Bibliography

[1] C. E. Shannon, ‘A mathematical theory of communication,’ Bell Systems Technical Journal , vol. 27, pp. 379–423, 623–656, 1948.

[2] L. Hanzo, P. J. Cherriman and J. Streit,Wireless Video Communications: Second to Third Generation Systems and Beyond. IEEE Press, 2001.

[3] F. I. Alajaji, N. C. Phamdo and T. E. Fuja, ‘Channel codes that exploit the residual redundancy in CELP-encoded speech,’ IEEE Transactions on Speech Audio Processing, vol. 4, pp. 325–336, September 1996.

[4] K. Sayood and J. C. Borkenhagen, ‘Use of residual redundancy in the design of joint source/channel coders,’ IEEE Transactions on Communications, vol. 39, pp. 838–846, June 1991.

[5] K. Sayood, F. Liu and J. D. Gibson, ‘A constrained joint source/channel coder design,’ IEEE Journal in Selected Areas of Communications, vol. 12, pp. 1584–1593, December 1994.

[6] R. E. V. Dyck and D. J. Miller, ‘Transport of wireless video using separate, concatenated, and joint source-channel coding,’ Proceedings of IEEE, vol. 87, no. 10, pp. 1734–1750, October 1999.

[7] C. Guillemot and P. Siohan, ‘Joint source-channel decoding of variable-length codes with soft information: A survey,’ EURASIP Journal on Applied Signal Processing, pp. 906–927, June 2005.

[8] J. Proakis,Digital Communications, 4th ed. New York: McGraw-Hill, 2001.

[9] D. A. Huffman, ‘A method for the construction of minimum redundancy codes,’ Proceedings of Institute of Radio Engineering, vol. 40, pp. 1098–1101, September 1952.

[10] J. J. Rissanen, ‘Arithmetic codings as number representations,’ Acta Polytechnica Scandinavica, vol. 31, pp. 44–51, 1979.

[11] J. C. Kieffer, ‘A survey of the theory of source coding with a fidelity criterion,’ IEEE Transactions on Information Theory, pp. 1473–1490, September 1993.

[12] Y. Takishima, M. Wada and H. Murakami, ‘Reversible Variable Length Codes,’ IEEE Transactions on Communications, vol. 43, no. 2/3/4, pp. 158–162, Feb./Mar./Apr. 1995.

[13] J. Wen and J. D. Villasenor, ‘A class of reversible variable length codes for robust image and video coding,’ inProceedings of IEEE International Conference on Image Processing, vol. 2, (Lausanne, Switzerland), October 1997, pp. 65–68.

[14] ——, ‘Reversible variable length codes for efficient and robust image and video coding,’ inData Compression Conference (DCC’98), Snowbird, USA, 1998, pp. 471–480.

[15] S. W. Golomb, ‘Run-length encodings,’ IEEE Transactions on Information Theory, pp. 1473–1490, July 1966.

[16] R. F. Rice, ‘Some practical universal noiseless coding techniques,’ Technical Report JPL-79-22, Jet Propulsion Laboratory, Pasadena, California, pp. 79–22, March 1979.

[17] J. Teuhola, ‘A compression method for clustered bit-vectors,’ Information Processing Letters, pp. 308–311, October 1978.

[18] ‘Video coding for low bit rate communication,’ ITU-T Recommendation H.263, 1998.

[19] ‘Generic coding of audio-visual objects,’ ISO/IEC 14496-2 MPEG-4, 1999.

[20] C. Tsai and J. Wu, ‘Modified symmetrical reversible variable-length code and its theoretical bounds,’ IEEE Transactions on Information Theory, vol. 47, no. 6, pp. 2543–2548, September 2001.

[21] ——, ‘On constructing the Huffman-code-based reversible variable-length codes,’ IEEE Transactions on Communications, vol. 49, no. 9, pp. 1506–1509, September 2001.

[22] K. Lakovic and J. Villasenor, ‘On design of error-correcting reversible variable length codes,’ IEEE Communications Letters, vol. 6, no. 8, pp. 337–339, August 2002.

[23] ——, ‘An algorithm for construction of efficient fix-free codes,’ IEEE Communications Letters, vol. 7, no. 8, pp. 391–393, August 2003.

[24] C. Lin, Y. Chuang and J. Wu, ‘Generic construction algorithms for symmetric and asymmetric RVLCs,’ in Proceedings of IEEE International Conference on Computational Science(ICCS), Amsterdam, The Netherlands, April 2002, pp. 968–972.

[25] Z. Kukorelly and K. Zeger, ‘New binary fix-free codes with Kraft sum 3/4,’ in IEEE International Symposium on Information Theory, Lausanne, Switzerland, June 2002, p. 178.

[26] S. Yekhanin, ‘Sufficient conditions for existence of fix-free codes,’ in IEEE International Symposium on Information Theory, Washington, USA, June 2001, p. 284.

[27] C. Ye and R. W. Yeung, ‘Some basic properties of fix-free codes,’ IEEE Transactions on Information Theory, vol. 47, no. 1, pp. 72–87, January 2001.

[28] V. Buttigieg and P. G. Farrell, ‘On variable-length error-correcting codes,’ in IEEE International Symposium on Information Theory (ISIT’94), Trondheim, Norway, June–July 1994, p. 507.

[29] ——, ‘Variable-length error-correcting codes,’ IEE Proc.-Commun., vol. 147, no. 4, pp. 211–215, August 2000.

[30] V. Buttigieg, ‘Variable-length error-correcting codes,’ Ph.D. dissertation, University of Manchester, Department of Electrical Engineering, 1995.

[31] C. Lamy and J. Paccaut, ‘Optimised constructions for variable-length error correcting codes,’ in Proceedings of IEEE Information Theory Workshop (ITW2003), Paris, France, March 31–April 4 2003, pp. 183–186.

[32] J. Wang, L.-L. Yang and L. Hanzo, ‘Iterative Construction of Reversible Variable Length Codes and Variable Length Error Correcting Codes,’ IEEE Communications Letters, pp. 671–673, August 2004.

[33] M. Schindler, ‘Practical Huffman Coding. [Online],’ Available: http://www.compressconsult.com/huffman/.

[34] C. Fogg, ‘Survey of software and hardware VLC architectures,’ in SPIE Proceedings on Image and Video Compression Conference, May 1994, pp. 29–37.

[35] P. C. Tseng, Y. C. Chang, Y. W. Huang, H. C. Fang, C. T. Huang and L. G. Chen, ‘Advances in hardware architectures for image and video coding-A survey,’ Proceedings of IEEE, vol. 93, no. 1, pp. 184–197, January 2005.

[36] M. Park and D. J. Miller, ‘Decoding entropy-coded symbols over noisy channels by MAP sequence estimation for asynchronous HMMs,’ in Proceedings of Conference on Information Sciences and Systems, Princeton, NJ, USA, March 1998, pp. 477–482.

[37] ——, ‘Joint source-channel decoding for variable-length encoded data by exact and approximate MAP sequence estimation,’ in Proceedings of IEEE International Conference on Acoustics, Speech, Signal Processing (ICASSP’99), Phoenix, AZ, USA, March 1999, pp. 2451–2454.

[38] N. Demir and K. Sayood, ‘Joint source/channel coding for variable length codes,’ in Proceedings of Data Compression Conference (DCC’98), Snowbird, UT, USA, March-April 1998, pp. 139–148.

[39] D. J. Miller and M. Park, ‘A sequence-based approximate MMSE decoder for source coding over noisy channels using discrete hidden Markov models,’ IEEE Transactions on Communications, vol. 46, no. 2, pp. 222–231, 1998.

[40] R. Bauer and J. Hagenauer, ‘Symbol by Symbol MAP Decoding of Variable Length Codes,’ in Proceedings of 3rd International ITG Conference on Source and Channel Coding, Munich, Germany, January 2000, pp. 111–116.

[41] V. B. Balakirsky, ‘Joint Source-Channel Coding with Variable Length Codes,’ in Proceedings of 1997 IEEE International Symposium on Information Theory(ISIT’97), Ulm Germany, July 1997, p. 419.

[42] R. Bauer and J. Hagenauer, ‘On Variable Length Codes for Iterative Source/Channel Decoding,’ in Proceedings of IEEE Data Compression Conference (DCC), Snowbird, USA, April 2001, pp. 273–282.

[43] J. Kliewer and R. Thobaben, ‘Combining FEC and optimal soft-input source decoding for the reliable transmission of correlated variable-length encoded signals,’ in Proceedings of CoIEEE Data Compression Conference, Snowbird, UT, USA, April 2002, pp. 83–91.

[44] R. Thobaben and J. Kliewer, ‘Robust decoding of variable-length encoded Markov sources using a three-dimensional trellis,’ IEEE Communications Letters, vol. 7, no. 7, pp. 320–322, July 2003.

[45] ——, ‘Low complexity iterative joint source-channel decoding for variable-length encoded Markov sources,’ IEEE Transactions on Communications, vol. 53, no. 12, pp. 2054–2064, December 2005.

[46] A. Guyader, E. Fabre, C. Guillemot and M. Robert, ‘Joint source-channel turbo decoding of entropy-coded sources,’ IEEE Journal of Selected Areas in Communications, vol. 19, no. 9, pp. 1680–1696, September 2001.

[47] A. J. Viterbi, ‘Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm,’ IEEE Transactions on Information Theory, vol. IT-13, pp. 260–269, April 1967.

[48] L. Bahl, J. Cocke, F. Jelinek and J. Raviv, ‘Optimal decoding of linear codes for minimizing symbol error rate (Corresp.),’ IEEE Transactions on Information Theory, vol. 20, no. 2, pp. 284–287, March 1974.

[49] M. Bystrom, S. Kaiser and A. Kopansky, ‘Soft source decoding with applications,’ IEEE Transaction on Circuits and Systems for Video Technology, vol. 11, no. 10, pp. 1108–1120, October 2001.

[50] L. Perros-Meilhac and C. Lamy, ‘Huffman tree-based metric derivation for a low-complexity sequential soft VLC decoding,’ in Proceedings of IEEE International Conference on Communications (ICC’02), New York, NY, USA, April–May 2002, pp. 783–787.

[51] P. Sweeney, Error Control Coding: From Theory to Practice. John Wiley & Sons, 2002.

[52] A. H. Murad and T. E. Fuja, ‘Joint source-channel decoding of variable-length encoded sources,’ in Proceedings of Information Theory Workshop (ITW’98), Killarney, Ireland, June 1998, pp. 94–95.

[53] J. Hagenauer, ‘The turbo principle: Tutorial introduction and state of the art,’ in Proceedings of the 1st International Symposium on Turbo Codes and Related Topics, Brest, France, 1997, pp. 1–12.

[54] N. Gortz, ‘On the iterative approximation of optimal joint source-channel decoding,’ IEEE Journal on Selected Areas in Communications, vol. 19, no. 9, pp. 1662–1670, September 2001.

[55] J. Wen and J. D. Villasenor, ‘Utilizing soft information in decoding of variable length codes,’ in Data Compression Conference (DCC’99), Snowbird, USA, 1999, pp. 131–139.

[56] M. Adrat, U. von Agris and P. Vary, ‘Convergence behavior of iterative source-channel decoding,’ in IEEE International Conference on Acoustics, Speech, Signal Processing (ICASSP’03), Hong Kong, China, April 2003, pp. 269–272.

[57] J. Kliewer and R. Thobaben, ‘Parallel concatenated joint source-channel coding,’ Electronics Letters, vol. 39, no. 23, pp. 1664–1666, 2003.

[58] J. Hagenauer, ‘Source-controlled channel decoding,’ IEEE Transactions on Communications, vol. 43, no. 9, pp. 2449–2457, September 1995.

[59] R. Steele and L. Hanzo, Eds., Mobile Radio Communications: Second and Third Generation Cellular and WATM Systems, 2nd ed. New York, USA: IEEE Press – John Wiley & Sons, 1999.

[60] J. Garcia-Frias and J. D. Villasenor, ‘Joint turbo decoding and estimation of hidden Markov sources,’ IEEE Journal on Selected Areas in Communications, vol. 19, no. 9, pp. 1671–1679, September 2001.

[61] G.-C. Zhu, F. Alajaji, J. Bajcsy and P. Mitran, ‘Non-systematic turbo codes for non-uniform i.i.d. sources over AWGN channels,’ in Proceedings of Conference on Information Sciences and Systems (CISS’02), Princeton, NJ, USA, March 2002.

[62] A. Elbaz, R. Pyndiah, B. Solaiman and O. Ait Sab, ‘Iterative decoding of product codes with a priori information over a Gaussian channel for still image transmission,’ in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM’99), Rio de Janeiro, Brazil, December 1999.

[63] Z. Peng, Y.-F. Huang and D. J. Costello, ‘Turbo codes for image transmission-a joint channel and source decoding approach,’ IEEE Journal on Selected Areas in Communications, vol. 18, no. 6, pp. 868–879, 2000.

[64] L. Guivarch, J.-C. Carlach and P. Siohan, ‘Joint source-channel soft decoding of Huffman codes with turbo-codes,’ in Proceedings of IEEE Data Compression Conference (DCC’00), Snowbird, Utah, USA, March 2000, pp. 8–92.

[65] M. Jeanne, J.-C. Carlach and P. Siohan, ‘Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes,’ IEEE Transactions on Communications, vol. 53, no. 1, pp. 10–15, 2005.

[66] L. Guivarch, J.-C. Carlach and P. Siohan, ‘Low complexity soft decoding of Huffman encoded Markov sources using turbo-codes,’ in Proceedings of IEEE 7th International Conference on Telecommunications (ICT’00), Acapulco, Mexico, May 2000, pp. 872–876.

[67] X. Jaspar and L. Vandendorpe, ‘Three SISO modules joint source-channel turbo decoding of variable length coded images,’ in Proceedings of 5th International ITG Conference on Source and Channel Coding (SCC’04), Erlangen, Germany, January 2004, pp. 279–286.

[68] N. Phamdo and N. Farvardin, ‘Optimal detection of discrete Markov sources over discrete memoryless channels – applications to combined source-channel coding,’ IEEE Transactions on Information Theory, vol. 40, no. 1, pp. 186–193, 1994.

[69] C. Berrou, A. Glavieux and P. Thitimajshima, ‘Near-Shannon limit error-correcting coding and decoding: Turbo-codes,’ in Proceedings of IEEE International Conference on Communications (ICC’93), Geneva, Switzerland, May 1993, pp. 1064–1070.

[70] L. Hanzo, T. H. Liew and B. L. Yeap, Turbo Coding, Turbo Equalisation and Space-time Coding for Transmission over Fading Channels. IEEE Press, 2002.

[71] S. Benedetto, D. Divsalar, G. Montorsi and F. Pollara, ‘Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding,’ IEEE Transactions on Information Theory, vol. 44, no. 3, pp. 909–926, May 1998.

[72] J. Hagenauer, E. Offer and L. Papke, ‘Iterative decoding of binary block and convolutional codes,’ IEEE Transactions on Information Theory, vol. 42, pp. 429–445, Mar. 1996.

[73] R. Pyndiah, ‘Near-optimum decoding of product codes: block turbo codes,’ IEEE Transactions on Communications, vol. 46, no. 8, pp. 1003–1010, August 1998.

[74] P. Sweeney and S. Wesemeyer, ‘Iterative soft-decision decoding of linear block codes,’ IEE Proceedings of Communications, vol. 147, no. 3, pp. 133–136, June 2000.

[75] D. Divsalar, H. Jin and R. McEliece, ‘Coding theorems for ‘turbo-like’ codes,’ in Proceedings of 36th Allerton Conference on Communication, Control and Computing, Allerton, IL, USA, September 1998, pp. 201–210.

[76] D. J. C. MacKay and R. M. Neal, ‘Near Shannon limit performance of Low Density Parity Check Codes,’ Electronics Letters, vol. 32, no. 18, pp. 1645–1646, 1996.

[77] T. Richardson and R. Urbanke, ‘The capacity of LDPC codes under message passing decoding,’ IEEE Transactions on Information Theory, vol. 47, pp. 595–618, February 2001.

[78] T. Richardson, M. A. Shokrollahi and R. Urbanke, ‘Design of capacity approaching low density parity-check codes,’ IEEE Transactions on Information Theory, vol. 47, pp. 619–637, February 2001.

[79] R. G. Gallager, ‘Low-density parity-check codes,’ IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21–28, 1962.

[80] M. Tüchler and J. Hagenauer, ‘EXIT charts of irregular codes,’ in Proceedings of Conference on Information Science and Systems [CDROM], Princeton University, 20-22 March 2002.

[81] M. Tüchler, ‘Design of serially concatenated systems depending on the blocklength,’ IEEE Transactions on Communications, vol. 52, no. 2, pp. 209–218, February 2004.

[82] C. Douillard, M. Jezequel, C. Berrou, A. Picart, P. Didier and A. Glavieux, ‘Iterative correction of intersymbol interference: Turbo equalization,’ European Transactions on Telecommunications, vol. 6, pp. 507–511, Sept.–Oct 1995.

[83] X. Li and J. A. Ritcey, ‘Bit-interleaved coded modulation with iterative decoding,’ in Proceedings of International Conference on Communications, Vancouver, Canada, Juen 1999, pp. 858–863.

[84] S. ten Brink, J. Speidel and R. Yan, ‘Iterative demapping and decoding for multilevel modulation,’ in Proceedings of IEEE Global Telecommunications Conference, 1998, pp. 858–863.

[85] S. Benedetto, D. Divsalar, G. Montorsi and F. Pollara, ‘Serial concatenated trellis coded modulation with iterative decoding,’ in Proceedings of IEEE International Symposium on Information Theory, 29 June–4 July 1997, p. 8.

[86] D. Divsalar, S. Dolinar and F. Pollara, ‘Serial turbo trellis coded modulation with rate-1 inner code,’ in Proceedings of International Symposium on Information Theory, Sorrento, Italy, June 2000, p. 194.

[87] M. Moher, ‘An iterative multiuser decoder for near-capacity communications,’ IEEE Transactions on Communications, vol. 46, no. 7, pp. 870–880, July 1998.

[88] M. C. Reed, C. B. Schlegel, P. Alexander and J. Asenstorfer, ‘Iterative multiuser detection for DS-CDMA with FEC: Near single user performance,’ IEEE Transactions on Communications, vol. 46, no. 7, pp. 1693–1699, July 1998.

[89] A. Nayak, J. Barry and S. McLaughlin, ‘Joint timing recovery and turbo equalization for coded partial response channels,’ IEEE Transactions on Magnetics, vol. 38, no. 5, September 2002.

