• DocumentCode
    941584
  • Title

    Fast polynomial transform and its implementation by computer

  • Author

    Reed, I.S. ; Shao, H.M. ; Truong, T.K.

  • Author_Institution
    University of Southern California, Department of Electrical Engineering, Los Angeles, USA
  • Volume
    128
  • Issue
    2
  • fYear
    1981
  • fDate
    3/1/1981 12:00:00 AM
  • Firstpage
    50
  • Lastpage
    60
  • Abstract
    Recently a new algorithm was developed to compute two-dimensional cyclic convolution by what is called the FPT (fast polynomial transform) algorithm. In this paper this new algorithm is further studied and implemented on a general purpose computer. Methods to cope with finite core memory limitations are presented and actual computational speed performances are listed.
  • Keywords
    polynomials; transforms; FPT; fast polynomial transform; two-dimensional cyclic convolution;
  • fLanguage
    English
  • Journal_Title
    Computers and Digital Techniques, IEE Proceedings E
  • Publisher
    iet
  • ISSN
    0143-7062
  • Type

    jour

  • DOI
    10.1049/ip-e.1981.0010
  • Filename
    4647616
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=941584