Optimal 2-D interleaving for robust multimedia transmission

Interleaving is a process to rearrange code symbols so as to spread bursts of errors over multiple codewords that can be corrected by random error correction codes (ECCs). By converting bursts of errors into random-like errors, interleaving thus becomes an effective means to combat error bursts. We focus on how to obtain effective interleaving schemes for 2-dimensional (2D) arrays, namely, how to spread the arbitrary error burst such that they are separated as far as possible. To achieve this, the theoretical bound for optimal 2D interleaving on arbitrary sized 2D array is analyzed. Based on it, a novel sphere tiling based method is proposed to achieve this bound. We first present this method for set of specified square array, then we extend it to arbitrary sized 2D array. The validity of the proposed method is proved. By using the proposed method, the multimedia transmission will be more robust against 2D burst error.