A matrix algorithm for computing the free space distance of TCM codes sequence

Author

Pingyi, Fan ; Zhigang, Cao

Author_Institution

Dept. of Electron. Eng., Tsinghua Univ., Beijing, China

fYear

1996

fDate

5-7 May 1996

Firstpage

536

Abstract

In this paper, the problem of computing the free distance of TCM code sequences has been discussed. A new algorithm, the matrix algorithm, is proposed, and the step-number estimation problem for state transmission to compute the free distance of the TCM code sequences has been theoretically solved. The matrix algorithm is derived from the Viterbi algorithm, and is an implementation of the Viterbi algorithm in the form of a matrix. Compared with other algorithms, the matrix algorithm has two advantages: (1) the explicit solution, and its relatively lower complexity, (2) its more reflexible ability to signal space distance variation. As examples, the results of some TCM code sequences on an AWGN channel and fading channels have been presented

Keywords

Gaussian channels; channel coding; computational complexity; fading; matrix algebra; maximum likelihood estimation; sequences; sequential codes; trellis coded modulation; AWGN channel; TCM code sequences; Viterbi algorithm; complexity; explicit solution; fading channels; free space distance; matrix algorithm; signal space distance variation; state transmission; step-number estimation problem; Computer simulation; Digital communication; Dynamic programming; Error probability; Extraterrestrial measurements; Heuristic algorithms; Signal to noise ratio; State estimation; Transfer functions; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Technology Proceedings, 1996. ICCT'96., 1996 International Conference on

Conference_Location

Beijing

Print_ISBN

0-7803-2916-3

Type

conf

DOI

10.1109/ICCT.1996.545240

Filename

545240