Title :
Efficient decoding algorithms for noncoherent trellis coded phase modulation
Author_Institution :
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
fDate :
28 Nov- 2 Dec 1994
Abstract :
Noncoherent decoding of trellis codes using multiple-symbol overlapped observations was shown to achieve close to the coherent performance. Optimal decoding by the Viterbi algorithm (VA) for L-symbol observations requires a number of states which grows exponentially with L. In the paper a novel suboptimal algorithm is presented, called estimated future decision feedback algorithm which is based on the VA. The number of states used is the same as in the original code, yielding complexity which depends weakly on L. A basic building block to this algorithm is the basic decision feedback algorithm (BDFA) or its modification the modified decision feedback algorithm (MDFA). The new algorithm uses a novel concept called “estimated future” and its performance is very close to optimum for most practical cases with some additional complexity and memory requirements as compared to the VA (used with coherent decoding)
Keywords :
Viterbi decoding; computational complexity; continuous phase modulation; trellis coded modulation; L-symbol observations; Viterbi algorithm; basic decision feedback algorithm; coherent performance; complexity; efficient decoding algorithms; estimated future; estimated future decision feedback algorithm; memory requirement; modified decision feedback algorithm; multiple-symbol overlapped observations; noncoherent trellis coded phase modulation; performance; suboptimal algorithm; AWGN; Convolutional codes; Degradation; Maximum likelihood decoding; Maximum likelihood detection; Maximum likelihood estimation; Modulation coding; Phase modulation; State feedback; Viterbi algorithm;
Conference_Titel :
Global Telecommunications Conference, 1994. GLOBECOM '94. Communications: The Global Bridge., IEEE
Conference_Location :
San Francisco, CA
Print_ISBN :
0-7803-1820-X
DOI :
10.1109/GLOCOM.1994.512988