A Computationally Efficient 1024-Point FFT Processor with Only a Subset of Non-Zero Inputs
碩士 === 國立中山大學 === 電機工程學系研究所 === 96 === Fast Fourier transformation (FFT) is a powerful analytical tool with wide-ranging applications in many fields. The standard FFT algorithms inherently assume that the length of the input and output sequence are equal. In practice, it is not always an accurate as...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/xymv4z |