Method of overflow-based defect management representation

Details Method of overflow-based defect management representation Method of overflow-based defect management representation

2001-05-18

2003-06-03

Nguyen, T. V. (Department: 2187)

Electrical computers and digital processing systems: memory

Address formation

Generating a particular pattern/sequence of addresses

C711S112000, C711S114000, C711S154000, C711S220000, C714S001000, C714S006130, C714S006130

Reexamination Certificate

active

06574723

ABSTRACT:

FIELD OF THE INVENTION
The present invention relates generally to disc drives, and in particular to media defect management schemes.
BACKGROUND OF THE INVENTION
Defect management schemes in a disc drive identify segments of the disc surface that are defective and which cannot be used to store data. Such defects may be caused by a number of sources, including thermal asperity, dust particles or other contaminants. These defective locations need to be identified and coded as no useful information can be recorded at these defective sites.
Drive certification is performed as part of the manufacturing process to identify defects on the media. In a typical full slip defect management scheme, all defective sectors found are characterized by a slip count parameter. The drive electronics uses this parameter to skip over the defective sectors. The accumulated slip and the cylinder location are recorded in the defect slippage field and the cylinder field respectively. Both these fields are a single word size parameter. This implies that the largest number of accumulated slips that can be recorded is 65535. This limitation poses a potential problem as the capacity of disc drives increases and the potential number of slips may exceed this number.
If a track or cylinder is mapped out due to bad servo bursts, the accumulated slip count increases tremendously, and the slip count may exceed the limit.
Following the current trend in the disc drive industry to increase drive capacity by increasing the number of tracks per inch, a similar problem will arise when the number of cylinders in a drive exceed 65535, since the cylinder field is a single word parameter.
A natural solution is to use an additional memory byte or word to represent the slip count or cylinder count, and thus avoid any possibility of parameter overflow. Unfortunately, this is not a feasible solution as buffer memory is both scarce and expensive in the disc drive electronics system. For example, if an additional byte is added for the cylinder and slip count fields, the additional memory required for the entire defect table will be 2 bytes multiplied by the number of defect entries. For an 8K defect entry system, an additional 16K bytes will be required.
There is clearly an unmet need for some way to overcome this memory limitation at acceptable cost.
SUMMARY OF THE INVENTION
In accordance with the invention, there is provided a method for storing values, some of the values being wider than n bits. The method is especially useful in a disc drive having n-bit wide memory allocated to the storage of such values.
According to a most preferred embodiment, the method involves obtaining the difference between each of the values and a value k2
n
. The value k is chosen as the smallest integer for the difference to be less than 2
n
. The differences are stored in a n-bit wide first memory in order of increasing magnitude of the values. Each of the differences is referenced by an address. For each k value, the address of the smallest difference is stored in a second memory as an overflow address. The method may further include updating the addresses in the first memory and, if necessary, in the second memory, when a new difference is inserted into the first memory. In this manner, the invention allows for the storage of values that may be wider than n bits without resorting to allocating more than n bits to store each of the values.
The method is applicable whether or not the values are accumulative. If the values are accumulative in nature, the n-bit values are updated along with any required updating of the addresses when a new difference is inserted into the first table.
To retrieve a value, the address of the difference stored in the first memory is compared with the overflow addresses stored in a second memory. The value of 2
n
is added to the difference if an overflow address is equal to or greater than the address. The comparing and adding steps are repeated for each overflow address less than the address of the difference. The final sum is the value to be retrieved.
Thus, it can be understood that the present invention can be implemented with minor code changes and yet bring about significant increase in the magnitude of the values that can be stored. These and various other features as well as advantages, which characterize the present invention, will be apparent from the following detailed description.


REFERENCES:
patent: 4935825 (1990-06-01), Worrell et al.
patent: 5271018 (1993-12-01), Chan
patent: 5541903 (1996-07-01), Funahashi et al.
patent: 5548572 (1996-08-01), Kulakowski et al.
patent: 5615190 (1997-03-01), Best et al.
patent: 5848438 (1998-12-01), Nemazie et al.
patent: 5937435 (1999-08-01), Dobbek et al.
patent: 5956307 (1999-09-01), Koudo et al.
patent: 6025966 (2000-02-01), Nemazie et al.
patent: 6098187 (2000-08-01), Takahashi

Affiliated with

Also associated with

Rating

Method of overflow-based defect management representation does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method of overflow-based defect management representation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of overflow-based defect management representation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3089088