Re: [myhdl-list] Low resource FFT core in Myhdl, first python Modell

[Christopher F. <chr...@gm...>]

On 11/28/2012 1:40 PM, Norbo wrote:
>> I have not reviewed your version yet, thought this might be helpful
>> (compare/contrast).  Here is another basic FFT which uses the recursive
>> ability in MyHDL.
>>
>> http://www.myhdl.org/doku.php/users:cfelton:projects:recursivefft
>>
>> This version the required resources are similar to yours.  It has been
>> synthesize for an FPGA.
>>
>> Regards,
>> Chris
>
>
> Yeah, i looked at this implementation before i started. If i got it
> correctly the basic radix-N elements are described with the aim to
> calculate everything combinatorically. Where my aim is to use at least
> (N*log(N)) clock cycles. And have only one basic radix-2 element as a
> center element were everything gets clocked through. And the data gets
> read and written from and to a RAM.

Yes, my version is straight-forward and doesn't share resources or 
multiplex.  It is pipelined though it is not one large combnitorial 
computation.  But I see this page is incomplete, I don't have everything 
posted.

Regards,
Chris