DocumentCode
913737
Title
Realization of optimum interleavers
Author
Ramsey, John L.
Volume
16
Issue
3
fYear
1970
fDate
5/1/1970 12:00:00 AM
Firstpage
338
Lastpage
345
Abstract
Four realizations of interleavers that reorder a sequence of symbols so that no contiguous sequence of
symbols in the reordered sequence contains any pair of symbols that were separated by fewer than
, symbols in the original ordering are introduced. For any
and
that satisfy an appropriate relative primeness condition, these interleavers are optimum in the sense that of all possible interleavers providing the indicated symbol separation, one of these four realizations achieves both the minimum possible encoding delay and the minimum possible combined storage capacity for the interleaver and its unscrambler.
symbols in the reordered sequence contains any pair of symbols that were separated by fewer than
, symbols in the original ordering are introduced. For any
and
that satisfy an appropriate relative primeness condition, these interleavers are optimum in the sense that of all possible interleavers providing the indicated symbol separation, one of these four realizations achieves both the minimum possible encoding delay and the minimum possible combined storage capacity for the interleaver and its unscrambler.Keywords
Burst-correcting codes; Cryptography; Error-correcting codes; Sequences; Adaptive estimation; Adaptive signal detection; Automatic control; Cybernetics; Distribution functions; Functional analysis; Information theory; Pattern recognition; Signal detection; System identification;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1970.1054443
Filename
1054443
Link To Document