• DocumentCode
    967525
  • Title

    Arithmetic for ternary number-theoretic transforms

  • Author

    Sunder, S. ; Antoniou, A.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
  • Volume
    40
  • Issue
    8
  • fYear
    1993
  • fDate
    8/1/1993 12:00:00 AM
  • Firstpage
    529
  • Lastpage
    531
  • Abstract
    A simplified arithmetic for the computation of ternary number-theoretic transforms is presented. The proposed arithmetic is based on the application of a code translation technique that was used by L.M. Leibowitz (1976) for the development of a simplified binary arithmetic for the computation of the Fermat number-theoretic transform
  • Keywords
    digital arithmetic; transforms; code translation technique; simplified binary arithmetic; ternary number-theoretic transforms; Arithmetic; Convolution; Convolutional codes; Discrete Fourier transforms; Discrete transforms; Fourier transforms; Galois fields; In vitro fertilization; Roundoff errors; Sufficient conditions;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1057-7130
  • Type

    jour

  • DOI
    10.1109/82.242344
  • Filename
    242344
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=967525