Title :
A reduced-state Viterbi algorithm for blind sequence estimation of DPSK sources
Author :
Li, Tongtong ; Ding, Zhi
Author_Institution :
Dept. of Electr. Eng., Auburn Univ., AL, USA
fDate :
6/21/1905 12:00:00 AM
Abstract :
The Viterbi algorithm is the optimum decoding algorithm for convolutional codes and has often served as a standard technique in digital communication systems for maximum likelihood sequence estimation. With the Viterbi algorithm, the computational complexity increases exponentially with the constraint length of the convolutional code. Reducing the constraint length (hence the number of states) would permit major simplification in the implementation of the Viterbi algorithm. In this paper, a reduced-state Viterbi algorithm for blind sequence estimation of DPSK sources is presented. It can reduce number of states in the Viterbi algorithm by at least half. The reduced state DPSK Viterbi decoder can be made much faster without any performance loss
Keywords :
Viterbi decoding; computational complexity; convolutional codes; differential phase shift keying; maximum likelihood sequence estimation; DPSK sources; Viterbi algorithm; blind sequence estimation; computational complexity; constraint length; convolutional code; optimum decoding algorithm; reduced state DPSK Viterbi decoder; reduced-state Viterbi algorithm; Code standards; Communication standards; Computational complexity; Convolutional codes; Differential quadrature phase shift keying; Digital communication; Maximum likelihood decoding; Maximum likelihood estimation; Performance loss; Viterbi algorithm;
Conference_Titel :
Global Telecommunications Conference, 1999. GLOBECOM '99
Conference_Location :
Rio de Janeireo
Print_ISBN :
0-7803-5796-5
DOI :
10.1109/GLOCOM.1999.827588
