Logarithmic Pruning of FFT Frequencies

S. Barash; Ya'acov Ritov

doi:10.1109/78.205740

Logarithmic Pruning of FFT Frequencies

S. Barash
, Ya'acov Ritov

Department of Statistics

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

A standard fast Fourier transform (FFT) computes the transform at evenly spaced points on a linear scale. We suggest a simple modification of the FFT algorithm resulting in an efficient method to calculate the transform only at evenly spaced frequencies on a logarithmic scale. The saving in the number of operations, compared with a standard FFT, is around 60% for typical values.

Original language	English
Pages (from-to)	1398-1400
Number of pages	3
Journal	IEEE Transactions on Signal Processing
Volume	41
Issue number	3
DOIs	https://doi.org/10.1109/78.205740
State	Published - Mar 1993

Access to Document

10.1109/78.205740

Cite this

@article{ecc4ba83f93b470fa0bdd2c07171dad2,

title = "Logarithmic Pruning of FFT Frequencies",

abstract = "A standard fast Fourier transform (FFT) computes the transform at evenly spaced points on a linear scale. We suggest a simple modification of the FFT algorithm resulting in an efficient method to calculate the transform only at evenly spaced frequencies on a logarithmic scale. The saving in the number of operations, compared with a standard FFT, is around 60\% for typical values.",

author = "S. Barash and Ya'acov Ritov",

year = "1993",

month = mar,

doi = "10.1109/78.205740",

language = "אנגלית",

volume = "41",

pages = "1398--1400",

journal = "IEEE Transactions on Signal Processing",

issn = "1053-587X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - Logarithmic Pruning of FFT Frequencies

AU - Barash, S.

AU - Ritov, Ya'acov

PY - 1993/3

Y1 - 1993/3

N2 - A standard fast Fourier transform (FFT) computes the transform at evenly spaced points on a linear scale. We suggest a simple modification of the FFT algorithm resulting in an efficient method to calculate the transform only at evenly spaced frequencies on a logarithmic scale. The saving in the number of operations, compared with a standard FFT, is around 60% for typical values.

AB - A standard fast Fourier transform (FFT) computes the transform at evenly spaced points on a linear scale. We suggest a simple modification of the FFT algorithm resulting in an efficient method to calculate the transform only at evenly spaced frequencies on a logarithmic scale. The saving in the number of operations, compared with a standard FFT, is around 60% for typical values.

UR - https://www.scopus.com/pages/publications/0027554533

U2 - 10.1109/78.205740

DO - 10.1109/78.205740

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0027554533

SN - 1053-587X

VL - 41

SP - 1398

EP - 1400

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

IS - 3

ER -

Logarithmic Pruning of FFT Frequencies

Abstract

Access to Document

Other files and links

Fingerprint

Cite this