Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 128 views

    Lecture16 - Error Detection

    Uploaded by

    rashmi
    Networks must transmit data accurately. Errors can occur during transmission and must be detected and corrected. There are three main types of errors: single-bit errors, which are rare; burst errors, where multiple consecutive bits are corrupted; and random errors. Error detection uses redundancy to detect errors without accessing the original data. Common detection techniques include vertical redundancy checks, longitudinal redundancy checks, and cyclic redundancy checks using polynomials or checksums. Error correction can involve retransmission or forward error correction using techniques like Hamming codes to correct single-bit errors.

    Copyright:

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

    Lecture16 - Error Detection

    Uploaded by

    rashmi
    128 views41 pages
    Networks must transmit data accurately. Errors can occur during transmission and must be detected and corrected. There are three main types of errors: single-bit errors, which are rare; burst errors, where multiple consecutive bits are corrupted; and random errors. Error detection uses redundancy to detect errors without accessing the original data. Common detection techniques include vertical redundancy checks, longitudinal redundancy checks, and cyclic redundancy checks using polynomials or checksums. Error correction can involve retransmission or forward error correction using techniques like Hamming codes to correct single-bit errors.

    Original Title

    Lecture16_Error detection.ppt

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Networks must transmit data accurately. Errors can occur during transmission and must be detected and corrected. There are three main types of errors: single-bit errors, which are rare; burst errors, where multiple consecutive bits are corrupted; and random errors. Error detection uses redundancy to detect errors without accessing the original data. Common detection techniques include vertical redundancy checks, longitudinal redundancy checks, and cyclic redundancy checks using polynomials or checksums. Error correction can involve retransmission or forward error correction using techniques like Hamming codes to correct single-bit errors.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    128 views41 pages

    Lecture16 - Error Detection

    Uploaded by

    rashmi
    Networks must transmit data accurately. Errors can occur during transmission and must be detected and corrected. There are three main types of errors: single-bit errors, which are rare; burst errors, where multiple consecutive bits are corrupted; and random errors. Error detection uses redundancy to detect errors without accessing the original data. Common detection techniques include vertical redundancy checks, longitudinal redundancy checks, and cyclic redundancy checks using polynomials or checksums. Error correction can involve retransmission or forward error correction using techniques like Hamming codes to correct single-bit errors.

    Copyright:

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

    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.
    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
    Vertical Redundancy Check
    VRC
    Performance
    It can detect burst errors only if the total
    number of errors is odd.
    Longitudinal Redundancy Check
    LRC
    Performance

    LCR increases the likelihood of detecting


    burst errors.
    If two bits in one data units are damaged
    and two bits in exactly the same positions in
    another data unit are also damaged, the LRC
    checker will not detect an error.
    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
    Checksum
    At the sender
    The unit is divided into k sections, each of n
    bits.
    All sections are added together using ones
    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 ones
    complement to get the sum.
    The sum is complemented.
    If the result is zero, the data are accepted:
    otherwise, they are rejected.
    Performance
    The checksum detects all errors involving an
    odd number of bits.
    It detects most errors involving an even number
    of bits.
    If one or more bits of a segment are damaged
    and the corresponding bit or bits of opposite
    value in a second segment are also damaged, the
    sums of those columns will not change and the
    receiver will not detect a problem.
    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.
    Main methods of error correction

    Forward Error Correction


    Retransmission

    Forward error correction is the process in which the receiver tries


    to guess the message by using redundant bits. This is possible, if the
    number of errors is small.

    Correction by retransmission is a technique in which the receiver


    detects the occurrence of an error and asks the sender to resend the
    message.
    Single-bit error correction
    To correct an error, the receiver reverses the value
    of the altered bit. To do so, it must know which bit
    is in error.
    Number of redundancy bits needed
    Let data bits = m
    Redundancy bits = r
    Total message sent = m+r
    The value of r must satisfy the following relation:
    2r m+r+1
    Error Correction
    Hamming Code
    Hamming Code
    Hamming Code
    Example of Hamming Code
    Single-bit error
    Error
    Detection

    You might also like