Scribd Logo
Upload

Welcome to Scribd!

  • Parity Eth

    Uploaded by

    thanh liêm lê
    34 views1 page
    The document discusses polynomial division and Reed-Solomon error correction codes. It explains that the data is divided into 8-bit symbols that are represented as polynomials. The symbols are then encoded into a polynomial over a Galois field using a generator polynomial G(x). The remainder of the division is used to generate the error correction codewords.

    Original Description:

    Original Title

    parity_eth.txt

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses polynomial division and Reed-Solomon error correction codes. It explains that the data is divided into 8-bit symbols that are represented as polynomials. The symbols are then encoded into a polynomial over a Galois field using a generator polynomial G(x). The remainder of the division is used to generate the error correction codewords.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    34 views1 page

    Parity Eth

    Uploaded by

    thanh liêm lê
    The document discusses polynomial division and Reed-Solomon error correction codes. It explains that the data is divided into 8-bit symbols that are represented as polynomials. The symbols are then encoded into a polynomial over a Galois field using a generator polynomial G(x). The remainder of the division is used to generate the error correction codewords.

    Copyright:

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

    G(x) = x^3 +1 -> kq = 3 bit

    datain : m(1) || m(2) || m(3) ||..... m(4)


    m(x) = 8 bit

    m(x) = m7 x^7 + m6 x^6 +++ m0


    p(x) = [m(1) * x^24 + m(2)x^16 + m(3)x^8 + m(4)] mod G(x)

    rmd(1) = rmd2 x^2 + rmd1 x^1 + rmd0 -> init to zero at start of message

    rmd(2) = m(1) mod G(x)

    next poly = rmd(2)*x^8 + m(2)

    ////////////////////////////////////

    m(x) = m(1) || m(2)


    = m(1) x^8 + m(2)

    m(1) = x^7 +1
    m(2) = x^2+1

    m(x) = x^15 + x^8 + x^2 +1

    1 0 0 0 0 0 0 1 x x x x x x x x x
    1 0 0 1 0 0 0 0

    0 0 0 1 0 0 0 1
    1 0 0 1
    1 1 xxxxxxxxx

    if(m7 == 1) result = m6:0 xor (g2:0) x^4


    else result = m6:0

    m[6:0] xor (m7?g[2:0] :0)

    if(result[6] == 1 ) result = result5:0 (xor g2:0) x^3


    else result = result5:0

    You might also like