Hi, all
We have an algorithm to port to C64x DSPs and now the algorithm is implemented in floating-point. So firstly we have to give a rough estimation of the complexity, an easy way could be to count the total floating-point operations and then estimate the cycles required for the same number of fixed-point operation. And in order to count the number of floating-point operation, I rebuild the rts library with debug info following the guide here.
http://processors.wiki.ti.com/index.php/How_to_rebuild_the_C6000_RTS
But even with the debug rts library, I can't get the number of floating-point operations after I profiling the algorithm using CCSv3.3. I just add the -g macro to enable debug information in RTS library, is there anything else I miss for the rebuild of the RTS library?
Or any other hint to estimate the performance required based on present floating-point algorithm?
Thanks
Touse