Multidimensional Householder based high-speed QR decomposition architecture for MIMO receivers

Conventional QR decomposition (QRD) hardware with a large size of channel matrix suffers from very low throughput and large latencies. This paper presents a high speed multi-dimensional (M-D) coordinate rotation digital computer (CORDIC) based QRD architecture. The novel high speed M-D architecture is enabled by exploiting multiple annihilations in a single CORDIC operation and removing data dependencies between two CORDIC operations (evaluation and application CORDIC) in Householder-based QRD process. The proposed QRD architecture can compute 4×4 complex R matrix for every 8 clock cycles. Our QRD hardware for 4×4 channel matrix was implemented using Samsung 0.13μm CMOS process, and the experimental results show that the proposed architecture achieves 4.74x speed-up compared to the conventional hybrid M-D based QRD.

[1]  Stefan Parkvall,et al.  Technical solutions for the 3G long-term evolution , 2006, IEEE Communications Magazine.

[2]  Kamran Etemad,et al.  Overview of mobile WiMAX technology and evolution , 2008, IEEE Communications Magazine.

[3]  Poras T. Balsara,et al.  VLSI Architecture for Matrix Inversion using Modified Gram-Schmidt based QR Decomposition , 2007, 20th International Conference on VLSI Design held jointly with 6th International Conference on Embedded Systems (VLSID'07).

[4]  P. Glenn Gulak,et al.  A low-complexity high-speed QR decomposition implementation for MIMO receivers , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[5]  P. Balsara,et al.  A Fixed-Point Implementation for QR Decomposition , 2006, 2006 IEEE Dallas/CAS Workshop on Design, Applications, Integration and Software.

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

[7]  Jongsun Park,et al.  High-speed tournament givens rotation-based QR Decomposition Architecture for MIMO Receiver , 2012, 2012 IEEE International Symposium on Circuits and Systems.

[8]  Shen-Fu Hsiao,et al.  Parallel singular value decomposition of complex matrices using multidimensional CORDIC algorithms , 1996, IEEE Trans. Signal Process..

[9]  Pei-Yun Tsai,et al.  Efficient Implementation of QR Decomposition for Gigabit MIMO-OFDM Systems , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[10]  Shen-Fu Hsiao,et al.  The CORDIC Householder algorithm , 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

[11]  Yin-Tsung Hwang,et al.  A low complexity complex QR factorization design for signal detection in MIMO OFDM systems , 2008, 2008 IEEE International Symposium on Circuits and Systems.

[12]  Roman Maslennikov,et al.  Triangular systolic array with reduced latency for QR-decomposition of complex matrices , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[13]  Andreas Peter Burg,et al.  VLSI Implementation of a High-Speed Iterative Sorted MMSE QR Decomposition , 2007, 2007 IEEE International Symposium on Circuits and Systems.