By Topic

Efficient message passing scheduling for terminated LDPC convolutional 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
$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)
Lentmaier, M. ; Dept. of Mobile Commun. Syst., Dresden Univ. of Technol. (TU Dresden), Dresden, Germany ; Prenda, M.M. ; Fettweis, G.P.

Message passing schedules that reduce the decoding complexity of terminated LDPC convolutional code ensembles are analyzed. Considering the AWGN channel, various schedules are compared by means of density evolution. The results of the analysis together with computer simulations for some (3,6)-regular codes confirm that sliding window decoding is an attractive practical solution for low-latency and low-complexity decoding.

Published in:

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Date of Conference:

July 31 2011-Aug. 5 2011