Question for the HP guys....
|
10-08-2017, 11:37 PM
Post: #1
|
|||
|
|||
Question for the HP guys....
I remember from back in my supercomputer days, the FFT algorithm was pretty important in the field I worked in, and there were generally 2 ways to implement it. The first used bit-reverse and radix-2 transform, while the second used digit-reverse and radix-4 transform. Radix-4 was quite a bit faster in implementation, so what I'm wondering is which is the version of the FFT function on the HP Prime, radix-2 or radix-4 ?????????
Thanks -Donald |
|||
« Next Oldest | Next Newest »
|
Messages In This Thread |
Question for the HP guys.... - webmasterpdx - 10-08-2017 11:37 PM
RE: Question for the HP guys.... - Tim Wessman - 10-09-2017, 12:03 AM
RE: Question for the HP guys.... - Mark Hardman - 10-09-2017, 12:30 AM
RE: Question for the HP guys.... - webmasterpdx - 10-09-2017, 04:25 AM
RE: Question for the HP guys.... - parisse - 10-10-2017, 09:09 AM
|
User(s) browsing this thread: 1 Guest(s)