Browser Not SupportedNew Algorithm for Signed Integer Comparison in $\{2^{n+k},2^{n}-1,2^{n}+1,2^{n\pm 1}-1\}$ and Its Efficient Hardware Implementation | IEEE Journals & Magazine | IEEE Xplore

Notice: IEEE Xplore is unable to display this page because you may be using an incompatible or unsupported browser.

For the best experience, please upgrade to a newer, supported browser using the links below. If you cannot upgrade your browser, a temporary IEEE Xplore site is available for basic searches with links to full-text.