Efficient realization structure of the a priori lattice-ladder recursive least squares algorithm

An efficient pipelined realization structure of the a priori lattice-ladder least squares multichannel algorithm is introduced. The structure is shown to exhibit great modularity and high parallelism. The architecture is evaluated for cost and data throughput delay assuming pipelined operations. It...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on signal processing Ročník 39; číslo 4; s. 992 - 996
Hlavní autoři: Petropulu, A.P., Nikias, C.L., Proakis, J.G.
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.04.1991
Témata:
Array signal processing
Costs
Delay
Filters
Least squares methods
Parallel processing
Roundoff errors
Signal processing algorithms
Throughput
Very large scale integration
ISSN:1053-587X
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í:An efficient pipelined realization structure of the a priori lattice-ladder least squares multichannel algorithm is introduced. The structure is shown to exhibit great modularity and high parallelism. The architecture is evaluated for cost and data throughput delay assuming pipelined operations. It is demonstrated that the throughput rate of the structure is O(1) and the cost is O(l/sup 2/N), where l is the number of channels and N is the order of the filter.< >
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
DOI:10.1109/78.80934