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 , 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