Variable-length Convolutional Coding for Short Blocklengths with Decision Feedback

Abstract

This paper presents a variable-length decision-feedback scheme that uses tail-biting convolutional codes and the tail-biting Reliability-Output Viterbi Algoritm (ROVA). Comparing with recent results in finite-blocklength information theory, simulation results for both the BSC and the AWGN channel show that the decision-feedback scheme using ROVA can surpass the random-coding lower bound on throughput for feedback codes at average blocklengths less than 100 symbols. This paper explores ROVA-based decision feedback both with decoding after every symbol and with decoding limited to a small number of increments. The performance of the reliability-based stopping rule with the ROVA is compared to 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.

Accepted for publication to IEEE Transactions on Communications. 15 single-spaced, double-column pages; 8 figures; 3 tables

References in corpus (2)

• Finite Block-length Analysis of the Incremental Redundancy HARQ
• Reliability-output Decoding of Tail-biting Convolutional Codes

Cited by in corpus (6)

• Towards Massive, Ultra-Reliable, and Low-Latency Wireless Communication with Short Packets
• Variable-Length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels
• A Systematic Approach to Incremental Redundancy over Erasure Channels
• Finite-Blocklength Performance of Sequential Transmission over BSC with Noiseless Feedback
• Efficient Error-Correcting Codes in the Short Blocklength Regime
• Low-Latency Short-Packet Transmissions: Fixed Length or HARQ?