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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing Vol. 39; no. 4; pp. 992 - 996
Main Authors: Petropulu, A.P., Nikias, C.L., Proakis, J.G.
Format: Journal Article
Language:English
Published: IEEE 01.04.1991
Subjects:
Array signal processing
Costs
Delay
Filters
Least squares methods
Parallel processing
Roundoff errors
Signal processing algorithms
Throughput
Very large scale integration
ISSN:1053-587X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
DOI:10.1109/78.80934