Commutative Reduced Biquaternions and Their Fourier Transform for Signal and Image Processing Applications

2004 ◽  
Vol 52 (7) ◽  
pp. 2012-2031 ◽  
Author(s):  
S.-C. Pei ◽  
J.-H. Chang ◽  
J.-J. Ding
Author(s):  
Akarshika Singhal ◽  
Anjana Goen ◽  
Tanu Trushna Mohapatrara

The Discrete Fourier Transform (DFT) can be implemented very fast using Fast Fourier Transform (FFT). It is one of the finest operation in the area of digital signal and image processing. FFT is a luxurious operation in terms of MAC. To achieve FFT calculation with a many points and with maximum number of samples the MACs requirement could not be matched by efficient hardware’s like DSP. A parallel and pipelined Fast Fourier Transform (FFT) processor for use in the Orthogonal Frequency division Multiplexer (OFDM) and WLAN, unlike being stored in the traditional ROM. The twiddle factors in our pipelined FFT processor can be accessed directly. In this paper, we present the implementation of fast algorithms for the DFT for evaluating their performance. The performance of this algorithm by implementing them on the Xillinx 9.2i Spartan 3E FPGAs  by developing our own FFT processor architecture.


2005 ◽  
Vol 123-124 ◽  
pp. 331-336 ◽  
Author(s):  
M. Vieira ◽  
M. Fernandes ◽  
P. Louro ◽  
A. Fantoni ◽  
G. Lavareda ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document