Abstract: In this paper the design of systolic array processors for computing 2-dimensional Discrete Fourier Transform (2-D DFT) is considered.
Shietung Peng, Stanislav Sedukhin, Hiroshi Nagata: A new scalable array processor for two-dimensional discrete Fourier transform. PARCO 1999: 358-365.
People also ask
What is the 2D discrete Fourier transform in digital image processing?
What is 2D Fourier transformation method?
Hence the proposed array processor is appropriate for applications with naturally arranged multidimensional data such as still images, video frames, 2D data ...
A NEW SCALABLE ARRAY PROCESSOR FOR TWO-DIMENSIONAL DISCRETE FOURIER TRANSFORM. DOI · Stanislav G. Sedukhin · Shietung Peng · Hiroshi Nagata. 収録刊行物.
An Efficient Two-Dimensional FFT Algorithm. A new version of the radix-2 row-column method for computing two-dimensional fast Fourier transforms is proposed.
Missing: discrete | Show results with:discrete
Feb 23, 2015 · ECSE-4540 Intro to Digital Image Processing Rich Radke, Rensselaer Polytechnic Institute Lecture 7: The 2D Discrete Fourier Transform ...
Missing: scalable processor
This paper proposes an optimized design of Discrete Hilbert Transform (DHT) processor using Complex Binary Number System (CBNS).
In this paper the design of systolic array processors for computing 2-dimensional Discrete Fourier Transform (2-D DFT) is considered. We present a new ...
Comparing the two Fourier transforming techniques, DFT and FFT, the computations are O(N²) vs. O(NlogN) in favor of FFT. However, the DFT enjoys a simple ...
The optimal systolic array processors are scalable, modular and suitable for VLSI implementation. An application of the designed systolic array processors ...
Missing: two- | Show results with:two-