Title :
Deferred-Iteration Aided Low-Complexity Turbo Hybrid ARQ Relying on a Look-Up Table
Author :
Chen, Hong ; Maunder, Robert G. ; Hanzo, Lajos
Author_Institution :
Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
Abstract :
Since the introduction of turbo code aided Hybrid Automatic Repeat reQuest (HARQ) schemes, their complexity reduction has drawn research attention. In our previous work, we proposed an Early Stopping (ES) strategy for a turbo HARQ scheme, which results in a beneficial complexity reduction, while maintaining a high throughput. However, this scheme was designed to strike a compromise across the full range of channel conditions. As a further advance, in this paper, we propose a new Deferred Iterations (DI) strategy, which is specifically designed for taking into account the prevalent channel conditions, as characterized by the Extrinsic Information Transfer (EXIT) chart tunnel opening. More specifically, the DI strategy delays the commencement of turbo decoding until an open EXIT chart tunnel appears. Our simulation results demonstrate that the complexity of the proposed DI aided turbo HARQ schemes is reduced by up to 50%, which is achieved without compromising the Packet Loss Ratio (PLR) or throughput.
Keywords :
automatic repeat request; iterative methods; table lookup; turbo codes; EXIT chart tunnel; deferred iterations strategy; extrinsic information transfer chart tunnel; hybrid automatic repeat request; look-up table; low-complexity turbo hybrid ARQ; packet loss ratio; turbo code; Complexity theory; Decoding; Fading; Iterative decoding; Systematics; Table lookup; Throughput;
Conference_Titel :
Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
Conference_Location :
Houston, TX, USA
Print_ISBN :
978-1-4244-9266-4
Electronic_ISBN :
1930-529X
DOI :
10.1109/GLOCOM.2011.6134499