Journal of the Franklin Institute-Engineering and Applied Mathematics
Decoding convolutional codes with binary digital modulation in intersymbol interference (ISI) channels is studied. The receiver structure is a whitened matched filter (WMF) whose transfer function is determined by the ISI channel. Decoding of the output sequence can be performed in two steps or one step. The two-step decoding first decodes the ISI corrupted coded sequence back to the ISI free coded sequence which is then decoded back to the uncoded message sequence. For one-step decoding, the entire encoder-channel-receiver system is modeled as a new encoder with combined memory length of the memory lengths of the original encoder and the channel, and followed by a weighted summation mapping from the binary symbols to real number symbols. The weighting coefficients are determined by the channel characteristic. In both two-step and one-step decoding, the Viterbi algorithm (VA) is used to perform the maximum likelihood decoding. Decoding error probability and complexity of both methods are analyzed, simulated and compared.
Xiong, Fuqin, "Optimal Sequence Estimation for Convolutionally Coded Signals With Binary Digital Modulation in ISI Channels" (1995). Electrical Engineering & Computer Science Faculty Publications. 57.
Xiong, F. (1995). Optimal Sequence Estimation for Convolutionally Coded Signals with Binary Digital Modulation in ISI Channels. Journal of The Franklin Institute, 332(2), 125-140.
NOTICE: this is the author’s version of a work that was accepted for publication in Journal of the Franklin Institute-Engineering and Applied Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of the Franklin Institute-Engineering and Applied Mathematics, 332, 2, (03-01-1995); 10.1016/0016-0032(95)00003-2