Open In App

4 Bit Binary Decrementer

What is 4 Bit Binary Decrementer ?
It subtracts 1 binary value from the existing binary value stored in the register or in other words we can simply say that it decreases the existing value stored in the register by 1. 
For any n- bit binary decrementer, ‘n’ refers to the storage capacity of the register which needs to be decremented by 1. So we require ‘n’ number of full adders. Thus, in case of 4 bit binary decrementer we require 4 full adders. 



Working:



Reason for adding 1111:

    In 4 bit representation           In 1's complement           In 2's complement   
 1 -------------------------> 0001 ----------------------> 1110 ---------------------> 1111
                                                                                                               

Example:

(Refer to the circuit diagram from right to left for better understanding)

1. Input: 1010  ----> After using 4 bit binary decrementer ----> Output: 1001
        
  1 0 1 0       (Comparing from the circuit 1 0 1 0 is A3, A2, A1, A0 respectively)
+ 1 1 1 1       (1 1 1 1 is added as seen in the diagram also, in each full adder 1 is taken as input)
  ________
  1 0 1 1       ( 1 0 1 1 , in the diagram are S3, S2, S1, S0 respectively)
  ________
  
2. Input: 0010  ----> After using 4 bit binary decrementer ----> Output: 0001

   1 0 1 0 
 + 1 1 1 1
   ________
   0 0 0 1
   ________
   
3. Input: 0011  ----> After using 4 bit binary decrementer ----> Output: 0001

   0 0 1 1
 + 1 1 1 1
  _________
   0 0 1 0
  _________
  
Article Tags :