A Maximum Likelihood Decoding Algorithm for Wireless Channels

Authors:
P. G. Babalis;P. T. Trakadas;C. N. Capsalis
Affiliations:
Department of Electrical and Computer Engineering, Information Transmission System and Material Technology Division, National Technical University of Athens, 9 Iroon Polytechniou Street, 157 80 At ...;Department of Electrical and Computer Engineering, Information Transmission System and Material Technology Division, National Technical University of Athens, 9 Iroon Polytechniou Street, 157 80 At ...;Department of Electrical and Computer Engineering, Information Transmission System and Material Technology Division, National Technical University of Athens, 9 Iroon Polytechniou Street, 157 80 At ...
Venue:
Wireless Personal Communications: An International Journal
Year:
2002

Citing 2
Cited 2

Reliability-based code-search algorithms for maximum-likelihood decoding of block codes

IEEE Transactions on Information Theory
Soft-decision decoding of binary linear block codes based on an iterative search algorithm

IEEE Transactions on Information Theory

Improved Performance of Maximum Likelihood Decoding Algorithm with Efficient Use of Algebraic Decoder

Wireless Personal Communications: An International Journal
A Generalized Suzuki Distribution

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new maximum likelihood decoding (MLD) algorithm for linear block codes is proposed. The new algorithm uses the algebraic decoder in order to generate the set of candidate codewords. It uses the exact probability for each codeword as a new likelihood metric and a method to generate the appropriate set of codewords similar to Kaneko, et al., and Tanaka-Kakigahara algorithms. The performance of the proposed algorithm is the same as that of MLD as it is proved theoretically and verified by simulation results. The comparison with these similar algorithms shows that the new one always requires less average decoding complexity than those of the other algorithms. Finally, we compare the algorithms for terrestrial and satellite channels.