0% found this document useful (0 votes)
53 views

Error Correction

Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
53 views

Error Correction

Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Presentation

Theme: “Error correction”.


Prepared by:Rakhym N.A.
Khalmirzaeva A.E.
Group: M1703-21
Checked by: Zhorabekova A.N.
 
 
 
Shymkent-2021
Plan:
• Introduction
• Types of error correction
• Error detection schemes
• Application
• Conclusion
• References
Introduction
• All error-detection and correction schemes add some redundancy (i.e., some extra data) to a
message, which receivers can use to check consistency of the delivered message, and to
recover data that has been determined to be corrupted. Error-detection and correction
schemes can be either systematic or non-systematic. In a systematic scheme, the transmitter
sends the original data, and attaches a fixed number of check bits (or parity data), which are
derived from the data bits by some deterministic algorithm. If only error detection is
required, a receiver can simply apply the same algorithm to the received data bits and
compare its output with the received check bits; if the values do not match, an error has
occurred at some point during the transmission. In a system that uses a non-systematic code,
the original message is transformed into an encoded message carrying the same information
and that has at least as many bits as the original message.
• Good error control performance requires the scheme to be selected based on the
characteristics of the communication channel. Common channel models include memoryless
models where errors occur randomly and with a certain probability, and dynamic models
where errors occur primarily in bursts. Consequently, error-detecting and correcting codes
can be generally distinguished between random-error-detecting/correcting and burst-error-
detecting/correcting. Some codes can also be suitable for a mixture of random errors and
burst errors.
• Hybrid ARQ is a combination of ARQ and forward error correction. There are two basic approaches: [10] Hybrid schemes
• Messages are always transmitted with FEC parity data (and error-detection redundancy). A receiver decodes a message using
the parity information, and requests retransmission using ARQ only if the parity data was not sufficient for successful
decoding (identified through a failed integrity check).
• Forward error correction (FEC) is a process of adding redundant data such as an error-correcting code (ECC) to a message so
Forward error
that it can be recovered by a receiver even when a number of errors (up to the capability of the code being used) were correction
introduced, either during the process of transmission, or on storage. 
• The actual maximum code rate allowed depends on the error-correcting code used, and may be lower. This is because
Shannon's proof was only of existential nature, and did not show how to construct codes which are both optimal and have 
efficient encoding and decoding algorithms.
Automatic repeat
• Automatic Repeat reQuest (ARQ) is an error control method for data transmission that makes use of error-detection codes,
request (ARQ)
acknowledgment and/or negative acknowledgment messages, and timeouts to achieve reliable data transmission.
An acknowledgment is a message sent by the receiver to indicate that it has correctly received a data frame.
• For example, ARQ is used on shortwave radio data links in the form of ARQ-E, or combined with multiplexing as ARQ-M.
There are three major types of error correction.
Types of error correction
Error detection schemes

Minimum
• A random-error-correcting code based on 
minimum distance coding can provide a strict guarantee on
the number of detectable errors, but it may not protect

distance
against a preimage attack

coding
• A repetition code is a coding scheme that repeats the bits
across a channel to achieve error-free communication.

Repetition Given a stream of data to be transmitted, the data are


divided into blocks of bits. Each block is transmitted some
predetermined number of times. For example, to send the

codes bit pattern "1011", the four-bit block can be repeated three
times, thus producing "1011 1011 1011". If this twelve-bit
pattern was received as "1010 1011 1011" – where the first
block is unlike the other two – an error has occurred.
Application

• Applications that require low latency (such as telephone conversations) cannot use 
automatic repeat request (ARQ); they must use forward error correction (FEC). By
the time an ARQ system discovers an error and re-transmits it, the re-sent data will
arrive too late to be usable.
• Applications where the transmitter immediately forgets the information as soon as
it is sent (such as most television cameras) cannot use ARQ; they must use FEC
because when an error occurs, the original data is no longer available.
• Applications that use ARQ must have a return channel; applications having no
return channel cannot use ARQ.
• Applications that require extremely low error rates (such as digital money
transfers) must use ARQ due to the possibility of uncorrectable errors with FEC.
• Reliability and inspection engineering also make use of the theory of error-
correcting codes.
Error-correcting memory

• Dynamic random-access memory  (DRAM) may provide stronger protection


against soft errors by relying on error-correcting codes. Such error-correcting
memory, known as ECC or EDAC-protected memory, is particularly desirable
for mission-critical applications, such as scientific computing, financial,
medical, etc. as well as extraterrestrial applications due to the increased 
radiation in space.
• Error-correcting memory controllers traditionally use Hamming codes,
although some use triple modular redundancy . Interleaving allows distributing
the effect of a single cosmic ray potentially upsetting multiple physically
neighboring bits across multiple words by associating neighboring bits to
different words. As long as a single-event upset (SEU) does not exceed the
error threshold (e.g., a single error) in any particular word between accesses, it
can be corrected (e.g., by a single-bit error-correcting code), and the illusion of
an error-free memory system may be maintained.
Conclusion

• Whichever way you go about correcting your students, try to keep the experience
positive for the learner. Being corrected constantly can be a really de-motivating,
as every language learner knows. As you are listening out for your students’ errors,
make sure you also listen out for really good uses of language and highlight these
to the group too. In the case of language learning I really do believe the classic
saying, ‘you learn from your mistakes’.
Questions:
What is the role of error in language learning?

What decisions do teachers need to make


regarding error correction?

What techniques can teachers use to correct


student errors?
References:
• Pratico, Gary D.; Pelt, Miles V. Van (2009). 
Basics of Biblical Hebrew Grammar: Second Edition . Zondervan. ISBN 
978-0-310-55882-8.
• ^ Mounce, William D. (2007). 
Greek for the Rest of Us: Using Greek Tools Without Mastering Biblical Languages .
Zondervan. p. 289. ISBN 978-0-310-28289-1.
• ^ Mishneh Torah, Tefillin, Mezuzah, and Sefer Torah, 1:2. Example English
translation: Eliyahu Touger. The Rambam's Mishneh Torah. Moznaim
Publishing Corporation.
• ^ Brian M. Fagan (5 December 1996). "Dead Sea Scrolls". 
The Oxford Companion to Archaeology . Oxford University Press . ISBN 0195076184
.
• ^ Thompson, Thomas M. (1983), From Error-Correcting Codes through Sphere
Packings to Simple Groups, The Carus Mathematical Monographs (#21), The
Mathematical Association of America, p. vii, ISBN 0-88385-023-0

You might also like