[90] X. Wang and H. Poor, ‘Iterative (turbo) soft interference cancellation and decoding for coded CDMA,’ IEEE Transactions on Communications, vol. 47, no. 10, pp. 1046–1061, July 1999.

[91] J. Pearl,Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA, USA: Morgan Kaufmann Publishers, 1988.

[92] R. J. McEliece, D. J. C. MacKay and J.-F. Cheng, ‘Turbo decoding as an instance of pearl’s “belief propagation” algorithm,’ IEEE Journal on Selected Areas in Communications, vol. 16, no. 2, pp. 140–152, 1998.

[93] F. R. Kschischang, B. J. Frey and H.-A. Loeliger, ‘Factor graphs and the sum-product algorithm,’ IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 498–519, 2001.

[94] H.-A. Loeliger, ‘An introduction to factor graphs,’ IEEE Signal Processing Magazine, pp. 28–41, January 2004.

[95] F. R. Kschischang and B. J. Frey, ‘Iterative decoding of compound codes by probability propagation in graphical models,’ IEEE Journal on Selected Areas in Communications, vol. 16, no. 2, pp. 219–230, 1998.

[96] E. Biglieri, ‘Receivers for coded signals: a unified view based on factor graph,’ in Proceedings of the Fifth International Conference on Information, Communications and Signal Processing, Bangkok, Thailand, 6–9 December 2005, p. 97.

[97] J. Hagenauer, ‘The EXIT chart – Introduction to extrinsic information transfer in iterative processing,’ in Proceedings of 12th European Signal Processing Conference (EUSIPCO), September 2004, pp. 1541–1548.

[98] S. ten Brink, ‘Convergence behaviour of iteratively decoded parallel concatenated codes,’ IEEE Transactions on Communications, pp. 1727–1737, Oct. 2001.

[99] S. Benedetto and G. Montorsi, ‘Unveiling turbo codes: some results on parallel concatenated coding schemes,’ IEEE Transactions on Information Theory, vol. 42, pp. 409–428, Mar. 1996.

[100] D. Divsalar and R. J. McEliece, ‘Effective free distance of turbo codes,’ Electronics Letters, vol. 32, no. 5, pp. 445–446, February 1996.

[101] L. C. Perez, J. Seghers and D. J. Costello, ‘A distance spectrum interpretation of turbo codes,’ IEEE Transactions on Information Theory, vol. 42, pp. 1698–1709, November 1996.

[102] T. Duman and R. Salehi, ‘New performance bounds for turbo codes,’ in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM’97), Phoenix, AZ, USA, November 1997, pp. 634–638.

[103] S. Chung, T. Richardson and R. Urbanke, ‘Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation,’ IEEE Transactions on Information Theory, vol. 47, pp. 657–670, February 2001.

[104] D. Divsalar, S. Dolinar and F. Pollara, ‘Low complexity turbo-like codes,’ in Proceedings of the 2nd International Symposium on Turbo Codes and Related Topics, Brest, France, September 2000, pp. 73–80.

[105] K. R. Narayanan, ‘Effect of precoding on the convergence of turbo equalization for partial response channels,’ IEEE Journal on Selected Areas in Communications, vol. 19, no. 4, pp. 686–698, April 2001.

[106] S. ten Brink, ‘Convergence of iterative decoding,’ Electronics Letters, vol. 35, pp. 806–808, 1999.

[107] M. Tüchler, S. ten Brink and J. Hagenauer, ‘Measures for tracing convergence of iterative decoding algorithms,’ in Proceedings of 4th IEEE/ITG Conference on Source and Channel Coding, Berlin, Germany, January 2002, pp. 53–60.

[108] S. Kullback, Information Theory and Statistics. Dover Publications Inc., New York, 1968.

[109] Q. Luo and P. Sweeney, ‘Method to analyse convergence of turbo codes,’ Electronics Letters, vol. 41, no. 13, pp. 757–758, June 2005.

[110] M. Moher and T. A. Gulliver., ‘Cross-entropy and iterative decoding,’ IEEE Transactions on Information Theory, vol. 44, no. 7, pp. 3097–3104, November 1998.

[111] S. ten Brink, ‘Iterative decoding trajectories of parallel concatenated codes,’ in Proceedings of the 3rd IEEE/ITG Conference on Source and Channel Coding, Munich, Germany, January 2000, pp. 75–80.

[112] ——, ‘Design of serially concatenated codes based on iterative decoding convergence,’ in Proceedings of the 2nd International Symposium on Turbo Codes and Related Topics, Brest, France, September 2000, pp. 319–322.

[113] M. Tüchler, R. Koetter and A. C. Singer, ‘Turbo equalization: Principles and new results,’ IEEE Transactions on Communications, vol. 50, pp. 754–767, May 2002.

[114] F. Schreckenbach and G. Bauch, ‘Measures for tracing convergence of iterative decoding algorithms,’ in Proceedings of 12th European Signal Processing Conference (EUSIPCO), Vienna, Austria, September 2004, pp. 1557–1560.

[115] S. ten Brink, ‘Designing iterative decoding schemes with the extrinsic information transfer chart,’ AE Ü International Journal of Electronics and Communications, vol. 54, no. 6, pp. 389–398, November 2000.

[116] A. Ashikhmin, G. Kramer and S. ten Brink, ‘Extrinsic information transfer functions: model and erasure channel properties,’ IEEE Transactions on Information Theory, vol. 50, no. 11, pp. 2657–2673, November 2004.

[117] S. ten Brink, G. Kramer and A. Ashikhmin, ‘Design of Low-Density Parity-Check Codes for modulation and detection,’ IEEE Transactions on Communications, vol. 52, no. 4, pp. 670–678, April 2004.

[118] S. ten Brink and G. Kramer, ‘Design of repeat-accumulate codes for iterative detection and decoding,’ IEEE Transactions on Signal Processing, vol. 51, no. 11, pp. 2764–2772, November 2003.

[119] S. ten Brink, ‘Convergence of multi-dimensional iterative decoding schemes,’ in Proceedings of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, October/November 2001, pp. 270–274.

[120] M. Tüchler, ‘Convergence prediction for iterative decoding of threefold concatenated systems,’ in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM’02), Taipei, China, 17–21, November 2002, pp. 1358–1362.

[121] F. Brännström, L. K. Rasmussen and A. J. Grant, ‘Optimal scheduling for multiple serially concatenated codes,’ in International Symposium on Turbo Codes and Related Topics, Brest, France, September 2003, pp. 383–386.

[122] ——, ‘Convergence analysis and optimal scheduling for multiple concatenated codes,’ IEEE Transactions on Information Theory, vol. 51, no. 9, pp. 3354–3364, September 2005.

[123] A. Grant, ‘Convergence of non-binary iterative decoding,’ in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM’01), San Antonio TX, USA, November 2001, pp. 668–670.

[124] J. Kliewer, S. X. Ng and L. Hanzo, ‘On the computation of EXIT characteristics for symbol-based iterative decoding,’ in Proceedings of the 4th International Symposium on Turbo Codes (ISTC’06) in Connection with the 6th International ITG-Conference on Source and Channel Coding, Munich, Germany, 3–7 April 2006.

[125] G. D. Forney, Concatenated Codes. Cambridge, MA: MIT Press, 1966.

[126] D. Divsalar and F. Pollara, ‘Multiple turbo codes for deep space communications,’ Jet Propulsion Laboratory,’ TDA Progress Report 42–121, May 1995.

[127] S. Benedetto and G. Montorsi, ‘Serial concatenation of block and convolutional codes,’ Electronics Letters, vol. 32, no. 10, pp. 887–888, May 1996.

[128] ——, ‘Iterative decoding of serially concatenated convolutional codes,’ Electronics Letters, vol. 32, no. 13, pp. 1186–1187, June 1996.

[129] G. Ungerboeck, ‘Channel coding with multilevel/phase signals,’ IEEE Transactions on Information Theory, vol. IT-28, pp. 55–67, 1982.

[130] S. Benedetto, D. Divsalar, G. Montorsi and F. Pollara, ‘Analysis, design, and iterative decoding of double serially concatenated codes with interleavers,’ IEEE Journal on Selected Areas in Communications, vol. 16, pp. 231–244, February 1998.

[131] M. Tüchler, A. C. Singer and R. Koetter, ‘Minimum mean squared error equalization using a priori information,’ IEEE Transactions on Signal Processing, vol. 50, no. 3, pp. 673–682, March 2002.

[132] I. Land, Peter A. Hoeher and S. Gligorevic, ‘Computation of symbol-wise mutual information in transmission systems with LogAPP decoders and application to EXIT charts,’ in Proceedings of International ITG Conference on Source and Channel Coding, Erlangen, Germany, 2004, pp. 195–202.

[133] C. E. Shannon, ‘The mathematical theory of communication,’ Bell System Technical Journal, vol. 27, pp. 379–423, July 1948.

[134] D. J. Costello and G. D. Forney, ‘Channel coding: The road to channel capacity,’ Proceedings of the IEEE, vol. 95, no. 6, pp. 1150–1177, June 2007.

[135] I. Jacobs and E. Berlekamp, ‘A lower bound to the distribution of computation for sequential decoding,’ IEEE Transactions on Information Theory, vol. 13, no. 2, pp. 167–174, April 1967.

