Title: A reduced-state Viterbi algorithm for blind sequence estimation of DPSK sources
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...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.Read More
Publication Year: 1999
Publication Date: 1999-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot