Low-Complexity Multiple-Component Turbo Decoding Aided Hybrid ARQ
Previous research has focused on improving the throughput of Hybrid Automatic Repeat reQuest (HARQ) schemes. However, since turbo codes have been introduced into HARQ schemes, their complexity has increased owing to the iterative Bahl, Cocke, Jelinek and Raviv (BCJR) operations that are required fol...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2011-05-15.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Summary: | Previous research has focused on improving the throughput of Hybrid Automatic Repeat reQuest (HARQ) schemes. However, since turbo codes have been introduced into HARQ schemes, their complexity has increased owing to the iterative Bahl, Cocke, Jelinek and Raviv (BCJR) operations that are required following each retransmission. This paper explores the complexity of turbo HARQ schemes and proposes a new Early Stopping (ES) approach for iterative decoding based on Mutual Information (MI), which dynamically determines the appropriate number of BCJR operations to be performed following each Incremental-Redundancy (IR) transmission. We demonstrate that the proposed ES based Multiple-Component Turbo Code (MCTC) aided and systematic Twin-Component Turbo Code (TCTC) assisted HARQ schemes exhibit a 60% to 85% reduced complexity for SNRs below -2dB, without degrading the Packet Loss Ratio (PLR) and the throughput. |
|---|