Error handling in hard disk, Computer Engineering

Assignment Help:

Error handling in Hard disk in computer architecture:

Modern drives also make widespread use of Error Correcting Codes (ECCs), specifically Reed-Solomon error correction. These techniques store additional bits for each block of data that are resolute by mathematical formulas. The extra bits permit many errors to be fixed. Whereas these additional bits occupy space on the hard drive, they permit higher recording densities to be employed, resulting in much higher storage capacity for user data. In the year 2009, in the newest drives, low-density parity-check codes (LDPC) are supplanting Reed-Solomon. LDPC codes are able performance near to the Shannon Limit and therefore allow for the highest storage density available.

Typical hard drives effort to "remap" the data in a physical sector that will be bad to a spare physical sector-hopefully whilst the number of errors in that bad sector is still little enough that the E CC can fully recover the data without loss.

 

 


Related Discussions:- Error handling in hard disk

Determine the object design of object oriented modelling, Determine the Obj...

Determine the Object Design of Object oriented modelling Object Design:   At this phase, a design model is created based on the analysis model which is already created in the

How many bits must be decoded for 128 × 8 ram chips, How many bits must be ...

How many bits must be decoded for chip select? What is the size of decoder when 128 × 8 RAM chips are required to provide a memory capacity of 2048 bytes? Ans. All higher order l

What is non-volatile bios, Nonvolatile BIOS memory refers to a small memory...

Nonvolatile BIOS memory refers to a small memory on PC motherboards that is used to kept BIOS settings. It was traditionally known as CMOS RAM because it used a volatile, low-power

Find simplified function f and implement, Q. Find simplified function F and...

Q. Find simplified function F and implement that function using only NAND gates. 1. F(A,B,C) = (A+B) (A'+B+C') (A'+B'+C') 2. F (A,B,C) = A'B'C'+B'CD'+A'BCD'+AB'C' 3. F(X,Y

Rule in a single direction - equivalences rules, Rule in a single direction...

Rule in a single direction - equivalences rules: Hence there the power to replace  sub expressions always allows use to prove theorems with equivalences: as given in the above

Explain the term recursion, Explain the term recursion A recursive functi...

Explain the term recursion A recursive function is one which calls itself. Recursive functions are useful in evaluating certain types of mathematical function. Here is a recursiv

Define a socket, Define a socket? An application program interface give...

Define a socket? An application program interface gives the details of how can an application program interacts along with protocol software. But socket API is a defacto standa

Algebraic method for simplification of boolean expressions, Define Algebrai...

Define Algebraic method for Simplification of the Boolean Expressions This method is depend on the by knowledge of the Boolean algebra. Expression can be making simpler by usin

Explain pipelining, Define pipelining Pipelining is an efficient way of...

Define pipelining Pipelining is an efficient way of organizing concurrent activity in a computer system. The processor implements the program by fetching and implementing instr

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd