Categories
Computing VLSI

⨘ } VLSI } 23 } Transmission Gate Logic Circuits } LE PROFESSEUR }

Transmission gate logic style offers certain advantages over pass-transistor logic. We discuss about transmission logic gate concepts, how can we design circuits using transmission gates, what are key advantages, disadvantages of transmission gates over traditional logic and pass-transistor logic styles with an example circuit design. Thanks for watching. ► SUBSCRIBE, Like 👍 , and press […]

 210 total views,  2 views today

Categories
Computing VLSI

⨘ } VLSI } 22 } Pass-transistor logic circuits

nmos/pmos transistors can be used in a configuration where voltage on gate can be think in terms of control or valve to pass water (electric current analogue) between terminals of transistor, pass-transistors logic concepts are discussed. How pass transistors are different than conventional CMOS logic circuits, advantages, disadvantages of pass-transistor logic are discussed with examples […]

 335 total views,  2 views today

Categories
Computing VLSI

⨘ } VLSI } CMOS Circuits, Physical Layout, Combinatorial Logic Gates } LEPROF }

We have discussed logic gates in the previous lecture: Logic gates using multiplexers. We discussed at logic gate level. In this lecture we gonna be discussing next level – gate circuits. Techniques to design logic gate circuits using nmos and pmos. Concepts of CMOS circuit design with nMOS and pMOS are discussed. We can think […]

 271 total views,  2 views today

Categories
Computing VLSI

⨘ } VLSI } 20 } CMOS Interconnects }

Wire connecting the devices (nmos, pmos) are normally referred to as interconnects. Interconnects are very important, almost 70 percent chip area is consumed by interconnects. Interconnects increase circuit delays due to resistance and capacitances associated with them. Coupling capacitances induces crosstalk delay effects. Long wires induces inductive coupling due to inductance associated with them. Electric […]

 1,090 total views,  6 views today

Categories
Computing VLSI

⨘ } VLSI } 19 } System Verilog } Assertions } Async Interfaces } Protocol Verification }

We discuss assertions for asynchronous interfaces, how asynchronous master-slave protocol assertions can be written, debugged and complex protocols can be verified. We discuss following topics: 1. Master asserts request signal to slave indicating communication initiation, and request signal should get asserted only after N number of clock cycles data signal is stable. 2. Slave’s grant […]

 1,548 total views,  2 views today

Categories
Computing VLSI

⨘ } VLSI } 18 } Mentor’s Questa CDC Analysis } 0in }

Siemens / Mentor’s Questa 0-in clock domain crossing (CDC) solution – how to use Questa CDC tool, what are different clock domain crossing issues, different modes of operation of the tool, how to run the tool and generate CDC reports on full chip. Various aspects are discussed, e.g. what are common kinds of CDC violations, […]

 4,050 total views,  4 views today

Categories
Computing VLSI

⨘ } VLSI } 017 } CMOS Power Consumption }

CMOS power and energy concepts, power analysis during chip design flow is discussed. AC and DC power are discussed. Different power components of PMOS and NMOS dynamic and static power are discussed. Static and Dynamic power equations are discussed. A brief overview of Apache Power Artist EDA power analysis tool is discussed. Dynamic power in […]

 3,603 total views,  4 views today

Categories
Computing VLSI

⨘ } VLSI } 016 } Do You Write a Good RTL Code }

Important concepts for a good RTL design, blocking, non-blocking type of statements in verilog, multiple-drivers, assertions, fsm-deadlock, and in general good digital design practices are discussed. LEPROF/1LEPROF/LEPROFESSEUR  3,527 total views,  4 views today

 3,527 total views,  4 views today

Categories
Computing VLSI

VLSI } 015 } Static Timing Analysis

This lecture discuss static timing analysis concepts. What are different paths, different kinds of checks, e.g. max type, min type timing analysis tool like prime time from synopsys does. How the setup and hold checks are performed, how to analyzed the timing report, how to fix the setup and hold violations are discussed. The need […]

 4,175 total views,  4 views today

