Title :
Complexity-reduced multilevel coding with rate-compatible punctured convolutional codes
Author :
Cheng, Jung-Fu ; Chuang, Ching-Hua ; Lee, Lin-shan
Author_Institution :
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan
fDate :
29 Nov-2 Dec 1993
Abstract :
A new coding design with large coding gains and complexity-reduced decoders is proposed. The coding strategy is based on a multilevel coding construction with rate-compatible punctured convolutional codes as building blocks. A new sub-optimal decoding is proposed where only one decoder using Viterbi algorithm is drafted. Typical example codes for quadrature amplitude shift keying (QASK) constellations an constructed and shown to outperform Ungerboeck´s codes, but with higher decoding delay. Computer simulation is also performed to verify the results
Keywords :
amplitude modulation; amplitude shift keying; convolutional codes; decoding; encoding; maximum likelihood estimation; QASK; Viterbi algorithm; Viterbi decoding; coding design; coding gains; complexity-reduced decoders; complexity-reduced multilevel coding; computer simulation; decoding delay; interleaving; iterative decoding; quadrature amplitude shift keying; rate-compatible punctured convolutional codes; sub-optimal decoding; Amplitude shift keying; Bandwidth; Codecs; Computer simulation; Constellation diagram; Convolutional codes; Decoding; Delay; Modems; Viterbi algorithm;
Conference_Titel :
Global Telecommunications Conference, 1993, including a Communications Theory Mini-Conference. Technical Program Conference Record, IEEE in Houston. GLOBECOM '93., IEEE
Conference_Location :
Houston, TX
Print_ISBN :
0-7803-0917-0
DOI :
10.1109/GLOCOM.1993.318193
