Decoding of LDPC codes with binary vector messages and scalable complexity
Files
(Published version)
Date
2008
Authors
Lechner, G.
Land, I.R.
Rasmussen, L.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
2008 5th International Symposium on Turbo Codes and Related Topics : Lausanne, 1-5 September, 2008, 2008, pp.350-355
Statement of Responsibility
Conference Name
5th International Symposium on Turbo Codes and Related Topics (1 Sep 2008 - 5 Sep 2008 : Lausanne, Switzerland)
Abstract
In this paper, an iterative decoder for LDPC codes, suitable for high-speed processing, is proposed and analyzed. The messages exchanged between the nodes are binary vectors, where the information is conveyed by the number of ones rather than their positions in the vector. Regarding this aspect, the approach exhibits some similarities to stochastic decoding techniques. The check node decoders perform simple bit-wise modulo-2 additions, whereas the variable node decoders perform more complex processing tasks, making the resulting structure attractive for high-speed hardware implementation. By selecting the length of the binary vector messages between one and infinity, the complexity and the performance of the decoder can be scaled between that of the original binary message passing algorithm and that of the sum-product algorithm. Density evolution is developed for the proposed decoding algorithm, and decoding thresholds are determined as functions of the length of the binary vector messages. Simulation results exemplify the performance for finite-length codes.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright IEEE 2008. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.