Low latency group‐sorted QR decomposition algorithm for larger‐scale MIMO systems. Issue 12 (26th March 2021)

• Record Type: Journal Article
• Authors: Chen, Lirui; Wang, Yu; Xing, Zuocheng; Qiu, Shikai; Wang, Qinglin; Li, Yongzhong
• Is Part Of: IET communications. Volume 15:Issue 12(2021)
• Page Start: 1548
• Page End: 1560
• Publication Date: 2021-03-26
• Subjects: Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/cmu2.12168
• Languages: English
• ISSNs: 1751-8628

Abstract

Abstract: Sorted QR decomposition (SQRD) has been extensively adopted for various multiple‐input‐multiple‐output (MIMO) detectors, in which the sorting process incurs severe latency when it comes to larger‐scale MIMO situations. This paper proposes a group‐SQRD (GSQRD) algorithm to alleviate the latency problem of general SQRD architectures for larger‐scale MIMO systems. Via predictively sorting a group of 4 columns at one stage, the GSQRD could eliminate the processing latency by 41% for decomposing 16 × 16 complex‐valued matrices. Additionally, this percentage even rises up to 68% for decomposing 128 × 128 matrices. To analyse the side effects, the GSQRD is applied in various MIMO detectors in a simulation link, which exhibits a negligible performance degradation for MIMO detection. Moreover, GSQRD is a hardware‐friendly algorithm because the division and square root operations in GSQRD are converted to multiplications for simplifying the hardware implementation. Based on this algorithm, two corresponding hardware architectures, which contains 2 and 4 columns respectively in a sorting group, are also implemented with 65‐nm CMOS technology. These architectures can work at 513 MHz to decompose 16 × 16 complex‐valued matrices. The processing latencies are respectively 0.32 and 0.26 μ s, superior to the state‐of‐art designs.