.png){kind=icon}
.png){kind=icon}
Return
A Fixed-Complexity Smart Candidate Adding Algorithm for Soft-Output MIMO Detection
.png){kind=icon}
PRE
AI
DOI：10.1109/JSTSP.2009.2035800.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a soft-output multiple-input multiple-output (MIMO) detection algorithm that achieves near max-log optimal error rate performance with low- and fixed-computational complexity. The proposed smart ordering and candidate adding (SOCA) algorithm combines a smart-ordered QR decomposition with smart candidate adding and a parallel layer-by-layer search of the detection tree. In contrast to prior algorithms that use smart candidate adding, the proposed algorithm has fixed computational complexity, and it never visits a node more than once. Results indicate that the SOCA algorithm has an attractive performance-complexity profile for both fast and slow fading 4 4 and 8 8 MIMO channels with quadrature amplitude modulation (QAM) inputs.
Keywords:
Breadth-first
list detection
parallel smart candidate adding
smart-ordered QR
smart ordering and candidate adding (SOCA)
soft-output multiple-input multiple-output (MIMO) detection
tree search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.9K
Citations:
1.1W
Organization
View more organizations