DocumentCode
3320503
Title
Finite-Length Scaling of Repeat-Accumulate Codes on the BEC
Author
Andriyanova, Iryna
Author_Institution
Sch. of Commun. & Comput. Sci., EPFL, Lausanne
fYear
2008
fDate
12-14 March 2008
Firstpage
64
Lastpage
67
Abstract
In this paper we consider the finite-length performance of Repeat-Accumulate codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] to this ensemble and we derive the scaling parameter. The obtained performance estimations match very well with numerical results.
Keywords
binary codes; channel coding; error statistics; parity check codes; LDPC codes; RA codes; binary erasure channel; error probability; finite-length scaling law performance; repeat-accumulate codes; waterfall region; Approximation algorithms; Channel capacity; Concatenated codes; Convolutional codes; Error probability; Iterative algorithms; Iterative decoding; Parity check codes; Seminars; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2008 IEEE International Zurich Seminar on
Conference_Location
Zurich
Print_ISBN
978-1-4244-1681-3
Electronic_ISBN
978-1-4244-1682-0
Type
conf
DOI
10.1109/IZS.2008.4497277
Filename
4497277
Link To Document