• DocumentCode
    2410321
  • Title

    Erasure Correcting Capability of SPC Product Codes

  • Author

    Amutha, R.

  • Author_Institution
    Electron. & Commun. Eng. Dept., Sri Venkateswara Coll. of Eng., Tamilnadu
  • fYear
    2007
  • fDate
    22-24 Feb. 2007
  • Firstpage
    183
  • Lastpage
    188
  • Abstract
    Product codes are powerful codes that can be used to correct errors or recover erasures. The simplest form of a product code is that where every row and every column is terminated by a single parity bit referred to as single parity check (SPC) product code. This code has a minimum distance of four and is thus guaranteed to recover all single, double, and triple erasure patterns. Judging the code performance based on its minimum distance is very pessimistic because the code is actually capable of recovering many higher erasure patterns. A detailed mathematical analysis has been carried out for erasure pattern of the SPC product code. We derive a formula for finding the number of unrecoverable basic pattern and the number of recoverable pattern generated from the unrecoverable basic pattern. The post decoding rate is calculated for SPC product code. Our results are in good agreement with Kousa (2002). Simulation results show that the error correcting capability of the SPC product code is beyond the minimum distance
  • Keywords
    decoding; error correction codes; parity check codes; product codes; SPC product code; decoding; error correction; minimum distance; single parity check; Bit error rate; Buffer overflow; Encoding; Error correction codes; Iterative decoding; Mathematical analysis; Parity check codes; Performance analysis; Product codes; Two dimensional displays; Erasure decoding; product code; recoverable basic pattern; single parity check (SPC) codes; unrecoverable basic pattern;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing, Communications and Networking, 2007. ICSCN '07. International Conference on
  • Conference_Location
    Chennai
  • Print_ISBN
    1-4244-0997-7
  • Electronic_ISBN
    1-4244-0997-7
  • Type

    conf

  • DOI
    10.1109/ICSCN.2007.350727
  • Filename
    4156609