Computer Science – Information Theory
Scientific paper
2009-02-19
Computer Science
Information Theory
5 pages, 4 figures, to be published at ISIT 2009
Scientific paper
A novel adaptive binary decoding algorithm for LDPC codes is proposed, which reduces the decoding complexity while having a comparable or even better performance than corresponding non-adaptive alternatives. In each iteration the variable node decoders use the binary check node decoders multiple times; each single use is referred to as a sub-iteration. To process the sequences of binary messages in each iteration, the variable node decoders employ pre-computed look-up tables. These look-up tables as well as the number of sub-iterations per iteration are dynamically adapted during the decoding process based on the decoder state, represented by the mutual information between the current messages and the syndrome bits. The look-up tables and the number of sub-iterations per iteration are determined and optimized using density evolution. The performance and the complexity of the proposed adaptive decoding algorithm is exemplified by simulations.
Land Ingmar
Lechner Gottfried
Rasmussen Lars K.
No associations
LandOfFree
Adaptive Decoding of LDPC Codes with Binary Messages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Adaptive Decoding of LDPC Codes with Binary Messages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Decoding of LDPC Codes with Binary Messages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-259902