Reach Us +1 850 754 6199

Journal of Computer Engineering & Information TechnologyISSN : 2324-9307

All submissions of the EM system will be redirected to Online Manuscript Submission System. Authors are requested to submit articles directly to Online Manuscript Submission System of respective journal.

Logic Scheme for Determining the Number of Leftmost Insignificant Digits in a Bit-Set of Any Length

Logic Scheme for Determining the Number of Leftmost Insignificant Digits in a Bit-Set of Any Length

The synthesized logic scheme is capable of determining the number of the leftmost insignificant digits of numbers, which are presented in a bit-set of any length. The content of the bitset can be interpreted in different ways – as signed magnitude, one’s complement or two’s complement number and also as fractional binary number. This allows the scheme to be used in devices working both with fixed-point and floating point. The number of leftmost insignificant digits of the number is necessary to implement the next highly productive one-clock left shift. This micro-operation has place in the algorithms of various machine operations performed in the digital processor. The suggested scheme does not depend on the length of the bit-set because of the cascade principle applied. The synthesized building unit solves the same problem and has a minimum length of 3 bits.

Special Features

Full Text

View

Track Your Manuscript

Share This Page

Media Partners

Associations