Abstract
The implementation complexity of the decoder for Low-density Parity-check Codes (LDPC) is dictated by memory and interconnection requirements. In this paper, we investigate the approaches to realize Turbo Decoding Message Passing (TDMP) algorithm. We compare the performance and implementation complexity of original approach, Jacobian approach, normalized min-sum approach and offset min-sum approach which are targeted for QuasiCyclic (QC) LDPC code defined in IEEE 802.16e standard. The normalized and offset approaches are more suitable for hardware implementation, which are realized on the FPGA.
Original language | English |
---|---|
Title of host publication | ASICON 2009 - Proceedings 2009 8th IEEE International Conference on ASIC |
Pages | 501-504 |
Number of pages | 4 |
DOIs | |
Publication status | Published - 2009 |
Event | 2009 8th IEEE International Conference on ASIC, ASICON 2009 - Changsha Duration: 2009 Oct 20 → 2009 Oct 23 |
Other
Other | 2009 8th IEEE International Conference on ASIC, ASICON 2009 |
---|---|
City | Changsha |
Period | 09/10/20 → 09/10/23 |
Keywords
- LDPC
- Min-sum
- TDMP
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering