On pipelined implementations of QRD-RLS adaptive filters

This chapter discusses the pipelined systolic implementations pipelined implementation of QR-decomposition-based recursive least-squares (QRD-RLS) adaptive filters. Theannihilation-reording look-ahead technique is presented as an attractive technique for pipelining of Givens rotation (or CO-ordinate Rotation DIgital Computer (CORDIC)) based adaptive filters. It is an exact look-ahead and is based on CORDIC arithmetic, CORDIC!arithmetic which is known to be numerically stable. The conventional look-ahead is based on multiply–add arithmetic. The annihilation-reording look-ahead technique transforms an orthogonal sequential adaptive filtering algorithm into an equivalent orthogonal concurrent one by creating additional concurrency in the algorithm. Parallelism in the transformed algorithm is explored, and different implementation styles including pipelining, block processing, and incremental block processing are presented. Their complexity are also studied and compared. The annihilation-reording look-ahead is employed to develop fine-grain pipelined QRD-RLS adaptive filters. fine-grain pipelining Both implicit and explicit weight extraction algorithms are considered. The proposed pipelined architectures can be operated at arbitrarily high sample rate without degrading the filter convergence behavior. Stability under finite-precision arithmetic are studied and proved for the proposed architectures. The complexity of the pipelined architectures are analyzed and compared.

[1]  Ilse C. F. Ipsen,et al.  Scaled givens rotations for the solution of linear least squares problems on systolic arrays , 1987 .

[2]  Ed F. Deprettere,et al.  MODEL AND METHODS FOR REGULAR ARRAY DESIGN , 1993 .

[3]  Andrew D Calway,et al.  Mathematics in Signal Processing II , 1990 .

[4]  Henry Leung,et al.  Stability of recursive QRD-LS algorithms using finite-precision systolic array implementation , 1989, IEEE Trans. Acoust. Speech Signal Process..

[5]  Uwe Schwiegelshohn,et al.  A Square Root and Division Free Givens Rotation for Solving Least Squares Problems on Systolic Arrays , 1991, SIAM J. Sci. Comput..

[6]  O. L. Frost,et al.  An algorithm for linearly constrained adaptive array processing , 1972 .

[7]  Keshab K. Parhi,et al.  VLSI digital signal processing systems , 1999 .

[8]  Ed F. Deprettere,et al.  A strategy for determining a Jacobi specific dataflow processor , 1997, Proceedings IEEE International Conference on Application-Specific Systems, Architectures and Processors.

[9]  Keshab K. Parhi,et al.  Pipelined RLS adaptive filtering using scaled tangent rotations (STAR) , 1996, IEEE Trans. Signal Process..

[10]  Y.H. Hu,et al.  CORDIC-based VLSI architectures for digital signal processing , 1992, IEEE Signal Processing Magazine.

[11]  Anantha P. Chandrakasan,et al.  Low-power CMOS digital design , 1992 .

[12]  K. J. Ray Liu,et al.  A unified square-root-free approach for QRD-based recursive-least-squares estimation , 1993, IEEE Trans. Signal Process..

[13]  Keshab K. Parhi,et al.  Annihilation-reordering look-ahead pipelined CORDIC-based RLS adaptive filters and their application to adaptive beamforming , 2000, IEEE Trans. Signal Process..

[14]  T. J. Shepherd,et al.  A systolic array processor for MVDR beamforming , 1989 .

[15]  Ed F. Deprettere,et al.  A fully pipelined RLS-based array for channel equalization , 1996, J. VLSI Signal Process..

[16]  Gene H. Golub,et al.  Matrix computations , 1983 .

[17]  Jack E. Volder.  The CORDIC Trigonometric Computing Technique , 1959, IRE Trans. Electron. Comput..

[18]  Charles E. Leiserson,et al.  Optimizing Synchronous Circuitry by Retiming (Preliminary Version) , 1983 .

[19]  J. G. McWhirter,et al.  Recursive Least-Squares Minimization Using A Systolic Array , 1983, Optics & Photonics.

[20]  R. P. Gooch,et al.  The CM array: An adaptive beamformer for constant modulus signals , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[21]  Keshab K. Parhi,et al.  Algorithm transformation techniques for concurrent processors , 1989, Proc. IEEE.

[22]  Keshab K. Parhi,et al.  Pipeline interleaving and parallelism in recursive digital filters. II. Pipelined incremental block filtering , 1989, IEEE Trans. Acoust. Speech Signal Process..

[23]  Keshab K. Parhi,et al.  Pipeline interleaving and parallelism in recursive digital filters. I. Pipelining using scattered look-ahead and decomposition , 1989, IEEE Trans. Acoust. Speech Signal Process..

[24]  K. J. Ray Liu,et al.  A class of square root and division free algorithms and architectures for QRD-based adaptive signal processing , 1994, IEEE Trans. Signal Process..

[25]  John M. Cioffi,et al.  The fast adaptive ROTOR's RLS algorithm , 1990, IEEE Trans. Acoust. Speech Signal Process..

[26]  Keshab K. Parhi,et al.  High-level algorithm and architecture transformations for DSP synthesis , 1995, J. VLSI Signal Process..

[27]  S. Hammarling.  A Note on Modifications to the Givens Plane Rotation , 1974 .

[28]  S. Thomas Alexander,et al.  A Method for Recursive Least Squares Filtering Based Upon an Inverse QR Decomposition , 1993, IEEE Trans. Signal Process..

[29]  H. T. Kung,et al.  Matrix Triangularization By Systolic Arrays , 1982, Optics & Photonics.

[30]  S. Applebaum,et al.  Adaptive arrays with main beam constraints , 1976 .

[31]  C. Lawson,et al.  Extensions and applications of the Householder algorithm for solving linear least squares problems , 1969 .

[32]  S. Haykin,et al.  Adaptive Filter Theory , 1986 .

[33]  Ed F. Deprettere,et al.  Floating point Cordic , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[34]  Robert J. Plemmons,et al.  Least squares modifications with inverse factorizations: Parallel implications , 1989 .

[35]  Edward A. Lee,et al.  Least squares computation at arbitrarily high speeds , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.