Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Should we belive declared high XNOR speedups? #1

Open
MaratZakirov opened this issue Dec 5, 2018 · 0 comments
Open

Should we belive declared high XNOR speedups? #1

MaratZakirov opened this issue Dec 5, 2018 · 0 comments

Comments

@MaratZakirov
Copy link

It is well known that both matrix multiplication and convolution operation (which are some kind of equivalent, convolution may be viewed as MM) are not straightforward. For example cuda MM uses Strassen algorithm conv2d(3x3) uses Winograd algorithm even bigger conv2d (9x9 for example) would use FFT. All methods of fast multiplication uses partial recurrent sums as essential component so XNOR operations could not be applied to them. Taking this into account it is obvious that XNOR will loose its advantage in speed staring form 6x6 in case of ideal implementation. What do think?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant