Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Interior point algorithms: theory and analysis
Interior point algorithms: theory and analysis
Convex Optimization
Decoding error-correcting codes via linear programming
Decoding error-correcting codes via linear programming
An LP decoding algorithm based on primal path-following interior point method
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Unified design of iterative receivers using factor graphs
IEEE Transactions on Information Theory
Joint message-passing decoding of LDPC codes and partial-response channels
IEEE Transactions on Information Theory
Joint message-passing decoding of ldpc codes and partial-response channels
IEEE Transactions on Information Theory
Coded modulation using superimposed binary codes
IEEE Transactions on Information Theory
Using linear programming to Decode Binary linear codes
IEEE Transactions on Information Theory
Superposition coding for side-information channels
IEEE Transactions on Information Theory
A New Linear Programming Approach to Decoding Linear Block Codes
IEEE Transactions on Information Theory
Adaptive Methods for Linear Programming Decoding
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
In the present paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, which is referred to hereinafter as interior point decoding, is designed for linear vector channels. The linear vector channels include several practically important channels, such as inter-symbol interference channels and partial response (PR) channels. It is shown that the maximum likelihood decoding (MLD) rule for a linear vector channel can be relaxed to a convex optimization problem, which is called a relaxed MLD problem. The proposed decoding algorithm is based on a numerical optimization technique known as the interior point method with barrier functions. Approximate variations of an interior point method based on the gradient descent and Newton methods are used to solve the relaxed MLD problem. Compared with a conventional joint message-passing decoder, from computer simulations, it is observed that the proposed decoding algorithm achieves better BER performance on PR channels with less decoding complexity in several cases. Furthermore, an extension of the proposed algorithm for high-order modulation formats, such as PAM and QAM, is presented.