
Lecture 41 of 45 · C-Based VLSI Design
Chandan Karfa
C-Based VLSI Design · 45 lectures
45 lectures
1: Introduction to C-Based VLSI Design
2: An Overview
3: Problem Formulation
4: Course Plan
5: Introduction to Scheduling
6: ILP formulation of Scheduling
7: ILP formulation of MRLC and MLRC Scheduling
8: Multiprocessor Scheduling
9: Hu’s algorithm for Multiprocessor Scheduling
10: List based Scheduling of MLRC
11: List based Scheduling of MRLC
12: Forced Directed Scheduling
13: Forced Directed MLRC and MRLC Scheduling Algorithm
14: Path Based Scheduling
15: Path Based Scheduling
16: Allocation and Binding Problem Formulation
17: Left Edge Algorithm
18: ILP Formulation of Allocation and Binding
19: Allocation and Binding for Hierarchical Graph
20: Register Allocation and Binding
21: Multi-port Binding Problem
22: Datapath and Controller Synthesis
23: HLS for Arrays
24: HLS for Loops
25: HLS for Loop - pipeline
26: Hardware Efficient C Coding
27: Hardware Efficient C Coding - part II
28: Dataflow Optimization in HLS
29: Frontend Optimizations in C
30: HLS Optimizations: Case Study 1
31: HLS Optimizations: Case Study 1
32: Simulation based Verification
33: RTL to C Reverse Engineering
34: Phase-wise Verification of HLS
35: Equivalence between C and RTL
36: Introduction to Hardware Security
37: HLS for Security
38: Attacks on RTL Logic locking
39: Introduction to Logic Synthesis
40: FPGA Technology Mapping
41: Introduction to Physical Synthesis
42: Introduction to Circuit optimizations
43: Recent Advances in C-Based VLSI Design
Tutorial 2 - High-Level Synthesis Optimizations with Vivado HLS
Tutorial 1 - High-Level Synthesis with Vivado HLS