Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
Message from discussion Large FFT --- NOT radix-2
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
James Van Buskirk  
View profile  
 More options Jan 22 2004, 12:41 am
Newsgroups: comp.dsp
From: "James Van Buskirk" <not_va...@comcast.net>
Date: Thu, 22 Jan 2004 05:41:08 GMT
Local: Thurs, Jan 22 2004 12:41 am
Subject: Re: Large FFT --- NOT radix-2
"Steven G. Johnson" <stev...@alum.mit.edu> wrote in message
news:bunj9a$hts$1@news.fas.harvard.edu...

> James Van Buskirk wrote:
> > 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?

The best I know of is 912 additions and 240 multiplications; just
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
look at DFTs, the more you become uncertain that what you or anyone
else does is optimal, even if you get to write the criteria of
optimality yourself.

--
write(*,*) transfer((/17.392111325966148d0,6.5794487871554595D-85, &
6.0134700243160014d-154/),(/'x'/)); end


 
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.