Detecting and Correcting Errors - MIT
Fall 2006Detecting and Correcting Errors , Slide 1Detecting andCorrecting Errors Codewords and Hamming Distance Error Detection: parity Single-bit Error Correction Burst Error Correction Fall 2006Detecting and Correcting Errors , Slide 2There s good news and bad good news: Our digital modulation scheme usually allows us to recover the original signal despite small amplitude Errors introduced by the components and example of the digital abstraction doing its job!The bad news: larger amplitude Errors (hopefully infrequent) that change the signal irretrievably. These show up as bit errorsin our digital data Fall 2006Detecting and Correcting Errors , Slide 3Channel codingOur plan to deal with bit Errors :We ll add redundant information to the transmitted bit stream (a process called channel coding) so that we can detect Errors at the receiver. Ideally we d like to correct commonly occurring Errors , , error bursts of bounded length. Otherwise, we should detect uncorrectable Errors and use, say, retransmission to deal with the problem.
6.082 Fall 2006 Detecting and Correcting Errors, Slide 2 There’s good news and bad news… The good news: Our digital modulation scheme usually allows us to recover the original signal despite small amplitude errors introduced by the components and channel. An example of the digital abstraction doing its job!
Download Detecting and Correcting Errors - MIT
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: