ISIT 2001, IEEE International Symposium on Information Theory, June 24-29, 2001, Washington, USA
The throughput performance of an incremental-redundancy ARQ scheme based on simple convolutional codes of rate 1/M is evaluated for the block-fading Gaussian collision channel. The performance of these codes is seen to get close to the limiting performance of binary random codes with typical set decoding.
Type:
Conference
City:
Washington
Date:
2001-06-24
Department:
Communication systems
Eurecom Ref:
1017
Copyright:
© 2001 IEEE. 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.
See also:
