QR-decomposition decision feedback equalisation and finite-precision results

Author(s): A.B. Sesay and M. Patton
DOI: 10.1049/ip-f-2.1993.0012

For access to this article, please select a purchase option:

Buy article PDF

Buy Knowledge Pack

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership

Recommend Title Publication to library

IEE Proceedings F (Radar and Signal Processing) — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Author(s): A.B. Sesay ¹ and M. Patton ²
- Affiliations: 1: TRLabs/Electrical and Computer Engineering Department, University of Calgary, Calgary, Canada
  2: Electrical and Computer Engineering Department, University of Calgary, Calgary, Canada
Source: Volume 140, Issue 2, April 1993, p. 89 – 97
DOI: 10.1049/ip-f-2.1993.0012 , Print ISSN 0956-375X, Online ISSN 2053-9045

The QRD LS algorithm is generally recognised for its superior numerical properties under finite-precision implementation. Furthermore, its systolic architecture is well suited for VLSI implementation. In DFE applications the inherent and implementation nonlinearities make it impossible to analyse precisely all effects of finite-precision arithmetic. The paper presents finite precision results of a QRD LS DFE using the TMS320C25 16-bit precision DSP processors as a simulation platform. Using the bit error rate as a performance measure, results are presented for 2-PSK, 4-PSK and Pi/4-DQPSK modulation formats. Also presented are the numerical accuracy and convergence sensitivity for the filter weights. These results may serve as a basis for practical implementation of QRD LS DFEs.

References

1. 1)
  - J.G. McWhirter . Recursive least-squares minimisation using a systolic array. Proc. SPIE , 105 - 112
2. 2)
  - M.S. Mueller . Least-squares algorithms for adaptive equalisers. Bell Syst. Tech. J. , 1905 - 1925
3. 3)
  - I.K. Proudler , J.G. McWhirter , T.J. Shepherd . Computationally efficient QR decomposition approach to least squares adaptive filtering. IEE Proc. F, Commun. Radar & Signal Process. , 4 , 341 - 353
4. 4)
  - ‘TMS320Cxx Users Guide’. Digital Signal Processing Products, Texas Instruments Inc., 1990.
5. 5)
  - K.R. Liu , S. Hsieh , K. Yao , C. Chin . Dynamic range, stability, and fault-tolerant capability of finite-precision RLS systolic array based on Given rotations. IEEE Trans. , 6 , 625 - 636
6. 6)
  - P. Lewis . Multichannel recursive least squares adaptive filtering without a desired signal. IEEE Trans. , 2 , 359 - 365
7. 7)
  - Moonen, M., Vaudewalle, J.: `A systolic array for recursive least squares computations', Proc. In. Conf. Acoustics, Speech & Signal Processing, May 1991, p. 1013–1016.
8. 8)
  - A.V. Oppenheim , R.W. Schafer . (1989) , Discrete-time signal processing.
9. 9)
  - Ghirnikar, A.L., Alexander, S.T.: `Stable recursive least squares filtering using an inverse QR decomposition', Proc. IEEE Int. Conf. on Acoustics, Spreech & Signal Processing, 1990, p. 1623–1626.
10. 10)
  - P.S. Lewis . QR-based algorithms for multichannel adaptive least-squares lattice filters. IEEE Trans. , 3 , 421 - 432
11. 11)
  - M. Moonen , J. Vandewalle . Recursive least squares with stabilized inverse factorization. Signal Process. , 1 , 1 - 15
12. 12)
  - M.A. Syed , V.J. Mathews . Finite-precison error analysis of a QR-decomposition-based lattice predictor. Proc. SPIE, Adaptive Signal Processing , 25 - 34
13. 13)
  - Stewart, R.W., Chapman, R.: `Fast stable Kalman filter algorithms utilising the square root', Proc. Int. Conf. on Acoustics, Speech & Signal Processing, 1990, p. 1815–1818.
14. 14)
  - C.R. Ward , P.J. Hargrave , J.G. McWhirter . A novel algorithm and architecture foradaptive digital beamforming. IEEE Trans. , 3 , 338 - 346
15. 15)
  - J.M. Cioffi . Limited-precision effects in adaptive filtering. IEEE Trans. , 7 , 821 - 833
16. 16)
  - C.T. Pan , R.J. Plemmons . Least squares modifications with inverse factorization: parallel implementations. J. Comput. & Applied Maths. , 109 - 127
17. 17)
  - Ling, F.: `Efficient least-squares lattice algorithms based on Givens rotation with systolic array implementation', Proc. IEEE Int. Conf. Acoustics, Speech & Signal Processing, May 1989, p. 1290–1293.
