Scribd Logo
Upload

Welcome to Scribd!

  • 178 views

    3 Error Detection and Correction

    Uploaded by

    Naveen Thotapalli
    Networks must reliably transfer data between devices. Errors can occur during transmission and must be detected and corrected for reliable communication. There are three main types of errors: single-bit errors, which are rare; multiple-bit errors; and burst errors, where a group of bits are corrupted. Error detection techniques like parity checks and cyclic redundancy checks allow a receiver to detect if an error occurred without the original data, while error correction codes like Hamming codes allow detection and correction of certain errors.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    3 Error Detection and Correction

    Uploaded by

    Naveen Thotapalli
    178 views33 pages
    Networks must reliably transfer data between devices. Errors can occur during transmission and must be detected and corrected for reliable communication. There are three main types of errors: single-bit errors, which are rare; multiple-bit errors; and burst errors, where a group of bits are corrupted. Error detection techniques like parity checks and cyclic redundancy checks allow a receiver to detect if an error occurred without the original data, while error correction codes like Hamming codes allow detection and correction of certain errors.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Networks must reliably transfer data between devices. Errors can occur during transmission and must be detected and corrected for reliable communication. There are three main types of errors: single-bit errors, which are rare; multiple-bit errors; and burst errors, where a group of bits are corrupted. Error detection techniques like parity checks and cyclic redundancy checks allow a receiver to detect if an error occurred without the original data, while error correction codes like Hamming codes allow detection and correction of certain errors.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    178 views33 pages

    3 Error Detection and Correction

    Uploaded by

    Naveen Thotapalli
    Networks must reliably transfer data between devices. Errors can occur during transmission and must be detected and corrected for reliable communication. There are three main types of errors: single-bit errors, which are rare; multiple-bit errors; and burst errors, where a group of bits are corrupted. Error detection techniques like parity checks and cyclic redundancy checks allow a receiver to detect if an error occurred without the original data, while error correction codes like Hamming codes allow detection and correction of certain errors.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 33

    Error Detection

    and Correction

    • Types of Errors
    • Detection
    • Correction
    Basic concepts
     Networks must be able to transfer data from
    one device to another with complete accuracy.
     Data can be corrupted during transmission.
     For reliable communication, errors must be
    detected and corrected.
    Error detection and correction
    are implemented either at the data link
    layer or the transport layer of the OSI
    model.
    Types of Errors
    Single-bit error
    Single bit errors are the least likely type of
    errors in serial data transmission because
    the noise must have a very short duration
    which is very rare. However this kind of
    errors can happen in parallel transmission.
    Example:
    If data is sent at 1Mbps then each bit lasts
    only 1/1,000,000 sec. or 1 μs.
    For a single-bit error to occur, the noise
    must have a duration of only 1 μs, which is
    very rare.
    Multiple-bit error
    Burst error
    The term burst error means that two or
    more bits in the data unit have changed
    from 1 to 0 or from 0 to 1.

    Burst errors does not necessarily mean


    that the errors occur in consecutive bits,
    the length of the burst is measured from the
    first corrupted bit to the last corrupted bit.
    Some bits in between may not have been
    corrupted.
    Burst error is most likely to happen in serial
    transmission since the duration of noise is
    normally longer than the duration of a bit.
    The number of bits affected depends on the data
    rate and duration of noise.
    Example:
    If data is sent at rate = 1Kbps then a noise of 1/100 sec
    can affect 10 bits.(1/100*1000)

    If same data is sent at rate = 1Mbps then a noise of


    1/100 sec can affect 10,000 bits.(1/100*106)
    Error detection
    Error detection means to decide whether the
    received data is correct or not without having a
    copy of the original message.

    Error detection uses the concept of redundancy,


    which means adding extra bits for detecting
    errors at the destination.
    Redundancy
    Four types of redundancy checks are used
    in data communications
    Simple Parity Check
    Two-Dimensional Parity Check
    Two-dimensional parity-check code
    Two-dimensional parity-check code
    Cyclic Redundancy Check
    CRC
    Cyclic Redundancy Check
    • Given a k-bit frame or message, the
    transmitter generates an n-bit sequence,
    known as a frame check sequence (FCS), so
    that the resulting frame, consisting of (k+n)
    bits, is exactly divisible by some
    predetermined number.
    • The receiver then divides the incoming
    frame by the same number and, if there is
    no remainder, assumes that there was no
    error.
    Binary Division
    Polynomial
    Polynomial and Divisor
    Standard Polynomials
    Checksum
    At the sender
    The unit is divided into k sections, each of n
    bits.
    All sections are added together using one’s
    complement to get the sum.
    The sum is complemented and becomes the
    checksum.
    The checksum is sent with the data
    At the receiver
    The unit is divided into k sections, each of n
    bits.
    All sections are added together using one’s
    complement to get the sum.
    The sum is complemented.
    If the result is zero, the data are accepted:
    otherwise, they are rejected.
    Error Correction
    It can be handled in two ways:
    1) Receiver can have the sender retransmit
    the entire data unit.
    2) The receiver can use an error-correcting
    code, which automatically corrects certain
    errors.
    Hamming Code
    Hamming Code
    Hamming Code
    Hamming Code
    Example of Hamming Code
    Single-bit error
    Error
    Detection

    You might also like