 |
FPGA CentralWorld's 1st FPGA Portal |
|
|
|
|||||||
| DSP comp.dsp newsgroup, mailing list |
|
|
|
 |
|
|
LinkBack | Thread Tools | Display Modes |
06-22-2009, 09:30 AM
|
|||
|
|||
Re: random length FFT implementation
On 22 Jun, 09:18, HyeeWang <hyeew...@gmail.com> wrote:
> Any random length FFT algorithm can work? *Here I am emphasizing a > FAST algo and implementation other than ordinary DFT. Where can I > download such a FAST FFT algo and implementation (c or matlab)? www.fftw.org/ is a link that is often mentioned when these questions come up. Rune 
|
|
| Bookmarks |
«
CFP: Optical SuperComputing Workshop 2009
|
[OT-ish] It's Spring, when a young man's thoughts turn to
»
| Thread Tools | |
| Display Modes | |
Linear Mode
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| How do I optimize filter coefficient bit length and signal bit length? | From Sweden | FPGA | 1 | 05-20-2008 08:55 PM |
| How do I optimize filter coefficient bit length and signal bit length? | From Sweden | DSP | 1 | 05-20-2008 08:55 PM |
| Odd length Hilbert FIR Implementation | Al Clark | DSP | 18 | 03-09-2006 02:10 AM |
| Relationship between Fibonacci and Galois Implementation of Maximal Length Sequences | Sastry | DSP | 2 | 05-20-2005 01:21 AM |
| Abnormal routing behavior for Active Module implementation and bitstream length. | Kelvin @ SG | FPGA | 0 | 02-05-2004 11:27 AM |
All times are GMT +1. The time now is 12:06 AM.
