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
Karnaugh map or K-map discussion
It is a way of minimizing the Boolean functions using diagrams which are made up
of squares. By minimization we imply a function with minimum number of terms and
each term with lowest number of literals.
Following k-map for 2-5 variables are discussed in this section:
2 -Variable Karnaugh map (K-map) discussion below:
First write the Truth Table for 2 variables x and y. Once we know all the values
in table its easier to plot the k-map.
2 variable K– map plot below : - Each element (0-3) from above table is plotted in
k-map below. Var x is horizontal row and y is vertical column. There intersection
denotes output function element. 2 var KMAP below.
Resources
Clock Domain Crossing Discussion with rtl & testbench example.
Rate change(asynchronous) FIFO design and fifo depth calculation.
Half-adder, Full-adder, 4-bit binary adder , adder-subtractor circuit, overflow with rtl & testbench. Binary Multiplier, Parity error TT
Arithmetic, logical, shift micro-operations. Stack organization, LIFO, RPN discussion. 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.