Channel Coding for IDM: High-Rate Convolutional Code Concatenated with Irregular Repetition Code

Currently, combining turbo or low-density paritycheck (LDPC) codes with bit-interleaved coded modulation (BICM) is the most common coding scheme for bandwidthlimited channels. However, in order to be capacity achieving, shaping is necessary, which is difficult in conjunction with iterative processing. An alternative is interleave-division multiplexing (IDM), which can be either treated as a coded modulation scheme or a multiplexing scheme. In IDM, coded data sequences are linearly superimposed, thus avoiding the necessity of active signal shaping. The characteristics of IDM can be controlled by power and phase allocation. With typical parameter settings, IDM is non- bijective. In that case, the main task of channel coding is aiding to resolve the data sequences ("layers") at the receiver side, whereas noise mitigation is a secondary task. In this paper, we demonstrate that classical channel codes (like LDPC and turbo codes) fail when applied with IDM. In fact, repetition coding is quite useful. It is shown by means of an EXIT chart analysis that a concatenation of a high-rate convolutional code with an irregular repetition code matches well with the characteristics of an IDM a posteriori probability (APP) demapper.

[1]  Michael P. Fitz,et al.  Constellation Design via Capacity Maximization , 2007, 2007 IEEE International Symposium on Information Theory.

[2]  David Haccoun,et al.  Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding , 1990, IEEE Trans. Commun..

[3]  Peter A. Hoeher,et al.  Multi-layer interleave-division multiple access: theory and practice , 2008, Eur. Trans. Telecommun..

[4]  Jr. D. Costello,et al.  Channel Coding: The Road to Channel Capacity Fifty years of effort and invention have finally produced coding schemes that closely approach Shannon's channel capacity limit on memoryless communication channels. , 2007 .

[5]  P. Hoeher,et al.  Adaptive Interleave-Division Multiple Access – A Potential Air Interface for 4 G Bearer Services and Wireless LANs , 2022 .

[6]  Li Ping,et al.  Coded modulation using superimposed binary codes , 2004, IEEE Transactions on Information Theory.

[7]  Peter Adam Hoeher,et al.  A universal coding approach for superposition mapping , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[8]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[9]  Ping Li,et al.  A Unified Approach to Multiuser Detection and Space-Time Coding with Low Complexity and Nearly Optimal Performance1 , 2002 .

[10]  Peter A. Hoeher,et al.  Iterative Processing for Superposition Mapping , 2010, J. Electr. Comput. Eng..

[11]  Daniel J. Costello,et al.  Channel coding: The road to channel capacity , 2006, Proceedings of the IEEE.

[12]  Peter Adam Hoeher,et al.  Multilayer APP detection for IDM , 2010 .

[13]  Peter A. Hoeher,et al.  Helical interleaver set design for interleave-division multiplexing and related techniques , 2008, IEEE Communications Letters.

[14]  Michael Tuchler,et al.  EXIT charts of irregular codes , 2002 .

[15]  Li Ping Interleave-division multiple access and chip-by-chip iterative multi-user detection , 2005 .