Channel code-division multiple access and its multilevel-structured LDPC-based instantiation

IEEE Transactions on Vehicular Technology

Volumn 58, Issue 5, 2009, Pages 2549-2553

  Bonello, Nicholas ^a   Zhang, Rong ^a   Chen, Sheng ^a   Hanzo, Lajos ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Channel code division multiple access (CCDMA); Multilevel structured (MLS) low density parity check (LDPC) codes

Indexed keywords

BIT ERROR RATIOS; CHANNEL CODE; CHANNEL CODE-DIVISION MULTIPLE ACCESS (CCDMA); COMPACT STRUCTURES; EXAMPLE BASED; LDPC CODES; LOW-DENSITY PARITY-CHECK CODES; MEMORY REQUIREMENTS; MULTI-USER; MULTILEVEL-STRUCTURED (MLS) LOW-DENSITY PARITY-CHECK (LDPC) CODES; PERFORMANCE DEGRADATION; PSEUDO RANDOM; USER BENEFITS;

AIRCRAFT LANDING SYSTEMS; DETECTOR CIRCUITS;

CHANNEL CODING;

EID: 66449099340     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVT.2008.2009560     Document Type: Article

References (16)

1. L. Hanzo, L.-L. Yang, E.-L. Kuan, and K. Yen, Single and Multi-Carrier DS-CDMA: Multi-User Detection, Space-Time Spreading, Synchronisation, Networking and Standards. New York: Wiley-IEEE Press, 2003.
2. F. Brannstrom, T. Aulin, and L. Rasmussen, "Iterative detectors for trellis-code multiple-access," IEEE Trans. Commun., vol. 50, no. 9, pp. 1478-1485, Sep. 2002.
3. L. Ping, L. Liu, K. Wu, and W. K. Leung, "Interleave division multipleaccess," IEEE Trans. Wireless Commun., vol. 5, no. 4, pp. 938-947, Apr. 2006.
4. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inf. Theory, vol. 8, no. 1, pp. 21-28, Jan. 1962.
5. D.MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
6. R. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
7. X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.
8. Y. Mao and A. H. Banihashemi, "A heuristic search for good LDPC codes at short block lengths," in Proc. Int. Conf. Commun., Helsinki, Finland, Nov. 2001, vol. 1, pp. 41-44.
9. N. Bonello, S. Chen, and L. Hanzo, "Multilevel structured low-density parity-check codes," in Proc. IEEE Conf. Commun., Beijing, China, May 19-23, 2008, pp. 485-489.
10. F. Kschischang, B. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
11. C. F. Laywine and G. L. Mullen, Discrete Mathematics Using Latin Squares. New York: Wiley-Interscience, 1998.
12. N. L. Biggs, Discrete Mathematics, 2nd ed. London, U.K.: Oxford Univ. Press, Dec. 2002.
13. B. D. McKay and E. Rogoyski, "Latin squares of order 10," Electron. J. Comb., vol. 2, no. 3, pp. 1-4, 1995.
14. B. D. McKay, Latin Squares. [Online]. Available: http:// cs.anu.edu.au/bdm/data/latin.html
15. R. A. Bailey and P. J. Cameron, Latin Squares: Equivalents and Equivalence. [Online]. Available: http://designtheory.org/
16. D. MacKay, Online Database of Low-Density Parity-Check Codes. [Online]. Available: Wol.ra.phy.cam.ac.uk/mackay/codes/data.html