High speed least square adaptive filter design using ART and HAT

Zhipei Chi, Keshab K. Parhi

Research output: Contribution to journalConference articlepeer-review

Abstract

In this paper, annihilation reordering transformation (ART) for pipelining QR decomposition based recursive least square adaptive filters is fully developed and rigorous mathematical proof of ART is given. A novel transformation, referred to as Hybrid Annihilation Transformation (HAT), for pipelining both the QR decomposition based recursive least square adaptive filters and QR decomposition based single/multi-channel least square lattice adaptive filters is presented. HAT does not introduce any approximation in the entire filtering process. Therefore, it causes no performance degradation no matter how deep the filter is pipelined. It allows a linear speedup of the throughput rate by a linear increase of hardware complexity.

Original languageEnglish (US)
Pages (from-to)427-436
Number of pages10
JournalIEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation
StatePublished - Dec 1 2000
Event2000 IEEE Workshop on Signal Processing Systems (SIPS 2000) - Lafayette, LA, USA
Duration: Oct 11 2000Oct 13 2000

Fingerprint

Dive into the research topics of 'High speed least square adaptive filter design using ART and HAT'. Together they form a unique fingerprint.

Cite this