• DocumentCode
    1237146
  • Title

    On iterative arrays for the Euclidean algorithm over finite fields

  • Author

    Mandelbaum, David M.

  • Volume
    38
  • Issue
    10
  • fYear
    1989
  • fDate
    10/1/1989 12:00:00 AM
  • Firstpage
    1473
  • Lastpage
    1478
  • Abstract
    Iterative arrays are described which implement the extended Euclidean algorithm over finite fields with characteristic two and are designed to have throughputs in the area of hundreds of megabits per second. A special form of the Euclidean algorithm is the basis of these arrays, which can be used for error decoding. The propagation time through the array is derived as a function of the degree of the input polynomials
  • Keywords
    decoding; error correction codes; Euclidean algorithm; error decoding; finite fields; iterative arrays; Delay; Error correction codes; Galois fields; Iterative algorithms; Iterative decoding; Polynomials; Read only memory; Reed-Solomon codes; Throughput; Very large scale integration;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.35844
  • Filename
    35844
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1237146