# Interior Point Decoding for Linear Vector Channels

@article{Wadayama2007InteriorPD, title={Interior Point Decoding for Linear Vector Channels}, author={Tadashi Wadayama}, journal={ArXiv}, year={2007}, volume={abs/0705.3990} }

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…

## 9 Citations

### Interior Point Decoding for Linear Vector Channels Based on Convex Optimization

- Computer ScienceIEEE Transactions on Information Theory
- 2010

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.

### Hybrid Decoding of LDPC Codes Based on Interior Point Method

- Computer Science2010 IEEE International Conference on Communications
- 2010

A hybrid decoding algorithm for finite-geometry low-density parity-check (FG-LDPC) codes is proposed, based on the interior point method with barrier function introduced by Wadayama, which achieves better bit- error rate (BER) and frame-error rate (FER) for small block lengths at medium to high signal-to-noise ratio (SNR).

### Hybrid Linear Programming Based Decoding Algorithm for LDPC Codes

- Computer ScienceIEEE Transactions on Communications
- 2011

A hybrid decoding algorithm for low-density parity-check (LDPC) codes based on the interior point method with barrier function for linear programming (LP) decoding introduced by Wadayama is presented.

### An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels

- Computer Science2011 IEEE International Conference on Communications (ICC)
- 2011

The intent was to find an algorithm very similar to BCJR-based turbo equalization (TE) and it seems that the search has succeeded and the result is an iterative solver for the joint decoding LP whose complexity is similar to TE but whose performance isSimilar to joint LP decoding.

### On the joint decoding of LDPC codes and finite-state channels via linear programming

- Computer ScienceISIT
- 2010

A rigorous definition of LP joint-decoding pseudo-codewords (JD-PCWs) is provided that enables evaluation of the pairwise error probability between codewords and JD-PCW, which leads naturally to a provable upper bound on decoder failure probability.

### Joint Decoding of LDPC Codes and Finite-State Channels Via Linear-Programming

- Computer ScienceIEEE Journal of Selected Topics in Signal Processing
- 2010

This paper provides a rigorous definition of LP joint-decoding pseudo-codewords (JD-PCWs) that enables evaluation of the pairwise error probability between codewords and JD-PCW in AWGN and develops an efficient iterative solver for the joint LP decoder.

### LDPC-coded transmission system for lossless compressed hyperspectral image over Rayleigh channel

- Computer SciencePhotoelectronic Detection and Imaging
- 2011

An efficient algorithm called infeasible primal-dual interior-point (IPDIP) algorithm for solving LP problem with predictor-corrector technique is presented, which can reconstruct the hyperspectral image completely with higher compression ratio than JPEG-LS's.

### A Unified Framework for Linear-Programming Based Communication Receivers

- Computer ScienceIEEE Transactions on Communications
- 2011

It is demonstrated how the LP design technique may be applied to the problem of joint equalization and decoding of coded transmissions over a frequency selective channel, and a simulation-based analysis of the error events of the resulting LP receiver is provided.

### Interior-point algorithms for linear-programming decoding

- Computer Science, Mathematics2008 Information Theory and Applications Workshop
- 2008

This paper studies efficient implementations of interior-point algorithms for solving the linear program that appears in the linear-programming decoder formulation.

## References

SHOWING 1-10 OF 33 REFERENCES

### Decoding error-correcting codes via linear programming

- Computer Science
- 2003

This thesis investigates the application of linear programming (LP) relaxation to the problem of decoding an error-correcting code, and provides specific LP decoders for two major families of codes: turbo codes and low-density parity-check codes.

### Joint message-passing decoding of LDPC Codes and partial-response channels

- Computer ScienceIEEE Trans. Inf. Theory
- 2002

A single message-passing detector/decoder matched to the combination of a partial-response channel and an LDPC code is investigated and it is well known that low-density parity-check (LDPC) codes can be decoded using a message-Passing algorithm.

### Low-density parity-check codes

- Computer ScienceIRE Trans. Inf. Theory
- 1962

A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.

### Equalization on Graphs: Linear Programming and Message Passing

- Computer Science2007 IEEE International Symposium on Information Theory
- 2007

It is shown that, for a certain class of channels and in the absence of coding, the proposed technique provides the exact ML solution without an exponential complexity in the size of channel memory, while for some other channels, this method has a non-diminishing probability of failure as SNR increases.

### Density evolution for two improved BP-Based decoding algorithms of LDPC codes

- Computer ScienceIEEE Communications Letters
- 2002

The numerical calculations show that with one properly chosen parameter for each of these two improved BP-based algorithms, performances very close to that of the BP algorithm can be achieved.

### Unified design of iterative receivers using factor graphs

- Computer ScienceIEEE Trans. Inf. Theory
- 2001

A unified approach based on factor graphs for deriving iterative message-passing receiver algorithms for channel estimation and decoding, and Canonical distributions provide a new, general framework for handling continuous variables.

### Turbo decoding of Gilbert-Elliot channels

- Computer ScienceIEEE Trans. Commun.
- 2002

This work describes parallel concatenated codes for communication over finite-state binary Markov channels and introduces a joint estimation/decoding method that allows the estimation of the parameters of the hidden Markov model when they are not known a priori.

### Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)

- Computer ScienceIEEE Trans. Inf. Theory
- 1974

The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered and an optimal decoding algorithm is derived.

### Encyclopedia of Sparse Graph Codes

- Computer Science
- 1999

Evaluation of Gallager codes for low error tolerance, short block length and high rate applications, comparing in particular the codes' block error rates with an emphasis on undetected versus detected errors.

### Interior-point algorithms for linear-programming decoding

- Computer Science, Mathematics2008 Information Theory and Applications Workshop
- 2008

This paper studies efficient implementations of interior-point algorithms for solving the linear program that appears in the linear-programming decoder formulation.