32 total views

32 total views

32 total views

32 total views

66 total views

66 total views

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 […]

1,677 total views, 8 views today

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 […]

1,048 total views, 2 views today

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 […]

1,036 total views

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 […]

2,715 total views, 8 views today

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 […]

2,865 total views, 6 views today

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, […]

5,543 total views, 6 views today

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 […]

4,890 total views, 8 views today

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 4,879 total views, 8 views today

4,879 total views, 8 views today

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,880 total views, 2 views today

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,838 total views

5,838 total views

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 […]

4,398 total views, 2 views today

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,812 total views

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 […]

5,366 total views, 2 views today

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 […]

4,513 total views, 2 views today

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 […]

7,046 total views, 4 views today

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,839 total views, 2 views today

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,986 total views, 2 views today

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 […]

6,408 total views, 2 views today

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 […]

5,023 total views, 4 views today

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 […]

6,511 total views

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 […]

5,161 total views, 2 views today

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 […]

5,247 total views

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. […]

5,398 total views, 2 views today

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,873 total views, 6 views today

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 […]

5,031 total views, 2 views today

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,820 total views, 2 views today

6,820 total views, 2 views today

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. 6,285 total views

6,285 total views

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. 6,009 total views, 2 views today

6,009 total views, 2 views today

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. 6,247 total views, 4 views today

6,247 total views, 4 views today

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 […]

4,564 total views, 2 views today

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. 6,185 total views

6,185 total views

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. 5,308 total views, 2 views today

5,308 total views, 2 views today

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,740 total views, 4 views today

5,740 total views, 4 views today

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,723 total views

8,723 total views

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 […]

7,464 total views, 2 views today

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,754 total views, 6 views today

5,754 total views, 6 views today

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 🙂 […]

6,084 total views

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. 8,014 total views, 4 views today

8,014 total views, 4 views today

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. 8,360 total views, 2 views today

8,360 total views, 2 views today

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

6,598 total views

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

5,649 total views