Impact of FFT algorithm selection on switching activity and coefficient memory size
The binary tree decomposition allows for obtaining a large number of algorithms that can be used to calculate the fast Fourier transform. This paper analyzes the differences among these algorithms in terms of switching activity, which is related to the power consumption of the circuit, and size of t...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | EJournal Article |
| Published: |
Institute of Advanced Engineering and Science,
2014-08-01.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |