.png){kind=icon}
.png){kind=icon}
Return
Toward a Preferred 4 x 4 Space-Time Block Code: A Performance-Versus-Complexity Sweet Spot with Linear-Filter Decoding
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2013.021913.120338.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We develop a new 4x4 Hadamard-precoded quasi-orthogonal space-time block code (QO-STBC) that enables highly effective near-maximum-likelihood (near-ML) reliability-based prioritized symbol detection using linear filters. Approximate block-error-rate minimization is being used to optimize the code rotation angle. Detailed computational complexity evaluation of the decoder in terms of real multiplications and additions shows significant complexity reduction for symbol alphabet sizes of interest. Numerical and simulation studies demonstrate negligible bit-error-rate degradation compared to the state-of-the-art in bit-error-rate by ML decoded 4 x 4 codewords.
Keywords:
Hadamard precoding
matched-filter (MF)
maximum-likelihood (ML) detection
minimum-mean-square-error (MMSE) filter
multi-input multi-output (MIMO) communications
quasi-orthogonal space-time block codes (QO-STBC)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W