By Topic

Efficient Implementation of Interior Point Decoding Based on Barrier Function for LDPC Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
T. M. N. Ngatched ; Dept. of Electr. & Comput. Eng., Univ. of Manitoba, Winnipeg, MB, Canada ; Attahiru S. Alfa ; Jun Cai

In this paper, an efficient implementation of the interior point algorithm recently proposed by Wadayama [5] for linear programming (LP) decoding of low-density parity-check (LDPC) codes is presented. The main idea behind the modification is to approximate the barrier function for the fundamental polytope defining the code so that it contains only one linear constraint for each of the parity-check constraints. Simulation results show that the approximations introduced do not result in any performance degradation, while considerably reducing the decoding complexity and latency.

Published in:

2010 IEEE Wireless Communication and Networking Conference

Date of Conference:

18-21 April 2010