You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
ToNAF returns the NAF decomposition of given input. The non-adjacent form (NAF) of a number is a unique signed-digit representation, in which non-zero values cannot be adjacent. For example, NAF(13) = [1, 0, -1, 0, 1].
But this check is not enforced, see
I suggest to remove the method. Usually 2-NAF representation is used to reduce the number of operations because of the lower Hamming weight compared to the bit representation. But anyway in-circuit the number of operations is related to the number of bits and not the representation because of the lack of branching. Originally we implemented this method to experiment with but ended up never using it so I suggest to remove it.
Description
The method focumentation is:
We should either fix it or remove the method as it is not used anymore.
cc. @gbotrel, @yelhousni
The text was updated successfully, but these errors were encountered: