Low latency group‐sorted QR decomposition algorithm for larger‐scale MIMO systems
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 late...
Main Authors: | Lirui Chen, Yu Wang, Zuocheng Xing, Shikai Qiu, Qinglin Wang, Yongzhong Li |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-07-01
|
Series: | IET Communications |
Online Access: | https://doi.org/10.1049/cmu2.12168 |
Similar Items
-
Efficient MIMO Preprocessor With Sorting-Relaxed QR Decomposition and Modified Greedy LLL Algorithm
by: Lirui Chen, et al.
Published: (2020-01-01) -
The VLSI Architecture of a Low-Latency High-Throughput Sorted QR Processor for MIMO Systems
by: Wei-Yang Chen, et al.
Published: (2015) -
Design of High Speed and Low Complexity Sorted QR Decomposition for 4x4 MIMO Detectors
by: Rong-sain Wang, et al.
Published: (2014) -
Design of High Speed Sorted QR Decomposition for 2×2~4×4 MIMO Detectors
by: Li-wei Chang, et al.
Published: (2012) -
Design and VLSI Implementation of a Reduced-Complexity Sorted QR Decomposition for High-Speed MIMO Systems
by: Lu Sun, et al.
Published: (2020-10-01)