AND-OR tree analysis of distributed LT codes

In this contribution, we consider design of distributed LT codes, i.e., independent rateless encodings of multiple sources which communicate to a common relay, where relay is able to combine incoming packets from the sources and forwards them to receivers. We provide density evolution formulae for d...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE Information Theory Workshop on Networking and Information Theory pp. 261 - 265
Main Authors Sejdinovic, D., Piechocki, R.J., Doufexi, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2009
Subjects
Belief propagation
Computational efficiency
Decoding
Design engineering
Encoding
Frame relay
Hamming weight
Information analysis
Probability distribution
Random variables
Online AccessGet full text
ISBN1424445353
9781424445356
DOI10.1109/ITWNIT.2009.5158583

Cover

More Information
Summary:In this contribution, we consider design of distributed LT codes, i.e., independent rateless encodings of multiple sources which communicate to a common relay, where relay is able to combine incoming packets from the sources and forwards them to receivers. We provide density evolution formulae for distributed LT codes, which allow us to formulate distributed LT code design problem and prove the equivalence of performance of distributed LT codes and LT codes with related parameters in the asymptotic regime. Furthermore, we demonstrate that allowing LT coding apparatus at both the sources and the relay may prove advantageous to coding only at the sources and coding only at the relay.
ISBN:1424445353
9781424445356
DOI:10.1109/ITWNIT.2009.5158583