Sequential decoding of convolutional codes in channels with intersymbol interference

From MaRDI portal

DOI10.1109/26.380115MaRDI QIDQ2726520zbMATH OpenOpenAlexFDO

Authors Fuqin Xiong

Publication date 18 July 2001

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/26.380115


Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Error probability in coding theory (94B70)




Review text

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 \(R_{comp}\) 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.


Recommendations



Cited in
(17)








This page was built for publication: Sequential decoding of convolutional codes in channels with intersymbol interference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2726520)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Sequential_decoding_of_convolutional_codes_in_channels_with_intersymbol_interference&oldid=83001416"
Powered by MediaWiki