Scribd Logo
Upload

Welcome to Scribd!

  • CRC Example Shifted Polynomial Method

    Uploaded by

    Crisputin86
    76 views6 pages
    The document describes the transmission of data using a polynomial format with a forward error correction code (FEC). The sender expresses the data as a polynomial and adds a 3-bit FEC to the end. It then performs calculations on the polynomial patterns. The receiver receives the data, adds the expected 3-bit FEC, and performs the same calculations. It detects no errors, indicating successful transmission.

    Original Description:

    CRC example for polynomial method

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes the transmission of data using a polynomial format with a forward error correction code (FEC). The sender expresses the data as a polynomial and adds a 3-bit FEC to the end. It then performs calculations on the polynomial patterns. The receiver receives the data, adds the expected 3-bit FEC, and performs the same calculations. It detects no errors, indicating successful transmission.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    76 views6 pages

    CRC Example Shifted Polynomial Method

    Uploaded by

    Crisputin86
    The document describes the transmission of data using a polynomial format with a forward error correction code (FEC). The sender expresses the data as a polynomial and adds a 3-bit FEC to the end. It then performs calculations on the polynomial patterns. The receiver receives the data, adds the expected 3-bit FEC, and performs the same calculations. It detects no errors, indicating successful transmission.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 6

    SENDER

    Polynomial X16 + X15 + X14 + X13 + X12 + X11 +

    Data 1

    Pattern

    Data expressed in
    polynomial format X11 +

    FCS = 3 bits which means that 000 are added to the end of the data
    1 1 0 1
    Shifted Polynomial
    data X14 +

    Polynomial Pattern X3 +

    X11 + X7 +

    X3 + X2 + X0 (1) X14 + X13 +


    X14 + X13 +

    FCS= X1 + X0 =011 in binary because of three bits for FCS


    X10 + X9 + X8 + X7 + X6 + X5 + X4 + X3 +

    1 0 1 1 1 0 0 1

    X10 + X8 + X7 + X6 + X3 + X2 + X1 *

    1 1 0 0 1 1 1 0

    X13 + X11 + X10 + X9 + X6 + X5 + X4

    X2 + X0

    X4 + X2 + X1 + X0

    X11 + X10 + X9 + X6 + X5 + X4
    X11
    X10 + X9 + X6 + X5 + X4
    X10 + X9 + X7
    X7 + X6 + X5 + X4
    X7 + X6 + X4
    X5
    X5 + X4 + X2
    X4 + X2
    X4 + X3 + X1
    X3 + X2 + X1
    X3 + X2 + X0
    X1 + X0

    ee bits for FCS


    X2 + X1 + X0 +

    1 1 0

    1 0 1

    X3

    0 0 0
    RECEIVER
    Polynomial X16 + X15 + X14 + X13 + X12 + X11 +

    Data 1

    Pattern

    Data expressed
    in polynomial
    format X11 +

    FCS = 011 which needs to be added to the data at the end

    Data + FCS 1 1 0 1

    Shifted
    Polynomial data X14 +

    Polynomial
    Pattern X3 +

    X11 + X7 +

    X3 + X2 + X0 X14 + X13 +
    X14 + X13 +

    FCS= zero so no errors detected. Transmission successful


    X10 + X9 + X8 + X7 + X6 + X5 + X4 + X3 +

    1 0 1 1 1 0 0 1

    X10 + X8 + X7 + X6 + X3 + X2 + X1

    1 1 0 0 1 1 1 0

    X13 + X11 + X10 + X9 + X6 + X5 + X4 + X1 +

    X2 + X0

    X4 + X2 + X1 + X0

    X11 + X10 + X9 + X6 + X5 + X4 + X1 + X0
    X11
    X10 + X9 + X6 + X5 + X4 + X1 + X0
    X10 + X9 + X7
    X7 + X6 + X5 + X4 + X1 + X0
    X7 + X6 + X4
    X5 X1 + X0
    X5 + X4 + X2
    X4 + X2 + X1 + X0
    X4 + X3 + X1
    X3 + X2 + X0
    X3 + X2 + X0
    0
    X2 + X1 + X0 +

    1 1 0

    1 0 1

    0 1 1

    X0

    You might also like