Channel Code-Division Multiple Access and Its Multilevel-Structured LDPC-Based Instantiation

In this paper, we introduce and outline the concept of channel code-division multiple access using a design example based on the recently proposed multilevel-structured (MLS) low-density parity-check (LDPC) codes. We succeeded in making the memory requirements of the multiuser transceiver to become practically independent of the total number of users supported by the system, as well as ascertain that each user benefits from the same level of protection. Finally, we will demonstrate that despite their beneficial compact structure, the proposed MLS LDPC codes do not suffer from any bit-error-ratio or block-error-ratio performance degradation, when compared to an otherwise identical benchmarker scheme using significantly more complex LDPC codes having pseudorandom parity-check matrices.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  Richard Johnsonbaugh,et al.  Discrete mathematics (2nd ed.) , 1990 .

[3]  G. Mullen,et al.  Discrete Mathematics Using Latin Squares , 1998, The Mathematical Gazette.

[4]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[5]  Li Ping,et al.  Interleave division multiple-access , 2006, IEEE Trans. Wirel. Commun..

[6]  Lajos Hanzo,et al.  Multilevel Structured Low-Density Parity-Check Codes , 2008, 2008 IEEE International Conference on Communications.

[7]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[8]  Brendan D. McKay,et al.  Latin Squares of Order 10 , 1995, Electron. J. Comb..

[9]  Ronald L. Graham,et al.  Dense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond , 1995, Electron. J. Comb..

[10]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[11]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[12]  Lars K. Rasmussen,et al.  Iterative detectors for trellis-code multiple-access , 2002, IEEE Trans. Commun..