Two-dimensional interleaving using the set partitioning technique

Abstract:

This paper proposes an efficient two-dimensional interleaving technique which spreads clusters of errors having a circular-type of shape. As a consequence of this technique, simple random-error-correcting codes can be used to correct cluster of errors, instead of the more complex burst-error correcting codes. The motivation for the use of this technique is related to applications such as magnetic, optical data storage, or even in digital image transmission, where cluster of errors occurs in the first case due to dust particles, or defective regions, and in the second case due to noise. This technique is used to separate the neighbors of any given point in a Q × Q square array, by minimum squared Euclidean distance, dmin ≤ Q. When dmin = Q, it is said that the interleaving is perfect, or it realizes a maximum distance spreading of points.

Año de publicación:

1994

Keywords:

Fuente:

scopus