A generic architecture for implementing a QR array processor in silicon is presented. This improves on previous research by considerably simplifying the derivation of timing schedules for a QR system implemented as a folded linear array, where account has to be taken of processor cell latency and timing at the detailed circuit level. The architecture and scheduling derived have been used to create a generator for the rapid design of System-on-a-Chip (SoC) cores for QR decomposition. This is demonstrated through the design of a single-chip architecture for implementing an adaptive beamformer for radar applications.
|Journal||IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing|
|Publication status||Published - 1 Apr 2003|
Bibliographical noteReference text:  L. C. Godara, “Application of antenna arrays to mobile communications, Part II: Beam-forming and direction-of-arrival considerations,” in Proc. IEEE, vol. 85, Aug. 1997, pp. 1995–1245.
 S. Haykin, Adaptive Filter Theory. Englewood Cliffs, NJ: Prentice-Hall, 1995.
 J. M. Cioffi and T. Kailath, “Fast recursive-least-square, transversal filters for adaptive filtering,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 998–1005, Feb. 1984.
 S. F. Hsieh, K. J. R. Liu, and K.Yao, “A unified approach for QRD-based recursive least-squares estimation without square roots,” IEEE Trans. Signal Processing, vol. 41, pp. 1405–1409, Mar. 1993.
 W. M. Gentleman and H. T. Kung, “Matrix triangularization by systolic array,” in Proc. SPIE (Real-Time Signal Processing IV), 1973, pp. 329–369.
 J. G. McWhirter, “Recursive least squares minimization using systolic array,” in Proc. SPIE (Real-Time Signal Processing IV), vol. 431, 1983, pp. 105–112.
 T. J. Shepherd and J. G. McWhirter, “Systolic adaptive beamforming,” in Array Signal Processing, S. Haykin, J. Litva, and T. J. Shepherd, Eds. New York: Springer-Verlag, 1993, ch. 5, pp. 153–243.
 G. Lightbody, R. Walke, R. Woods, and J. McCanny, “Linear QR architecture for a single chip adaptive beamformer,” J. VLSI Signal Processing Syst. Signal, Image, Video Technol., vol. 24, pp. 67–81, 2000.
 J. G. McWhirter, R. L. Walke, and J. Kadlec, “Normalized givens rotations for recursive least squares processing,” VLSI Signal Processing, vol. VIII, pp. 323–332, 1995.
 R. L. Walke, “High sample rate givens rotations for recursive least squares,” Ph.D. dissertation, Univ. of Warwick, Coventry, U.K., 1997.
 R. Dohler, “Squared given’s rotation,” IMA J. Numer. Anal., vol. II, pp. 1–5, 1991.
 J. Gotze and U. Schwiegelshohn, “A square root free Givens rotation for solving least squares problems on systolic arrays,” SIAM J. Sci. Stat. Comput., vol. 4, pp. 800–807, 1991.
 J. McCanny, D. Ridge, Y. Hu, and J. Hunter, “Hierarchical VHDL libraries for DSP ASIC design,” in Proc. IEEE Int. Conf. Acoust., Speech and Signal Processing, Munich, Germany, pp. 675–678.
 C. M. Rader, “VLSI systolic arrays for adaptive nulling,” IEEE Signal Processing Mag., vol. 13, no. 4, pp. 29–49, 1996.
 (1999, Aug.) DSiPWare: Floating point library data book. [Online].
- systolic arrays