This paper studies the problem of Raptor-code design for binary-input AWGN (BIAWGN) channels using the mean-LLR-EXIT chart approach presented. We report that there exist situations where such a design approach may fail or fail to produce capacity-achieving codes, for certain ranges of channel SNR. Suggestions and discussions are provided pertaining to the design of Raptor codes for BIAWGN channels using the mean-LLR-EXIT chart.

This paper studies the problem of Raptor-code design for binary-input AWGN (BIAWGN) channels using the mean-LLR-EXIT chart approach presented in [1]. We report that there exist situations where such a design approach may fail or fail to produce capacity-achieving codes, for certain ranges of channel SNR. Suggestions and discussions are provided pertaining to the design of Raptor codes for BIAWGN channels using the mean-LLR-EXIT chart.

We propose a novel coding framework for wireless relay channels based on rateless codes, which allows for a natural extension to multiple antenna and multiple relay settings. The relaying protocol is half-duplex, and relays independently choose when to collaborate, if at all. With a simulated fountain code based implementation of this framework, we show that the use of rateless codes is both robust and efficient when the channel state information is not available at the transmitters

Fountain codes are a universal class of rateless codes originally designed for erasure channels. Naturally adapting to channel states without channel knowledge at the transmitter, fountain codes have recently been demonstrated also as an appealing solution for communication over fading channels. However, their relatively high decoding complexity limits their practical use in a wireless setting. In this paper, we present a simple modification of the decoding algorithm for Raptor codes - a type of fountain codes - over fading channels, where the complexity is significantly reduced without sacrifice of performance.

We explore the use of rateless coding for communication over fading channels with delay constraints. Both quasi-static fading and block-fading channels are considered. When only the receiver has channel information, we show there exist rateless codes that are both reliable and efficient for every channel realization of such channels. We then apply these codes to a wireless streaming application with a sequence of playback deadlines. Rateless strategies demonstrate benefits in terms of throughput and outage probability compared to fixed-rate schemes

We propose a novel coding framework for wireless relay channels based on rateless codes. With a concrete Fountain-code implementation of this framework, we show that rateless codes are both robust and efficient when the channel state information is not available at the transmitters