Analysis of reliability-based incremental redundancy with convolutional codes

Eugene Visotsky; Yakun Sun; Michael L Honig; Vinayak Tripathi

Analysis of reliability-based incremental redundancy with convolutional codes

Eugene Visotsky^*, Yakun Sun, Michael L Honig, Vinayak Tripathi

^*Corresponding author for this work

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

Incremental redundancy, or Hybrid type-II ARQ (HARQ), algorithms use a combination of forward error correction and retransmissions to guarantee reliable packet data communication. In our previous work [1], we have proposed an adaptive HARQ algorithm that exploits received codeword reliability for optimizing the size of the subsequent retransmissions. The optimization is based on two mappings: the codeword reliability to block error rate (BLER) mapping and the coding rate to codeword reliability mapping. In this paper, we provide analytical approximations for these mappings for any convolutional code. Through simulations, the approximations are shown to be accurate in the range of interest.

Original language	English (US)
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
State	Published - Oct 20 2004

ASJC Scopus subject areas

Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Analysis of reliability-based incremental redundancy with convolutional codes'. Together they form a unique fingerprint.

Cite this

@article{716a30ab18a74285995796de95becd33,

title = "Analysis of reliability-based incremental redundancy with convolutional codes",

abstract = "Incremental redundancy, or Hybrid type-II ARQ (HARQ), algorithms use a combination of forward error correction and retransmissions to guarantee reliable packet data communication. In our previous work [1], we have proposed an adaptive HARQ algorithm that exploits received codeword reliability for optimizing the size of the subsequent retransmissions. The optimization is based on two mappings: the codeword reliability to block error rate (BLER) mapping and the coding rate to codeword reliability mapping. In this paper, we provide analytical approximations for these mappings for any convolutional code. Through simulations, the approximations are shown to be accurate in the range of interest.",

author = "Eugene Visotsky and Yakun Sun and Honig, {Michael L} and Vinayak Tripathi",

year = "2004",

month = oct,

day = "20",

language = "English (US)",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8097",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Analysis of reliability-based incremental redundancy with convolutional codes

AU - Visotsky, Eugene

AU - Sun, Yakun

AU - Honig, Michael L

AU - Tripathi, Vinayak

PY - 2004/10/20

Y1 - 2004/10/20

N2 - Incremental redundancy, or Hybrid type-II ARQ (HARQ), algorithms use a combination of forward error correction and retransmissions to guarantee reliable packet data communication. In our previous work [1], we have proposed an adaptive HARQ algorithm that exploits received codeword reliability for optimizing the size of the subsequent retransmissions. The optimization is based on two mappings: the codeword reliability to block error rate (BLER) mapping and the coding rate to codeword reliability mapping. In this paper, we provide analytical approximations for these mappings for any convolutional code. Through simulations, the approximations are shown to be accurate in the range of interest.

AB - Incremental redundancy, or Hybrid type-II ARQ (HARQ), algorithms use a combination of forward error correction and retransmissions to guarantee reliable packet data communication. In our previous work [1], we have proposed an adaptive HARQ algorithm that exploits received codeword reliability for optimizing the size of the subsequent retransmissions. The optimization is based on two mappings: the codeword reliability to block error rate (BLER) mapping and the coding rate to codeword reliability mapping. In this paper, we provide analytical approximations for these mappings for any convolutional code. Through simulations, the approximations are shown to be accurate in the range of interest.

UR - http://www.scopus.com/inward/record.url?scp=5044242126&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=5044242126&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:5044242126

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8097

ER -