The applicability of special purpose computers to fast Fourier transforms.
applicabilityofs00adam.pdf (1.953Mb)Abstract
The Fast Fourier Transfonn is an algorithm for the computation of Discrete Fourier Transforms in less time than allowed by any other algorithm available. The use of special purpose digital machines to reduce those times even further is of interest for real time spectral analysis. The main principles of Fast Fourier Transforms are presented. The design of a full-parallel eight sample processor is presented as a point of reference for comparison with serial and serial-parallel hybrid machines. Carry-Save Addition is introduced and used as the primary arithmetic logic.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.Collections
Related items
Showing items related by title, author, creator and subject.
-
Application of Constraint Dynamics for Spacecraft Maneuver
(1994);A new approach for spacecraft maneuver based upon constraint dynamics and tracking control laws is presented in this paper. For high precision pointing requirement on spacecraft maneuver, a desired trajectory is prescribed ... -
A Software-based network infrastructure for mobile ad hoc data networking in support of small tactical units using the SINCGARS radio
(Monterey, California. Naval Postgraduate School, 2006-03);Currently, there is no infrastructure in place to provide data networking capabilities to ground-based tactical units below the battalion level. Legacy, voice-centric radios, organic to these units, possesses no inherent ... -
The Lagrange-Galerkin method for the two-dimensional shallow water equations on adaptive grids
(2000);The weak Lagrange-Galerkin finite element method for the two-dimensional shallow water equations on adaptive unstructured grids is presented. The equations are written in conservation form and the domains are discretized ...
