DFT/FFT and Convolution Algorithms: Theory and Implementation

Authors:
C.S. S. Burrus;Thomas W. Parks
Affiliations:
-;-
Venue:
DFT/FFT and Convolution Algorithms: Theory and Implementation
Year:
1991

Citing 0
Cited 32

Parallel algorithms for super performance

Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Design for fast DSP machine

ACM SIGARCH Computer Architecture News
Efficient Implementation Methodology of Fast FIR Filtering Algorithms on DSP

Journal of VLSI Signal Processing Systems - Special issue on the 1995 VLSI signal processing workshop
Analysis of Cache-Related Preemption Delay in Fixed-Priority Preemptive Scheduling

IEEE Transactions on Computers
Index Mapping Approach of Deriving the PM DFT Algorithms

IEEE Transactions on Computers
Model-based dummy feature placement for oxide chemical-mechanical polishing manufacturability

Proceedings of the 37th Annual Design Automation Conference
Bounding Cache-Related Preemption Delay for Real-Time Systems

IEEE Transactions on Software Engineering
Continually evaluating similarity-based pattern queries on a streaming time series

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The TMS320C30 Floating-Point Digital Signal Processor

IEEE Micro
How RISCy is DSP?

IEEE Micro
Block, Multistride Vector, and FFT Accesses in Parallel Memory Systems

IEEE Transactions on Parallel and Distributed Systems
Twiddle-Factor-Based FFT Algorithm with Reduced Memory Access

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The twenty-fourth fermat number is composite

Mathematics of Computation
A novel efficient algorithm for music transposition

Organised Sound
A review of time–frequency representations, with application to sound/music analysis–resynthesis

Organised Sound
Continuous Similarity-Based Queries on Streaming Time Series

IEEE Transactions on Knowledge and Data Engineering
An efficient computing of oddly stacked MDCT/MDST via evenly stacked MDCT/MDST and vice versa

Signal Processing
Representation of the Fourier Transform by Fourier Series

Journal of Mathematical Imaging and Vision
An exact FFT recovery theory: a nonsubtractive dither quantization approach with applications

EURASIP Journal on Applied Signal Processing
Fast discrete Fourier transform computations using the reduced adder graph technique

EURASIP Journal on Applied Signal Processing
A state-of-the-art elliptic curve cryptographic processor operating in the frequency domain

Mobile Networks and Applications
Optimal Extension Field Inversion in the Frequency Domain

WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Lower Bounds on the Continuation of Holomorphic Functions

Electronic Notes in Theoretical Computer Science (ENTCS)
Asymptotic behavior of random vandermonde matrices with entries on the unit circle

IEEE Transactions on Information Theory
The case for an all digital military satellite communications earth terminal

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Review: A survey of efficient MDCT implementations in MP3 audio coding standard: Retrospective and state-of-the-art

Signal Processing
Practical template attacks

WISA'04 Proceedings of the 5th international conference on Information Security Applications
Fast hypercomplex polar fourier analysis for image processing

PSIVT'11 Proceedings of the 5th Pacific Rim conference on Advances in Image and Video Technology - Volume Part II
ASIC implementation of high speed processor for calculating discrete Fourier transformation using circular convolution technique

WSEAS Transactions on Circuits and Systems
Efficient computation of the short-time DFT based on a modified radix-2 decimation-in-frequency algorithm

Signal Processing
Sequency-ordered generalized Walsh-Fourier transform

Signal Processing
An optimized reconfigurable power spectral density converter for real-time shrew DDoS attacks detection

Computers and Electrical Engineering

Quantified Score

Hi-index	0.07

Visualization

Abstract

From the Publisher:This readable handbook provides complete coverage of both the theory and implementation of modern signal processing algorithms for computing the Discrete Fourier transform. Reviews continuous and discrete-time transform analysis of signals and properties of DFT, several ways to compute the DFT at a few frequencies, and the three main approaches to an FFT. Practical, tested FORTRAN and assembly language programs are included with enough theory to adapt them to particular applications. Compares and evaluates various algorithms.