00:21

⨘ } SoC clock domain crossings problem

57:49

⨘ } VLSI } 27 } Coding techniques - a simple fifo design in verilog } LEPROFESSEUR

13:30

⨘ } VLSI } 26 } CDC, Reconvergence } LEPROFESSEUR }

09:53

⨘ } VLSI } 24 } Reset Domain Crossings, Solutions } LE PROFOFESSEUR }

17:12

⨘ } VLSI } System Verilog Assertions } LE PROF }

29:04

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

28:01

⨘ } VLSI } 22 } Pass-Transistor Logic Circuits } LE PROF }

00:20

⨘ } Complex Concepts Made Easy } LEPROFESSEUR }

00:15

⨘ } Complex Concepts Made Easy } LeProfesseur} Learn with HR

47:41

⨘ } Multi-criteria Decision Making, Analytical Hierarchy Process (AHP) } LE PROFESSEUR }

26:27

⨘ } VLSI } 21 } CMOS circuits design, physical layout, combinatorial logic, PUN, PDN } LEPROF }

32:32

⨘ } VLSI } 20 } CMOS Interconnects } LEPROF }

53:22

⨘ } Tips for choosing a university for higher education } LEPROFESSEUR

24:28

⨘ } VLSI } 19 } System Verilog } Assertions } Protocol Verification } LEPROF }

33:27

⨘ } VLSI } 18 } Clock Domain Crossing } Questa CDC / Mentor / 0-in } LEPROF }

40:04

⨘ } VLSI } 17 } Power dissipation in electronic circuits } ASIC Power Analysis } LEPROF }

00:19

⨘ } Le Professeur - Learn with HR

25:52

⨘ } VLSI } 16 } Verilog, VHDL, Do You Write a Good RTL Code } LEPROFESSEUR

51:16

⨘ } VLSI } 15 } Static Timing Analysis (STA), concepts, paths, and how to fix violations } LE PROF }

00:12

⨘ } LEPROFESSEUR }

23:11

⨘ } VLSI } 14 } Latch-up & CMOS Technologies } LEPROF }

26:24

⨘ } VLSI } 13 } Floor-planning & placement tips } LEPROF }

31:29

⨘ } VLSI } 12 } Metastability in digital circuits } LEPROF }

18:29

⨘ } Economics } 12 } Economic Growth, GDP, Business Cycles } LEPROF }

14:11

⨘ } VLSI } 11 } Clock Domain Crossing (CDC) } Multi Voltage Domains } LEPROF }

17:21

⨘ } Algorithms } 45 } Ant Colony Optimization } Mathematical Formulations } LE PROF }

14:45

⨘ } VLSI } 10 } Clock Domain Crossing (CDC) } Reset Domain Crossing (RDC) } LEPROF }

19:42

⨘ } VLSI } 9 } Clock Domain Crossing (CDC) } FIFO } LE PROF }

16:10

⨘ } Algorithms } 44 } Ant Colony Optimization } part - 1 } LEPROF }

47:09

⨘ } Matlab / Octave basic concepts } LEPROF }

22:24

⨘ } Software Engineering } 007 } Agile vs Spiral } LEPROF }

26:39

⨘ } VLSI } 8 } Antenna Effects } LE PROF }

16:58

⨘ } Algorithms } 43 } Genetic Algorithms } part - 1 } LEPROF }

10:25

⨘ } Investment } Templeton's 16 Rules for Investment Success }

14:23

⨘ } Algorithms } 42 } Monte-Carlo Methods } LE PROF }

37:52

⨘ } Investment } What are Hedge Funds } LEPROF }

24:20

⨘ } VLSI } 007 } Logic Gates using Multiplexers } LE PROF }

12:00

⨘ } Algorithms } 41 } Data Structures } Bags, Queues, Stacks } LEPROF }

14:37

⨘ } Algorithms } 40 } Computational Geometry } Line Segments } LE PROF }

22:12

⨘ } Algorithms } 39 } String Matching } Knuth-Morris-Pratt 's Method } LEPROF }

24:47

⨘ } Algorithms } 38 } String Matching } Finite Automata } LEPROF }

10:02

⨘ } Algorithms } 37 } String Matching } Concepts } LEPROF }

17:12

⨘ } VLSI } System Verliog } Assertions } LE PROF }

18:05

⨘ } VLSI } 6 } Synchronous Design, Flip-Flops, Clocks & Timing } LEPROF }

11:15

⨘ } Algorithms} 36 } Greatest Common Divisor [ GCD ] }

10:09

Financial Analysis } 13 } Profitability & Growth }

32:06

⨘ } Algorithms } 35 } Linear Programming } Simplex Method }

28:45

⨘ } Algorithms } 34 } Solving linear equations } LUP decomposition } LEPROF }

16:05

⨘ } Economics } 11 } Real Estate Pricing }

22:27

⨘ } vi / vim / gvim - a quick overview } LEPROF }

10:21

⨘ } Algorithms } 33 } Parallel Algorithms } LE PROF }

10:29

⨘ } Economics } 10 } Applied consumer theory, labor supply models } LEPROF }

12:31

⨘ } Corporate Finance } 12 } Convertible Bonds }

26:48

⨘ } Algorithms } 32 } Graphs } Flow Networks } Push-Relabel } LE PROF }

04:06

⨘ } Algorithms } 31 } Graphs } Flow Networks } Edmonds-Karp } LEPROFESSEUR }

15:02

⨘ } Financial Analysis } 12 } Revenue Analysis }

53:12

⨘ } Algorithms } 30 } Graphs } Flow Networks } Ford-Fulkerson's Method } LEPROFESSEUR }

22:05

⨘ } Algorithms } 29 } Graphs } Dijkstra's method }

15:34

⨘ } Algorithms } 28 } Graphs } Shortest Path } Bellman-Ford }

17:55

⨘ } Economics } 9 } Economic Utility }