Journal ArticleDOI
Implementation of a fast Fourier transform (FFT) for image processing applications
Reads0
Chats0
TLDR
This work proposes an implementation whereby two radix-N1/2passes are carried out in parallel and in which each N 1/2-point transform is carried out via a serial input parallel output transform circuit.Abstract:
Different fast Fourier transform (FFT) algorithms for hardware implementation have been considered. We propose an implementation whereby two radix-N1/2passes are carried out in parallel and in which each N1/2-point transform is carried out via a serial input parallel output transform circuit. The processing rate is one clock cycle per input point for the N-point transform regardless of the value of N chosen. The circuit is being implemented with TTL logic and will be used to perform spatial frequency domain filtering on two dimensional infrared camera images in real time; real time meaning processing between frame display.read more
Citations
More filters
Real Time Heart Rate Monitoring from Facial RGB Color Video using Webcam
TL;DR: Heart Rate (HR) is one of the most important Physiological parameter and a vital indicator of peoples physiological state and is therefore important to monitor.
Proceedings ArticleDOI
Optimizing the Fast Fourier Transform Using Mixed Precision on Tensor Core Hardware
TL;DR: An algorithm that dynamically splits the input single precision dataset into two half precision sets at the lowest level, uses half precision multiplication, and recombines the result at a later step is developed, paving the way for using tensor cores for high precision inputs.
Journal ArticleDOI
L 1 0 rare-earth-free permanent magnets: The effects of twinning versus dislocations in Mn-Al magnets
Yuxiao Jia,Yuye Wu,Yuye Wu,Shuang Zhao,Shulan Zuo,Konstantin P. Skokov,Oliver Gutfleisch,Chengbao Jiang,Huibin Xu +8 more
TL;DR: In this article, the negative effect of twin structure and the positive effect of dislocations on the coercivity were clarified in a systematic experimental study of L10-MnAl alloys, because the former defect can induce the nucleation of reversal domain and the latter can act as a pinning center.
Journal ArticleDOI
Word Level Multi-Script Identification Using Curvelet Transform in Log-Polar Domain
TL;DR: A new scheme for script identification from word images using skew and scale robust log-polar curvelet features, which illustrated the effectiveness of the proposed method, where a maximum recall rate of 98.76% has been achieved.
Journal ArticleDOI
Surface Thermo-Dynamic Characterization of Poly (Vinylidene Chloride-Co-Acrylonitrile) (P(VDC-co-AN)) Using Inverse-Gas Chromatography and Investigation of Visual Traits Using Computer Vision Image Processing Algorithms.
TL;DR: The substantial results revealed that the (P(VDC-co-AN)) polymer surface contains more basic sites than acidic sites and, hence, can closely associate in acidic media.
References
More filters
Journal ArticleDOI
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley,John W. Tukey +1 more
TL;DR: Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Journal ArticleDOI
Parallelism in fast Fourier transform hardware
Bernard Gold,T. Bially +1 more
TL;DR: A diagrammatic representation of mixed radix and highest radix FFT algorithms is derived, and two broad classes of FFT hard-ware are explored, from the point of view of speed, parallelism, radix number, and type of memory.
Journal ArticleDOI
A Fast Fourier Transform for High-Speed Signal Processing
TL;DR: An arbitrary-radix fast Fourier transform algorithm and the design of its implementing signal processing machine are introduced, which yields an implementation with a level of parallelism proportional to the radix r of factorization of the discrete Fouriertransform.
Journal ArticleDOI
The Design of a Class of Fast Fourier Transform Computers
TL;DR: The design of a class of special-purpose computers for time-series analysis by Fourier transformation is described, which implement machine-oriented fast Fourier transform algorithms obtained by factoring the discrete Fouriertransform to an arbitrary radix.
Journal ArticleDOI
A serial minded FFT
TL;DR: The possibly unexpected conclusion is made that the FFT implementation using parallel arithmetic units is more efficient in terms of speed and probably design effort and hardware, than one using high radix algorithms.
Related Papers (5)
An Application of the Projection Transform Technique in Image Transmission
William G. Wee,Tsung-Tao Hsieh +1 more