[136] J. Wozencraft, ‘Sequential decoding for reliable communication,’ IRE National Convention Record, vol. 5, no. 2, pp. 11–25, August 1957.

[137] J. M. Wozencraft and B. Reiffen, Sequential Decoding. Cambridge, MA: MIT Press, 1961.

[138] J. Massey, Threshold Decoding. Cambridge, MA: MIT Press, 1961.

[139] R. Fano, ‘A heuristic discussion of probabilistic decoding,’ IEEE Transactions on Information Theory, vol. 9, no. 2, pp. 64–74, April 1963.

[140] P. Elias, ‘Coding for noisy channels,’ IRE International Convention Record, vol. 3, no. 4, pp. 37–46, 1955.

[141] G. D. Forney, ‘Review of random tree codes,’ NASA Ames Research Center, Moffett Field, CA, USA, Tech. Rep. NASA CR73176, December 1967.

[142] C. Berrou, A. Glavieux, and P. Thitimajshima, ‘Near Shannon limit error-correcting coding and decoding: Turbo-codes (1),’ in Proceedings of the IEEE International Conference on Communications, vol. 2, Geneva, May 1993, pp. 1064–1070.

[143] R. G. Gallager, ‘Low-density parity-check codes,’ IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21–28, January 1962.

[144] ——, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.

[145] D. J. C. MacKay and R. M. Neal, ‘Near Shannon limit performance of low density parity check codes,’ Electronics Letters, vol. 32, no. 18, pp. 457–458, August 1996.

[146] R. Tanner, ‘A recursive approach to low complexity codes,’ IEEE Transactions on Information Theory, vol. 27, no. 5, pp. 533–547, September 1981.

[147] M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman and V. Stemann, ‘Practical loss-resilient codes,’ in Proceedings of the ACM Symposium on Theory of Computing, El Paso, TX, USA, May 1997, pp. 150–159.

[148] B. J. Frey and D. J. C. MacKay, ‘Irregular turbo-like codes,’ in Proceedings of the International Symposium on Turbo Codes, Brest, France, September 2000, pp. 67–72.

[149] M. Tüchler and J. Hagenauer, ‘EXIT charts of irregular codes,’ in Proceedings of the Conference on Information Sciences and Systems, Princeton, NJ, USA, March 2002, pp. 748–753.

[150] A. J. Viterbi and J. K. Omura, Principles of Digital Communications and Coding. New York, NY, USA: McGraw-Hill, 1979.

[151] L. Hanzo, P. J. Cherriman, and J. Streit, Video Compression and Communications: H.261, H.263, H.264, MPEG4 and Proprietary Codecs for HSDPA-Style Adaptive Turbo-Transceivers. John Wiley and IEEE Press, September 2007.

[152] L. Hanzo, F. C. A. Somerville and J. P. Woodard, Voice and Audio Compression for Wireless Communications. John Wiley and IEEE Press, 2007.

[153] N. Ahmed, T. Natarajan and K. R. Rao, ‘Discrete cosine transform,’ IEEE Transactions on Computers, vol. C-23, pp. 90–93, January 1974.

[154] A. N. Netravali and J. D. Robbins, ‘Motion-compensated television coding. I,’ Bell System Technical Journal, vol. 58, pp. 631–670, March 1979.

[155] D. A. Huffman, ‘A method for the construction of minimum-redundancy codes,’ Proceedings of the IRE, vol. 40, pp. 1098–1101, September 1952.

[156] Information Technology – Coding of Moving Pictures and Associated Audio for Digital Storage Media at up to About 1.5 Mbit/s, ISO/IEC Std. 11 172, June 1996.

[157] ISO/IEC CD 13818 MPEG 2 International Standard, Information Technology, Generic Coding of Moving Video and Associated Audio Information, Parts 1–3, International Standards Organization.

[158] Information Technology – Coding of Audio-visual Objects, ISO/IEC Std. 14 496.

[159] Video Codec for Audiovisual Services at p × 64kbit/s, ITU-T Std. H.261, March 1993.

[160] Video Coding for Low Bit Rate Communication, ITU-T Std. H.263, January 2005.

[161] Advanced Video Coding for Generic Audiovisual Services, ITU-T Std. H.264, March 2005.

[162] J. L. Massey, ‘Joint source and channel coding,’ in Communication Systems and Random Process Theory, J. K. Skwirzynski, Ed. Amsterdam, The Netherlands: Sijthoff and Noordhoff, December 1978, pp. 279–293.

[163] R. E. van Dyck and D. J. Miller, ‘Transport of wireless video using separate, concatenated, and joint source-channel coding,’ Proceedings of the IEEE, vol. 87, no. 10, pp. 1734–1750, October 1999.

[164] S. Lloyd, ‘Least squares quantization in PCM,’ IEEE Transactions on Information Theory, vol. 28, no. 2, pp. 129–137, March 1982.

[165] J. Max, ‘Quantizing for minimum distortion,’ IRE Transactions on Information Theory, vol. 6, no. 1, pp. 7–12, March 1960.

[166] A. Kurtenbach and P. Wintz, ‘Quantizing for noisy channels,’ IEEE Transactions on Communications, vol. 17, no. 2, pp. 291–302, April 1969.

[167] N. Farvardin and V. Vaishampayan, ‘Optimal quantizer design for noisy channels: An approach to combined source-channel coding,’ IEEE Transactions on Information Theory, vol. 33, no. 6, pp. 827–838, November 1987.

[168] H. Kumazawa, M. Kasahara, and T. Namekawa, ‘A construction of vector quantizers for noisy channels,’ Electronics and Engineering in Japan, vol. 67-B, no. 4, pp. 39–47, January 1984.

[169] N. Farvardin, ‘A study of vector quantization for noisy channels,’ IEEE Transactions on Information Theory, vol. 36, no. 4, pp. 799–809, July 1990.

[170] Y. Linde, A. Buzo, and R. Gray, ‘An algorithm for vector quantizer design,’ IEEE Transactions on Communications, vol. 28, no. 1, pp. 84–95, January 1980.

[171] K. Sayood and J. C. Borkenhagen, ‘Use of residual redundancy in the design of joint source/channel coders,’ IEEE Transactions on Communications, vol. 39, no. 6, pp. 838–846, June 1991.

[172] N. Phamdo and N. Farvardin, ‘Optimal detection of discrete Markov sources over discretememoryless channels – applications to combined source-channel coding,’ IEEE Transactions on Information Theory, vol. 40, no. 1, pp. 186–193, January 1994.

[173] T. Fingscheidt and P. Vary, ‘Softbit speech decoding: A new approach to error concealment,’ IEEE Transactions on Speech and Audio Processing, vol. 9, no. 3, pp. 240–251, March 2001.

[174] J. Kliewer and R. Thobaben, ‘Iterative joint source-channel decoding of variable-length codes using residual source redundancy,’ IEEE Transactions on Wireless Communications, vol. 4, no. 3, pp. 919–929, May 2005.

[175] F. Lahouti and A. K. Khandani, ‘Soft reconstruction of speech in the presence of noise and packet loss,’ IEEE Transactions on Audio, Speech and Language Processing, vol. 15, no. 1, pp. 44–56, January 2007.

[176] R. Thobaben and J. Kliewer, ‘Low-complexity iterative joint source-channel decoding for variable-length encoded Markov sources,’ IEEE Transactions on Communications, vol. 53, no. 12, pp. 2054–2064, December 2005.

[177] D. J. Miller and M. Park, ‘A sequence-based approximate MMSE decoder for source coding over noisy channels using discrete hidden Markov models,’ IEEE Transactions on Communications, vol. 46, no. 2, pp. 222–231, February 1998.

[178] M. W. Marcellin and T. R. Fischer, ‘Trellis coded quantization of memoryless and Gauss-Markov sources,’ IEEE Transactions on Communications, vol. 38, no. 1, pp. 82–93, January 1990.

[179] V. Buttigieg and P. G. Farrell, ‘Variable-length error-correcting codes,’ IEE Proceedings on Communications, vol. 147, no. 4, pp. 211–215, August 2000.

[180] V. B. Balakirsky, ‘Joint source-channel coding with variable length codes,’ in Proceedings of the IEEE International Symposium on Information Theory, Ulm, Germany, June 1997, p. 419.

[181] R. Bauer and J. Hagenauer, ‘Symbol by symbol MAP decoding of variable length codes,’ in Proceedings of the ITG Conference on Source and Channel Coding, Munich, Germany, January 2000, pp. 111–116.

[182] M. Park and D. J. Miller, ‘Decoding entropy-coded symbols over noisy channels by MAP sequence estimation for asynchronous HMMs,’ in Proceedings of the Conference on Information Sciences and Systems, Princeton, NJ, USA, March 1998, pp. 477–482.

[183] M. Bystrom, S. Kaiser and A. Kopansky, ‘Soft source decoding with applications,’ IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, no. 10, pp. 1108–1120, October 2001.

[184] N. Görtz, ‘A generalized framework for iterative source-channel decoding,’ Annals of Telecommunications, pp. 435–446, July/August 2001.

[185] J. Hagenauer and N. Görtz, ‘The turbo principle in joint source-channel coding,’ in Proceedings of the IEEE Information Theory Workshop, Paris, France, March 2003, pp. 275–278.

[186] X. Jaspar, C. Guillemot and L. Vandendorpe, ‘Joint source-channel turbo techniques for discrete-valued sources: From theory to practice,’ Proceedings of the IEEE, vol. 95, no. 6, pp. 1345–1361, June 2007.

