Home.Verilog.Digital Design.Digital Basics.Python.RF Basics.
Previous.
Next.
Custom Search

Feedback ? Send it to admin@fullchipdesign.com or join me at fullchip@gmail.com

Legal Disclaimer

Chip Designing for ASIC/ FPGA Design engineers and Students
FULLCHIPDESIGN
Digital-logic Design...  Dream for many students… start learning front-end…

Legal Disclaimer

Topics @TYH :- 4G LTE Tutorial, Inside Smart-Phone, Cloud Computing
PICS
FORUM
FORUM
Verilog Tutorial.
Binary Numbers 1s_complement 2s_complement Binary Subtraction Binary Sub. Ex's Sign_magnitude SignM EX Gray Coding BCD coding Digital gates NAND NOR & XNOR Theorems Boolean Functions BFunc Examples Minterm Maxterm Sum of Minterms Prdt of Maxterms 2 var K-map 3 var K-map 4 var K-map 5 var K-map Prime Implicant PI example

Signed Magnitude Numbers

Discussion of signed magnitude involves the classification of the numbers in digital system as signed or unsigned.  Examples here

Un-signed Numbers:

In un-signed number system all the bits directly correspond to the equivalent decimal number.

Examples:

 

100011 binary = 35 decimal

000011 binary = 3 decimal

Signed Numbers:

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.

Examples:- Signed Magnitude
 Adding a positive and a negative number.
 Adding two negative numbers and Overflow conditions.

Overflow condition and detection rules.

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.
Media Gallery
 Las Vegas
 Grand Canyon
 Alcatraz -the rock
 San Francisco
 Napa Valley
 Los Angeles
 17 Mile Drive
 Golden Gate Bridge
 Blog- Planning
Interview Questions. Main, FPGA, Digital Fundamentals
K-map - 2,3,4,5 var & Prime Implicant discussion
Arithmetic, logical, shift micro-operations, Overflow
Arithmetic, logical and shift micro operations.
Binary to Gray code conversion
 Readmemh, Readmemb. Random numbers
 Memory Implementation - sync Ram and Testbench
K-map - 2,3,4,5 var & Prime Implicant discussion
Arithmetic, logical and shift microoperations.
Binary to Gray code conversion
 Readmemh, Readmemb. Random numbers