A New Method to Decode Low Density Parity Check Codes
Open Access DepositedOf the two major decoding schemes applicable to LDPC codes, soft decision decoders such as Sum Product Algorithm (SPA) have superior error performance. However, their superior performance is achieved provided that large number of decoding iterations are performed, and extremely large block codes are generated to approach channel capacity, both of which adds to complexity of the decoding scheme. On the other hand, other decoding schemes such as hard decision bit flipping algorithms are less complex, but their error performances are inferior to soft decision decoders. Extensive research has been performed in two fronts to 1) reduce the complexity of soft decision decoders, and at the same time, improve the error performance of hard decision decoders. The problem persists simply because efforts to reduce complexity of soft decision decoders inevitably degrades the error performance. Conversely, efforts to improve error performance of hard decision decoders introduce additional computational complexity. A two-stage hybrid soft/hard decoding model has been proposed here that offers better error performance than each individual decoder while maintaining low computational complexity and low processing delay. Stage 1 of the hybrid decoder consists of a SPA decoder with modified Log Likelihood Ratio (LLR) in which computational complexity of Extrinsic Information equation has been reduced. Stage 2 of the hybrid decoder consists of a modified BF algorithm based on Gradient Decent optimization process that has been optimized for decoding over Rayleigh fading channel.
- All rights reserved
Notice to Authors
If you are the author of this work and you have any questions about the information on this page, please use the Contact form to get in touch with us.
| Thumbnail | Title | Date Uploaded | Visibility | Actions |
|---|---|---|---|---|
|
|
Biazaran_gwu_0075A_16825.pdf | 2024-10-02 | Open Access |
|