multi-edge framework for unequal error protecting lt codes
DESCRIPTION
Multi-Edge Framework for Unequal Error Protecting LT Codes. H. V. Beltr˜ao Neto, W. Henkel, V. C. da Rocha Jr. Jacobs University Bremen, Germany IEEE ITW(Information Theory Workshop) 2012. Outlines. Introduction Construction algorithms for UEP LT Codes Simulation results Conclusions. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/1.jpg)
1
Multi-Edge Framework for Unequal Error Protecting LT Codes
H. V. Beltr˜ao Neto, W. Henkel, V. C. da Rocha Jr.
Jacobs University Bremen, Germany
IEEE ITW(Information Theory Workshop) 2012
![Page 2: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/2.jpg)
2
Outlines
• Introduction• Construction algorithms for UEP LT Codes• Simulation results• Conclusions
![Page 3: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/3.jpg)
3
Introduction
• Rateless codes– LT codes, Raptor codes, Online codes, …– can adapt their rate on the fly to suit different
channel conditions– are interesting for multicast transmission since
they eliminate the requirement for retransmission
![Page 4: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/4.jpg)
4
Introduction
• The multi-edge framework was originally derived for Low Density Parity-Check codes (LDPC) in [7].
• Several edge classes can be defined within the bipartite graph induced by the encoding
• Every node is characterized by the number of connections to edges of each class.
[7] T. Richardson and R. Urbanke, “Multi-Edge Type LDPC Codes,” Tech. Rep., 2004, submitted to IEEE Transaction on Information Theory.
![Page 5: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/5.jpg)
5
Introduction
• me : the number of edge types used to represent the bipartite graph
• Each node in the bipartite graph has 2 vectors– x = (x1, ..., xme) that indicates the different types of edges
connected to it
– d = (d1, ..., dme) referred to as edge degree vector which denotes the number of connections of a node to edges of type i,
![Page 6: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/6.jpg)
6
Introduction
• xd = • Ldk : the number of variable nodes (input
symbol) of type(degree) d• Rdk : the number of check nodes (output
symbol) of type(degree) d
![Page 7: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/7.jpg)
7
Introduction
• type-1 edge (solid lines)• type-2 edges (dashed lines)
3 4 4 2 2 2 3 2
![Page 8: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/8.jpg)
8
Introduction
• The multi-edge degree distributions for the code depicted in Fig. 1 are:
• Divide the variable nodes into me protection classes (C1,C2, . . . ,Cme) with monotonically decreasing levels of protection
![Page 9: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/9.jpg)
9
Introduction
• The degree of an output symbol corresponds to the number of edges connected to it
• dj : the number of edges of type j connected to a check node
• Ωi : the probability of an output symbol having degree i • Ω(x) : the overall output symbol degree distribution
![Page 10: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/10.jpg)
10
Introduction
• Asymptotically (as k increases to infinity), we can approximate Eq. (6) by
• Ωj : the probability of an input symbol of the class Cj being chosen among the k input symbols
• The check node degree distribution is
![Page 11: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/11.jpg)
11
Introduction
• Codes with only 2 protection classes, i.e., codes with me = 2 Eqs. (8) and (10) are reduced to
![Page 12: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/12.jpg)
12
Construction algorithms for UEP LT Codes
• Weighted approach[5]– Partition of the k variable nodes into me sets of sizes α1k, α2k,…,
αmek, such that – The probability of an edge being connected to a particular
variable node within the set j being qj
– The selection probabilities are defined as ω1 = αkM and ω2 = (1 −α)KL • α is the fraction of input symbols that belong to the first class and, kM
> 1 and 0 < kL < 1 are assigned to the set of more important bits (MIB) and less important bits (LIB)
[5] N. Rahnavard, B. N. Vellambi, and F. Fekri, “Rateless codes with unequal error protection property,” IEEE Transactions on Information Theory, vol. 53, no. 4, pp. 1521–1532, April 2007.
![Page 13: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/13.jpg)
13[5] N. Rahnavard, B. N. Vellambi, and F. Fekri, “Rateless codes with unequal error protection property,” IEEE Transactions on Information Theory, vol. 53, no. 4, pp. 1521–1532, April 2007.
![Page 14: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/14.jpg)
UEP at the Rateless Encoding Stage
• Type-1 Codes
• Weakness– Change of degree distribution (input nodes)– It is likely that d1 = 0 for low-degree encoding
nodes
…
… …d1 = min([(K1/K)dkM,K1] d2 = d-d1
…K1 K2
14
N. Rahnavard and F. Fekri, “Finite-length unequal error protection rateless codes: Design and analysis,” in IEEE GLOBECOM 2005.
http://www.powercam.cc/show.php?ch=12&fid=74&id=238
![Page 15: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/15.jpg)
15
Construction algorithms for UEP LT Codes
• Windowed approach[6]– Partition the input symbols into protection classes
of k1, k2,. . . , kme symbols such that k1+k2+. . . +kme = k – The i-th window is defined as the set of the first input symbols– The most important symbols form the first window
while the whole block comprises the final meth window.
[6] D. Sejdinovi´c, D. Vukobratovi´c, A. Doufexi, V. ˇSenk, and R. Piechocki, “Expanding window fountain codes for unequal error protection,” IEEE Transactions on Communications, vol. 57, no. 9, pp. 2510–2516, Sep. 2009.
![Page 16: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/16.jpg)
16
Construction algorithms for UEP LT Codes
• Each output symbol is encoded first selecting a window i, with each window having associated to it a probability Гi of being chosen
![Page 17: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/17.jpg)
EWF(Expanding Window Fountain) Codes
• Notation– EWF codes are applied on consecutive source blocks of k
symbols (data packets).– The sequence of r expanding windows, where each window is
contained in the next window in the sequence.• The number r of expanding windows is equal to the number of
importance classes of the source block.
– the size of the i-th window as ki, where k1<…<kr=k• s1=k1
• s1+s2+…+sr = k• si = ki – ki-1
– the division of the source block into importance classes
17http://www.powercam.cc/slide/19578
![Page 19: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/19.jpg)
Fig. 1. Expanding window fountain (EWF) codes.
19http://www.powercam.cc/slide/19578
![Page 20: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/20.jpg)
EWF Codes
• 2 importance classes– The expressions for the erasure probabilities of
Most Important Bit (MIB) class and Least Important Bit (LIB) class after l iterations
20http://www.powercam.cc/slide/19578
![Page 21: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/21.jpg)
21
Flexible UEP LT Codes
• An LT code with 2 protection classes. Its check node degree distribution can be written as
• for d = (d1, d2) and
• To keep the original overall output symbol degree distribution Ω(x), the coefficients Rd must satisfy
![Page 22: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/22.jpg)
22
Flexible UEP LT Codes
• In the two-class case, R(1,0) + R(0,1) = Ω1, R(2,0) + R(1,1) + R(0,2) = Ω2 ......
• The idea of our proposed scheme :– Increase the probability of selection of the most
important input symbols – Increase the occurrence probability of output symbols
which are more connected to input symbols of the most sensitive class
– Increase the values of the coefficients R(d1, d2) with d1 > d2
![Page 23: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/23.jpg)
23
Flexible UEP LT Codes • The encoding of the flexible UEP LT codes is similar to the
traditional LT codes
• One must select an edge degree vector d according to
• Rd : the probability of the edge degree vector d being chosen • An output symbol with edge degree vector d = (d1, d2) is formed
by selecting d1 input symbols from C1, d2 input symbols from C2 uniformly and at random, and performing a bitwise XOR operation between them.
![Page 24: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/24.jpg)
24
Flexible UEP LT Codes • LT code with degree distribution
Ω(x) = 0.15x + 0.55x2 + 0.30x3 • Construct a two-class UEP LT code where 10% of the input
symbols belong to the most protected class, i.e., α = 0.1. • Compute the coefficients Rd for the non-UEP case by
means of Eq. (11) with ω1 = α and ω2 = 1 − α. • We will refer to the EEP LT codes check node coefficients
as Rd and the ones of UEP LT codes as RdUEP
• Increase the values of the coefficients R(d1,d2) with d1 > d2
![Page 25: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/25.jpg)
25
Flexible UEP LT Codes
• A simple way of realizing this is to transfer a fraction f of a coefficient R(a,b) where a < b to the coefficient R(b,a)
– If f = 0.1
• In order to further refine the performance of the UEP LT codes, we can define different values of f– f = f1 for symbols with d2 = 0 and f = f2 otherwise.
![Page 26: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/26.jpg)
26
Asymptotic analysis of multi-edge LT codes
• Theorem 1: The erasure probability of an input symbol of class j of a multi-edge LT code with node perspective degree distribution pair (L(x),R(x)) at iteration l ≥ 0 is given by
where y−1 = 1, denotes the fraction of type j (j = 1 , . . . ,me) edges
connected to check nodes of type d.
![Page 27: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/27.jpg)
27
Asymptotic analysis of multi-edge LT codes
• Multi-edge UEP LT codes with the overall output symbol degree distribution proposed in [2]
[2] A. Shokrollahi, “Raptor codes,” IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2551–2567, June 2006.
![Page 28: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/28.jpg)
28
Asymptotic analysis of multi-edge LT codes
• Parameters– The weighted approach (km = 2.077)
– The windowed approaches (Г1 = 0.084) are optimized for an overhead γ = 1.05 according to
[6]• The flexible UEP LT performance was obtained
for f1 = 0.09 and f2 = 0.13
[6] D. Sejdinovi´c, D. Vukobratovi´c, A. Doufexi, V. ˇSenk, and R. Piechocki, “Expanding window fountain codes for unequal error protection,” IEEE Transactions on Communications, vol. 57, no. 9, pp. 2510–2516, Sep. 2009.
![Page 29: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/29.jpg)
29Fig. 2. Asymptotic performance of the weighted, windowed and the proposed flexible UEP LT construction strategies. The parameters of the three approaches were optimized for an overhead γ = 1.05.
1.05
![Page 30: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/30.jpg)
30
Simulation Results
• Settings– Assume the transmission of k = 5000 input
symbols divided into 2 different levels of protection
– The first protection class is composed of 10% of the input symbols (k1 = 0.1k)
– The second protection class contains the other k2 = k − k1 input symbols
![Page 31: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/31.jpg)
31
Fig. 3. Simulation results of the weighted and flexible schemes for k = 5000.
1.0751.05
![Page 32: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/32.jpg)
32
Conclusions
• We introduced a multi-edge type analysis of unequal error protecting LT codes.
• Our proposed scheme performed better than the weighted and the windowed schemes.
![Page 33: Multi-Edge Framework for Unequal Error Protecting LT Codes](https://reader036.vdocuments.site/reader036/viewer/2022062310/56816303550346895dd37c05/html5/thumbnails/33.jpg)
33
References• [1] M. Luby, “LT codes,” in Proceedings of the 43rd Annual IEEE Symposium on
Foundations of Computer Science, Nov. 2002, pp. 271–282.• [2] A. Shokrollahi, “Raptor codes,” IEEE Transactions on Information Theory, vol. 52,
no. 6, pp. 2551–2567, June 2006.• [3] P. Maymounkov, “Online codes,” NYU, Tech. Rep. TR2003-883, Nov. 2002.• [5] N. Rahnavard, B. N. Vellambi, and F. Fekri, “Rateless codes with unequal error
protection property,” IEEE Transactions on Information Theory, vol. 53, no. 4, pp. 1521–1532, April 2007.
• [6] D. Sejdinovi´c, D. Vukobratovi´c, A. Doufexi, V. ˇSenk, and R. Piechocki, “Expanding window fountain codes for unequal error protection,” IEEE Transactions on Communications, vol. 57, no. 9, pp. 2510–2516, Sep. 2009.
• [7] T. Richardson and R. Urbanke, “Multi-Edge Type LDPC Codes,” Tech. Rep., 2004, submitted to IEEE Transaction on Information Theory.
• [8] ——, Modern Coding Theory. Cambridge University Press, 2008.• [9] M. Luby, M. Mitzenmacher, and A. Shokrollahi, “Analysis of random processes via
and-or tree evaluation,” in Proceedings of the 9th SIAM Symposium on Discrete Algorithms, Jan. 1998, pp. 364–373.