On Turbo-Schedules for LDPC Decoding

Abstract

The convergence rate of LDPC decoding is comparatively slower than turbo code decoding: 25 LDPC iterations versus 8-10 iterations for turbo codes. Recently, Mansour proposed a Ć¢ turbo-scheduleĆ¢ to improve the convergence rate of LDPC decoders. In this letter, we first extend the turbo-scheduling principle to the check messages. Second, we show analytically that the convergence rate of both turbo-schedules is about twice as fast as the standard message passing algorithm for most LDPC codes.

Description
Journal Paper
Advisor
Degree
Type
Journal article
Keywords
Citation

A. de Baynast, P. Radosavljevic, A. Sabharwal and J. R. Cavallaro, "On Turbo-Schedules for LDPC Decoding," IEEE Communications Letters, 2006.

Has part(s)
Forms part of
Published Version
Rights
Link to license
Citable link to this page
Collections