Hybrid-ARQ-aided short fountain codes designed for block-fading channels

Abstract

As a benefit of their inherent rateless nature, fountain codes constitute a favourable choice for protecting packetbased transmissions in the physical layer for wireless channels having varying quality. However, previous research revealed that the performance of fountain codes substantially degrades, as their block-length is reduced. Three structural phenomena of the Tanner graph were identified by Mackay in the hard decoding of fountain codes on Binary Erasure Channels (BECs) [1], which may be referred to as having ‘no degree-one check nodes’, ‘no emerging degree-one check nodes’ and ‘uncovered variable nodes’. In this paper, we explicitly analyzed how these structural phenomena influence their soft decoding algorithm. Furthermore, these phenomena are shown to be responsible for the high error floors, when fountain codes are transmitted over noisy fading channels, especially for the transmissions of short blocks. In order to eliminate the influence of these structural phenomena, we conceived a technique of generating a few specifically encoded bits, with the aid of the associated Tanner graph. Simulation results have demonstrated that our improved Raptor codes significantly reduce the Packet Loss Ratio (PLR) of conventional fountain codes, despite imposing a reduced low complexity. Finally, we conceive a novel adaptive Hybrid Automatic Repeat reQuest (HARQ) scheme based on a Look-Up Table (LUT) aided technique, which may adapt its coding rate for each transmission. Our simulation results demonstrated that the proposed IRaptor HARQ achieves a similar performance to the Long Term Evolution (LTE) turbo coded HARQ scheme, or even outperforms the LTE arrangement for block-length in excess of 1000 bits.

More information

Identifiers

ORCID for Robert G. Maunder: orcid.org/0000-0002-7944-2615

ORCID for Lajos Hanzo: orcid.org/0000-0002-2636-5214

Catalogue record

Export record

Altmetrics