18. 18)
  - Proudler, I.K., McWhirter, J.G., Shepherd, T.J.: `The QRD-based least-squares lattice algorithm: Some computer simulations using finite wordlength', Proc. IEEE Int. Symp. on Circuits & Systems, May 1990, p. 258–261.
19. 19)
  - Hsieh, S.F., Yao, K.: `Systolic implementation of windowed recursive LS estimation', Proc. IEEE ISCAS, May 1990, New Orleans, p. 1931–1934.
20. 20)
  - Yang, B., Bohme, J.F.: `Systolic implementation of a general adaptive processing algorithm', Proc. IEEE Int. Conf. Acoustics, Speech & Signal Processing, 1988, p. 1785–1788.
21. 21)
  - E.H. Satorius , S.T. Alexander . Channel equalisation using adaptive lattice algorithms. IEEE Trans. , 6 , 899 - 905
22. 22)
  - Tsubokawa, H., Kubota, H., Tsujii, S.: `Effect of floating-point error reduction with recursive least-square for parallel architecture', Proc. IEEE Int. Conf. on Acoustics, Speech, & Signal Processing, April 1990, p. 1487–1490.
23. 23)
  - S.Y. Kung . VLSI array processors. IEEE ASSP Mag. , 4 - 22
24. 24)
  - W.M. Gentleman , H.T. Kung . Matrix triangularisation by systolic arrays. Proc. SPIE , 19 - 26
25. 25)
  - Bellanger, M.G.: `Computational complexity and accuracy issues in fast least-squares algorithms for adaptive filtering', Proc. IEEE Int. Symposium, Circuits & Systems, 1988, Finland, p. 2635–2639.
26. 26)
  - J.M. Cioffi . The fast adaptive ROTOR's RLS algorithm. IEEE Trans. , 4
27. 27)
  - H.T. Kung . Why systolic architecture. IEEE Computer Mag. , 37 - 46
28. 28)
  - J.G. McWhirter , T.J. Shephard . Systolic array processor for MVDR beam forming. IEE Proc. F, Commun., Radar & Signal Process. , 75 - 80
29. 29)
  - Hargrave, P.J., Ward, C.R.: `Systolic array building blocks for real-time signal processing', 2nd Int. Specialist Seminar on Design & Application of Parallel Digital Processors, April 1991, p. 24–29.
30. 30)
  - Liu, K., Ray, J.: `Dynamic range of finite-precision recursive QRD LS algorithm and its stability', Proc. IEEE Int. Symp. on Circuits & Systems, May 1990, p. 3142–3145, Part 4.
31. 31)
  - H. Leung , S. Haykin . Stability of recursive QRD-LS algorithms using finite-precision systolic array implementation. IEEE Trans. , 5 , 730 - 763
32. 32)
  - S.Y. Kung . On supercomputing with systolic/wavefront array processors. Proc. IEEE , 867 - 884
33. 33)
  - A.P. Varvitsiotis , S. Theodoridis . A pipelines structure for QR adaptive LS system identification. IEEE Trans. , 8 , 1920 - 1923
34. 34)
  - S. Haykin . (1991) , Adaptive filter theory.
35. 35)
  - J.G. Proakis , D.G. Manolakis . (1991) , Introduction to digital signal processing.
36. 36)
  - Shepherd, T.J., Hudson, J.: `Parallel weight extraction from a systolic adaptive beamformer', Proc. IMA Conference on Mathematics in Signal Processing, December 1988, Warwick, UK, p. 24–29.
37. 37)
  - Lewis, P.: `Algorithms and architectures for multichannel enhancement of magnetoencephalographic signals', Proc. 21st IEEE Asimolar Conference on Signals, Systems & Computers, November 1987, p. 741–745.
38. 38)
  - S.U.H. Qureshi . Adaptive equalisation. Proc. IEEE , 9 , 1349 - 1387
39. 39)
  - Regalia, P.A.: `System theoretic properties in the stability analysis of QR-based fast least-squares algorithms', Report DEG-0390-003, 1990.
40. 40)
  - Proudler, I.K., McWhirter, J.G., Shephard, T.J.: `QRD-based lattice-ladder algorithm for adaptive filtering', Proc. Int. Symp. Math. Theory of Networks & Systems, June 1989.

QR-decomposition decision feedback equalisation and finite-precision results

QR-decomposition decision feedback equalisation and finite-precision results

Buy article PDF

Buy Knowledge Pack

Thank you

References

Related content