Name
Abstract | ||
|---|---|---|
As a highly efficient decoding and demodulation scheme, bit-interleaved coded modulation (BICM) is widely adopted in modern communication systems. In order to enhance the attainable spectral efficiency, usually high-order modulation schemes are used for BICM systems. When combined with iterative demapping and decoding, BICM-ID is capable of further improving the achievable receiver performance. However, the complexity of the standard max-sum approximation of the maximum a posteriori probability in log-domain (Max-Log-MAP) invoked by the iterative demapper is on the order of 2m or O ( 2m) for a 2m-ary modulation constellation having m bits per symbol, which may become excessive for high-order BICM-ID systems. The existing simplified algorithms employed for noniterative demappers are based on exploiting the constellation’s symmetry, which is no longer retained upon the introduction of the a priori information in BICM-ID systems. Hence in this contribution, a simplified iterative demapping algorithm is proposed for substantially reducing the demapping complexity for binary-reflected Gray-labeled constellation. Our detailed analysis shows that the simplified demapping scheme proposed for BICM-ID reduces the computational complexity to O(m). We demonstrate that this dramatic computational complexity only imposes a modest performance degradation with respect to that of the optimal high-complexity Max-Log-MAP scheme. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TVT.2014.2366195 | Vehicular Technology, IEEE Transactions |
Keywords | Field | DocType |
bit-interleaved coded modulation with iterative decoding,iterative demapper,maximum a posteriori probability in log-domain demapping,pulse amplitude modulation,quadrature amplitude modulation,optimization,algorithms | Demodulation,Quadrature amplitude modulation,Computer science,A priori and a posteriori,Algorithm,Electronic engineering,Spectral efficiency,Maximum a posteriori estimation,Decoding methods,Pulse-amplitude modulation,Computational complexity theory | Journal |
Volume | Issue | ISSN |
PP | 99 | 0018-9545 |
Citations | PageRank | References |
2 | 0.41 | 10 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| jiandong tan | 1 | 2 | 0.75 |
| Qi Wang | 2 | 142 | 10.51 |
| Chen Qian | 3 | 71 | 6.13 |
| Zhaocheng Wang | 4 | 2359 | 147.30 |
| Sheng Chen | 5 | 1294 | 92.85 |
| Lajos Hanzo | 6 | 10889 | 849.85 |