By Topic

Improved iterative decoding of LDPC codes from the IEEE WiMAX standard

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
$31 $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)
Hehn, T. ; Inst. for Inf. Transm. (LIT), Univ. of Erlangen-Nuremberg, Erlangen, Germany ; Huber, J.B. ; Laendner, S.

Multiple-bases belief-propagation is a parallel decoding setup which allows for improved decoding performance when compared to standard belief-propagation. Originally designed for decoding of high-density parity-check codes in an iterative manner, this method also shows good decoding results for well-designed low-density parity-check codes when signaling over the AWGN channel. We show the applicability of this scheme to channel codes defined in the IEEE WiMAX standard. It is challenging to find sets of well-performing parity-check matrices for these codes, all of them differing from each other. We propose an algorithm which makes use of the special structure of an underlying base matrix to accomplish this task. The results are compared to codes constructed by the progressive edge-growth algorithm and to bounds from information theory.

Published in:

Source and Channel Coding (SCC), 2010 International ITG Conference on

Date of Conference:

18-21 Jan. 2010