Name - _
ID - _
Answer Sheet (43 marks)
ONLY fill in the BOXES with correct answers on the ANSWER SHEET. Please write your Name and ID on the
ANSWER SHEET and RETURN it!
[5+5+18+12+3= 43 marks]
Q1).
Q2).
All load-distance values
Q3).
Least load-distance v
Dont Care Conditions
- Unspecified outputs for certain inputs
- Used in Map to provide further
simplification
- X is marked inside the square for dont
care input
- Choose to include each dont care
minterm with either 1 or 0
POS Simplification
- Combine va
Birla Institute of Technology and Science
Ist Semester 2010-2011
Digital Electronics and Computer Organization
CS/ EEE/ INSTR C391
Verilog Assignment
-Instructions:
(i) Following are a set of problems prepared to practice Verilog programming. Please go
th
PROGRAMMABLE
ARRAY
LOGIC
Programmable Array Logic (PAL)
OR plane (array) is fixed, AND plane can be
programmed
Less flexible than PLA
no of product terms available per function (OR
outputs) is limited
PAL Example
inputs
1st output
section
2nd output
se
De-Multiplexer
A De-multiplexer is a logic circuit that transmit
information from a single line on one of 2n output
lines
Selection of output line depends on the value of n
select lines
A Decoder with enable input can function as a Demultiplexer
DATA FLOW
DESIGN OF CLOCKED
SEQUENTIAL CIRCUITS
Given a problem statement
State Table/State diagram
Assign binary codes for states
Flip-flop input Equations
Boolean expression for the input
Build Circuit
AN EXAMPLE PROBLEM
A 4-bit sequential odd parity checker is t
Main Memory 64kB
Block size 8 bytes
Direct Mapped Cache 32 lines
How is the 16 bit mem add divided
Into what line a byte with add below be stored
0001 0001 0001 1011
1100 0011 0011 0100
Main Memory 64kB
Block size 8 bytes
Two way set associative 32 lines
ARITHMETIC CIRCUITS
HALF ADDER
FULL ADDER
Binary Adder/Subtractors
The subtraction A-B can be performed by
taking the 2's complement of B and adding to
A.
The 2's complement of B can be obtained by
complementing B and adding one to the result.
A-B = A +
Quine-McCluskey Method
K-Maps Difficult in Visualization for
six variables and above
Not software adaptable
Quine-McCluskey Method
An Example
1. Find all the prime implicants
f ( a, b, c, d ) = m(0,1,2,5,6,7,8,9,10,14)
Quine-McCluskey Method
An Example
1.
A
Case I:
D = 0, CLK = 0
Case II: D = 1, CLK = 0
CLK = 0 => R =1, S = 1
B
D = 1, R = 1 => B = 0
B = 0, S = 1 => A = 1
ASRB = 1110
SR = 11 => No change
A
Case I:
D = 0, CLK = 0
D = 0 => B = 1
CLK = 0 => R =1, S = 1
Case II: D = 1, CLK = 0
CLK = 0 => R
Hardware Description Language
(HDL)
Digital Design Flow
Behavior
RTL (Register Transfer Level)
Logic Circuit (Gates & FFs)
Layout
Abstractions in Digital IC
Design Example [1]
S=a+b+c
Co = Carry generated in the
above operation
Behavior
Abstractions in Di
Do you Know ?
Excess 3 Code
Gray Code
Maxterm
Minterm
Canonical form
K-Map/QM Method
Diminished Radix Complement
Number N in base r having n digits
(r-1)s complement. = (rn -1) N
Radix Complement
Number N in base r having n digits
(r)s complement. = (rn
Canonical Form
- Boolean Expression expressed in
sum of minterms or product of maxterms
Standard form
F1 = y +xy + xyz
KARNAUGH MAPS
-Graphical
Device used to
Simplify Boolean expressions
-Relates
-Useful
inputs to Outputs
upto six variables
Row of a Tr