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 BICM is combined with iterative decoding (BICM-ID), it is capable of further improving the achievable receiver performance. However, the complexity of the standard max-sum approximation of the maximum aposteriori probability in log-domain (Max-Log-MAP) invoked by the iterative demapper is on the order of 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> or O(2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> ) for a 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> -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 paper, a simplified iterative demapping algorithm is proposed to substantially reduce the demapping complexity for a 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 modest performance degradation with respect to that of the optimal high-complexity Max-Log-MAP scheme.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
