Variable-Length Convolutional Coding for Short Blocklengths With Decision Feedback
Authors:
Open Access
- 4 May 2015
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 63 (7) , 2389-2403
Abstract
This paper presents a variable-length decision-feedback coding scheme that achieves high rates at short blocklengths. This scheme uses the reliability-output Viterbi algorithm (ROVA) to determine when the receiver's decoding estimate satisfies a given error constraint. We evaluate the performance of both terminated and tail-biting convolutional codes at average blocklengths less than 300 symbols, using the ROVA and the tail-biting ROVA, respectively. Comparing with recent results from finite-blocklength information theory, simulations for both the BSC and the AWGN channel show that the reliability-based decision-feedback scheme can surpass the random-coding lower bound on throughput for feedback codes at some blocklengths less than 100 symbols. This is true both when decoding after every symbol is permitted and when decoding is limited to a small number of increments. Finally, the performance of the reliability-based stopping rule with the ROVA is compared with retransmission decisions based on CRCs. For short blocklengths where the latency overhead of the CRC bits is severe, the ROVA-based approach delivers superior rates.Keywords
All Related Versions
Funding Information
- National Science Foundation (1162501)
This publication has 53 references indexed in Scilit:
- Reliability-based hybrid ARQElectronics Letters, 2002
- A reliability output Viterbi algorithm with applications to hybrid ARQIEEE Transactions on Information Theory, 1998
- Tailbiting MAP decodersIEEE Journal on Selected Areas in Communications, 1998
- Decision depths of convolutional codesIEEE Transactions on Information Theory, 1989
- Viterbi decoding algorithm for convolutional codes with repeat requestIEEE Transactions on Information Theory, 1980
- An adaptive-feedback coding scheme using incremental redundancy (Corresp.)IEEE Transactions on Information Theory, 1974
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974
- Exponential error bounds for erasure, list, and decision feedback schemesIEEE Transactions on Information Theory, 1968
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956
- Theory of information feedback systemsIEEE Transactions on Information Theory, 1956