• DocumentCode
    1653444
  • Title

    DFT computation for overlapping data segments

  • Author

    Stasinski, R.

  • Author_Institution
    Inst. Elektroniki i Telekomunikacji, Politechnika Poznanska, Poland
  • fYear
    1991
  • Firstpage
    396
  • Abstract
    A DFT algorithm for overlapping data segments requiring O(NlogK) and not the usual O(N logN) operations is described. K is the number of new input data samples. The algorithm forms a basis for an improved block-filtering algorithm requiring O(NlogK) operations. The same computational complexity can be achieved for the adaptive version of block-filtering algorithm, if the improved algorithm for frequency-domain sampled filters is introduced
  • Keywords
    adaptive filters; computational complexity; fast Fourier transforms; filtering and prediction theory; DFT algorithm; adaptive version; block-filtering algorithm; computational complexity; frequency-domain sampled filters; overlapping data segments; Adaptive filters; Computational complexity; Filtering algorithms; Flexible printed circuits; Frequency domain analysis; Spectral analysis; Telecommunication computing; Time frequency analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electrotechnical Conference, 1991. Proceedings., 6th Mediterranean
  • Conference_Location
    LJubljana
  • Print_ISBN
    0-87942-655-1
  • Type

    conf

  • DOI
    10.1109/MELCON.1991.161860
  • Filename
    161860
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1653444