DocumentCode
302593
Title
Star RLS lattice adaptive filters
Author
Li, Yuet ; Parhi, Keshab K.
Author_Institution
Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA
Volume
2
fYear
1996
fDate
12-15 May 1996
Firstpage
389
Abstract
The recursive least squared lattice (LSL) algorithm based on the newly developed scaled tangent rotations (STAR) is derived. Similar to other recursive least square lattice algorithm for adaptive filtering, this algorithm requires only O(N) operations. The algorithm also preserved the desired properties of the STAR-RLS algorithm. Specifically, it can be pipelined at fine-grain level. To this end, a pipelined version of the STAR-LSL (referred to as PSTAR-LSL) is also developed. Computer simulations show that the performance of the STAR-LSL algorithm is as good as the QRD-LSL algorithm. Finite wordlength simulations also verify that this algorithm is robust to roundoff error
Keywords
adaptive filters; lattice filters; least squares approximations; recursive filters; roundoff errors; O(N) operations; PSTAR-LSL; STAR; adaptive filtering; fine-grain level; finite wordlength simulations; recursive least squared lattice algorithm; roundoff error; scaled tangent rotations; Adaptive filters; Computational complexity; Computer simulation; Filtering algorithms; Lattices; Least squares methods; Pipeline processing; Resonance light scattering; Systolic arrays; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1996. ISCAS '96., Connecting the World., 1996 IEEE International Symposium on
Conference_Location
Atlanta, GA
Print_ISBN
0-7803-3073-0
Type
conf
DOI
10.1109/ISCAS.1996.541728
Filename
541728
Link To Document