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

Vakilinia, Kasra; Williamson, Adam R.; Ranganathan, Sudarsan V. S.; Wesel, Richard D.

doi:10.1109/itw.2014.6970814

Cited by 10 publications

(18 citation statements)

References 7 publications

(13 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3 shows the empirical c.c.d.f. of the instantaneous rate R S = k N S at which decoding is successful for SNR-2dB BI-AWGN of [33]. This c.c.d.f.…”

Section: B Gaussian and Reciprocal-gaussian Approximationsmentioning

confidence: 92%

“…We also introduce a new VLF system that uses a stopping criterion that incorporates a cyclic redundancy check (CRC). This new system achieves better throughput performance than the schemes of [32], [33] for the example BI-AWGN channel with an SNR of 2 dB in the blocklength regime of 150 to 600 bits. For this channel, the CRC-based VLF scheme achieves about 94% of the capacity with an unlimited number m of transmissions and about 92% of the capacity with m = 10.…”

Section: Introductionmentioning

confidence: 89%

See 1 more Smart Citation

Optimizing Transmission Lengths for Limited Feedback With Nonbinary LDPC Examples

Vakilinia

Ranganathan

Wesel

2016

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

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. This approach is based on a tight normal approximation on the rate for successful decoding. Applying this approach to a variety of feedback systems using non-binary (NB) low-density parity-check (LDPC) codes shows that greater than 90% of capacity can be achieved with average blocklengths fewer than 500 transmitted bits. One result is that the performance with ten increments closely approaches the performance with an infinite number of increments. The paper focuses on binaryinput additive-white Gaussian noise (BI-AWGN) channels but also demonstrates that the normal approximation works well on examples of fading channels as well as high-SNR AWGN channels that require larger QAM constellations. The paper explores both variable-length feedback codes with termination (VLFT) and the more practical variable length feedback (VLF) codes without termination that require no assumption of noiseless transmitter confirmation. For VLF we consider both a two-phase scheme and CRC-based scheme.

show abstract

“…3 shows the empirical c.c.d.f. of the instantaneous rate R S = k N S at which decoding is successful for SNR-2dB BI-AWGN of [33]. This c.c.d.f.…”

Section: B Gaussian and Reciprocal-gaussian Approximationsmentioning

confidence: 92%

Section: Introductionmentioning

confidence: 89%

Optimizing Transmission Lengths for Limited Feedback With Nonbinary LDPC Examples

Vakilinia

Ranganathan

Wesel

2016

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Several works (e.g., [15,40]) have shown that the FER of a finite length code can be well approximated by…”

Section: Error Correctionmentioning

confidence: 99%

“…The achievable data rate (throughput) with Type-II HARQ has been upper-bounded under the assumption of unlimited single bit IR and perfect feedback [6,12] and several methods have been proposed to construct IR bits [13,14] or optimize their block lengths under a finite number of retransmissions [15,16]. However, most of these works have focused on extending idealized error correcting codes (ECC) in known channels with either infinite or single-bit feedback.…”

Section: Introductionmentioning

confidence: 99%

Optimizing HARQ and Relay Strategies in Limited Feedback Communication Systems

2020

View full text Add to dashboard Cite

One of the key challenges for future communication systems is to deal with fast changing channels due to the mobility of users. Having a robust protocol capable of handling transmission failures in unfavorable channel conditions is crucial, but the feedback capacity may be greatly limited due to strict latency requirements. This paper studies the hybrid automatic repeat request (HARQ) techniques involved in re-transmissions when decoding failures occur at the receiver and proposes a scheme that relies on codeword bundling and adaptive incremental redundancy (IR) to maximize the overall throughput in a limited feedback system. In addition to the traditional codeword extension IR bits, this paper introduces a new type of IR, bundle parity bits, obtained from an erasure code across all the codewords in a bundle. The type and number of IR bits to be sent as a response to a decoding failure is optimized through a Markov Decision Process. In addition to the single link analysis, the paper studies how the same techniques generalize to relay and multi-user broadcast systems. Simulation results show that the proposed schemes can provide a significant increase in throughput over traditional HARQ techniques.

show abstract

“…Yet, until recently, brute force searches, simulation studies, and ad-hoc schemes remained the primary means of parameter selection in terms of blocklengths and code rate for such systems, see, e.g., [8]. This situation changed when Vakilinia et al introduced a novel approach for parameter selection [9], [10]. Their proposed methodology captures the effects of the physical channel on code performance by defining an approximate empirical distribution on the probability that a rate compatible code decodes successfully at each of its available rates.…”

Section: Introductionmentioning

confidence: 99%

A Systematic Approach to Incremental Redundancy over Erasure Channels

Heidarzadeh

Chamberland

Parag

et al. 2018

2018 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

As sensing and instrumentation play an increasingly important role in systems controlled over wired and wireless networks, the need to better understand delay-sensitive communication becomes a prime issue. Along these lines, this article studies the operation of data links that employ incremental redundancy as a practical means to protect information from the effects of unreliable channels. Specifically, this work extends a powerful methodology termed sequential differential optimization to choose near-optimal block sizes for hybrid ARQ over erasure channels. In doing so, an interesting connection between random coding and well-known constants in number theory is established. Furthermore, results show that the impact of the coding strategy adopted and the propensity of the channel to erase symbols naturally decouple when analyzing throughput. Overall, block size selection is motivated by normal approximations on the probability of decoding success at every stage of the incremental transmission process. This novel perspective, which rigorously bridges hybrid ARQ and coding, offers a pragmatic means to select code rates and blocklengths for incremental redundancy.

show abstract

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

Cited by 10 publications

References 7 publications

Optimizing Transmission Lengths for Limited Feedback With Nonbinary LDPC Examples

Optimizing Transmission Lengths for Limited Feedback With Nonbinary LDPC Examples

Optimizing HARQ and Relay Strategies in Limited Feedback Communication Systems

A Systematic Approach to Incremental Redundancy over Erasure Channels

Contact Info

Product

Resources

About