[187] J. Modestino and D. Daut, ‘Combined source-channel coding of images,’ IEEE Transactions on Communications, vol. 27, no. 11, pp. 1644–1659, November 1979.

[188] M. Grangetto, B. Scanavino, G. Olmo and S. Benedetto, ‘Iterative decoding of serially concatenated arithmetic and channel codes with JPEG 2000 applications,’ IEEE Transactions on Image Processing, vol. 16, no. 6, pp. 1557–1567, June 2007.

[189] Q. Qu, Y. Pei and J. W. Modestino, ‘An adaptive motion-based unequal error protection approach for real-time video transport over wireless IP networks,’ IEEE Transactions on Multimedia, vol. 8, no. 5, pp. 1033–1044, October 2006.

[190] Y. C. Chang, S. W. Lee, and R. Komiya, ‘A low-complexity unequal error protection of H.264/AVC video using adaptive hierarchical QAM,’ IEEE Transactions on Consumer Electronics, vol. 52, no. 4, pp. 1153–1158, November 2006.

[191] T. Gan, L. Gan, and K.-K. Ma, ‘Reducing video-quality fluctuations for streaming scalable video using unequal error protection, retransmission, and interleaving,’ IEEE Transactions on Image Processing, vol. 15, no. 4, pp. 819–832, April 2006.

[192] R. Bauer and J. Hagenauer, ‘Iterative source/channel-decoding using reversible variable length codes,’ in Proceedings of the IEEE Data Compression Conference, Snowbird, UT, USA, March 2000, pp. 93–102.

[193] A. Viterbi, ‘Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,’ IEEE Transactions on Information Theory, vol. 13, no. 2, pp. 260–269, April 1967.

[194] R. G. Maunder, J. Kliewer, S. X. Ng, J. Wang, L.-L. Yang and L. Hanzo, ‘Joint iterative decoding of trellis-based VQ and TCM,’ IEEE Transactions on Wireless Communications, vol. 6, no. 4, pp. 1327–1336, April 2007.

[195] ——, ‘Iterative joint video and channel decoding in a trellis-based vector-quantized video codec and trellis-coded modulation aided wireless videophone,’ in Proceedings of the IEEE Vehicular Technology Conference, Dallas, TX, USA, September 2005, pp. 922–926.

[196] R. G. Maunder, J. Wang, S. X. Ng, L.-L. Yang and L. Hanzo, ‘On the performance and complexity of irregular variable length codes for near-capacity joint source and channel coding,’ IEEE Transactions on Wireless Communications, vol. 7, no. 4, pp. 1338–1347, 2008.

[197] ——, ‘Iteratively decoded irregular variable length coding and trellis coded modulation,’ in Proceedings of the IEEE Workshop on Signal Processing Systems, Shanghai, China, October 2007, pp. 222–227.

[198] S. Ahmed, R. G. Maunder, L.-L. Yang and L. Hanzo, ‘Iterative detection of unity-rate precoded FFH-MFSK and irregular variable length coding,’ in IEEE Transactions on Vehicular Technology, vol. 58, no. 7, September 2009, pp. 3765–3770.

[199] M. El-Hajjar, R. G. Maunder, O. Alamri, S. X. Ng and L. Hanzo, ‘Iteratively decoded irregular variable length coding and sphere-packing modulation-aided differential space-time spreading,’ in Proceedings of the IEEE Vehicular Technology Conference, Baltimore, MD, USA, September 2007.

[200] R. G. Maunder and L. Hanzo, ‘Genetic algorithm aided design of variable length error correcting codes for arbitrary coding rate and error correction capability,’ IEEE Transactions on Communications, vol. 57, no. 5, pp. 1290–1297, 2009.

[201] ——, ‘Genetic algorithm aided design of near-capacity irregular variable length codes,’ IEEE Wireless Communications and Networking Conference, WCNC 2008. Las Vegas, NV, USA, March 2008, 1256–1260.

[202] ——, ‘Near-capacity irregular variable length coding and irregular unity rate coding,’ IEEE Transactions on Wireless Communications, vol. 8, no. 11, pp. 5500–5507, 2009.

[203] ——, ‘Concatenated irregular variable length coding and irregular unity rate coding,’ IEEE International Conference on Communications, Beijing, China, May 2008, pp. 795–799.

[204] A. Ashikhmin, G. Kramer and S. ten Brink, ‘Code rate and the area under extrinsic information transfer curves,’ in Proceedings of the IEEE International Symposium on Information Theory, Lausanne, Switzerland, June 2002, p. 115.

[205] V. Buttigieg, ‘Variable-Length Error-Correcting Codes,’ Ph.D. dissertation, Department of Electronic Engineering, University of Manchester, Manchester, UK, 1995.

[206] C. Lamy and J. Paccaut, ‘Optimised constructions for variable-length error correcting codes,’ in Proceedings of the IEEE Information Theory Workshop, Paris, France, March 2003, pp. 183–186.

[207] J. Wang, L.-L. Yang and L. Hanzo, ‘Iterative construction of reversible variable-length codes and variable-length error-correcting codes,’ IEEE Communications Letters, vol. 8, no. 11, pp. 671–673, November 2004.

[208] R. Y. Tee, R. G. Maunder, J. Wang and L. Hanzo, ‘Capacity approaching irregular bit-interleaved coded modulation,’ submitted toIEEE Vehicular Technology Conference, Marina Bay, Singapore, May 2008.

[209] J. Wang, L.-L. Yang and L. Hanzo, ‘Iterative channel equalization, channel decoding and source decoding,’ in Proceedings of the 61st IEEE Vehicular Technology Conference, Sweden, May 2005.

[210] L.-L. Yang, J. Wang, R. Maunder and L. Hanzo, ‘Iterative channel equalization and source decoding for vector quantization sources,’ in Proceedings of the 63rd IEEE Vehicular Technology Conference, Melbourne, Australia, 7–10 May 2006.

[211] J. Wang, L.-L. Yang and L. Hanzo, ‘Combined serially concatenated codes and MMSE equalisation: an EXIT chart aided perspective,’ in Proceedings of the 64th IEEE Vehicular Technology Conference [CDROM], Montréal, Canada, 25–28 September 2006.

[212] A. G. Lillie, A. R. Nix and J. P. McGeehan, ‘Performance and design of a reduced complexity iterative equalizer for precoded ISI channels,’ in IEEE Vehicular Technology Conference, Orlando, FL, USA, October 2003, pp. 299–303.

[213] J. Wang, S. X. Ng, A. Wolfgang, L.-L. Yang, S. Chen and L. Hanzo, ‘Near-capacity three-stage MMSE turbo equalization using irregular convolutional codes,’ in Proceedings of the 4th International Symposium on Turbo Codes (ISTC’06) in Connection with the 6th International ITG-Conference on Source and Channel Coding, Munich, Germany, 3–7 April 2006.

[214] O. Alamri, J. Wang, S. X. Ng, L.-L. Yang and L. Hanzo, ‘Near-capacity three-stage turbo detection of irregular convolutional coded joint sphere-packing modulation and space-time coding,’ IEEE Transactions on Communications, vol. 57, no. 5, pp. 1486–1495, 2009.

[215] C. Shannon, ‘A mathematical theory of communication – part I,’ Bell Systems Technical Journal, pp. 379–405, 1948.

[216] ——, ‘A mathematical theory of communication – part II,’ Bell Systems Technical Journal, pp. 405–423, 1948.

[217] ——, ‘A mathematical theory of communication – part III,’ Bell Systems Technical Journal, vol. 27, pp. 623–656, 1948.

[218] H. Nyquist, ‘Certain factors affecting telegraph speed,’ Bell System Technical Journal, p. 617, April 1928.

[219] R. Hartley, ‘Transmission of information,’ Bell Systems Technical Journal, p. 535, 1928.

[220] N. Abramson, Information Theory and Coding. New York: McGraw-Hill, 1975.

[221] A. Carlson, Communication Systems. New York: McGraw-Hill, 1975.

[222] H. Raemer, Statistical Communication Theory and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1969.

[223] P. Ferenczy, Telecommunications Theory, in Hungarian: Hirkozleselmelet. Budapest, Hungary: Tankonyvkiado, 1972.

[224] K. Shanmugam, Digital and Analog Communications Systems. New York: John Wiley and Sons, 1979.

[225] C. Shannon, ‘Communication in the presence of noise,’ Proceedings of the I.R.E., vol. 37, pp. 10–22, January 1949.

[226] ——, ‘Probability of error for optimal codes in a Gaussian channel,’ Bell Systems Technical Journal, vol. 38, pp. 611–656, 1959.

[227] A. Jain, Fundamentals of Digital Image Processing. Englewood Cliffs, NJ: Prentice-Hall, 1989.

[228] A. Hey and R. Allen, Eds., R.P. Feynman: Feynman Lectures on Computation. Reading, MA: Addison-Wesley, 1996.

[229] C. Berrou, A. Glavieux and P. Thitimajshima, ‘Near Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes,’ in Proceedings of the International Conference on Communications, Geneva, Switzerland, May 1993, pp. 1064–1070.

[230] L. Hanzo, W. Webb and T. Keller, Single- and Multi-Carrier Quadrature Amplitude Modulation: Principles and Applications for Personal Communications, WLANs and Broadcasting. IEEE Press, 2000.

