By Topic

Spectra and Minimum Distances of Repeat Multiple–Accumulate Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chiara Ravazzi ; Dept. of Math., Politec. di Torino, Torino, Italy ; Fabio Fagnani

In this paper, the ensembles of repeat multiple- accumulate codes (RAm), which are obtained by interconnecting a repeater with a cascade of m accumulate codes through uniform random interleavers, are analyzed. It is proved that the average spectral shapes of these code ensembles are equal to 0 below a threshold distance epsivm and, moreover, they form a nonincreasing sequence in m converging uniformly to the maximum between the average spectral shape of the linear random ensemble and 0. Consequently the sequence epsivm converges to the Gilbert-Varshamov (GV) distance. A further analysis allows to conclude that if m ges 2 the RAm are asymptotically good and that epsivm is the typical normalized minimum distance when the interleaver length goes to infinity. Combining the two results it is possible to conclude that the typical distance of the ensembles RAm converges to the Gilbert-Varshamov bound.

Published in:

IEEE Transactions on Information Theory  (Volume:55 ,  Issue: 11 )