• DocumentCode
    855535
  • Title

    Fast discrete Pascal transform

  • Author

    Skodras, A.N.

  • Author_Institution
    Dept. of Comput. Sci., Hellenic Open Univ., Patras
  • Volume
    42
  • Issue
    23
  • fYear
    2006
  • Firstpage
    1367
  • Lastpage
    1368
  • Abstract
    An efficient structure for the fast computation of the discrete Pascal transform (DPT) is presented. Only frac12N(N-1) additions are required for the computation of an N-point DPT as opposed to N2 multiplications and N(N-1) additions. The reduced computational complexity of the proposed algorithm results in significant time savings and software/hardware simplicity
  • Keywords
    computational complexity; discrete transforms; polynomial matrices; N-point transform; computational complexity; fast discrete Pascal transform;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:20062588
  • Filename
    4027833
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=855535