.png){kind=icon}
Return
Low-Complexity Sphere Decoding for Polar-Coded MIMO Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2022.3229557.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For polar-coded MIMO systems, separate detection and de-coding (SDD) is the traditional scheme. In SDD systems, sphere decoding (SD) is one of the competitive MIMO detection schemes. However, SD may not utilize the coding information sufficiently in SDD systems, causing an error-correction performance loss. The existed joint detection and decoding using breadth-first SD (BSD) improves the performance than SDD, whereas the limited search space still causes a performance loss. In this paper, we propose joint detection and decoding based on SD (SD JDD) for polar-coded MIMO systems to reach maximum likelihood (ML) bound. Subsequently, two approaches are further proposed to reduce the computational complex-ity. The first approach reduces the layers of the SD search tree by exploiting symbol synchro sets, which could accelerate the convergence of SD JDD. The second efficient approach performs multiple tree searches. A small initial radius of the sphere for the first search is assigned to reduce the search space. The ML optimality could be preserved by the following multiple tree searches with increasing radius. It is shown from the numerical results that the proposed JDD outperforms SDD by 3.1 dB at FER = 10(-3) for P(64, 32) polar-coded 4 x 4 MIMO system with 16-QAM modulation. Furthermore, compared with BSD JDD, the proposed JDD has an average computational complexity reduction of up to an order of magnitude at high signal-to-noise ratios while achieving even better performance for short code lengths.
Keywords:
Joint detection and decoding
sphere decoding
polar codes
MIMO detection
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
View more