Computing the Inverse DFT with the In-Place, In-Order Prime Factor FFT Algorithm

Kin Man Lam; Hong Yan

doi:10.1109/78.414783

Computing the Inverse DFT with the In-Place, In-Order Prime Factor FFT Algorithm

Kin Man Lam, Hong Yan

Research output: Journal article publication › Journal article › Academic research › peer-review

4 Citations (Scopus)

Abstract

In this correspondence, we present a method for computing the inverse discrete Fourier transform (IDFT) by the in-place, in-order prime factor FFT algorithm (PFA). This is achieved by modifying the input and the output index mapping equations. This approach does not result in any additional cost in terms of program length and computational time.

Original language	English
Pages (from-to)	2193-2194
Number of pages	2
Journal	IEEE Transactions on Signal Processing
Volume	43
Issue number	9
DOIs	https://doi.org/10.1109/78.414783
Publication status	Published - 1 Jan 1995
Externally published	Yes

ASJC Scopus subject areas

Signal Processing
Electrical and Electronic Engineering

More information

10.1109/78.414783

Cite this

@article{314bf1f92286422aabc01d830434f6c2,

title = "Computing the Inverse DFT with the In-Place, In-Order Prime Factor FFT Algorithm",

abstract = "In this correspondence, we present a method for computing the inverse discrete Fourier transform (IDFT) by the in-place, in-order prime factor FFT algorithm (PFA). This is achieved by modifying the input and the output index mapping equations. This approach does not result in any additional cost in terms of program length and computational time.",

author = "Lam, {Kin Man} and Hong Yan",

year = "1995",

month = jan,

day = "1",

doi = "10.1109/78.414783",

language = "English",

volume = "43",

pages = "2193--2194",

journal = "IEEE Transactions on Signal Processing",

issn = "1053-587X",

publisher = "IEEE",

number = "9",

}

TY - JOUR

T1 - Computing the Inverse DFT with the In-Place, In-Order Prime Factor FFT Algorithm

AU - Lam, Kin Man

AU - Yan, Hong

PY - 1995/1/1

Y1 - 1995/1/1

N2 - In this correspondence, we present a method for computing the inverse discrete Fourier transform (IDFT) by the in-place, in-order prime factor FFT algorithm (PFA). This is achieved by modifying the input and the output index mapping equations. This approach does not result in any additional cost in terms of program length and computational time.

AB - In this correspondence, we present a method for computing the inverse discrete Fourier transform (IDFT) by the in-place, in-order prime factor FFT algorithm (PFA). This is achieved by modifying the input and the output index mapping equations. This approach does not result in any additional cost in terms of program length and computational time.

UR - http://www.scopus.com/inward/record.url?scp=0029378610&partnerID=8YFLogxK

U2 - 10.1109/78.414783

DO - 10.1109/78.414783

M3 - Journal article

SN - 1053-587X

VL - 43

SP - 2193

EP - 2194

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

IS - 9

ER -

Computing the Inverse DFT with the In-Place, In-Order Prime Factor FFT Algorithm

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this