A key design element of bit-interleaved coded modulation with iterative decoding (BICM-ID) is the mapping of the bit patterns to the elements of the signal constellation set (SCS). Recently, we proposed mappings and new non-regular SCSs with superior asymptotic performance, i.e., lower error
oors. These proposed mappings
use signal constellation sets with less elements than the number of bit patterns to be transmitted and an appropriate assignment of the bit patterns to them. The puncturing introduced by the not one-to-one relation between assigned bit patterns and the elements of the SCS is compensated by the usage of extrinsic information
obtained in the iterations. We further show the theoretical limits for the improvement of BICM-ID by this technique. Based on the mutual information concept of EXIT charts, a method is presented allowing
easy determination of the achievable gains by different mappings for different kinds of channels. The results are conrmed by simulations.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
The following notice applies to all IEEE publications:
© IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.