Programmable Devices
CPLDs, FPGAs, SoC FPGAs, Configuration, and Transceivers
Announcements
FPGA community forums and blogs on community.intel.com are migrating to the new Altera Community and are read-only. For urgent support needs during this transition, please visit the FPGA Design Resources page or contact an Altera Authorized Distributor.
21615 Discussions

time complexity of float multiplication

Altera_Forum
Honored Contributor II
‎08-14-2014 09:29 AM
1,300 Views

Can someone provide some documentation for the complexity ("big O") of the float multiplication using floating point megafunctions?

0 Kudos

Link Copied

1 Reply
Altera_Forum
Honored Contributor II
‎08-14-2014 09:44 AM
632 Views

Without knowing anything about the megafunctuions... 

I'd guess that multiply is fixed cost, only underflow and overflow generate special cases. 

Addition/subtraction needs to shift one of the numbers (by the difference in exponents) - so could depend on that value. 

Division is hard and slow.
0 Kudos
Copy link
Reply

Community support is provided Monday to Friday. Other contact methods are available here.

Intel does not verify all solutions, including but not limited to any file transfers that may appear in this community. Accordingly, Intel disclaims all express and implied warranties, including without limitation, the implied warranties of merchantability, fitness for a particular purpose, and non-infringement, as well as any warranty arising from course of performance, course of dealing, or usage in trade.

For more complete information about compiler optimizations, see our Optimization Notice.