High-speed Cordic based parallel weight extraction for QRD-RLS adaptive filtering

Author

Ma, Jun ; Parhi, Keshab K. ; Deprettiere, Ed.F.

Author_Institution

Dept. of Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN, USA

Volume

5

fYear

1998

fDate

31 May-3 Jun 1998

Firstpage

245

Abstract

In this paper, a very high-speed Cordic based parallel weight extraction algorithm for QRD-RLS adaptive filtering is developed using the matrix lookahead technique. The algorithm is based on inverse updating and is pipelined at fine-grain level. The proposed architecture can be operated at arbitrarily high sample rates, and consists of only Givens rotations which can be mapped onto a Jacobi specific dataflow processor. It requires a complexity of O(Mp²) Givens rotations per sample period, where p is the size of the input data samples, and M is the pipelining level

Keywords

adaptive filters; adaptive signal processing; computational complexity; least squares approximations; matrix algebra; parallel algorithms; parallel architectures; pipeline arithmetic; Givens rotations; Jacobi specific dataflow processor; QRD-RLS adaptive filtering; fine-grain level pipelining; high-speed Cordic based extraction; inverse updating; matrix lookahead technique; parallel weight extraction algorithm; Adaptive arrays; Adaptive filters; Equations; Jacobian matrices; Least squares approximation; Least squares methods; Matrix decomposition; Pipeline processing; Resonance light scattering; Signal processing algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1998. ISCAS '98. Proceedings of the 1998 IEEE International Symposium on

Conference_Location

Monterey, CA

Print_ISBN

0-7803-4455-3

Type

conf

DOI

10.1109/ISCAS.1998.694455

Filename

694455