Fountain Codes With Nonuniform Selection Distributions Through Feedback

Hashemi, Morteza; Cassuto, Yuval; Trachtenberg, Ari

doi:10.1109/tit.2016.2570232

Cited by 27 publications

(16 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rateless codes have generated a lot of interest as a promising forward error correction (FEC) technique [2]. Being able to adapt both the code construction and the number of parity symbols to time-varying channel conditions [3], [4], rateless codes hold the potential for achieving the capacity with relatively short delays compared to fixed-rate codes, which have fixed code construction and codeword length. Since rateless codes are able to transmit information adaptive Part of this work will be presented at GLOBECOM16 [1].…”

Section: A Motivationmentioning

confidence: 99%

“…With mmWave technology in the pipeline and higher processing speeds, the value of L will be getting smaller. 3 For simplicity, we assume a flat fading channel in the paper, yet the concepts and results apply to OFDM transmission over frequency selective fading, common in cellular downlink. to 1 and then N becomes the maximum number of decoding attempts.…”

Section: System Modelmentioning

confidence: 99%

See 1 more Smart Citation

Enhanced Cellular Coverage and Throughput Using Rateless Codes

Rajanna

Haenggi

2017

IEEE Trans. Commun.

View full text Add to dashboard Cite

Rateless codes have been shown to provide robust error correction over a wide range of binary and noisy channels. Using a stochastic geometry model, this paper studies the performance of rateless codes in the cellular downlink and compares it with the performance of fixed-rate codes. For the case of Rayleigh fading, an accurate approximation is proposed for the distribution of the packet transmission time of K-bit information packets using rateless codes. The two types of channel coding schemes are compared by evaluating the typical user and per-user success probability and the rate. Based on both the analytical results and simulations, the paper shows that rateless coding provides a significant throughput gain relative to fixed-rate coding. Moreover the benefit is not restricted to the typical user but applies to all users in the cellular network.

show abstract

Section: A Motivationmentioning

confidence: 99%

Section: System Modelmentioning

confidence: 99%

Enhanced Cellular Coverage and Throughput Using Rateless Codes

Rajanna

Haenggi

2017

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…Hagedorn et al [16] modified the robust soliton distribution of the LT codes. Hashemi et al [17] proposed a protocol with the distance-type feedback messages to select input symbols no uniformly.…”

Section: A Delayed Data Collection Protocolsmentioning

confidence: 99%

Wireless Multiple Access Network With a Sectional Configured Data Collection System and Codeword Filtering Mechanism

Zhang

Ren

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Swarm robotics is an approach to collective robotics with which it is easily possible to complete the tasks that are difficult to do with single robot. The wireless multiple access network contributes significantly in wireless mobile swarm robotics for communication and networking, especially in disaster scenarios. Since the unpredictable impacts may fail the sensing robots or nodes, causing the loss of valuable data, a coding scheme called the Growth codes is designed to increase data persistence. In the wireless multiple access network, a key requirement of data collection in disaster scenarios is to maintain a high data intermediate recovery rate. In the later period of the Growth codes, the large amount of redundant data in the network affects the efficiency of data collection. In this paper, we design and analyze techniques to reduce the number of redundant data, and propose a sectional configured data collection strategy based on the Growth codes, called the SCGC protocol. Setting cache nodes around the sink to filter the redundant codewords, the sink can collect data faster, ensuring a high data intermediate recovery rate. We also design an information update strategy and some constraints to control node overhead. Through the simulations, we show that the proportion of redundant codewords can be reduced by 10-15%, while the negative impact of these valid codewords is not considered in the Growth codes. We also show that the SCGC protocol can improve the data recovery efficiency without affecting the stability of the network or shortening the network lifetime.

show abstract

“…The goal is to minimise the unreleased probabilities and improve intermediate decoding performance. The authors in [23] proposed feedback‐based fountain codes with dynamically adjusted non‐uniform selection distributions. According to the decoding process, more helpful input symbols are assigned with higher probabilities to be selected in future encodings.…”

Section: Introductionmentioning

confidence: 99%