Amanote Research

Amanote Research

    RegisterSign In

The Fast Fourier Transform Recursive Equations for Arbitrary Length Records

Mathematics of Computation - United States
doi 10.1090/s0025-5718-1967-0223120-2
Full Text
Open PDF
Abstract

Available in full text

Categories
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
Date

May 1, 1967

Authors
G. D. Bergland
Publisher

American Mathematical Society (AMS)


Related search

The Future Fast Fourier Transform?

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
1998English

Weak Form Nonuniform Fast Fourier Transform Method for Solving Volume Integral Equations

Progress In Electromagnetics Research
2009English

Area-Efficient Architecture for Fast Fourier Transform

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
1999English

Frobenius Additive Fast Fourier Transform

2018English

Implementation the Technique of Orthogonal Frequency Division Multiplexing Using 16-Point Fast Fourier Transform and Inverse Fast Fourier Transform

IOSR Journal of Electronics and Communication Engineering
2014English

Molecular Simulation With Discrete Fast Fourier Transform

2012English

Gauss and the History of the Fast Fourier Transform

IEEE ASSP Magazine
1984English

A Vector Implementation of the Fast Fourier Transform Algorithm

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1981English

Efficient Fractal Image Coding Using Fast Fourier Transform

GSTF INTERNATIONAL JOURNAL ON COMPUTING
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy