15.01.2013 Views

U. Glaeser

U. Glaeser

U. Glaeser

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

FIGURE 34.43 Two equivalent constraints: (a) F = {11} NRZI and (b) F = {101, 010} NRZ.<br />

For high capacity constraints, graph transforming techniques, such as the state-splitting algorithm,<br />

may result in encoder/decoder architectures with formidable complexity. Fortunately, a block encoder/<br />

decoder architecture with acceptable implementation complexity for many constraints can be designed<br />

by well-known enumerative [6], and other combinatorial [32] as well as heuristic techniques [25].<br />

Translation of constrained sequences into the channel sequences depends on the modulation method.<br />

Saturation recording of binary information on a magnetic medium is accomplished by converting an<br />

input stream of data into a spatial stream of bit cells along a track where each cell is fully magnetized in<br />

one of two possible directions, denoted by 0 and 1. Two important modulation methods are commonly<br />

used on magnetic recording channels: non-return-to-zero (NRZ) and modified non-return-to-zero (NRZI).<br />

In NRZ modulation, the binary digits 0 and 1 in the input data stream correspond to 0 and 1 directions<br />

of cell magnetizations, respectively. In NRZI modulation, the binary digit 1 corresponds to a magnetic<br />

transition between two bit cells, and the binary digit 0 corresponds to no transition. For example, the<br />

channel constraint which forbids transitions in two neighboring bit cells, can be accomplished by either<br />

F = {11} NRZI constraint or F = {101, 010} NRZ constraint. The graph representation of these two<br />

constraints is shown in Fig. 34.43. The NRZI representation is, in this case, simpler.<br />

Constraints for ISI Channels<br />

This subsection discusses a class of codes known as codes, which avoid specified differences. This is the<br />

only class of distance enhancing codes used in commercial magnetic recording systems. Two main reasons<br />

for this are: these codes simplify the channel detectors relative to the uncoded channel and even high<br />

rate codes in this class can be realized by low complexity encoders and decoders.<br />

Requirements<br />

A number of papers have proposed using constrained codes to provide coding gain on channels with<br />

high ISI (see, for example, [4,10,20,28]). The main idea of this approach can be described as follows<br />

[20]. Consider a discrete-time model for the magnetic recording channel with possibly constrained input<br />

a = {an} C ∈� {0,1} ∞ , impulse response {hn}, and output y = {yn} given by<br />

© 2002 by CRC Press LLC<br />

∑<br />

yn = amh n−m + ηn m<br />

(34.32)<br />

where h(D) = ∑ nh nD n = (1 − D)(1 + D) 3 (E 2 PR4) or h(D) = ∑ nh nD n = (1 − D)(1 + D) 4 (E 3 PR4), η n are<br />

independent Gaussian random variables with zero mean and variance σ 2 . The quantity 1/σ 2 is referred<br />

to as the signal-to-noise ratio (SNR). The minimum distance of the uncoded channel (34.32) is<br />

2<br />

d<br />

min<br />

min =<br />

�( D)<br />

0<br />

≠ h( D)�(<br />

D)<br />

2

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!