Abstract
A squarer mod A is a circuit that computes the residue of the square of an integer X taken modulo a positive integer A. It is an essential building block in a variety of high-speed hardware for a digital signal processor (DSP) using the residue number system (RNS) which implements, e.g., the quarter-square modulo multiplication, the squared Euclidean distance, correlation, and circular convolution. Also, it is used to build large modulo exponentiators needed for implementation of cryptographic algorithms. In this paper, a comprehensive study of new squarers mod A is presented. For some special cases of A, like 2/sup a/-1, 2/sup a/, 2/sup a-1/+1, and others, the general design approach is presented, which takes advantage of the periodicity of the series of powers of 2 taken modulo A, with no limitations on the size of A. The resulting squarers are almost exclusively composed of full- and half-adders which makes them suitable for low-level pipelining. For many A/spl les/64, the minimized logic functions of the squarers with small delay are also derived.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
