Coded data generation or conversion – Digital code to digital code converters
Reexamination Certificate
2002-09-25
2004-09-07
Jeanglaude, Jean Bruner (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
C341S051000, C341S058000
Reexamination Certificate
active
06788223
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to apparatus and methods to encode information to reduce a probability of errors in a transmission and/or a recording (storage) of the information.
2. Description of the Related Art
In magnetic recording, various sources of noise can corrupt accurate information (for example, thermal noise, interference, and media noise arising from sources such as jitter, DC erase noise, and pulse width/height modulation). Media noise is a dominant source of noise in many current recording systems. The media noise is usually treated as highly correlated non-stationary noise added to a read-back signal. “Transition jitter” is the dominant component of media noise and affects the position of transitions.
RLL Coding schemes use (d, k) constraints, which limit a minimum and a maximum run lengths of zeros, respectively, or alternatively, the schemes control high and low frequency contents of user data. Conventional high-rate RLL (0, k) codes are highly complex for circuit implementation and relatively “blind” in terms of error detection during a demodulation process. The d, k constraints include properties of the conventional codes exploitable for error control purposes. However, this specialized type of error is only a small subset of the total number of possible errors.
A construction of an encoder, which encodes arbitrary binary sequences into sequences, is needed that obeys a specific run-length-limited (RLL) constraint. It is important that the encoder encodes data at a high rate, that the decoder does not propagate channel errors, and that a complexity of encoding and decoding be low.
White noise is added to every symbol entering a channel in a magnetic recording medium. Media Noise, like white noise, is random. Unlike the white noise, the media noise is not added to every symbol. The media noise happens only when there is a transition on the input to the channel. For example, if we input 00010110, then we have media noise when the input changes from a “0” to a “1” and from a “1” to a “0”. The denser a signal is written onto the magnetic recording medium, the more severe media noise becomes. Thus, a recording density controls a ratio of media noise to white noise. For instance, a ratio of 50:50 may be one example.
Let n_j, n_w, and n_e to denote components of media noise, n, due to jitter, j, pulse width noise, w, and electronic noise, e, respectively.
n=n
—
j+n
—
w+n
—
e+n′
, where,
n′
, represents all other noises.
Components n_j and n_w are proportional to a number of pairs, (x(i), x(i+1)), that are (0, 1) or (1,0). In other words, n_j and n_w, are proportional to a number of times there is a transition in the x sequence either from 0 to 1, or from 1 to 0. Because, n_j and n_w depend on input data, the error performance of the system can vary significantly with the data. Sequences, x, having few transitions will suffer less from, n_j and n_w, than those having many transitions. Accordingly, an encoder is needed to reduce media noise from being added to an input of the channel x(i).
SUMMARY OF THE INVENTION
Various objects and advantages of the invention will be set forth in part in the description that follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
According to one aspect, an apparatus has a conversion circuit, a precoder circuit and a selection circuit. The conversion circuit converts user data b
1
, b
2
, b
3
. . . b
k
to a coded sequence c
0
, c
1
, c
2
. . . c
q
. The precoder circuit having an initial state (s
2
(0), s
1
(0)) produces an output x
0
, x
1
, x
2
. . . x
q
from the coded sequence c
0
, c
1
, c
2
. . . c
q
as follows: x(i)=c(i)⊕s
2
(i−2), where (x(−2), x(−1))=(s
2
(0), s
1
(0)).
The selection circuit selects c
0
in the coded sequence c
0
, c
1
, c
2
. . . c
q
such that the output x
0
, x
1
, x
2
. . . x
q
of the precoder circuit has less than a maximum number q of transitions.
The conversion circuit may include an encoder circuit to convert user data b
1
, b
2
, b
3
. . . b
k
to a sequence c
1
, c
2
. . . c
q
, and a transition minimization circuit to add c
0
to the sequence c
1
, c
2
. . . c
q
.
The apparatus may have a circuit to append the coded sequence c
0
, c
1
, c
2
. . . c
q
by adding at least one additional bit to the coded sequence c
0
, c
1
, c
2
. . . c
q
to produce a sequence c
0
, c
1
, c
2
, . . . , c
q
, c
q+1
, . . . , c
m
. The at least one additional bit added to produce c
0
, c
1
, c
2
, . . . , c
q
, c
q+1
, . . . , c
m
may include a parity bit.
According to another aspect, a method for coding includes adding a single bit to a input sequence of length q, and producing an output sequence of length q+1 having t transitions such that for any input sequence, t is an integer less than or equal to one half the maximum number of transitions and is represented by the following formula: t≦q/2.
A computer readable medium may store a program for controlling at least one computer to perform the method.
These together with other aspects and advantages which will be subsequently apparent, reside in the details of construction and operation as more fully hereinafter described and claimed, reference being had to the accompanying drawings forming a part hereof, wherein like numerals refer to like parts throughout.
REFERENCES:
patent: 5142421 (1992-08-01), Kahlman et al.
patent: 5220568 (1993-06-01), Howe et al.
patent: 5544178 (1996-08-01), Zook
patent: 5635933 (1997-06-01), Fitzpatrick et al.
patent: 5757294 (1998-05-01), Fisher et al.
patent: 5949357 (1999-09-01), Fitzpatrick et al.
patent: 6052072 (2000-04-01), Tsang et al.
patent: 6154870 (2000-11-01), Fredrickson et al.
patent: 6185173 (2001-02-01), Livingston et al.
patent: 6229458 (2001-05-01), Altekar et al.
patent: 6388587 (2002-05-01), Brickner et al.
patent: 6411224 (2002-06-01), Wilson et al.
patent: 6492918 (2002-12-01), Rezzi et al.
patent: o 633 571 (1995-01-01), None
B.E. Moision, P.H. Siegel, and E. Soljanin, “Distance-enhancing codes for digital recording,” IEEE Trans. Magn., vol. 34, No. 1, pp. 69-74, Jan. 1998.
Umemoto, “On Coding and Decoding for High-order Partial Response Systems”, IEEE Transactions on Magnetics, vol. 34, No. 1, Jan. 1998, pp. 80-84.
Lee et al., “Modulation Codes for Precoded Partial Response Channels”, IEEE Transactions on Magnetics, vol. 32, No. 5, Sep. 1996, pp. 3986-3988.
Bliss William G.
Karabed Razmik
Vityaev Andrei
Infineon Technolgies NA Corp.
Staas & Halsey , LLP
LandOfFree
High rate coding for media noise does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with High rate coding for media noise, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High rate coding for media noise will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3196281