Abstract
Theoretical basis and the resulting algorithm for calculating the remainder of 2's complement signed numbers integer division operation is presented. A logic scheme for calculating the remainder according to the non-restoring division algorithm is synthesized. A structural scheme for micro-pipeline organization of the computations is presented. The logic scheme, along with that for computation of the quotient for the same operation (synthesized and published earlier by us [7]), makes a division operation executable over time to switch the entire combinational scheme. Thus, the calculation of the two results from operation division by this logical scheme is as fast as possible, which can be achieved. The functionality of the scheme is illustrated by numerical examples.
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 callDisclaimer: 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.
