Decomposition based fast least squares algorithm for output error systems

Parameter estimation methods have wide applications in signal processing, communication and system identification. This paper derives an iterative least squares algorithm to estimate the parameters of output error systems and uses the partitioned matrix inversion lemma to implement the proposed algo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Signal processing Ročník 93; číslo 5; s. 1235 - 1242
Hlavní autor: Ding, Feng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.05.2013
Elsevier
Témata:
Algorithms
Applied sciences
Communication systems
Computational efficiency
Computer simulation
Detection, estimation, filtering, equalization, prediction
Errors
Exact sciences and technology
Fast least squares
Filtering
Information, signal and communications theory
Inversions
Iterative algorithm
Least squares method
Parameter estimation
Signal and communications theory
Signal processing
Signal, noise
Telecommunications and information theory
Signal processing
Iterative algorithm
Parameter estimation
Filtering
Fast least squares
Performance evaluation
Iterative method
Implementation
Simulation
Matrix inversion
Least squares method
Telecommunication system
System identification
Fast algorithm
ISSN:0165-1684, 1872-7557
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Parameter estimation methods have wide applications in signal processing, communication and system identification. This paper derives an iterative least squares algorithm to estimate the parameters of output error systems and uses the partitioned matrix inversion lemma to implement the proposed algorithm in order to enhance computational efficiencies. The simulation results show that the proposed algorithm works well. ► An iterative least squares algorithm is presented for output error systems. ► The proposed algorithm is implemented by using the partitioned matrix inversion. ► The proposed algorithm has high computational efficiencies.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0165-1684
1872-7557
DOI:10.1016/j.sigpro.2012.12.013