Optimized Message Passing Schedules for LDPC Decoding

Simple item page
dc.citation.bibtexNameinproceedingsen_US
dc.citation.conferenceNameAsilomar Conference on Signals, Systems, and Computersen_US
dc.citation.firstpage591
dc.citation.lastpage595
dc.contributor.authorRadosavljevic, Predragen_US
dc.contributor.authorde Baynast, Alexandreen_US
dc.contributor.authorCavallaro, Joseph R.en_US
dc.contributor.orgCenter for Multimedia Communications (http://cmc.rice.edu/)en_US
dc.date.accessioned2007-10-31T00:58:24Z
dc.date.available2007-10-31T00:58:24Z
dc.date.issued2005-11-01
dc.date.modified2006-06-02en_US
dc.date.note2005-12-17en_US
dc.date.submitted2005-11-01en_US
dc.descriptionConference Paperen_US
dc.description.abstractThe major drawback of the LDPC codes versus the turbo-codes is their comparative low convergence speed: 25-30 iterations vs. 8-10 iterations for turbo-codes. Recently, Hocevar showed by simulations that the convergence rate of the LDPC decoder can be accelerated by exploiting a â turbo-schedulingâ applied on the bit-node messages (rows of the parity check matrix). In this paper, we show analytically that the convergence rate for this type of scheduling is about two times increased for most of the regular LDPC codes. Second we prove that â turbo-schedulingâ applied on the rows of the parity check matrix is identical belief propagation algorithm as standard message passing algorithm. Furthermore, we propose two new message passing schedules: 1) a turbo-scheduling is applied on the checknode messages (columns of the parity check matrix); 2) a hybrid version of both previous schedules where the turbo-effect is applied on both check-nodes and bit-nodes. Frame error rate simulations validate the effectiveness of the proposed schedules.en_US
dc.identifier.citationP. Radosavljevic, A. de Baynast and J. R. Cavallaro, "Optimized Message Passing Schedules for LDPC Decoding," 2005.
dc.identifier.urihttps://hdl.handle.net/1911/20208
dc.language.isoeng
dc.subjectForward Error Correction*
dc.subjectLDPC codes*
dc.subjectMessage-Passing algorithms*
dc.subjectDecoding convergence*
dc.subjectLayered Belief Propagation*
dc.subject.keywordForward Error Correctionen_US
dc.subject.keywordLDPC codesen_US
dc.subject.keywordMessage-Passing algorithmsen_US
dc.subject.keywordDecoding convergenceen_US
dc.subject.keywordLayered Belief Propagationen_US
dc.titleOptimized Message Passing Schedules for LDPC Decodingen_US
dc.typeConference paper
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Rad2005Nov5OptimizedM.PDF
Size:
280.96 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications