Low-complexity decoding of LDPC codes

The offset BP-based algorithm is a reduced-complexity derivative of the belief-propagation algorithm for decoding of low-density parity-check codes. It uses a constant offset term to simplify decoding, but at the cost of performance. A method to obtain a 'variable' offset parameter is pres...

Full description

Saved in:
Bibliographic Details
Published inElectronics letters Vol. 43; no. 18; p. 1
Main Authors Pandya, N, Honary, B
Format Journal Article
LanguageEnglish
Published Stevenage John Wiley & Sons, Inc 31.08.2007
Subjects
Algorithms
Constants
Decoding
Derivatives
Error correcting codes
Offsets
Performance enhancement
Online AccessGet full text
ISSN0013-5194
1350-911X

Cover

More Information
Summary:The offset BP-based algorithm is a reduced-complexity derivative of the belief-propagation algorithm for decoding of low-density parity-check codes. It uses a constant offset term to simplify decoding, but at the cost of performance. A method to obtain a 'variable' offset parameter is presented in this paper to improve the performance of the algorithm.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0013-5194
1350-911X