Chip Designing for ASIC/ FPGA Design engineers and Students
Digital-logic Design... Dream for many students… start learning front-end…
Get Noticed:- Submit your own content to be published on fullchipdesign.com
Send it to fullchip@gmail.com
Discussion of signed magnitude involves the classification of the numbers in digital
system as signed or unsigned. Examples here
In un-signed number system all the bits directly correspond to the equivalent decimal
number.
Examples:
100011 binary = 35 decimal
000011 binary = 3 decimal
In signed number system the most significant bit (msb) bit signifies sign of all
lower significant bit (lsb) bits for the number.
Examples:
100011 binary = -3 decimal
000011 binary = +3 decimal
In Digital Systems the negative numbers can be represented by following three ways:-
-3 in signed magnitude value 10011
-3 in signed 1’s complement value 11100
-3 in signed 2’s complement value 11101
Few rules to know for arithmetic addition of two numbers using signed magnitude.
Rule 1:- If one of the numbers to be added is negative then take signed 2’s complement
of the number.
Rule 2:- If any ‘end carry’… discard it.
Rule 3:- If the MSB of result after discarding ‘end carry’ is 1 then take 2’s complement
of the remaining bits.
Digital Logic fundamentals topics @ fcd
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 - discussion with examples, Boolean Functions, Canonical and Standard Forms, Minterms and Maxterms Sum of Minterms, Product of Maxterms or Canonical Forms, Karnaugh map or K-map discussion 2, 3, ,4 and 5 var’s Prime Implicant and Gate level minimization examples.