• DocumentCode
    1537258
  • Title

    Prefolding in FHT algorithms

  • Author

    Prabu, K.M.M. ; Anupindi, N.

  • Author_Institution
    Dept. of Electr. Eng., Indian Inst. of Technol., Madras, India
  • Volume
    27
  • Issue
    11
  • fYear
    1991
  • fDate
    5/23/1991 12:00:00 AM
  • Firstpage
    940
  • Lastpage
    941
  • Abstract
    A generalised approach to prefolding the input sequence of the FHT algorithms m times for a radix-r case is introduced. The resulting output sequence is found, in the case of a decaying input sequence to have the same spectral shape and resolution as the output sequence obtained with the nearest higher two-power sequence length input using zero padding. By this procedure, a significant reduction in the required amount of arithmetic can be obtained.
  • Keywords
    signal processing; transforms; FHT; FHT algorithms; decaying input sequence; input sequence; output sequence; prefolding; radix-r case; resolution; spectral shape; zero padding;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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