Sequential Decoding of Convolutional Codes in Channels With Intersymbol Interference

Document Type

Article

Publication Date

2-1995

Publication Title

IEEE Transactions on Communications

Abstract

Sequential sequence estimation for communications channels with convolutionally coded input sequences and intersymbol interference (ISI) is proposed. The receiver consists of a whitened matched filter (WMF) and a vector sequential decoder. The metric of the vector sequential algorithm (SA) is derived. Analytical results for error probability and computational complexity of the sequential decoder are presented. The error probability is found to be dominated by the minimum Euclidean distance between the possible output sequences and the computational distribution is Pareto, typical of a sequential decoder. The computational cut-off code rate Rcomp and its lower bound R comp' are also derived. Numerical simulation results of the error probability and the computational complexity are presented. Comparing with the Viterbi algorithm (VA) reveals that the SA essentially has the same error performance as that of the VA while its average computational complexity is one to two orders of magnitude less than that of the VA.

Original Citation

Fuqin Xiong. (1995). Sequential decoding of convolutional codes in channels with intersymbol interference. IEEE Transactions on- Communications, 43, 234, 828-836, doi: 10.1109/26.380115

DOI

doi: 10.1109/26.380115

Volume

43

Issue

234

Link to Full Text

Share

COinS