A recursive fast Fourier transformation algorithm
type: Item
instance of: scholarly article
title: A recursive fast Fourier transformation algorithm
zbMATH Open document ID: 0869.65083
DOI: 10.1109/82.466641
author: Annamária R. Várkonyi-Kóczy
published in: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
publication date: 1997-09-01T00:00:00Z
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 1014321
zbMATH Keywords: parallel computation
zbMATH Keywords: filter-bank structure
zbMATH Keywords: recursive discrete transformation
zbMATH Keywords: polyphase filtering
zbMATH Keywords: fast Fourier transformation
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1109/82.466641
OpenAlex ID: W2081249859
Recommended article: Q3725511
Recommended article: On a fast algorithm for computing the Fourier transform
Recommended article: Q3746793
Recommended article: Q5186696
Recommended article: A fast recursive algorithm for the discrete sine transform
Recommended article: Q4298259
Recommended article: Q3713553
Recommended article: Rapid Computation of the Discrete Fourier Transform
Recommended article: Fast and precise Fourier transforms
Recommended article: Q4314094
description: scientific article; zbMATH DE number 1014321