[231] J. Hagenauer, ‘Quellengesteuerte kanalcodierung fuer sprach- und tonuebertragung im mobilfunk,’ Aachener Kolloquium Signaltheorie, pp. 67–76, 23–25 March 1994.

[232] A. Viterbi, ‘Wireless digital communications: A view based on three lessons learned,’ IEEE Communications Magazine, pp. 33–36, September 1991.

[233] J. B. MacQueen, ‘Some methods for classification and analysis of multivariate observations,’ in Proceedings of the Berkeley Symposium on Mathematical Statistics and Probability, CA, USA, March 1966, pp. 281–297.

[234] B. McMillan, ‘Two inequalities implied by unique decipherability,’ IRE Transactions on Information Theory, vol. IT-2, pp. 115–116, Dec. 1956.

[235] D. J. C. MacKay, Information Theory, Inference, and Learning Algorithms. Cambridge University Press, Cambridge, 2003.

[236] L. G. Kraft, ‘A device for quantizing, grouping, and coding of amplitude modulated pulses,’ Master’s thesis, Electrical Engineering Department, M.I.T., Mar. 1949.

[237] E. S. Schwartz and B. Kallick, ‘Generating a canonical prefix encoding,’ Communications of ACM, vol. 7, no. 3, pp. 166–169, Mar. 1964.

[238] C. Lamy and F. Bergot, ‘Lower bounds on the existence of binary error-correcting variable-length codes,’ in Proceedings of IEEE Information Theory Workshop, Paris, France, 31 March–4 April 2003, pp. 300–303.

[239] W. E. Hartnett, Ed., Foundations of Coding Theory. Dordrecht, Holland: D. Reidling Publishing Co., 1974.

[240] E. J. Dunscombe, ‘Some applications of mathematics to coding theory,’ Ph.D. dissertation, Royal Holloway and Bedford New College, University of London, 1988.

[241] M. A. Bernard and B. D. Sharma, ‘Variable length perfect codes,’ Journal of Information & Optimization Science, vol. 13, pp. 143–151, January 1992.

[242] A. Escott, ‘A new performance measure for a class of two-length error correcting codes,’ in Codes and Cyphers: Cryptography and Coding IV, P.G. Farrell, Ed. Essex, England: Institute of Mathematics and its Applications, 1995, pp. 167–181.

[243] ‘Information technology – Digital compression and coding of continuous-tone still images–requirements and guidelines,’ ITU-T T.81 (ISO/IEC 10918-1), 1992.

[244] ‘Information technology – JPEG2000,’ ISO/IEC 15444-1 (ITU-T T.800), 2000.

[245] ‘Coding of moving pictures and associated audio for digital storage media at up to 1.5 Mbps,’ ISO/IEC 11172 MPEG-1, 1993.

[246] ‘Generic coding of moving pictures and associated audio information,’ ISO/IEC 13818 MPEG-2, 1994.

[247] A. J. Viterbi, ‘Wireless digital communications: A view based on three lessons learnt,’ IEEE Communications Magazine, pp. 33–36, September 1991.

[248] G. D. Forney, ‘The Viterbi algorithm,’ Proceedings of the IEEE, vol. 61, no. 3, pp. 268–278, March 1973.

[249] W. Xiang, S. Pietrobon and S. Barbulescu, ‘Iterative decoding of JPEG coded images with channel coding,’ in IEEE International Conference on Telecommunications, Tahiti, French, Feb. 2003, pp. 1356–1360.

[250] P. Robertson, E. Villebrun and P. Hoeher, ‘A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain,’ in Proceedings of IEEE International Conference on Communications, Seattle, WA, June 1995, pp. 1009–1013.

[251] T. Okuda, E. Tanaka and T. Kasai, ‘A method for the correction of garbled words based on the Levenshtein metric,’ IEEE Transactions on Computers, vol. C-25, no. 2, pp. 172–176, February 1976.

[252] M. Adrat and P. Vary, ‘Iterative source-channel decoding: Improved system design using EXIT charts,’ EURASIP Journal on Applied Signal Processing (Special Issue: TURBO Processing), no. 6, pp. 928–941, May 2005.

[253] D. Divsalar and F. Pollara, ‘Hybrid concatenated codes and iterative decoding,’ Jet Propulsion Laboratory,’ TDA Progress Report 42-130, August 1997.

[254] S. Benedetto, D. Divsalar, G. Montorsi and F. Pollara, ‘A soft-input soft-output APP module for iterative decoding of concatenated codes,’ IEEE Communications Letters, vol. 1, no. 1, pp. 22–24, January 1997.

[255] ——, ‘Soft-input soft-output modules for the construction and distributed iterative decoding of code networks,’ European Transactions on Telecommunications, vol. 9, pp. 155–172, March 1998.

[256] S. Huettinger and J. Huber, ‘Design of multiple turbo codes with transfer characteristics of component codes,’ in Proceedings of Conference on Information Sciences and Systems, March 2002.

[257] D. Raphaeli and Y. Zarai, ‘Combined turbo equalization and turbo decoding,’ IEEE Communications Letters, pp. 107–109, April 1998.

[258] W. E. Ryan, L. L. McPheters and S. W. McLaughlin, ‘Combined turbo coding and turbo equalization for PR4-equalized Lorentzian channels,’ in Proceedings of Conference on Information Sciences and Systems, March 1998, pp. 489–493.

[259] J. Kliewer, S. X. Ng and L. Hanzo, ‘Efficient computation of EXIT functions for non-binary iterative decoding,’ IEEE Transactions on Communications (Letter), vol. 54, no. 12, pp. 2133–2136, 2006.

[260] L. Hanzo, C.H. Wong and M.S. Yee, Adaptive Wireless Transceivers: Turbo-Coded, Space-Time Coded TDMA, CDMA and OFDM Systems. Chichester, UK: John Wiley-IEEE Press, 2002.

[261] A. Glavieux, C. Laot and J. Labat, ‘Turbo equalization over a frequency selective channel,’ in Proceedings of International Symposium on Turbo Codes, Brest, France, 1997, pp. 96–102.

[262] D. Raphaeli, ‘Combined turbo equalization and turbo decoding,’ IEEE Communications Letters, vol. 2, no. 4, pp. 107–109, April 1998.

[263] I. Lee, ‘The effect of precoder on serially concatenated coding systems with an ISI channel,’ IEEE Transactions on Communications, vol. 49, no. 7, pp. 1168–1175, July 2001.

[264] W. Ryan, ‘Performance of high rate turbo codes on a PR4 equalized magnetic recording channel,’ in IEEE International Conference on Communications (ICC), Atlanta, GA, USA, June 1998, pp. 947–951.

[265] T. Souvignier, A. Friedman, M. Oberg, P. H. Siegel, R. E. Swanson and J. Wolf, ‘Turbo decoding for PR4: Parallel versus serial concatenation,’ in IEEE International Conference on Communications (ICC), Vancouver, Canada, June 1999, pp. 1638–1642.

[266] D. N. Doan and K. R. Narayanan, ‘Some new results on the design of codes for inter-symbol interference channels based on convergence of turbo equalization,’ in IEEE International Conference on Communications (ICC’02), Anchorage Alaska, USA, 2002, pp. 1873–1877.

[267] A. Ashikhmin, G. Kramer and S. ten Brink, ‘Extrinsic information transfer functions: Model and erasure channel properties,’ IEEE Transactions on Information Theory, vol. 50, no. 11, pp. 2657–2673, November 2004.

[268] M. Adrat, J. Brauers, T. Clevorn and P. Vary, ‘The EXIT-characteristic of softbit-source decoders,’ IEEE Communications Letters, vol. 9, no. 6, pp. 540–542, June 2005.

[269] J. G. Proakis, Digital Communications. McGraw-Hill, 1983.

[270] H. Jin, A. Khandekar and R. McEliece, ‘Irregular repeat-accumulate codes,’ in Proceedings of 2nd International Symposium on Turbo Codes and Related Topics, Brest, France, September 2000, pp. 1–8.

[271] S. X. Ng, J. Wang, M. Tao, L.-L. Yang and L. Hanzo, ‘Iteratively decoded variable-length space-time coded modulation: code construction and convergence analysis,’ IEEE Transactions on Wireless Communications, vol. 6, no. 5, pp. 1953–1963, 2007.

[272] S. X. Ng, J. Y. Chung and L. Hanzo, ‘Turbo-detected unequal protection MPEG-4 wireless video telephony using multi level coding, trellis coded modulation and space-time trellis coding,’ IEE Proceedings on Communications, vol. 152, no. 6, pp. 1116–1124, December 2005.

[273] S. X. Ng, R. G. Maunder, J. Wang, L.-L. Yang and L. Hanzo, ‘Joint iterative-detection of reversible variable-length coded constant bit rate vector-quantized video and coded modulation,’ in Proceedings of the European Signal Processing Conference, Vienna, Austria, September 2004, pp. 2231–2234.

[274] S. X. Ng, J. Y. Chung, F. Guo and L. Hanzo, ‘A turbo-detection aided serially concatenated MPEG-4/TCM videophone transceiver,’ in Proceedings of the IEEE Vehicular Technology Conference, vol. 4, Los Angeles, CA, USA, September 2004, pp. 2606–2610.

[275] S. Benedetto and G. Montorsi, ‘Serial concatenation of block and convolutional codes,’ Electronics Letters, vol. 32, no. 10, pp. 887–888, May 1996.

