Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Sequential Circuits: Synthesis and Retiming
Graph Chatbot
Related lectures (29)
Previous
Page 3 of 3
Next
Fundamentals of Digital Systems: Sequential Logic and Memory Elements
Introduces the fundamentals of digital systems, focusing on sequential logic and memory elements like latches and flip-flops.
Shortest Path Algorithms: BFS and Dijkstra
Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.
Digital Logic: Circuits and Design
Introduces digital logic, covering Boolean algebra, logic gates, combinational circuits, flip-flops, and state machines.
Testability Analysis: SCOAP Measures
Introduces SCOAP measures for testability analysis in VLSI systems, covering controllability, observability, and test vector length prediction.
Sequential Logic Designs
Introduces clocked systems, sequential circuits, bistable-state devices, metastable states, and D-type flip-flops.
Arbiter FSM & FPGA Implementation
Covers the design of an Arbiter FSM in VHDL for digital system design, emphasizing access timing management.
Digital Logic Circuits: Memory and Decoder Fundamentals
Provides an overview of digital logic circuits, focusing on memory systems and binary decoders, including their operation and access protocols.
Full Adder: Binary Addition Logic
Explains the full adder's role in binary addition and its design using transistors.
Minimum Spanning Trees: Prim's Algorithm
Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.