Star RLS lattice adaptive filters

Research output: Contribution to journalConference article

1 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)389-392
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume2
StatePublished - Jan 1 1996
EventProceedings of the 1996 IEEE International Symposium on Circuits and Systems, ISCAS. Part 1 (of 4) - Atlanta, GA, USA
Duration: May 12 1996May 15 1996

Fingerprint Dive into the research topics of 'Star RLS lattice adaptive filters'. Together they form a unique fingerprint.

  • Cite this