[276] Y. Takishima, M. Wada and H. Murakami, ‘Reversible variable length codes,’ IEEE Transactions on Communications, vol. 43, no. 234, pp. 158–162, February 1995.

[277] G. Ungerboeck, ‘Channel coding with multilevel/phase signals,’ IEEE Transactions on Information Theory, vol. 28, no. 1, pp. 55–67, January 1982.

[278] S. Benedetto and G. Montorsi, ‘Iterative decoding of serially concatenated convolutional codes,’ Electronics Letters, vol. 32, no. 13, pp. 1186–1188, June 1996.

[279] C. Bergeron and C. Lamy-Bergot, ‘Soft-input decoding of variable-length codes applied to the H.264 standard,’ in Proceedings of the IEEE Workshop on Multimedia Signal Processing, Siena, Italy, September 2004, pp. 87–90.

[280] K. P. Subbalakshmi and Q. Chen, ‘Joint source-channel decoding for MPEG-4 coded video over wireless channels,’ in Proceeding of the IASTED International Conference on Wireless and Optical Communications, Banff National Park, Canada, July 2002, pp. 617–622.

[281] Q. Chen and K. P. Subbalakshmi, ‘Trellis decoding for MPEG-4 streams over wireless channels,’ in Proceedings of SPIE Electronic Imaging: Image and Video Communications and Processing, Santa Clara, CA, USA, January 2003, pp. 810–819.

[282] X. F. Ma and W. E. Lynch, ‘Iterative joint source-channel decoding using turbo codes for MPEG-4 video transmission,’ in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 4, Montreal, Quebec, Canada, May 2004, pp. 657–660.

[283] Q. Chen and K. P. Subbalakshmi, ‘Joint source-channel decoding for MPEG-4 video transmission over wireless channels,’ IEEE Journal on Selected Areas in Communications, vol. 21, no. 10, pp. 1780–1789, December 2003.

[284] Y. Wang and S. Yu, ‘Joint source-channel decoding for H.264 coded video stream,’ IEEE Transactions on Consumer Electronics, vol. 51, no. 4, pp. 1273–1276, November 2005.

[285] Q. Chen and K. P. Subbalakshmi, ‘An integrated joint source-channel decoder for MPEG-4 coded video,’ IEEE Vehicular Technology Conference, vol. 1, pp. 347–351, October 2003.

[286] K. Lakovic and J. Villasenor, ‘Combining variable length codes and turbo codes,’ in Proceedings of the IEEE Vehicular Technology Conference, vol. 4, Birmingham, AL, USA, May 2002, pp. 1719–1723.

[287] M. Grangetto, B. Scanavino, and G. Olmo, ‘Joint source-channel iterative decoding of arithmetic codes,’ in Proceedings of the IEEE International Conference on Communications, vol. 2, Paris, France, June 2004, pp. 886–890.

[288] H. Nguyen and P. Duhamel, ‘Iterative joint source-channel decoding of variable length encoded video sequences exploiting source semantics,’ in Proceedings of the International Conference on Image Processing, vol. 5, Singapore, October 2004, pp. 3221–3224.

[289] H. Xiao and B. Vucetic, ‘Channel optimized vector quantization with soft input decoding,’ in Proceedings of the International Symposium on Signal Processing and Its Applications, vol. 2, Gold Coast, Queensland, Australia, August 1996, pp. 501–504.

[290] D. J. Vaisey and A. Gersho, ‘Variable block-size image coding,’ in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 12, Dallas, TX, USA, April 1987, pp. 1051–1054.

[291] A. Makur and K. P. Subbalakshmi, ‘Variable dimension VQ encoding and codebook design,’ IEEE Transactions on Communications, vol. 45, no. 8, pp. 897–899, August 1997.

[292] J. Hagenauer, E. Offer, and L. Papke, ‘Iterative decoding of binary block and convolutional codes,’ IEEE Transactions on Information Theory, vol. 42, no. 2, pp. 429–445, March 1996.

[293] S. X. Ng and L. Hanzo, ‘Space-time IQ-interleaved TCM and TTCM for AWGN and Rayleigh fading channels,’ Electronics Letters, vol. 38, no. 24, pp. 1553–1555, 2002.

[294] S. ten Brink, ‘Convergence of iterative decoding,’ Electronics Letters, vol. 35, no. 10, pp. 806–808, May 1999.

[295] P. Robertson, E. Villebrun and P. Hoeher, ‘A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain,’ in Proceedings of the IEEE International Conference on Communications, vol. 2, Seattle, WA, USA, June 1995, pp. 1009–1013.

[296] L. Hanzo, T. H. Liew and B. L. Yeap, Turbo Coding, Turbo Equalisation and Space Time Coding for Transmission over Wireless Channels. Chichester, UK: Wiley, 2002.

[297] V. Franz and J. B. Anderson, ‘Concatenated decoding with a reduced-search BCJR algorithm,’ IEEE Journal on Selected Areas in Communications, vol. 16, no. 2, pp. 186–195, February 1998.

[298] J. Kliewer, N. Görtz and A. Mertins, ‘Iterative source-channel decoding with Markov random field source models,’ IEEE Transactions on Signal Processing, vol. 54, no. 10, pp. 3688–3701, October 2006.

[299] J. Kliewer, A. Huebner and D. J. Costello, ‘On the achievable extrinsic information of inner decoders in serial concatenation,’ in Proceedings of the IEEE International Symposium on Information Theory, Seattle, WA, USA, July 2006, pp. 2680–2684.

[300] L. Hanzo, S. X. Ng, T. Keller and W. Webb, Quadrature Amplitude Modulation. Chichester, UK: Wiley, 2004.

[301] R. Bauer and J. Hagenauer, ‘On variable length codes for iterative source/channel decoding,’ in Proceedings of the IEEE Data Compression Conference, Snowbird, UT, USA, March 2001, pp. 273–282.

[302] R. C. Bose and D. K. Ray-Chaudhuri, ‘On a class of error-correcting binary group codes,’ Information and Control, vol. 3, pp. 68–79, March 1960.

[303] A. Hocquenghem, ‘Codes correcteurs d’erreurs,’ Chiffres, vol. 2, pp. 147–156, September 1959.

[304] B. Masnick and J. Wolf, ‘On linear unequal error protection codes,’ IEEE Transactions on Information Theory, vol. 13, no. 4, pp. 600–607, October 1967.

[305] M. Rosenblatt, ‘A central limit theorem and a strong mixing condition,’ Proceedings of the National Academy of Sciences, no. 42, pp. 43–47, 1956.

[306] M. Tüchler, ‘Design of serially concatenated systems depending on the block length,’ IEEE Transactions on Communications, vol. 52, no. 2, pp. 209–218, February 2004.

[307] D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.

[308] D. Divsalar, S. Dolinar and F. Pollara, ‘Serial concatenated trellis coded modulation with rate-1 inner code,’ in Proceedings of the IEEE Global Telecommunications Conference, vol. 2, San Francisco, CA, USA, November 2000, pp. 777–782.

[309] G. Golub and C. van Loan, Matrix Computations. Baltimore: Johns Hopkins University Press, 1996. [310] F. Gray, US Patent 2 632 058, March, 1953.

[311] G. Caire, G. Taricco and E. Biglieri, ‘Bit-interleaved coded modulation,’ IEEE Transactions on Information Theory, vol. 44, no. 3, pp. 927–946, May 1998.

[312] S. ten Brink, ‘Code characteristic matching for iterative decoding of serially concatenated codes,’ Annals of Telecommunications, vol. 56, no. 7–8, pp. 394–408, July–August 2001.

[313] T. J. Richardson, M. A. Shokrollahi and R. L. Urbanke, ‘Design of capacity-approaching irregular low-density parity-check codes,’ IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 619–637, February 2001.

[314] G. Foschini Jr. and M. Gans, ‘On limits of wireless communication in a fading environment when using multiple antennas,’ Wireless Personal Communications, vol. 6, no. 3, pp. 311–335, March 1998.

[315] E. Telatar, ‘Capacity of multi-antenna Gaussian channels,’ European Transactions on Telecommunication, vol. 10, no. 6, pp. 585–595, Nov–Dec 1999.

[316] G. J. Foschini, Jr., ‘Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas,’ Bell Labs Technical Journal, pp. 41–59, 1996.

[317] V. Tarokh, N. Seshadri and A. R. Calderbank, ‘Space-time codes for high rate wireless communication: Performance analysis and code construction,’ IEEE Transactions on Information Theory, vol. 44, no. 2, pp. 744–765, March 1998.

[318] S. Lin, A. Stefanov and Y. Wang, ‘Joint source and space-time block coding for MIMO video communications,’ in IEEE Vehicular Technology Conference, Los Angeles, CA, Sept 2004, pp. 2508–2512.

[319] T. Holliday and A. Goldsmith, ‘Joint source and channel coding for MIMO systems,’ in Proceedings of Allerton Conference on Communication, Control, and Computing, Oct. 2004.

[320] S. X. Ng, F. Guo and L. Hanzo, ‘Iterative detection of diagonal block space time trellis codes, TCM and reversible variable length codes for transmission over Rayleigh fading channels,’ in IEEE Vehicular Technology Conference, Los Angeles, CA, USA, 26–29 September 2004, pp. 1348–1352.

