Finite-Length Scaling of Parallel Turbo Codes on the BEC

In this paper we consider the finite-length performance of turbo codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] and of Repeat-Accumulate codes [3] to this ensemble and we derive the scaling parameter. The obtained performance estimations match very well with numerical results.


Published in:
2008 Ieee International Symposium On Information Theory Proceedings, Vols 1-6, 1893-1897
Presented at:
IEEE International Symposium on Information Theory, Toronto, CANADA, Jul 06-11, 2008
Year:
2008
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
978-1-4244-2256-2
Laboratories:




 Record created 2010-11-30, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)