Hello,

I'm trying to estimate the number of logic gates used to build different C-operators. Gates needed is dependent on the input and delay factor but for the beginning I just want to consider the input (how man bits..).

For example, the most easiest are bitwise operators. There we have 1 Gate needed.
Now I'm trying to find estimates for..
+, -, ++, --
Relational, logical and ternary operators
*
/,%
sqrt
.. Besides the fact that there are many implementation possibilities of these operators, do you have an idea where I can get some Gate counts?

Thank you for the help

 

Most of the C operations are actually comprised of many steps as an algorithm - such is the nature of such a high-level language like C.

There comes a point where the circuit required to implement an operation is better suited to using either as lookup table or an algorithm rather than a hardware implementation.

If you really want some gate counts, some truth tables describing each operation would help you identify the required gates. You will need to select a data size to operate on.