Categories
Computing VLSI

VLSI } 014 } Latch-up & CMOS Technologies }

Latch-up phenomenon in CMOS circuits – What is latch-up, what are typical methods to mitigate latch-up and layout changes for conventional bulk silicon technology. A discussion on other technology – SOI versus bulk silicon is presented.  5,270 total views

 5,270 total views

Categories
Computing VLSI

VLSI } 013 } Floor-planning tips }

This lecture discusses some of the SoC floor-planning challenges and tips. A good floor-plan is the key to quality placement results. These are NP-hard problems which EDA tool have to deal with. A good initial floor-plan can save lot of physical design issues later in the design phase. It is very important to have a […]

 3,821 total views

Categories
Computing VLSI

VLSI } 012 } Metastability }

This lecture discusses concept of metastability. Synchronous designs suffer from this inherent problem associated with flip-flops, latches in the design. How to conceptualize metastability. Water flow analogy is very helpful when designing circuits at transistors level. What is MTBF (mean time between failures) and how we can develop MTBF equation. What are different recommendations for […]

 5,079 total views

Categories
Computing VLSI

VLSI } 011 } Clock Domain Crossing } Multi Voltage Domains }

This lecture discusses multi voltage domain crossings. Now a days integrated circuits are no longer simple circuits running on one or two static voltage domains but having dynamically switched multi voltage domains. Signals pass through these voltage domains. There can exists crossings between different clock domains having same voltage domain or different clock domains and […]

 4,639 total views

Categories
Algorithms Computing

Algorithms } 045 } Ant Colony Optimization } Technique

This lecture extends further the discussion on any colony technique. Ants can be considered artificial agents which work together and improve candidate solution in each iteration. A simple ant colony algorithm is discussed. Individual ants may not be that smart but when they work in group, they are one of the smartest creatures. How ant […]

 3,894 total views,  4 views today

Categories
Computing VLSI

VLSI } 010 } Reset Domain Crossing (RDC) }

This lecture discusses reset domain crossing (RDC) digital design techniques. Reset trees are similar to clock trees and resets crossings must be carefully verified. It needs to plan early in the design phase for clock and reset crossing verification which is quite essential. The bugs which can be due to reset domain crossings or clock […]

 6,177 total views,  2 views today

Categories
Computing VLSI

VLSI } 009 } Clock Domain Crossings } FIFO }

This lecture extends the discussion on clock domain crossings. In this lecture design techniques for multi-bit clock crossings have been discussed. One can classify CDC signals in two groups broadly: control signals and data signals. For single bit control signals double flop synchronizing circuits or special library sync cells can be used safely. This becomes […]

 5,131 total views,  2 views today

Categories
Algorithms Computing

Algorithms } 044 } Ant Colony Optimization } Introduction }

This lecture introduces the concept of ant colony. Individual ants may not be that smart but when they work in group, they are one of the smartest creatures. How ant find the food quickly and slowly optimize their route to shortest route from source to their home, the same concept we can apply to many […]

 4,418 total views,  2 views today

Categories
Computer Programming Computing

⨘ } Matlab quick overview }

This lecture provides a quick overview for Matlab or Octave. Matlab and Octave both are software tools for scientific computations. Matlab is proprietary software package and Octave is open source which can be downloaded from gnu open source project page. Some syntax of Octave may not be compatible with Matlab but mostly matlab code is […]

 5,813 total views,  2 views today

Categories
Computing Software Engineering

Software Engineering } 007 } Agile versus Spiral }

This lecture discusses key ideas of agile framework and its differences with traditional waterfall and spiral software development methodologies. Waterfall model is a very early model of software development. As software systems became complex, it needed new techniques to manage software development process. In waterfall model cost dynamically increase if we try to implement design […]

 4,446 total views,  2 views today

Categories
Computing VLSI

VLSI } 008 } Antenna Effects }

This lecture discusses concept of antenna effect in vlsi physical design. A typical chip manufacturing steps discussed with the design guidelines to avoid antenna effects in vlsi design. Antenna effect can damage the integrated circuit permanently. Antenna effects are caused by plasma etching process. In simple terms antenna are floating charge builds up on metal […]

 5,876 total views

Categories
Algorithms Computing

Algorithms } 043 } Genetic Algorithms }

This lecture discusses basic principles of Genetic Algorithms, a class of evolutionary computational algorithms. Genetic algorithms are based on the concept of biological evolution. As in biological science there is concept of how species are born due to union of male and female type of species and new generation take place of older generation, in […]

 4,577 total views,  6 views today

Categories
Algorithms Computing

Algorithms } 042 } Monte-Carlo Methods }

This lecture discusses basic principles of Monte-Carlo methods, a class of computational algorithms. A simple example of estimating value of pi is discussed. Monte-carlo techniques are widely used in the areas of modern physics, nuclear simulation, astro-physics and many other areas of science and engineering where direct computation or analytical solutions are impossible or too […]

 4,625 total views

Categories
Computing VLSI

VLSI } 007 } Logic Gates using Multiplexers }

This lecture discusses multiplexers and logic gates. How to design logic gates using 2:1 multiplexers? Multiplexers are considered universal logic. One can design any logic gate using multiplexers and in turn any logic circuit. Mux-based FPGAS use these techniques to create logic gates using multiplexers for logic implementation. [ ►Subscribe ] Leprofesseur } on YouTube. […]

 4,755 total views

Categories
Algorithms Computing

Algorithms } 04 } Bags, Queues, and Stacks }

This lecture covers very basic concepts about bags, stacks and queues in nutshell. You may have known these concepts already. Just a note that when I discuss stacks I was explaining compiler example for stack, it just for example a partial stack. More detailed stack implementation as compiler does is not explained here. Also, I […]

 5,285 total views

Categories
Algorithms Computing

Algorithms } 040 } Computational Geometry }

This lecture introduces computational geometry and basic algorithms for finding line segments. Computational geometry has applications in many areas: robotics, forestry, medical imaging, metallurgy, VLSI design, textile layout, manufacturing, computer graphics, robotics, computer-aided design, molecular modeling and many other modern science areas which one needs to deal with geometric objects and geometric problems. Typical inputs […]

 4,425 total views,  2 views today

Categories
Algorithms Computing

Algorithms } 039 } String Matching } Knuth-Morris-Pratt }

This lecture discusses Knuth-Morris-Pratt string matching algorithm. Click above and [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up ? Sincerely, H.  6,243 total views

 6,243 total views

Categories
Algorithms Computing

Algorithms } 038 } String Matching } Finite Automata }

This lecture discusses string matching problem and finite automation based string matcher algorithm. Click above and [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂 Sincerely, H.  5,670 total views,  2 views today

 5,670 total views,  2 views today

Categories
Algorithms Computing

Algorithms } 037 } String Matching }

This lecture discusses string matching problem and brute force naive string matcher algorithm. Click above and [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂 Sincerely, H.  5,400 total views,  2 views today

 5,400 total views,  2 views today

Categories
Computing VLSI

Tutorials } System Verilog } Assertions }

This lecture discusses assertions in system verilog. Immediate, concurrent assertions with multiple clock domains are discussed. [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂 Sincerely, H.  5,626 total views

 5,626 total views

Categories
Computing VLSI

VLSI } 006 } Timing }

This lecture discusses timing in digital circuits. It is said that “Timing is everything”. If someone does not arrive on time at a meeting of a party it is considered bad effect. In similar way timing is the most important in digital circuits. Sequential digital techniques are dependent on correct time accurate behavior of design […]

 3,937 total views,  2 views today

Categories
Algorithms Computing

Algorithms } 036 } Greatest Common Divisor (GCD) }

