.png){kind=icon}
.png){kind=icon}
Return
Power efficient algorithms for computing fast Fourier transform over wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1109/AICCSA.2006.205144.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FTT 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 I-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 (log(2)N)/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 thereby, increasing lifetime of the sensor network.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
0
Papers:
2
Citations:
0
