Computer Science – Information Theory
Scientific paper
2007-05-28
Computer Science
Information Theory
18 pages, 17 figures, The paper has been submitted to IEEE Transaction on Information Theory
Scientific paper
10.1088/1742-6596/95/1/012009
In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter symbol interference channels and partial response 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 so called interior point method with barrier function. Approximate variations of the gradient descent and the Newton methods are used to solve the convex optimization problem. In a decoding process of the proposed algorithm, a search point always lies in the fundamental polytope defined based on a low-density parity-check matrix. Compared with a convectional joint message passing decoder, the proposed decoding algorithm achieves better BER performance with less complexity in the case of partial response channels in many cases.
No associations
LandOfFree
Interior Point Decoding for Linear Vector Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Interior Point Decoding for Linear Vector Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interior Point Decoding for Linear Vector Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-447908