Optimum ARQ design: A dynamic programming approach

Eugene Visotsky; Vinayak Tripathi; Michael Honig

doi:10.1109/isit.2003.1228468

Optimum ARQ design: A dynamic programming approach

Eugene Visotsky^*, Vinayak Tripathi, Michael Honig

^*Corresponding author for this work

Electrical and Computer Engineering

Research output: Contribution to journal › Conference article › peer-review

20 Scopus citations

Abstract

We view a hybrid ARQ scheme as an incremental accumulation of redundancy at the receiver. A hybrid ARQ design problem is formulated as a research for the sequence of redundancies maximizing throughput or minimizing delay. The optimization is performed within the framework of a Markov decision process. The state space is defined as the total accumulated redundancy at the receiver. The transition probabilities model the error-correcting capability of the code and properties of the channel. Employing a dynamic programming approach, the optimum sequence of redundancies is characterized.

Original language	English (US)
Pages (from-to)	451
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
DOIs	https://doi.org/10.1109/isit.2003.1228468
State	Published - 2003
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Applied Mathematics
Modeling and Simulation

Access to Document

10.1109/isit.2003.1228468

Cite this

@article{e29cec47d0eb41ad94f11dfaecfd612a,

title = "Optimum ARQ design: A dynamic programming approach",

abstract = "We view a hybrid ARQ scheme as an incremental accumulation of redundancy at the receiver. A hybrid ARQ design problem is formulated as a research for the sequence of redundancies maximizing throughput or minimizing delay. The optimization is performed within the framework of a Markov decision process. The state space is defined as the total accumulated redundancy at the receiver. The transition probabilities model the error-correcting capability of the code and properties of the channel. Employing a dynamic programming approach, the optimum sequence of redundancies is characterized.",

author = "Eugene Visotsky and Vinayak Tripathi and Michael Honig",

year = "2003",

doi = "10.1109/isit.2003.1228468",

language = "English (US)",

pages = "451",

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

issn = "2157-8096",

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

note = "Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) ; Conference date: 29-06-2003 Through 04-07-2003",

}

TY - JOUR

T1 - Optimum ARQ design

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

AU - Visotsky, Eugene

AU - Tripathi, Vinayak

AU - Honig, Michael

PY - 2003

Y1 - 2003

N2 - We view a hybrid ARQ scheme as an incremental accumulation of redundancy at the receiver. A hybrid ARQ design problem is formulated as a research for the sequence of redundancies maximizing throughput or minimizing delay. The optimization is performed within the framework of a Markov decision process. The state space is defined as the total accumulated redundancy at the receiver. The transition probabilities model the error-correcting capability of the code and properties of the channel. Employing a dynamic programming approach, the optimum sequence of redundancies is characterized.

AB - We view a hybrid ARQ scheme as an incremental accumulation of redundancy at the receiver. A hybrid ARQ design problem is formulated as a research for the sequence of redundancies maximizing throughput or minimizing delay. The optimization is performed within the framework of a Markov decision process. The state space is defined as the total accumulated redundancy at the receiver. The transition probabilities model the error-correcting capability of the code and properties of the channel. Employing a dynamic programming approach, the optimum sequence of redundancies is characterized.

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

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

U2 - 10.1109/isit.2003.1228468

DO - 10.1109/isit.2003.1228468

M3 - Conference article

AN - SCOPUS:0141938570

SN - 2157-8096

SP - 451

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

Y2 - 29 June 2003 through 4 July 2003

ER -

Optimum ARQ design: A dynamic programming approach

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this