FFT Multiplication (HP-48G/GX/G+)
|
02-15-2014, 09:41 PM
Post: #21
|
|||
|
|||
RE: FFT Multiplication (HP-48G/GX/G+)
(02-15-2014 08:26 PM)Gerson W. Barbosa Wrote:No, the stack diagram usually lists the inputs, the way and the output.(02-14-2014 10:37 PM)Raymond Del Tondo Wrote:On my HP-48GX (and on the emulator) things go like this: [%] [%]' --> ENTER --> [%]". Is this behavior normal? The program expects two arrays, and returns another array. (02-15-2014 08:26 PM)Gerson W. Barbosa Wrote: Here is the running times table, times in seconds:You could use a simple TICKS wrapper, very similar to the tEVAL I use. Thanks for the correction about the element count. For some reason I thought the example arrays consisted of 128 elements, but it was 64 only. My fault. So the timings in my last posts actually were for two arrays of 64 elements each. Still not bad for the brave old HP 48, and still slightly faster than the 50g;-) Cheers -- Ray |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)