Feedback ? Send it to admin@fullchipdesign.com or join me at fullchip@gmail.com
2’s complement:-
2’s complement of a binary number N is obtained by the formula
(2^n) – N
Where n is the no of bits in number N
Example:
Convert binary number 111001101 to 2’s complement
Method
2’s complement of a binary no can be obtained by two step process
Step 1
1’s complement of number N = 000110010
Step 2
1’s complement + 1
000110010
+ 000000001
= 000110011
Answer
2’s complement of a binary no 111001101 is 000110011
Trick : 2’s complement can be represented by keeping all lower significant bits till first 1 as it is and taking complement of all upper bits after that.
Some more examples for 2’s complement conversion.
2’s (Two’s) Complement Discussion.
1’s Complement discussion from here.
Digital design resources
Clock Domain Crossing Discussion with
rtl & testbench example.
Rate change(asynchronous) FIFO design and fifo depth calculation.
Half-
VHDL rtl -
RTL coding guidelines. ICG cell, Assertions, $assertkill, levels.
Digital design Interview questions.
FPGA Interview. FPGA flow.
Guide to Graduate studies in US
Pipeline vs. Parallel processing.
Digital basics tutorial
Binary number discussion, 1 and 2 complement discussion,
Binary arithmetic, Signed Magnitude, overflow, examples
Gray coding, Binary coded digital (BCD) coding, BCD addition
Digital logic gates basic (AND, OR, XOR, NOT) and derived (NAND, NOR and XNOR). Drive XOR from NAND gates. Drive XOR from NOR gates
Discussion of Boolean Algebra with examples.
Duality Principle, Huntington Postulates, Theorems of Boolean Algebra -
Canonical and Standard Forms, Minterms and Maxterms
Sum of Minterms, Product of Maxterms or Canonical Forms,
Karnaugh map or K-
Prime Implicant and Gate level minimization examples.