Sciweavers

Share
AICCSA
2006
IEEE

Power Efficient Algorithms for Computing Fast Fourier Transform over Wireless Sensor Networks

10 years 3 months ago
Power Efficient Algorithms for Computing Fast Fourier Transform over Wireless Sensor Networks
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a vehicle to highlight the issues involved in realizing distributed computations over sensor networks that have global and local communication and synchronization characteristics. We present a power efficient algorithm for computing 1-D Fast Fourier Transform (FFT) over single and multi-hop wireless sensor networks. The proposed algorithm reduces the number of transmissions, eliminates typical redundant computations in a distributed FFT algorithm and uniformly maps complex multiplications over all the sensors nodes by introducing an extra bit-complement permutation stage after first (log2N)/2 iterations. We show that the proposed algorithm improves energy consumption by 36% on the average on multi-hop sensor networks. This saving in energy consumption significantly improves the battery life of the sensor nodes the...
Turkmen Canli, Ajay K. Gupta, Ashfaq A. Khokhar
Added 10 Jun 2010
Updated 10 Jun 2010
Type Conference
Year 2006
Where AICCSA
Authors Turkmen Canli, Ajay K. Gupta, Ashfaq A. Khokhar
Comments (0)
books