The University of Southampton
University of Southampton Institutional Repository

Deferred-Iteration Aided Low-Complexity Turbo Hybrid ARQ Relying on a Look-up Table

Deferred-Iteration Aided Low-Complexity Turbo Hybrid ARQ Relying on a Look-up Table
Deferred-Iteration Aided Low-Complexity Turbo Hybrid ARQ Relying on a Look-up Table
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.
Chen, Hong
0f30c1b9-7831-4010-a81c-c6825f78af16
Maunder, Robert G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Chen, Hong
0f30c1b9-7831-4010-a81c-c6825f78af16
Maunder, Robert G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Chen, Hong, Maunder, Robert G. and Hanzo, Lajos (2011) Deferred-Iteration Aided Low-Complexity Turbo Hybrid ARQ Relying on a Look-up Table At GLOBECOM 2011, United States. 05 - 09 Dec 2011.

Record type: Conference or Workshop Item (Paper)

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.

PDF PID1102306.PDF - Other
Download (208kB)

More information

Published date: December 2011
Additional Information: Event Dates: 5-9 December 2011
Venue - Dates: GLOBECOM 2011, United States, 2011-12-05 - 2011-12-09
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 272597
URI: http://eprints.soton.ac.uk/id/eprint/272597
PURE UUID: 7fdf488e-474f-4c4c-9959-81c12433c372
ORCID for Robert G. Maunder: ORCID iD orcid.org/0000-0002-7944-2615
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 26 Jul 2011 10:34
Last modified: 18 Jul 2017 06:22

Export record

Contributors

Author: Hong Chen
Author: Robert G. Maunder ORCID iD
Author: Lajos Hanzo ORCID iD

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×