|
|
|
|
stream interlace and deinterlace
|
(Theorem)
|
|
|
Interlace is the method to create a new data stream from two data streams, each of which has a constant time interval sequence. Formally, suppose
and
are two data streams, each have a constant time sequence. For convenience, we use
and
to also denote the constant terms of each of those sequences. We construct a new data stream
, also having constant time interval, as follows:

Deinterlace is the method of constructing two data streams , and , each having constant time interval, from a given data stream and primary interlace value of computed stream, where has constant time interval.
and

This sequences are the Fraenkel partition theorem instance.
References
- [1]
- Aviezri S. Fraenkel, The bracket function and complementary sets of integers, Canad. J. Math. 21 (1969), 6-27. MR 38:3214
- [2]
- Michal Widera, Deterministic method of data sequence processing, Vol. IV, ISSN 1732-1360, Annales UMCS (2006), 314-331. UMCS Annales AI
|
"stream interlace and deinterlace" is owned by michal.
|
|
(view preamble)
Cross-references: integers, complementary, bracket function, references, Fraenkel partition theorem, primary, constant terms, sequence, interval, data stream
This is version 13 of stream interlace and deinterlace, born on 2005-12-27, modified 2007-06-23.
Object id is 7543, canonical name is WideraInterlaceAndDeinterlace.
Accessed 9420 times total.
Classification:
| AMS MSC: | 11B83 (Number theory :: Sequences and sets :: Special sequences and polynomials) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|