[321] D. Divsalar, S. Dolinar and F. Pollara, ‘Serial concatenated trellis coded modulation with rate-1 inner code,’ in GLOBECOM ‘00, San Francisco, CA, Nov–Dec 2000, pp. 777–782.

[322] G. Ungerböck, ‘Channel coding with multilevel/phase signals,’ IEEE Transactions on Information Theory, vol. 28, pp. 55–67, January 1982.

[323] A. F. Naguib, V. Tarokh, N. Seshadri and A. R. Calderbank, ‘A space-time coding modem for high-data-rate wireless communications,’ IEEE Journal on Selected Areas in Communications, vol. 16, no. 8, pp. 1459–1478, October 1998.

[324] D. Divsalar and M. K. Simon, ‘Trellis coded modulation for 4800-9600 bits/s transmission over a fading mobile satellite channel,’ IEEE Journal on Selected Areas in Communications, vol. 5, no. 2, pp. 162–175, February 1987.

[325] M. Tao and R. S. Cheng, ‘Diagonal block space-time code design for diversity and coding advantage over flat rayleigh fading channels,’ IEEE Transactions on Signal Processing, no. 4, pp. 1012–1020, April 2004.

[326] T. M. Cover and J. A. Thomas, Elements of Information Theory. New York, USA: John Wiley IEEE Press, 1991.

[327] G. L. Nemhauser, A. H. G. Rinnooy Kan and M. J. Todd, Optimization. Amsterdam, The Netherlands: North-Holland, 1989.

[328] L. Hanzo, T. H. Liew and B. L. Yeap, Turbo Coding, Turbo Equalisation and Space Time Coding for Transmission over Wireless Channels. New York, USA: John Wiley IEEE Press, 2002.

[329] X. Li and J. A. Ritcey, ‘Bit-interleaved coded modulation with iterative decoding using soft feedback,’ IEE Electronics Letters, vol. 34, pp. 942–943, May 1998.

[330] P. Robertson, E. Villebrun and P. Höher, ‘A comparison of optimal and sub-optimal MAP decoding algorithms operating in log domain,’ in Proceedings of the International Conference on Communications, June 1995, pp. 1009–1013.

[331] S. ten Brink, ‘Convergence behaviour of iteratively decoded parallel concatenated codes,’ IEEE Transactions on Communications, vol. 49, no. 10, pp. 1727–1737, October 2001.

[332] H. Chen and A. Haimovich, ‘EXIT charts for turbo trellis-coded modulation,’ IEEE Communications Letters, vol. 8, no. 11, pp. 668–670, November 2004.

[333] A. Grant, ‘Convergence of non-binary iterative decoding,’ in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM), San Antonio TX, USA, November 2001, pp. 1058–1062.

[334] M. Tuchler, ‘Convergence prediction for iterative decoding of threefold concatenated systems,’ in GLOBECOM ‘02, Taipei, Taiwan, 17–21 November 2002, pp. 1358–1362.

[335] F. Brannstrom, L. K. Rasmussen and A. J. Grant, ‘Convergence analysis and optimal scheduling for multiple concatenated codes,’ IEEE Transaction on Information Theory, pp. 3354–3364, Sept 2005.

[336] S. X. Ng and L. Hanzo, ‘On the MIMO channel capacity of multi-dimensional signal sets,’ IEEE Transactions on Vehicular Technology, vol. 55, no. 2, pp. 528–536, 2006.

[337] S. Ahmed, R. G. Maunder, L.-L. Yang and L. Hanzo, ‘Iterative detection of unity-rate precoded FFH-MFSK and irregular variable-length coding,’ in IEEE transactions on Vehicular Technology, vol. 58, no. 7, 2009, pp. 3765–3770.

[338] K. C. Teh, A. C. Kot and K. H. Li, ‘FFT-based clipper receiver for fast frequency-hopping spread-spectrum system,’ in Proceedings of the IEEE Symposium on Circuits and Systems, vol.4, May-June 1998, pp. 305–308.

[339] R. E. Ziemer and R. L. Peterson, Digital Communications and Spread Spectrum Systems. New York: Mcmillan Inc., 1985.

[340] V. A. Aalo and J. Zhang, ‘Performance analysis of maximal ratio combining in the presence of multiple equal-power cochannel interferers in a Nakagami fading channel,’ IEEE Transactions on Vehicular Technology, vol. 50, no. 2, pp. 497–503, March 2001.

[341] J. S. Lee, L. E. Miller and Y. K. Kim, ‘Probability of error analyses of a BFSK frequency-hopping system with diversity under partial-band jamming interference-Part II: Performance of square-law nonlinear combining soft decision receivers,’ IEEE Transaction on Communications, vol. COM-32, no. 12, pp. 1243–1250, December 1984.

[342] C.-L. Chang and T.-M. Tu, ‘Performance analysis of FFH/BFSK product-combining receiver with partial-band jamming over independent Rician fading channels,’ IEEE Transactions on Wireless Communications, vol. 4, no. 6, pp. 2629–2635, November 2005.

[343] R. C. Robertson and T. T. Ha, ‘Error probabilities of fast frequency-hopped MFSK receiver with noise-normalization combining in a fading channel with partial-band interference,’ IEEE Transactions on Communications, vol. 40, no. 2, pp. 404–412, February 1992.

[344] P. C. P. Liang and W. E. Stark, ‘Algorithm for joint decoding of turbo codes and M-ary orthogonal modulation,’ in IEEE International Symposium on Information Theory, 2000, June 2000, p. 191.

[345] M. C. Valenti, E. Hueffmeier, B. Bogusch and J. Fryer, ‘Towards the capacity of noncoherent orthogonal modulation: BICM-ID for turbo coded NFSK,’ in IEEE Conference on Military Communications, 2004. MILCOM 2004, vol. 3, October–November 2004, pp. 1549–1555.

[346] S. ten Brink, ‘Convergence of iterative decoding,’ IEEE Transactions on Communications, vol. 49, no. 10, pp. 1727–1737, October 2001.

[347] U. C. Fiebig, ‘Soft-decision and erasure decoding in fast frequency-hopping systems with convolutional, turbo, and Reed-Solomon codes,’ IEEE Transactions on Communications, vol. 47, no. 11, pp. 1646–1654, November 1999.

[348] D. Park and B. G. Lee, ‘Iterative decoding in convolutionally and turbo coded MFSK/FH-SSMA systems,’ in IEEE International Conference on Communications, ICC 2001, vol. 9, June 2001, pp. 2784–2788.

[349] W. E. Ryan, ‘Concatenated codes for class IV partial response channels,’ IEEE Transactions on Communications, vol. 49, no. 3, pp. 445–454, March 2001.

[350] R. Y. S. Tee, S. X. Ng and L. Hanzo, ‘Precoder-aided iterative detection assisted multilevel coding and three-dimensional EXIT-chart analysis,’ in IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006, vol. 3, April 2006, pp. 1322–1326.

[351] D. Divsalar, S. Dolinar and F. Pollara, ‘Serial concatenated trellis coded modulation with rate-1 inner code,’ in IEEE Global Telecommunications Conference, 2000. GLOBECOM ‘00., vol. 2, November–December 2000, pp. 777–782.

[352] J. G. Proakis, Digital Communications. Singapore: McGraw-Hill, 2001.

[353] S. Ahmed, S. X. Ng, L.-L. Yang and L. Hanzo, ‘Iterative decoding and soft interference cancellation in fast frequency hopping multiuser system using clipped combining,’ in Proceedings of the IEEE Wireless Communications and Networking Conference, WCNC 2007, March 2007, pp. 723–728.

[354] L. Hanzo, T. H. Liew and B. L. Yeap, Turbo Coding, Turbo Equalisation and Space-Time Coding for Transmission over Fading Channels. England: John Wiley and Sons, England, 2002.

[355] J. Wang, S. X. Ng, A. Wolfgang, L.-L. Yang, S. Chen and L. Hanzo, ‘Near-capacity three-stage MMSE turbo equalization using irregular convolutional codes,’ in Proceedings of the International Symposium on Turbo Codes, Munich, Germany, April 2006, electronic publication.

[356] P. J. Crepeau, ‘Performance of FH/BFSK with generalized fading in worst-case partial-band Gaussian interference,’ IEEE Transactions on Selected Areas of Communications, vol. 8, no. 5, pp. 884–886, June 1990.

[357] G. Huo and M. S. Aluoini, ‘Another look at the BER performance of FFH/BFSK with product combining over partial-band jammed Rayleigh fading channels,’ IEEE Transactions on Vehicular Technology, vol. 50, no. 5, pp. 1203–1215, September 2001.

[358] A. Chindapol and J. A. Ritcey, ‘Design, analysis, and performance evaluation for BICM-ID with square QAM constellations in Rayleigh fading channels,’ IEEE Journal on Selected Areas in Communications, vol. 19, no. 5, pp. 944–957, May 2001.

[359] J. Tan and G. L. Stuber, ‘Analysis and design of interleaver mappings for iteratively decoded BICM,’ in Proceedings of the IEEE International Conference on Communications, vol. 3, New York, NY, USA, April 2002, pp. 1403–1407.

[360] F. Schreckenbach, N. Görtz, J. Hagenauer and G. Bauch, ‘Optimized symbol mappings for bit-interleaved coded modulation with iterative decoding,’ in Proceedings of the IEEE Global Telecommunications Conference, vol. 6, San Francisco, CA, USA, December 2003, pp. 3316–3320.