Decoding with Early Termination for Raptor Codes

TitleDecoding with Early Termination for Raptor Codes
Publication TypeJournal Article
Year of Publication2008
AuthorsAbdulhussein, A., A. Oka, and L. Lampe
JournalCommunications Letters, IEEE
Volume12
Pagination444 -446
Date Publishedjun.
ISSN1089-7798
Keywordschannel capacity, channel coding, channel condition, decoding, Raptor codes
Abstract

Rateless codes, and especially Raptor codes, have received considerable attention in the recent past due to their inherent ability to adapt to channel conditions and their capacity- approaching performance. Since decoding of rateless codes typically involves multiple decoding attempts, early termination of such attempts is mandatory for overall efficient decoding. In this letter, we propose a new decoding scheme with early termination that is particularly suited for rateless codes. Simulation results for the example of the binary symmetric channel show complexity reductions (in terms of the total required number of decoding iterations) by 87% compared to conventional message-passing decoding and 54% compared to a recently proposed incremental decoding scheme for Raptor codes.

URLhttp://dx.doi.org/10.1109/LCOMM.2008.080260
DOI10.1109/LCOMM.2008.080260

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2018 The University of British Columbia