Skip to main navigation Skip to search Skip to main content

Resource allocation for Type-I HARQ-based wireless networks with finite-length codes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Optimal bandwidth and power allocation is performed in a wireless clustered ad hoc network (CAHN) when Type-I Hybrid Automatic Repeat reQuest (HARQ) is used at the link layer along with an Orthogonal Frequency Division Multiple Access (OFDMA) scheme under individual data rate constraint. The considered network topology imposes the resource allocation manager to know only the channel state information (CSI) statistics. Gaussian codes with a finite block length are assumed in order to give the best achievable performance, with finite latency, that one could expect from this HARQ-based CAHN. The framework developed in this paper is well adapted to predict the performance of strong channel coding over the Rayleigh channel. Typically it gives useful insights on the behavior of the proposed HARQ-based CAHN when LDPC codes are implemented.

Original languageEnglish
Title of host publication2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2013
Pages1-5
Number of pages5
DOIs
Publication statusPublished - 22 Oct 2013
Event2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2013 - Darmstadt, Germany
Duration: 16 Jun 201319 Jun 2013

Publication series

NameIEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC

Conference

Conference2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2013
Country/TerritoryGermany
CityDarmstadt
Period16/06/1319/06/13

Fingerprint

Dive into the research topics of 'Resource allocation for Type-I HARQ-based wireless networks with finite-length codes'. Together they form a unique fingerprint.

Cite this