Transmission of nonuniform memoryless sources via nonsystematic turbo codes

IEEE Transactions on Communications

Volumn 52, Issue 8, 2004, Pages 1344-1354

  Zhu, Guang Chong ^a   Alajaji, Fady ^b   Bajcsy, Jan ^c   Mitran, Patrick ^d  

^a UNIVERSITY OF TORONTO   (Canada)

^b QUEEN S UNIVERSITY   (Canada)

^c MCGILL UNIVERSITY   (Canada)

^d HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; CONVOLUTIONAL CODES; DATA COMMUNICATION SYSTEMS; DATA COMPRESSION; PHASE SHIFT KEYING; RAYLEIGH FADING; RECURSIVE FUNCTIONS; TURBO CODES; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE; JOINT SOURCE CHANNEL CODING; NONSYSTEMATIC TURBO CODES; NONUNIFORM MEMORYLESS SOURCES; RAYLEIGH FADING CHANNELS; SHANNON LIMIT;

SIGNAL ENCODING;

EID: 4444259721     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2004.833026     Document Type: Article

References (47)

1. P. Burlina, F. Alajaji, and R. Chellappa, "Transmission of two-tone images over noisy communication channels with memory," Univ, of Maryland, Center for Automat. Res., College Park, MD, Tech. Rep. CAR-TR-814, 1996.
2. J. Kroll and N. Phamdo, "Source-channel optimized trellis codes for bitonal image transmission over AWGN channels," IEEE Trans. Image Processing, vol. 8, pp. 899-912, July 1999.
3. F. Alajaji, N. Phamdo, and T. Fuja, "Channel codes that exploit the residual redundancy in CELP-encoded speech," IEEE Trans. Speech Audio Processing, vol. 4, pp. 325-336, Sept. 1996.
4. R. B. Blizard, "Convolutional coding for data compression," Martin Marietta Corp., Denver, CO, Rep. R-69-17, 1969.
5. V. N. Koshelev, "Direct sequential encoding and decoding for discrete sources," IEEE Trans. Inform. Theory, vol. IT-19, pp. 340-343, May 1973.
6. M. E. Hellman, "Convolutional source encoding," IEEE Trans. Inform. Theory, vol. IT-21, pp. 651-656, Nov. 1975.
7. F. Alajaji, N. Phamdo, N. Farvardin, and T. Fuja, "Detection of binary Markov sources over channels with additive Markov noise" IEEE Trans. Inform. Theory, vol, 42, pp. 230-239, Jan. 1996.
8. T. Fingscheidt, T. Hindelang, R. V. Cox, and N. Seshadri, "Joint source-channel (de)coding for mobile communications," IEEE Trans. Commun., vol. 50, pp. 200-212, Feb. 2002.
9. J. Hagenauer, "Source-controlled channel decoding," IEEE Trans. Commun., vol. 43, pp. 2449-2457, Sept. 1995.
10. F. Lahouti and A. Khandani, "Sequence MMSE source decoding over noisy channels using the residual redundancies," in Proc. Allerton Conf. Communications, Control, Computing, Monticello, IL, Oct. 2001, pp. 1306-1315.
11. M. Park and D. Miller, "Improved image decoding over noisy channels using minimum mean-squared estimation and a Markov mesh," IEEE Trans. Image Processing, vol. 8, pp. 863-867, June 1999.
12. M. Park, "Joint source-channel decoding for variable-length encoded data by exact and approximate MAP sequence estimation," IEEE Trans. Commun., vol. 48, pp. 1-6, Jan. 2000.
13. M. Adrat, P. Vary, and J, Spittka, "Iterative source-channel decoding using extrinsic information of softbit-source decoding," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, Salt Lake City, UT, May 2001, pp. 2653-2656.
14. N. Görtz, "On the iterative approximation of optimal joint source-channel decoding," IEEE J. Select. Areas Commun., vol. 19, pp. 1662-1670, Sept. 2001.
15. N. Phamdo, "Quantization over discrete noisy channels under complexity constraints," Ph.D. dissertation, Univ. Maryland, College Park, MD, 1993.
16. N. Phamdo and N. Farvardin, "Optimal detection of discrete Markov sources over discrete memoryless channels - Applications to combined source-channel coding," IEEE Trans. Inform. Theory, vol. 40, pp. 186-193, Jan. 1994.
17. N. Phamdo, "Scalar quantization of memoryless sources over memoryless channels using rate-one convolutional codes," in Proc. Int. Symp. Information Theory, Trondheim, Norway, June 1994, p. 235.
18. K. Sayood and J. C. Borkenhagen, "Use of residual redundancy in the design of joint source-channel codes;" IEEE Trans. Commun., vol. 39, pp. 838-846, June 1991.
19. M. Skoglund, "Soft decoding for vector quantization over noisy channels with memory," IEEE Trans. Inform. Theory, vol. 45, pp. 1293-1307, May 1999.
20. M. Skoglund, "Bit-estimate-based decoding for vector quantization over noisy channels with intersymbol interference," IEEE Trans. Commun., vol. 48, pp. 1309-1317, Aug. 2000.
21. R. E. Van Dyck and D. Miller, "Transport of wireless video using separate, concatenated, and joint source-channel coding," Proc. IEEE, vol. 87, pp. 1734-1750, Oct. 1999.
22. W. Xu, J. Hagenauer, and J. Hollmann, "Joint source-channel decoding using the residual redundancy.in compressed images," in Proc. Int. Conf. Communications, Dallas, TX, June 1996, pp. 142-148.
23. C. Berrou and A. Glavieux, "Near-optimum error-correcting coding and decoding: Turbo codes," IEEE Trans. Commun., vol. 44, pp. 1261-1271, Oct. 1996.
24. E. K. Hall and S. G. Wilson, "Design and analysis of turbo codes on Rayleigh fading channels," IEEE J. Select. Areas Commun., vol. 16, pp. 160-174, Feb. 1998.
25. R. J. McEliece, "Are turbo-like codes effective on nonstandard channels?," IEEE Inform. Theory Soc. Newsletter, vol. 51, .pp. 1-8, Dec. 2001.
26. J. Garcia-Frias and J. D. Villasenor, "Combining hidden Markov source models and parallel concatenated codes," IEEE Commun. Lett., vol. 1, pp. 111-113, July 1997.
27. J. Garcia-Frias, "Joint turbo decoding and estimation of hidden Markov sources," IEEE J. Select. Areas Commun., vol. 19, pp. 1671-1679, Sept. 2001.
28. G.-C. Zhu and F. Alajaji, "Design of turbo codes for nonequiprobable memoryless sources," in Proc. 39th Allerton Conf. Communication, Control, Computing, Monticello, IL, Oct. 2001, pp. 1253-1262.
29. G.-C. Zhu, "Turbo codes for nonuniform memoryless sources over noisy channels," IEEE Commun. Lett., vol. 6, pp. 64-66, Feb. 2002.
30. S. Shamai and S. Verdú, "The empirical distribution of good codes," IEEE Trans. Inform. Theory, vol. 43, pp. 836-846, May 1997.
31. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
32. R. J. McEliece, The Theory of Information and Coding, 2nd ed. Reading, MA: Addison-Wesley, 2002.
33. I. J. Fair, V. K. Bhargava, and Q. Wang, "On the power spectral density of self-synchronizing scrambled sequences," IEEE Trans. Inform. Theory, vol. 44, pp. 1687-1693, July 1998.
34. D. G. Leeper, "A universal digital data scrambler," Bell Syst. Tech. J., vol. 52, no. 10, pp. 1851-1865, Dec. 1973.
35. D. J. Costello, Jr., P. C. Massey, O. M. Collins, and O. Y. Takeshita, "Some reflections on the mythology of turbo codes," in Proc. 3rd ITG Con. Source Channel Coding, Munich, Germany, Jan. 2000, pp. 157-160.
36. O. M. Collins, O. Y. Takeshita, and D. J. Costello, Jr., "Iterative decoding of nonsystematic turbo codes," in Proc. Int. Symp. Information Theory, Sorrento, Italy, June 2000, p. 172.
37. D. J. Costello, Jr., H. A. Cabral, and O. Y. Takeshita, "Some thoughts on the equivalence of systematic and nonsystematic convolutional encoders," in Codes, Graphs and Systems, R. E. Blahut and R. Koetter, Eds. Norwell, MA: Kluwer, 2002.
38. P. C. Massey and D. J. Costello, Jr., "Turbo codes with recursive nonsystematic quick-look-in constituent codes," in Proc. Int. Symp. Information Theory, Washington, DC, June 2001, p. 141.
39. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 248-287, Mar. 1974.
40. S. Benedetto and G. Momorsi, "Unveiling turbo codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inform. Theory, vol. 42, pp. 409-428, Mar. 1996.
41. T. M. Duman and M. Salehi, "New performance bounds for turbo codes," IEEE Trans. Commun., vol. 46, pp. 717-723, June 1998.
42. S. Shamai and I. Sason, "Variations on Gallager's bounding techniques: Performance bounds for turbo codes in Gaussian and fading channels," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sept. 2000, pp. 27-34
43. 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.
44. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423 and 623-656, 1948.
45. D. Divsalar and F. Pollara, "Multiple turbo codes for deep-space communications; Jet Propulsion Lab., Pasadena, CA, TDA Prog. Rep. 42-121, 1995.
46. L. Guivarch, J.-C. Carlach, and P. Siohan, "Joint source-channel soft decoding of Huffman codes with turbo codes," in Proc. Data Compression Conf., Snowbird, UT, Mar. 2000, pp. 83-92.
47. J. Hagenauer and R. Bauer, "The turbo principle in joint source-channel decoding of variable-length codes," in Proc. IEEE Information Theory Workshop, Cairns, Australia, Sept. 2001, pp. 128-130.