# Digital fundamentals ` discussion and ` tutorial.

Lets start deep diving into digital fundamentals which are ` essential to build ` digital logic design skills.

#### 1. Number systems.

2. Binary Coded Digital (BCD)
1. BCD coding and `step by step` addition approach.
2. Discuss with Examples.
3. An interesting interview question. Note `advanced` topic.
3. Gray coding.
1. Logic to convert binary to gray `and gray` to binary.
2. Binary to Gray code mapping for 11 to 50 , 50 to 100 decimal numbers.
3. Advanced `design` topic. Discussion with  verilog rtl code examples.

#### 2. Complement Number Systems.

1. Ones or 1’s complement discussion.
2. Twos or 2’s complement discussion.
3. `Discussion` with examples.

#### 3. Binary Arithmetic.

1. Binary arithmetic. Addition, subtraction in `general`
2. Details on binary `signed` addition.
1. Add negative + negative example with `overflow analysis`.
2. Add positive + positive example with overflow analysis.
3. Add positive > negative example with overflow analysis.
4. Add positive < negative example with overflow analysis.
3. Details on binary `signed` subtraction.
4. Signed Magnitude & examples.
1. Overflow arithmetic.
2. Overflow signed detection.

LTE - 4G Wireless Technology

Digital fundamentals.

Interview Questions.

#### 4. Digital Logic building blocks.

1. Logic Gates symbols and truth-table
2. Convert XOR gate to Inverter.
3. Universal NAND Gate.
1. Drive AND gate from NAND gate.
2. Drive OR gate from universal NAND gate.
3. Drive XOR gate from universal NAND gate.

#### 5. Discussion of Boolean Algebra.

1. Duality Principle and Huntington Postulates.
2. Theorems of `Boolean Algebra` - discussion.
3. Discussion of Boolean Functions.
4. Understand Boolean Functions using examples.

#### 6. Boolean Functions and use of logic gates.

1. Implementation of Boolean Functions using gates.
2. Exercise to minimize Boolean Functions.
3. Representation of Boolean functions in Canonical and Standard Forms.
1. Minterms and Maxterms discussion.
2. Sum of Minterms discussion.
3. Product of Maxterms or Canonical Forms.

#### 7. K-map detailed discussion. All about Karnaugh maps for 2, 3, 4, 5 variables.

1. Two (2var KMap)) variables K-map (truth table and K-map plot).
2. Three variables K-map (`3var KMap` truth table and plot). Examples `Next`.
1. F(x,y,z) = (0,1,6,7) - Answer.
2. F(x,y,z) = (0,1,4,5,6,7) - Answer.
3. F(x,y,z) = (3,4,6,7) - Answer.
3. Four variables K-map (truth table and K-map plot). Examples `Next`.
1. F(x,y,w, z) = (0,1,2,3,4,6,11,14)
2. F(x,y,w, z) = (0,2,4,6,12,14)
3. F(x,y,w, z) = (0,2,5,7,8,11,13,15)
4. Five variables K-map (truth table and K-map plot).
5. Prime Implicant and Gate level minimization examples.

You completed! Digital fundamentals section. Now lets move on to Digital Logic Design Section

Tutorials `@fullchipdesign.com`

Verilog Tutorial.

LTE Tutorial.

Memory Tutorial.

Hope you liked! this page. Don't forgot to access relevant `previous and next sections ` with links below.