Testing of VLSI Systems

Related lectures (26)

Page 2 of 3

Explores Karnaugh maps, TTL gates, analog aspects of digital logic, and prime implicants.

Delves into the complexity and interdependencies of transitioning to smart cities, emphasizing the importance of a holistic approach.

Discusses digital logic circuits, CMOS technology, and Verilog for circuit design.

Covers the Logical Effort method for optimizing logic delay and gate sizing impact.

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.

Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Explores Karnaugh maps, grouping rules, and transistor logic in logic systems.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.