• DocumentCode
    696876
  • Title

    Number theoretic transform modulo K.2N+1, a prime

  • Author

    Bhattacharya, M. ; Astola, J.

  • Author_Institution
    Tampere International Center for Signal Processing, Tampere University of Technology, P.O. Box 553, Tampere, FIN 33101, Finland
  • fYear
    2000
  • fDate
    4-8 Sept. 2000
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Due to its simple and real arithmetic structure Number Theoretic Transform is attractive for computation of convolution. However, there exists a stringent relation between the choice of modulus M and convolution length. Choice of modulus as K.2N+1, a prime, leads to relaxation of this constraint and wide choices of wordlength, with each of these associated with many choices of convolution length are are obtained. Under these choice of modulus a computational structure when the convolution length is a perfect square is presented.
  • Keywords
    Convolution; Read only memory; Signal processing algorithms; Speech; Speech processing; Transforms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing Conference, 2000 10th European
  • Conference_Location
    Tampere, Finland
  • Print_ISBN
    978-952-1504-43-3
  • Type

    conf

  • Filename
    7075498
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=696876