Guaranteed scrambling

Author

Hekstra, Andries P. ; Tolhuizen, Ludo M G M

Author_Institution

Philips Res. Labs., Eindhoven, Netherlands

Volume

41

Issue

11

fYear

2005

Firstpage

4323

Lastpage

4326

Abstract

The bit-error rate (BER) of a storage or transmission channel may be data-dependent. This can lead to certain pathological input sequences, for which the reliability of the system is below specifications. Guided scrambling is a well-known technique to randomize the input to a channel while minimizing a certain objective function. In this paper, we take the average predicted BER as the objective function. We show that for a certain scrambling code C, for any input sequence m there exists a scrambling codeword c∈C such that the predicted BER of the (modulo-2) sum of m and c is not more than that for random input data. We present examples of scrambling codes for two-dimensional optical storage and indicate a way of combining them with error-correcting codes.

Keywords

FIR filters; error statistics; optical storage; reliability; 2D optical storage; bit error rate; error correcting codes; reliability; scrambling; Bit error rate; Communication channels; Error correction codes; Finite impulse response filter; Laboratories; Magnetic memory; Nonlinear filters; Pathology; Performance evaluation; Random sequences; Bit-error rate; guided scrambling; two-dimensional magnetic storage; two-dimensional optical storage;

fLanguage

English

Journal_Title

Magnetics, IEEE Transactions on

Publisher

ieee

ISSN

0018-9464

Type

jour

DOI

10.1109/TMAG.2005.856699

Filename

1532343