This lecture discusses Euclid’s algorithm for finding greatest common divisor. Extended Euclid’s algorithm has also been discussed. [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂 Sincerely, H.  5,546 total views,  2 views today

 5,546 total views,  2 views today

Categories
Algorithms Computing

Algorithms } 035 } Linear Programming } Simplex Algorithm }

This lecture discusses optimization problems, slack representation and Simplex algorithm for solving linear programming problems. [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂 Sincerely, H.  4,735 total views,  2 views today

 4,735 total views,  2 views today

Categories
Algorithms Computing

Algorithms } 034 } Solving Linear Equations }

This lecture discusses LPU decomposition method for solving linear equations. [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂 Sincerely, H.  5,145 total views,  2 views today

 5,145 total views,  2 views today

Categories
Algorithms Computing

Algorithms } 033 } Parallel Algorithms }

This lecture discusses introduction to parallel algorithms with multi-threading. Fibonacci series example is discussed. [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂 Sincerely, H.  8,136 total views

 8,136 total views

Categories
Algorithms Computing

Algorithms } 032 } Graphs } Flow Networks } Push-Relabel }

This lecture discusses Push-Relabel approach for solving flow network problems. Generic flow-network algorithm has been discussed. [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂 Sincerely, H.R. ERRATA: Nicklas Dohrn pointed this error: “Hey there, great video and one of the only videos that […]

 6,850 total views,  2 views today

Categories
Algorithms Computing

Algorithms } 031 } Graphs } Flow Networks } Edmonds-Karp }

This lecture discusses basic difference between Edmonds-Karp and Ford-Fulkerson’s algorithm. [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂 Sincerely, H.  5,143 total views

 5,143 total views

Categories
Algorithms Computing

Algorithms } 030 } Graphs } Flow Networks } Ford-Fulkerson }

This lecture discusses concept of flow networks, flow, residual graph, and how to find maximum flow value in a flow network. The Ford-Fulkerson’s algorithm is discussed for finding maximum flow in a given flow network. [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂 […]

 5,492 total views,  2 views today

Categories
Algorithms Computing

Algorithms } 029 } Graphs } Dijkstra’s algorithm }

This algorithm discusses Dijkstra’s algorithm for single-source shortest path problem. [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂 Sincerely, H.  7,413 total views

 7,413 total views

Categories
Algorithms Computing

Algorithms } 028 } Graphs } The Bellman-Ford Algorithm }

This lecture discusses the Bellman-Ford algorithm for finding single source shortest path. [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Sincerely, H.  7,746 total views,  4 views today

 7,746 total views,  4 views today

Categories
Algorithms Computing

Algorithms } 027 } Graphs } Minimum Spanning Tree } Prim }

This algorithm discusses Prim’s algorithm for finding minimum spanning tree. [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your support and feedback. Sincerely, H.  6,009 total views,  2 views today

 6,009 total views,  2 views today

Categories
Algorithms Computing

Algorithms } 026 } Graphs } Minimum Spanning Tree } Kruskal }

This algorithm discusses Kruskal’s algorithm for finding minimum spanning tree. [ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your support and feedback. Sincerely, H.  4,977 total views

 4,977 total views

Categories
Algorithms Computing

Algorithms } 025 } Graphs } Minimum Spanning Tree } Introduction }

This lecture discusses spanning trees and minimum spanning tree with a generic algorithm to find a minimum spanning tree in a graph. A basic greedy approach to find minimum spanning tree in a graph is discussed for a digital circuit example. Sincerely, H.  4,841 total views,  2 views today

 4,841 total views,  2 views today

Categories
Computing VLSI

VLSI } 005 } State Machines }

This lecture discusses a fundamental and an important topic in digital circuit design – state machines. Mealy and Moore variants of sequential state machine are discussed with examples. How to synthesize state machine circuit from state graphs, state transition tables using Boolean equations and Karnaugh map is discussed. A verilog example for synthesizable Moore and […]

 7,014 total views,  4 views today