On Turbo-Schedules for LDPC Decoding

Simple item page
dc.citation.bibtexNamearticleen_US
dc.citation.journalTitleIEEE Communications Lettersen_US
dc.contributor.authorde Baynast, Alexandreen_US
dc.contributor.authorRadosavljevic, Predragen_US
dc.contributor.authorSabharwal, Ashutoshen_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:42:04Zen_US
dc.date.available2007-10-31T00:42:04Zen_US
dc.date.issued2006-05-01en_US
dc.date.modified2006-06-02en_US
dc.date.submitted2006-06-02en_US
dc.descriptionJournal Paperen_US
dc.description.abstractThe 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.en_US
dc.identifier.citationA. de Baynast, P. Radosavljevic, A. Sabharwal and J. R. Cavallaro, "On Turbo-Schedules for LDPC Decoding," <i>IEEE Communications Letters,</i> 2006.en_US
dc.identifier.urihttps://hdl.handle.net/1911/19842en_US
dc.language.isoengen_US
dc.titleOn Turbo-Schedules for LDPC Decodingen_US
dc.typeJournal articleen_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
deB2006May1OnTurboSch.PDF
Size:
75.41 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications