An Improved A^ Decoding Algorithm With List Decoding

Comparing with hard decision decoding algorithms, soft decoding has a lower probability of bit error but a higher computational complexity. As a maximum-likelihood soft decoding method, the <inline-formula> <tex-math notation="LaTeX">A^{\ast } </tex-math></inline-formu...

Full description

Bibliographic Details

Published in:	IEEE access Vol. 6; pp. 46877 - 46885
Main Authors:	Xu, Bin, Ying, Chenhao, Luo, Yuan
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 01.01.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">A algorithm Accuracy Algorithms Binary system Block codes Codes Complexity Computational complexity Decoding Error correcting coding Error probability Generators Heuristic algorithms list decoding Maximum likelihood decoding
ISSN:	2169-3536, 2169-3536
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!