"Steven G. Johnson" <stev...@alum.mit.edu> wrote in message
> James Van Buskirk wrote:The best I know of is 912 additions and 240 multiplications; just
> > But it seems to me that split-radix requires 912 additions and 248
> > multiplications for n = 64, and 1160 isn't the minimal number of
> > operations.
> What do you think is the lowest known number of operations for an n=64
> complex DFT, using what algorithm?
figured out how to achieve this result yesterday. Algorithm is
the same as used for all my computational kernals (heavy use of
real-half-complex DFTs,) just became aware of another possible trick.
The lowest known by anyone is a different question. The more you
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.