Literature Database Entry

soijanin2006punctured


E. Soijanin, N. Varnica and P. Whiting, "Punctured vs Rateless Codes for Hybrid ARQ," Proceedings of IEEE Information Theory Workshop (ITW 2006), Punta del Este, Uruguay, March 2006, pp. 155-159.

Abstract

Two incremental redundancy hybrid ARQ (IR-HARQ) schemes are compared: one is based on LDPC code ensembles with random transmission assignments, the other is based on recently introduced Raptor codes. A number of important issues, such as rate and power control, and error rate performance after each transmission on time varying binary-input, symmetric-output channels are addressed by analyzing performance of LDPC and Raptor codes on parallel channels. The theoretical results obtained for random code ensembles are tested on several practical code examples by simulation. Both theoretical and simulation results show that both LDPC and Raptor codes are suitable for HARQ schemes. Which codes would make a better choice depends mainly on the width of the signal-to-noise operating range of the HARQ scheme, prior knowledge of that range, and other design parameters and constraints dictated by standards.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

E. Soijanin
N. Varnica
P. Whiting

BibTeX reference

@inproceedings{soijanin2006punctured,
    address = {Punta del Este, Uruguay},
    author = {Soijanin, E. and Varnica, N. and Whiting, P.},
    booktitle = {IEEE Information Theory Workshop (ITW 2006)},
    doi = {10.1109/ITW.2006.1633801},
    month = {3},
    pages = {155-159},
    publisher = {IEEE},
    title = {{Punctured vs Rateless Codes for Hybrid ARQ}},
    year = {2006},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.