• Corpus ID: 236562

Feedback Communication Systems with Limitations on Incremental Redundancy

@article{Chen2013FeedbackCS,
title={Feedback Communication Systems with Limitations on Incremental Redundancy},
author={Tsung-Yi Chen and Adam R. Williamson and Nambi Seshadri and Richard D. Wesel},
journal={ArXiv},
year={2013},
volume={abs/1309.0707}
}
• Published 3 September 2013
• Computer Science
• ArXiv
This paper explores feedback systems using incremental redundancy (IR) with noiseless transmitter confirmation (NTC). For IR-NTC systems based on {\em finite-length} codes (with blocklength $N$) and decoding attempts only at {\em certain specified decoding times}, this paper presents the asymptotic expansion achieved by random coding, provides rate-compatible sphere-packing (RCSP) performance approximations, and presents simulation results of tail-biting convolutional codes. The information…
17 Citations

Figures and Tables from this paper

Achieving Low-Latency Communication with Feedback: from Information Theory to System Design

This dissertation studies the asymptotic expansion achieved by random coding, provides rate-compatible sphere-packing (RCSP) performance approximations, and presents simulation results of tail-biting convolutional codes.

Optimizing Transmission Lengths for Limited Feedback With Nonbinary LDPC Examples

• Computer Science
IEEE Transactions on Communications
• 2016
This paper presents a general approach for optimizing the number of symbols in increments (packets of incremental redundancy) in a feedback communication system with a limited number of increments and demonstrates that the normal approximation works well on examples of fading channels as well as high-SNR AWGN channels that require larger QAM constellations.

Reliability-output Decoding and Low-latency Variable-length Coding Schemes for Communication with Feedback

It is demonstrated that tail-biting convolutional codes can deliver rates surpassing the random-coding lower bound at blocklengths less than 100 symbols, and the energy efficiency of variable-length feedback codes compared to that of fixed-length block codes without feedback is investigated.

Feedback systems using non-binary LDPC codes with a limited number of transmissions

• Computer Science
2014 IEEE Information Theory Workshop (ITW 2014)
• 2014
This paper optimizes the size of each incremental transmission for non-binary (NB) LDPC codes to maximize throughput in VLFT and two-phase VLF settings, using an approximation based on the inverse-Gaussian p.d.f. of the blocklength required for successful decoding.

Short-blocklength non-binary LDPC codes with feedback-dependent incremental transmissions

• Computer Science
2014 IEEE International Symposium on Information Theory
• 2014
This paper presents a communication system with feedback that uses carefully designed non-binary LDPC codes and incremental transmissions to achieve 92-94% of the idealized throughput of rate-compatible sphere-packing with maximum-likelihood decoding (RCSP-ML) for average blocklengths of 150-450 bits.

Variable-Length Convolutional Coding for Short Blocklengths With Decision Feedback

• Computer Science
IEEE Transactions on Communications
• 2015
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.

Asymptotic expansion and error exponent for two-phase feedback codes on DMCs

• Computer Science
2014 IEEE International Symposium on Information Theory
• 2014
This paper shows that a two-phase coding scheme where each phase uses an IR scheme achieves the optimal error-exponent while maintaining an expansion on the message size that yields the O(log ℓ) back-off.

Coding Schemes to Approach Capacity in Short Blocklength with Feedback and LDPC Coding for Flash Memory

An extension of reciprocal channel approximation (RCA) is used to accurately and effi- ciently predict the frame error rate (FER) performance of polar codes by analyzing the probability density function (p.d.f.) of the log-likelihood ratio (LLR) values associated with information bits.

Asymptotic Expansion and Error Exponent of Two-Phase Variable-Length Coding with Feedback for Discrete Memoryless Channels

• Computer Science
• 2014
This paper shows that a two-phase coding scheme where each phase uses an IR scheme achieves the optimal error-exponent while maintaining an expansion on the message size that yields the O(log l) back-off.

Fixed Error Asymptotics For Erasure and List Decoding

• Computer Science
• 2014
The direct parts of the coding theorems leverage on the simple threshold decoder and converses are proved using variants of the hypothesis testing converse.

References

SHOWING 1-10 OF 45 REFERENCES

A rate-compatible sphere-packing analysis of feedback coding with limited retransmissions

• Computer Science
2012 IEEE International Symposium on Information Theory Proceedings
• 2012
Chen's rate-compatible sphere-packing analysis is used to study what happens when symbols must be transmitted in packets, as with a traditional hybrid ARQ system, and limited to relatively few (six or fewer) incremental transmissions.

A Sphere-Packing Analysis of Incremental Redundancy with Feedback

• Computer Science
2011 IEEE International Conference on Communications (ICC)
• 2011
A code-independent analysis that quantifies the latency benefits possible by using modified incremental redundancy with feedback (MIRF) and a sphere-packing analysis yields the throughput vs. latency performance of both a baseline ACK/NACK scheme and MIRF.

Feedback in the Non-Asymptotic Regime

• Computer Science
IEEE Transactions on Information Theory
• 2011
Novel achievability bounds are used to demonstrate that in the non-asymptotic regime, the maximal achievable rate improves dramatically thanks to variable-length coding and feedback, and practically all the advantages of noiseless feedback are shown to be achievable.

Error Exponents for Variable-Length Block Codes With Feedback and Cost Constraints

• Computer Science
IEEE Transactions on Information Theory
• 2008
Variable-length block-coding schemes are investigated for discrete memoryless channels with ideal feedback under cost constraints and the resulting reliability function,limtaurarrinfin(-In Pe,min)/tau as a function of R and V, is concave and generalizes the linear reliability function of Burnashev to include cost constraints.

Code Combining - A Maximum-Likelihood Decoding Approach for Combining an Arbitrary Number of Noisy Packets

• D. Chase
• Computer Science
IEEE Transactions on Communications
• 1985
The receiver adapts to the actual jammer-to-signal(J/S)ratio which is critical when the level of interference is not known a priori, and optimizes the code rate and minimizes the delay required to decode a given packet.

A coding scheme for additive noise channels with feedback-II: Band-limited signals

This paper extends the scheme for effectively exploiting a noiseless feedback link associated with an additive white Gaussian noise channel to a band-limited channel with signal bandwidth restricted to (- W, W) and achieves the well-known channel capacity.

On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes

• Computer Science
IEEE Trans. Commun.
• 2000
The proposed RCPT-ARQ system combines the performance of turbo codes with the frugal use of incremental redundancy inherent in the rate compatible punctured convolutional codes of Hagenauer (1988) to achieve enhanced throughput performance over a nonstationary Gaussian channel.

A coding scheme for additive noise channels with feedback-I: No bandwidth constraint

• Computer Science
IEEE Trans. Inf. Theory
• 1966
This paper presents a coding scheme that exploits the feedback to achieve considerable reductions in coding and decoding complexity and delay over what would be needed for comparable performance with the best known (simplex) codes for the one-way channel.

Is feedback a performance equalizer of classic and modern codes?

• Computer Science
2010 Information Theory and Applications Workshop (ITA)
• 2010
Results seem to indicate that feedback largely equalizes the performance of classic (convolutional) codes and modern (turbo, LDPC) codes.