Raptor codes for reliable download delivery in wireless broadcast systems

Luby, Michael; Watson, Mark A.; Gasiba, Tiago Espinha; Stockhammer, Thomas; Xu, Wen

doi:10.1109/ccnc.2006.1593014

Cited by 139 publications

(85 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The description of each step and the details on specific parameters can be found in (3GPP, 2008a). The study presented in (Luby et al, 2006) shows that Raptor codes have a performance very close to ideal, i.e., the failure probability of the code is such that in case that only slightly more than k encoding symbols are received, the code can recover the source block. In fact, for k > 200 the small inefficiency of the Raptor code can accurately be modelled by the following equation (Luby et al, 2007):…”

Section: Application Layer Fecmentioning

confidence: 99%

See 1 more Smart Citation

Forward Error Correction for Reliable e-MBMS Transmissions in LTE Networks

Alexiou¹,

Bouras²,

Kokkinos³

et al. 2011

Cellular Networks - Positioning, Performance Analysis, Reliability

View full text Add to dashboard Cite

Wireless cellular networks are an integral part of modern telecommunication systems. Today it is hard to imagine our life without the use of such networks. Nevertheless, the development, implementation and operation of these networks require engineers and scientists to address a number of interrelated problems. Among them are the problem of choosing the proper geometric shape and dimensions of cells based on geographical location, finding the optimal location of cell base station, selection the scheme dividing the total net bandwidth between its cells, organization of the handover of a call between cells, information security and network reliability, and many others. The book focuses on three types of problems from the above listPositioning, Performance Analysis and Reliability. It contains three sections. The Section 1 is devoted to problems of Positioning and contains five chapters. The Section 2 contains eight Chapters which are devoted to quality of service (QoS) metrics analysis of wireless cellular networks. The Section 3 contains two Chapters and deal with reliability issues of wireless cellular networks. The book will be useful to researches in academia and industry and also to post-gradute students in telecommunication specialitiies.

show abstract

Section: Application Layer Fecmentioning

confidence: 99%

“…Even though this research area is relatively new, a lot of solutions have been proposed so far. In (Luby et al, 2006) an introduction in the Raptor code structure is presented. The Raptor codes are described through simple linear algebra notation.…”

Section: Related Workmentioning

confidence: 99%

Forward Error Correction for Reliable e-MBMS Transmissions in LTE Networks

Alexiou¹,

Bouras²,

Kokkinos³

et al. 2011

Cellular Networks - Positioning, Performance Analysis, Reliability

View full text Add to dashboard Cite

show abstract

“…LT codes are the first practical realization of the digital fountain concept [24]. The term fountain describes the data dissemination process.…”

Section: Concepts Of Lt Codesmentioning

confidence: 99%

“…the transmitter and receivers can apply the same random generator in which case only a seed for each encoded packet needs to be explicitly conveyed to the receivers [24].…”

Section: Decoding Processmentioning

confidence: 99%

See 1 more Smart Citation

Investigation of forward error correction coding schemes for a broadcast communication system

Wang

Willig

Woodward

2013

2013 Australasian Telecommunication Networks and Applications Conference (ATNAC)

View full text Add to dashboard Cite

To the 365 days I spent in NZi3. AbstractThis thesis investigates four FEC (forward error correction) coding schemes for their suitability for a broadcast system where there is one energy-rich transmitter and many energy-constrained receivers with a variety of channel conditions. The four coding schemes are: repetition codes (the baseline scheme); Reed-Solomon (RS) codes; Luby-Transform (LT) codes; and a type of RS and LT concatenated codes. The schemes were tested in terms of their ability to achieve both high average data reception success probability and short data reception time at the receivers (due to limited energy). The code rate (R c ) is fixed to either 1/2 or 1/3. Two statistical channel models were employed: the memoryless channel and the Gilbert-Elliott channel. The investigation considered only the data-link layer behaviour of the schemes. During the course of the investigation, an improvement to the original LT encoding process was made, the name LTAM (LT codes with Added Memory) was given to this improved coding method. LTAM codes reduce the overhead needed for decoding short-length messages. The improvement can be seen for decoding up to 10000 number of user packets. The maximum overhead reduction is as much as 10% over the original LT codes.The LT-type codes were found to have the property that can both achieve high success data reception performance and flexible switch off time for the receivers. They are also adaptable to different channel characteristics. Therefore it is a prototype of the ideal coding scheme that this project is looking for. This scheme was then further developed by applying an RS code as an inner code to further improve the success probability of packet reception. The results show that LT&RS code has a significant improvement in the channel error tolerance over that of the LT codes without an RS code applied. The trade-off is slightly more reception time needed and more decoding complexity. This LT&RS code is then determined to be the best scheme that fulfils the aim in the context of this project which is to find a coding scheme that both has a high overall data reception probability and short overall data reception time.Comparing the LT&RS code with the baseline repetition code, the improvement is in three aspects. Firstly, the LT&RS code can keep full success rate over channels have approximately two orders of magnitude more errors than the repetition code. This is for the two channel models and two code rates tested. Secondly, the LT&RS code shows an exceptionally good performance under burst error channels. It is able to maintain more than 70% success rate under the long burst error channels where both the repetition code and the RS code have almost zero success probability. Thirdly, while the success rates are improved, the data reception time, measured in terms of number of packets needed to be received at the receiver, of the LT&RS codes can reach a maximum of 58% reduction for R c = 1/2 and 158% reduction for R c = 1/3 compared with both the repetition code and th...

show abstract