Low-Rate Turbo-Hadamard Codes

IEEE Transactions on Information Theory

Volumn 49, Issue 12, 2003, Pages 3213-3224+3354

  Ping, Li ^a   Leung, W K ^a   Wu, K Y ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

A posteriori probability (APP) decoding; Hadamard codes; Iterative decoding; Spread spectrum; Turbo codes

Indexed keywords

ALGORITHMS; CODE DIVISION MULTIPLE ACCESS; COMMUNICATION SYSTEMS; COMPUTER SIMULATION; DECODING; ENCODING (SYMBOLS); FAST FOURIER TRANSFORMS; GAUSSIAN NOISE (ELECTRONIC); ITERATIVE METHODS; MATRIX ALGEBRA; PROBABILITY; SYNCHRONIZATION; VECTORS; WHITE NOISE;

ITERATIVE DECODING; SPREAD SPECTRUM; TURBO-HADAMARD CODES;

TURBO CODES;

EID: 0346707319     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.820018     Document Type: Article

References (26)

1. K. S. Gilhousen, I. M. Jacobs, R. Padovani, A. J. Viterbi, L. A. Weaver, and C. E. Wheatley Jr., "On the capacity of a cellular CDMA system," IEEE Trans. Veh. Technol., vol. 40, no. 2, pp. 303-312, May 1991.
2. A. J. Viterbi, "The orthogonal-random waveform dichotomy for digital mobile personal communication," IEEE Personal Commun., vol. 1, pp. 18-24, Mar. 1994.
3. _, "Very low rate convolutional codes for maximum theoretical performance of spread-spectrum multiple-access channels," IEEE J. Selected Areas Commun., vol. 8, pp. 641-649, May 1990.
4. R. Herzog, J. Hagenauer, and A. Schmidbauer, "Soft-in/soft-out hadamard despreader for iterative decoding in the IS-95(A) system," Proc. IEEE Vehicular Technology Conf. (VTC'97), vol. 2, pp. 1219-1222, 1997.
5. F. M. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1997, vol. 1 and 2.
6. R. K. R. Yarlagadda and J. E. Hershey, Hadamard Matrix Analysis and Synthesis: With Applications to Communications and Signal/Image Processing. Boston, MA: Kluwer, 1997.
7. A. J. Viterbi, "Orthogonal tree codes for communication in the presence of white Gaussian noise," IEEE Trans. Commun. Technol., vol. COM-15, pp. 238-242, Apr. 1967.
8. P. Komulainen and K. Pehkonen, "Performance evaluation of super-orthogonal turbo codes in AWGN and flat Rayleigh fading channels," IEEE J. Select. Areas Commun., vol. 16, pp. 196-205, Feb. 1998.
9. M. Bingeman and A. K. Khandani, "Symbol based turbo codes," IEEE Commun. Lett., vol. 3, pp. 285-287, Oct. 1999.
10. P. Sauve and F. R. Kschischang, "Decoding turbo codes by multi bit probability propagation," in Proc. 19th Biennial Symp. Communications, Kingston, ON, Canada, June 1998, pp. 89-93.
11. D. Divsalar, H. Jin, and R. McEliece, "Coding theorems for 'turbo-like' codes," in Proc. 1998 Allerton Conf., 1998, pp. 201-210.
12. L. Ping and S. Chan, "Iterative decodiiig of concatenated hadamard codes," Proc. IEEE Int. Communications Conf. (ICC'98), vol. 1, pp. 136-140, 1998.
13. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near shannon limit error-correcting coding and decoding: Turbo-codes," Proc. IEEE Int. Communications Conf. (ICC'93), vol. 2, pp. 1064-1070, 1993.
14. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
15. D. J. C. McKay and R. M. Neal, "Near shannon limit performance of low-density parity check codes," Electron. Lett., vol. 33, no. 6, pp. 457-458, Mar. 1997.
16. W. K. Leung, K. S. Ho, and L. Ping, "Approaching low rate shannon limit using concatenated hadamard codes," Electron. Lett., vol. 36, no. 1, pp. 45-46, Jan. 2000.
17. J. G. Proakis and D. G. Manolakis, Digital Signal Processing Principles, Algorithms, and Applications. New York: Macmillan, 1992.
18. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, Mar. 1996.
19. J. Hagenauer, "The turbo principle: Tutorial introduction and state of the art," in Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, Sept. 1997, pp. 1-11.
20. S. Benedetto and G. Montorsi, "Unveiling turbo codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inform. Theory, vol. 42, pp. 409-428, Mar. 1996.
21. L. Ping and K. Y. Wu, "Concatenated tree codes: A low complexity, high performance approach," IEEE Trans. Inform. Theory, vol. 47, pp. 791-799, Feb. 2001.
22. L. Ping, "Simple method for generating distance spectrum and multiplicities of convolutional codes," Proc. Inst. Elec. Eng. - Commun., vol. 143, no. 5, pp. 247-249, Oct. 1996.
23. M. L. Cedervall and R. Johannesson, "A fast algorithm for computing distance spectrum of convolutional codes," IEEE Trans. Inform. Theory, vol. 35, pp. 1146-1159, Nov. 1989.
24. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Analysis, design, and iterative decoding of double serially concatenated codes with interleavers," IEEE J. Select. Areas Commun., vol. 16, pp. 231-244, Feb. 1998.
25. L. Ping, L. Liu, and W. K. Leung, "A simple approach to near-optimal multiuser detection: Interleaver-division multiple-access," in Proc. IEEE Wireless Communications and Networking Conf. (WCNC'2003), New Orleans, LA, Mar. 2003, pp. 391-396.
26. W. K. Leung, K. Y. Wu, and L. Ping, "Interleave-division-multiplexing space-time codes," in Proc. IEEE Vehicular Technology (VTC'03), Jeju, Korea, Apr. 2003, pp. 1094-1098.