Rate-compatible punctured convolutional codes (RCPC codes) and their applications
- 1 April 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 36 (4), 389-400
- https://doi.org/10.1109/26.2763
Abstract
The concept of punctured convolutional codes is extended by punctuating a low-rate 1/N code periodically with period P to obtain a family of codes with rate P/(P+l), where l can be varied between 1 and (N-1)P. A rate-compatibility restriction on the puncturing tables ensures that all code bits of high rate codes are used by the lower-rate codes. This allows transmission of incremental redundancy in ARQ/FEC (automatic repeat request/forward error correction) schemes and continuous rate variation to change from low to high error protection within a data frame. Families of RCPC codes with rates between 8/9 and 1/4 are given for memories M from 3 to 6 (8 to 64 trellis states) together with the relevant distance spectra. These codes are almost as good as the best known general convolutional codes of the respective rates. It is shown that the same Viterbi decoder can be used for all RCPC codes of the same M. the application of RCPC codes to hybrid ARQ/FEC schemes is discussed for Gaussian and Rayleigh fading channels using channel-state information to optimise throughput. >Keywords
This publication has 17 references indexed in Scilit:
- A sub-band coder designed for combined source and channel coding (speech coding)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A New Error Control Scheme for Hybrid ARQ SystemsIEEE Transactions on Communications, 1987
- Forward Error Correction Coding for Fading Compensation in Mobile Satellite ChannelsIEEE Journal on Selected Areas in Communications, 1987
- Application of Code Combining to a Selective-Repeat ARQ LinkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Code Combining--A Maximum-Likelihood Decoding Approach for Combining an Arbitrary Number of Noisy PacketsIEEE Transactions on Communications, 1985
- Efficient Selective Repeat ARQ Strategies for Very Noisy and Fluctuating ChannelsIEEE Transactions on Communications, 1985
- Automatic-repeat-request error-control schemesIEEE Communications Magazine, 1984
- Some periodic convolutional codes better than any fixed code (Corresp.)IEEE Transactions on Information Theory, 1983
- New short constraint length convolutional code constructions for selected rational rates (Corresp.)IEEE Transactions on Information Theory, 1982
- Punctured convolutional codes of rate(n-1)/nand simplified maximum likelihood decoding (Corresp.)IEEE Transactions on Information Theory, 1979