article · IEEE Transactions on Information Theory · 2008
Adaptive Methods for Linear Programming Decoding
M. Hossein Taghavi, P.H. Siegel
Cited by 120Abstract and details only
Abstract
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying LP problem. In this paper, we make a first step in studying this method, and show that by starting from a simple LP problem and adaptively adding the necessary constraints, the complexity of LP decoding can be significantly reduced. In particular, we observe that with adaptive LP decoding, the sizes of the LP problems that need to be solved become practically independent of the density of the parity-check matrix. We further show that adaptively adding extra constraints, such as constraints based on redundant parity checks, can provide large gains in the performance. </para>
Cite this paper
Taghavi, M. H., & Siegel, P. (2008). Adaptive Methods for Linear Programming Decoding. IEEE Transactions on Information Theory, 54(12), 5396–5410. https://doi.org/10.1109/tit.2008.2006384
Taghavi, M. Hossein, and P.H. Siegel. “Adaptive Methods for Linear Programming Decoding.” IEEE Transactions on Information Theory, vol. 54, no. 12, 2008, pp. 5396–410, https://doi.org/10.1109/tit.2008.2006384.
Taghavi, M. Hossein, and P.H. Siegel. 2008. “Adaptive Methods for Linear Programming Decoding.” IEEE Transactions on Information Theory 54 (12): 5396–410. https://doi.org/10.1109/tit.2008.2006384.
Taghavi, M.H. and Siegel, P. (2008) ‘Adaptive Methods for Linear Programming Decoding’, IEEE Transactions on Information Theory, 54(12), pp. 5396–5410. Available at: https://doi.org/10.1109/tit.2008.2006384.
@article{taghavi2008adaptive,
title = {{Adaptive Methods for Linear Programming Decoding}},
author = {Taghavi, M. Hossein and Siegel, P.H.},
journal = {IEEE Transactions on Information Theory},
volume = {54},
number = {12},
pages = {5396--5410},
year = {2008},
doi = {10.1109/tit.2008.2006384}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Efficient Sphere Polar Decoding via Synchronous Determination
Huayi Zhou, Warren J. Gross, Zaichen Zhang et al. · IEEE Transactions on Vehicular Technology · 2020
Cited by 11
Iterative and Adjustable Soft List Decoding for Polar Codes
Bowen Feng, Jian Jiao, Shaohua Wu et al. · IEEE Transactions on Signal Processing · 2020
Cited by 5
Low-Complexity Successive Cancellation List Decoding of Polar Codes Based on Path Metric
Xiaodong Liu, Ce Sun, Wei Tang · IEEE International Conference on Communication Technology (ICCT) · 2021
Cited by 3
Research of modified IRA decoding algorithm based on offset approximation
Tian Zhang · Microcomputer & its Applications · 2009
Cited by 0
Fast Decoding with Cryptcodes for Burst Errors
Aleksandra Popovska‐Mitrovikj, Verica Bakeva, Daniela Mechkaroska · Communications in computer and information science · 2020
Cited by 4
Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding
Jason Bellorado, A. Kavcic, Marcus Marrow et al. · IEEE Transactions on Information Theory · 2010
Cited by 25