Attribution Non-Commercial (BY-NC)

3 views

Attribution Non-Commercial (BY-NC)

- 17 18 discrete syllabus
- t01
- Math 30-2 Unit Exam (#2) (Written Only)
- ISI BI
- M Essa CV European
- Complexity Analysis
- Cs310w03 Final
- An Algebraic Approach to Constraint Satisfaction Problems
- Supply Chain Optimization Course Notes
- Mathematics
- AaDS - W01b Foundations.pdf
- Cbse Class 7 Maths Syllabus 2012-13
- Olympiads 16 2
- 4.OA.1 Pencil Pickup
- journal week 1
- bio managment plan & syllabus
- Lecture 5
- P1&2 Seminar Part 1 Overview
- Program Coding 2nd semester.docx
- gg

You are on page 1of 1

Amin Shokrollahi

EPFL and Digital Fountain, Inc.

Lausanne, Switzerland, and Fremont, USA

amin.shokrollahi@epfl.ch

Abstract We exhibit a class of universal Raptor

Codes: for a given integer k, and any real > 0, Rap-

tor Codes in this class produce a potentially innite

stream of symbols such that any subset of symbols of

size k(1 +) is sucient to recover the original k sym-

bols, with high probability. Each output symbol is

generated using O(log(1/)) operations, and the orig-

inal symbols are recovered from the collected ones

with O(k log(1/)) operations.

I. Introduction

Raptor Codes are an extension of LT-Codes [1]. The pa-

rameters of a Raptor Code of length k over a eld F are given

by a pre-code C of dimension k and block-length n over F,

and a probability distribution on F

n

. Given k source sym-

bols x1, . . . , x

k

, the pre-code rst encodes these symbols into

a codeword (y1, . . . , yn) of length n; the symbols belong to a

nite dimensional vector space over F. Each output symbol

is obtained by sampling from the distribution to obtain a

vector (v1, . . . , vn). The value of the output symbol is then

obtained as

n

i=1

viyi.

The case of primary interest is when F = F2, and is a

distribution which is constant on words of equal weight. In

this case, can be described by the numbers 1, . . . , n such

the probability of a vector x F

n

under is w/

n

w

, where

w is the Hamming weight of x. In this case, we identify with

the generating polynomial (x) =

n

i=1

ix

i

; the parameters

of the Raptor Code then become (k, C, (x)). Note that a

Raptor Code does not have a xed block-length. In applica-

tions, x1, . . . , x

k

can be packets to be sent over a computer

network. The Raptor Code can be used to produce a poten-

tially limitless stream of output symbols (i.e., packets). The

design problem in this case consists of choosing the parame-

ters of the Raptor Code in such a way that ecient decoding

is possible after reception of k(1 + ) output packets, for

arbitrarily close to zero. We call such a decoding algorithm

an algorithm overhead .

An encoding algorithm is called linear time if the pre-code

can be encoded in linear time, and the average number of op-

erations to produce an output symbol is a constant. A decod-

ing algorithm is called linear time if, after collecting a certain

number of output symbols, it can decode the k source symbols

in time O(k). We will solve the asymptotic design problem for

Raptor Codes by showing that, for any given , an appropri-

ate choice of the pre-code and the output degree distribution

will result in the Belief Propagation (BP) Decoding algorithm

to be linear time and of overhead .

II. Asymptotic Analysis

Let > 0, and let Cm be a sequence of codes of block-length n

such that the rate R of Cm is (approximately) (1 + /2)/(1 +

), and such that the BP decoder can decode Cm on a BEC

with erasure probability = (/4)/(1 + ) = (1 R)/2 with

O(nlog(1/)) arithmetic operations. Further, let D := 4(1 +

)/ and dene

D(x) =

1

+ 1

x +

D

i=2

x

i

i(i 1)

+

x

D+1

D

,

where = (/2) + (/2)

2

.

Theorem 1. Let R = (1 + /2)/(1 + ), and Cm be the

family of codes of rate R and dimension k with the proper-

ties described above. Then the Raptor code with parame-

ters (k, Cn, D(x)) has a linear time encoding algorithm, and

BP decoding is a linear time decoding of overhead for the

code. More precisely, it can be shown that the average num-

ber of operations to produce an output symbol is O(log(1/)),

and the average number of operations to recover the k source

symbols is O(k log(1/)). The theorem is proved using a com-

bination of density evolution techniques from [2] and Lubys

techniques [1].

III. Finite Length Design

We have developed ecient techniques to design Raptor Codes

of small length for which the BP decoder has provable guaran-

tees on its error performance. The design consists of a design

problem for the output degree distribution (x), and the de-

sign problem for the pre-code C. For lack of space, we will not

discuss the details of our approach, and conne ourselves to

mentioning an example only. In this example, we assume that

k > 64536. First, we encode the k source symbols using an

extended Hamming Code to produce

k symbols. The value of

k is roughly k +log

2

(k). Next, we use a random left-regular

LDPC code with

k + 1000 message symbols and 580 check

symbols in which the message symbols are all of degree 4, and

the neighbors of each message symbol are chosen randomly.

Using this code, we encode the

k symbols into

k +1000 input

symbols. This completes the description of the pre-code. For

the output degree distribution (x) we choose

(x) = 0.008x + 0.494x

2

+ 0.166x

3

+ 0.073x

4

+

0.083x

5

+ 0.056x

8

+ 0.037x

9

+ 0.056x

19

+

0.025x

65

+ 0.003x

66

.

Then we can show that the error probability of the BP decoder

on this Raptor Code is at most 1.71 10

14

. The proof of

this assertion is based on a novel analysis tool for nite length

LT Codes [3], combined with an ecient method to analyze

right-Poisson LDPC codes on the BEC.

References

[1] M. Luby, LT-codes, in Proceedings of the ACM Symposium

on Foundations of Computer Science (FOCS), 2002.

[2] M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman,

Ecient erasure correcting codes, IEEE Trans. Inform. The-

ory, vol. 47, pp. 569584, 2001.

[3] R. Karp, M. Luby, and A. Shokrollahi, Finite length analysis

of LT-codes, This Proceedings, 2004.

ISIT 2004, Chicago, USA, June 27 July 2, 2004

36 0-7803-8280-3/04/$20.00 2004 IEEE

- 17 18 discrete syllabusUploaded byapi-261876175
- t01Uploaded byorbita3000
- Math 30-2 Unit Exam (#2) (Written Only)Uploaded byAnand Unnithan
- ISI BIUploaded bycastello
- M Essa CV EuropeanUploaded byAbdel Rahman Mohamed
- Complexity AnalysisUploaded byZoHaib Ahmed
- Cs310w03 FinalUploaded byrodrdc2011
- An Algebraic Approach to Constraint Satisfaction ProblemsUploaded byhumejias
- Supply Chain Optimization Course NotesUploaded byChetan Gupta
- MathematicsUploaded byMiKiValenzuela
- AaDS - W01b Foundations.pdfUploaded byGustavoMCPRA
- Cbse Class 7 Maths Syllabus 2012-13Uploaded bySunaina Rawat
- Olympiads 16 2Uploaded byDrArun Kaliappan
- 4.OA.1 Pencil PickupUploaded bysuchi ravalia
- journal week 1Uploaded byapi-206689394
- bio managment plan & syllabusUploaded byapi-285999757
- Lecture 5Uploaded byHimaghna Dasgupta
- P1&2 Seminar Part 1 OverviewUploaded byBernard Chan
- Program Coding 2nd semester.docxUploaded byAnonymous W6RB34
- ggUploaded byapi-341126007
- CVEN 2401 Workshop Week6Uploaded byMichael Boutsalis
- Campify - Your Student Life Sorted_5Uploaded bykwik1804
- 4101-2017-23.pdfUploaded byNoni Khanna
- Unit IUploaded bySamay
- MIT6_845F10_lec01Uploaded byGiannis Papaioannou
- RDMDCTUploaded byKrutarth Patel
- Q and Error Function Full TableUploaded bypanya prachachit
- 4096 Bit QAM Random Generated NumbersUploaded byPeska123
- Long-term behaviour solution.pdfUploaded byMohammad Javed Quraishi
- Trabajo individualUploaded byJuan M Cardona

- (the IMA Volumes in Mathematics and Its Applications 16) Avner Friedman (Auth.)-Mathematics in Industrial Problems-Springer-Verlag New York (1988)Uploaded byAL Ray
- ch1.pptUploaded byAshok Sharma
- MIT8 02SC Challenge Sol05Uploaded bySagar Sharma
- Exercises3-1A Class 8Uploaded bybrayan martinez
- Rational Expressions and Equation TestUploaded byEamon Barkhordarian
- HP 49G RPL.pdfUploaded byChristian D. Orbe
- 10h-kmp.pdfUploaded byShubham Mishra
- Log Tables and Their OperationsUploaded byUday Prakash Sahu
- TS PGECET Mechanical Engineering (ME) Exam Syllabus & PatternUploaded bypavani
- What is the Expectation Maximization Algorithm?Uploaded byslash020
- Venn Diagram Logic Problem TutorialUploaded byThe-Truth
- 567 bất đẳng thức hay và khó.pdfUploaded byReiichi Syuusuke
- calculus diariesUploaded byapi-254633633
- Trig for Computer GraphicsUploaded byasdfsd88
- UEM Sol to Exerc Chap 091Uploaded byshivaprasadmvit
- Robust Pole Placement using Linear Quadratic Regulator Weight Selection AlgorithmUploaded byijsret
- IntroCS Part 3Uploaded byAlfred Stafasani
- Queueing Theory SlidesUploaded byJDTerex
- ENAE 641Uploaded bybob3173
- LaTeX AidUploaded byyouarefubar
- Pentagonal NumbersUploaded byRaj Uppar
- Sequences and Series of Real Numbers PDFUploaded byAhamedIqbal
- Magoosh GRE eBook.pdfUploaded byDeepesh Bharani
- Joel Franklin-Classical Field TheoryUploaded byGerman Chiappe
- Form 2 Mathematics Notes +Exercise By Kelvin - Chapter 3-4Uploaded byKelvin
- Calculus Practice TestUploaded byadam
- BSBUploaded byRastogi Aman
- FS-719 Numerical Methods.pdfUploaded bysuma sharma
- Multi Asset Options Behavior Price MovementUploaded byShweta Srivastava
- Bca SyllabusUploaded byMohammed Jeelan