Iterative QR Decomposition Architecture Using the Modified Gram-Schmidt Algorithm for MIMO Systems

• Published in: IEEE transactions on circuits and systems. I, Regular papers Vol. 57; no. 5; pp. 1095 - 1102
• Main Authors: Chang, Robert Chen-Hao, Chih-Hung Lin, Kuang-Hao Lin, Chien-Lin Huang, Feng-Chi Chen
• Format: Journal Article
• Language: English
• Published: IEEE 01.05.2010
• Subjects: Algorithms; Architecture; Computational efficiency; Computer architecture; Counting; Decomposition; Delay; Gates; Hardware; Iterative algorithms; Iterative methods; K -best detection; Matrices; Matrix decomposition; MIMO; modified Gram-Schmidt (MGS); multiple-input-multiple-output (MIMO); Numerical stability; orthogonal frequency-division multiplexing (OFDM); QR decomposition (QRD); Robust stability; Systolic arrays; triangular systolic array (TSA)
• ISSN: 1549-8328; 1558-0806
• DOI: 10.1109/TCSI.2010.2047744

Implementation of an iterative QR decomposition (QRD) (IQRD) architecture based on the modified Gram-Schmidt (MGS) algorithm is proposed in this paper. A QRD is extensively adopted by the detection of multiple-input-multiple-output systems. In order to achieve computational efficiency with robust numerical stability, a triangular systolic array (TSA) for QRD of large-size matrices is presented. In addition, the TSA architecture can be modified into an iterative architecture that is called IQRD for reducing hardware cost. The IQRD hardware is constructed by the diagonal and the triangular process with fewer gate counts and lower power consumption than TSAQRD. For a 4 × 4 matrix, the hardware area of the proposed IQRD can reduce about 41% of the gate counts in TSAQRD. For a generic square matrix of order m IQRD, the latency required is 2m - 1 time units, which is based on the MGS algorithm. Thus, the total clock latency is only 10 m - 5 cycles.