Oberon Community Platform Forum
November 20, 2019, 09:11:26 PM *
Welcome, Guest. Please login or register.
Did you miss your activation email?

Login with username, password and session length
   Home   Help Search Login Register  
Pages: [1]
Author Topic: Bit reversing functions part 2  (Read 2570 times)
Jr. Member
Posts: 59

« on: August 14, 2008, 09:19:04 PM »

Hi All,
  I do not know how useful  a new implementation  of the bit reversing function could be, but I gain more than  100ms per 1000 iterations  Grin.

The newest implementation uses a pre-computed array of reversed bits from 0 to 255.

The results I got on my PC (the same Athlon X2 machine)   are:

Testing speed of  the bit reversing functions (1000 iterations)
[BitRevDEFINITION ]     Execution time is -> 4750 ms
[RevBitAsm16]             Execution time is -> 907 ms
[RevBitAsm16Unrolled]   Execution time is -> 656 ms
[RevBitAsm16Arr]          Execution time is -> 547 ms

Now, I am going to stop with it (unless there is demand for more  functionality), and start looking into FFT's and other DSP functions.

Attached, a new version of the module, and testing program.

Comments and measurements of the execution time on other machines are very welcome.

Have fun.



* BitReversing.Mod (6.19 KB - downloaded 336 times.)
* TestBitRevers.Mod (8.83 KB - downloaded 325 times.)
Pages: [1]
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.21 | SMF © 2015, Simple Machines Valid XHTML 1.0! Valid CSS!