Forum Discussion

Altera_Forum's avatar
Altera_Forum
Icon for Honored Contributor rankHonored Contributor
11 years ago

time complexity of float multiplication

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

1 Reply

  • Altera_Forum's avatar
    Altera_Forum
    Icon for Honored Contributor rankHonored Contributor
    11 years ago

    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.