Certification Course in ASIC RTL Design and Verification


We have designed this course for serious VLSI job seekers to fully prepare them to the expectations of the industry standard and we are committed to provide 100% placement assistance. Candidates must take a written test to be eligible for joining this course.

In this course you will learn both ASIC design and verification concepts. Verilog is covered as part of design and systemVerilog/UVM are covered as part of verification. The course highlights are periodical tests followed by extensive lab sessions and mock interviews.


This course provides the solid foundations on ASIC design concepts. The course starts from the fundamentals , covers block level design from scratch, RTL coding , FSM coding techniques,  Verilog design & verification constructs,  Synthesis,  area and timing constraints,  finding critical paths in the design and optimization, Clock domain Crossing and metastability,  Low Power design techniques, memories, Xilinx FPGA design etc.    Exercises and interview preparation as part of this course are added advantage.


Verification has become primary concern as all the companies want their IP to be fully verified before it goes to silicon. As a result, companies are spending more money on verification and the demand for verification engineers in the industry is growing day by day.

This course is designed to fully prepare the student to meet the verification challenges involved with medium size to complex IP’s.  SystemVerilog emerged as the industry’s key verification languages as it supports coverage driven verification coupled with CRT(Constrained Random Techniques). In this course, you will learn verification concepts such as functional coverage, verification plan, layered testbenches etc., and as part of systemVerilog,  OOPS concepts such as inheritance, polymorphism, encapsulation, and Constrained random techniques , coverage driven verification, virtual interfaces and call backs etc.

UVM(Universal verification methodology) is gaining universal acceptance as the de-facto verification methodology. UVM enables efficient development and reuse of verification environments. As part of this course, you will learn all UVM concepts such as UVM factory,UVC(UVM verification components), UVM sequencers, configuration database, sequence libraries,  TLM, virtual sequencer, register abstraction, callbacks etc.


Register here : https://www.sumedhait.com/register/

Course duration             : 4.5 months

Fees                                  : Rs 60,000 (including taxes)

Next Batch starting on : 2nd January

Course Curriculum:

Main Topic Contents
ASIC and SOC What is ASIC & SOCs & FPGAs
SOC Design Flow Study different stages of ASIC design flow
Number Systems Analog Vs Digital
Binary numbers
Fixed and Floating point
Binary Octal Hexa Decimal
Binary Addition
Representation of Negative numbers
1’s Complement & 2’s Complement
2’s Complement addition and Subtraction
Binary multiplication
Binary Codes, Gray Code, Excess-3 code, 2421 code, BCD code
Error Detecting and Correcting Codes Parity
Hamming codes
CRC codes
Logic Simplification Boolean Algebra
Principle of duality
Shannon’s theorem
Min terms and Max terms
Canonical SOP and POS
Algebraic Simplification
Simplification using k-map
Prime Implicants, Essential Prime Implicants, Finding minimal expression
Quine-McCluskey Method
Combinational Logic Part I SOC Design Flow
What is ASIC & SOCs & FPGAs
Study different stages of ASIC design flow
Gates, Fan-in, Fan-out, Noise Margin, Propagation Delay
Active High and Active Low logic
Levels of logic and propagation delay
Multiple outputs – Simplification
Universal gates, Inverting gates vs Non-inverting gates
Inhibition and Implication, Timing Hazards Static or Dynamic
Combinational Logic Part II Decoders, Encoders and Priority Encoders
Tri-State Buffers
Parity circuits
Iterative Circuits
Half adder
Full adder
Binary Adder
Adder Cum Subtractor
BCD adder
Fast Adders
Carry look ahead adder
Carry Skip adder
Carry Save adder
Carry Select Adder
Combinational Logic – Design examples. Some Indiustrial oriented designs using combi logic
Sequential Logic – Part 1 Combinational Vs Sequential Circuits
Latches, S-R Latch, J-K Latch
Flip-Flop, S-R Flip-flop, J-K Flip-Flop
Latch vs Flip-Flop
Race around Condition
Master Slave flip flop
Edge Triggered flip-flops
D-flop, T-Flop
Preset and Clear pins
Excitation tables and Characteristic equation
Sequential Logic – Part 2 Shift Registers
Universal Shift Register
Ripple Counters
Synchronous Counters
Divide-by-n counters
up/down counters
Design using State machines Mealay and Moore state machines
State table, State diagram, State reduction, State assignment Analysis,
Design, Mealy Vs Moore
Sequential Logic – Design examples. Some Industrial oriented designs using Seq logic
Design Rules/Logic Setup and hold timings
Maximum frequency of operation
Crtical Path
Clock Skew and Clock Jitter
Fixing set-up and Hold violations
Control and datapath design
Factoring State machines.
Design Examples – Part I
Design Examples – Part II
Metastability and Clock Domain Crossing Techniques
Reset Synchronization
Low Power Design – Clock Gating Techniques
Programmable logic Devices –
FPGA architecures Xilinx FPGAs
Synthesizing and Implementing Designs
Verilog HDL Introduction to HDLs and RTL design
Data types
Verilog Constructs
Continuous assignments
Procedural assignment statements – blocking and non-blocking
Logical operators
Arithmetic Operators
Unsigned arithmetic
Signed arithmetic
Relational Operators
Equality Operators
Shift Operators
Vector Operations
Part Selects
Bit Selects
Conditional Expressions
Always Statement
If statement
Case Statement (CaseZ&CaseX Statements)
Inferring Latches from Case Statements
Full case, Parallel case
Module Instantiation Statement
Parametered Designs
Structural, Behavioral, Dataflow modelling in verilog
Modelling in Verilog Combinational logic using verilog
Sequential logic using verilog
Coding FSMs in Verilog
Coding Mealy FSMs in Verilog
Coding Moore FSMs in Verilog
Design Examples using verilog
Optimizations in Verilog Resource allocation
common Subexpressions
Moving Code
Common factoring
Avoiding latches
Reusable and modular design using Verilog Parameterized design
Verilog Function
Verilog Generate Construct
Verilog `ifdef
Verification using verilog Verilog testbench
Non-synthesizable constructs in verilog
Initial statement
for loop,repeat
while loop
force, release
fork and join
Functions and Tasks in verilog $finish,$stop
Design Techniques Memory modeling using verilog
RTL Coding Guidelines – Dos and Donts
Synthesis Overview
Simulation and Synthesis mismatches
Constraining Designs
Verification Guidelines
The Verification Process
The Verification Plan
The Verification Methodology Manuals
Basic Testbench Functionality
Directed Testing
Methodology Basics
Constrained Random Stimulus
What should you Randomize
Functional Coverage
Testbench Components
Layered Testbench
Building a Layered Testbench
Simulation Environment Phases
Maximum Code Reuse
Testbench Performance
HVL System Verilog
Datatypes Introduction
Built-in Data Types
Fixed Size Arrays
Dynamic Arrays
Associative Arrays
Linked Lists
Array Methods
Choosing a Storage Type
Creating New Types with typedef
Creating user-defined structure
Enumerated types
Expression width
Net types
Procedural Statements And Routines Introduction
Procedural Statements
Tasks,Functions, and Void Functions
Task and Function Overview
Routine Arguments
Returning from a Routine
Local Data Storage
Time Values
Basic OOP Introduction
Think of Nouns,not verbs
First Class
Defining a Class
OOP Terminology
Creating New Objects
Object Deallocation
Using Objects
Static Variables vs Global variables
Class Routines
Defining Routines outside
of the Class
Scoping Rules
Using one class inside another
Understanding dynamic objects
copying objects
Public vs Private
Straying Off a course
Building a Testbench
Connecting The Testbench And Design Introduction
Separating the Testbench and Design
The Interface Construct
Stimulus Timing
Interface Driving and Sampling
Connecting It All Together
Top Level Scope
Program – Module interactions
SystemVerilog Assertions
The Four-Port ATM Router
Randomization Introduction
What to Randomize
Randomization in SystemVerilog
Constraint Details
Solution Probabilities
Controlling Multiple Constraint Blocks
Valid Constraints
In-line Constraints
The pre_randomize and post_randomize Functions
Constraint Tips and Techniques
Common Randomization Problems
Iterative and Array Constraints
Atomic Stimulus generation vs scenario generation
Random Control
Random Generators
Random Device Configuration
Threads and Interprocess Communication Introduction
working with thread
Inter process Communication
Building a Testbench with Threads and IP
Advanced OOP and Guidelines Introduction
Introduction to Inheritance
Factory Patterns
Type Casting and
Virtual methods
Composition,Inheritance and Alternatives
Copying an Object
Functional Coverage Introduction
Coverage Types
Functional Coverage Stratagies
Simple Functional Coverage Example
Anatomy of a cover group
Triggering of a cover
Data Sampling
Cross Coverage
Coverage Options
Parameterized Cover Groups
Analyzing Coverage Data
Measuring Coverage Statistics during simulation
Universal Verification Methodology (UVM)
A Conventional Testbench for the TinyALU
SystemVerilog Interfaces and Bus Functional Models
Object Oriented Programming(OOP)
Classes And Extension
Static Methods and Variables
Parameterized Class Definitions
The Factory Pattern
An Object Oriented Testbench
UVM Tests
UVM Components
UVM Environments
A New Paradigm
Talking to Multiple Objects
Using Analysis Ports in a Testbench
Interthread Communication
Put and Get ports in Action
UVM Reporting
Class Hierarchies and Deep Operations
UVM Transactions
UVM Agents
UVM sequences
Onward with the UVM


Course Duration : 30 days

Course fee : Rs 30,000

Course Curriculum

PCIe protocol 



  • Typical PCI Bus Cycle
  • PCI Bus Architecture Perspective
  • PCI Transaction Models
  • Programmed I/O
  • Direct Memory Access (DMA)
  • PCI Inefficiencies
  • PCI Retry Protocol
  • PCI Disconnect Protocol
  • PCI Interrupt Handling
  • PCI Error Handling
  • PCI Address Space Map
  • PCI Configuration Cycle Generation
  • PCI-X Transactions



  • Split-Transaction Model
  • Message Signaled Interrupts
  • Transaction Attributes
  • No Snoop (NS)
  • Relaxed Ordering (RO)
  • Higher Bandwidth PCI-X
  • Parallel Bus Model


PCIe Architecture Overview:

  • Root Complex
  • Switches and Bridges
  • Endpoint
  • Introduction to Device Layers
  • Device Core / Software Layer
  • Transaction Layer
  • Data Link Layer
  • Physical Layer


Transaction Layer:

  • TLP Assembly and Disassembly
  •  TLP Structurer
  • Generic TLP Header format
  •  Generic Header Field format
  •  Request & Completion of TLP
    • IO Request
    • Memory Request
    • Configuration Request
    • Message Request
  •  Address Routing
    • Address based Routing
    • ID based Routing
    • Implicit Routing
  •  Example TLP packet flow


Data Link Layer:

  • Data Link Layer Transmitter
  • Data Link Layer Receiver
  • DLLP Packet Types
  • Ack/Nak DLLP Format
  • Power Management DLLP Format
  • Flow Control DLLP Format
  • DLLP Assembly
  • DLLP Disassembly
  • Ack/Nak Protocol
  • Flow Control
  • Power Management


Physical Layer:

  • PHY Layer Overview
  • Overview of PHY Transmit Logic
  • Overview of PHY Receiver Logic
  • Byte Stripping / Unstripping
  • Scrambling / Descrambling
  • 8/10b Encoding / Decoding
  • 128/130b Encoding / Decoding
  • PHY Layer Error Handling


Link Initialization & Training:

  • Ordered Sets in Link Training
  • Link Training and Status State Machine (LTSSM)
  • LTSSM States
  • Detect State
  • Polling State
  • Configuration State
  • L0 State
  • Recovery State
  • L1 State
  • L2 State


            I2C Protocol

Introduction to I2C communication

  • Features
  • Hardware
  • The physical I2C bus Master and Slave devices SDA and SCL bus signal.

Data transfer format in protocol

  • start condition
  • Address block
    7-bit addressing
    10-bit     addressing
  • Read/Write bit
  • ACK/NACK bit
  • Data block
  • Stop condition
  • Repeated start condition


How I2C communication practically works?

  • Sending data to the slave device
  • Reading data from the slave device
  • Clock     synchronization
  • Concept of clock stretching
  • Arbitration


Bus speeds

  • Standard mode
  • Fast mode
  • High speed mode
  • ultra fast mode


Serial VS. Parallel Communication

Introduction of SPI protocol

  •  Serial Peripheral Interface Basics
  •  SPI Lines
  •  MISO (Master in Slave out)
  •  MOSI (Master out Slave in)
  •  SCK (serial clock)
  •  SS (Slave Select) and CS (Chip Select)

SPI Data Transmission and Reception

Multiple slaves

Programmable registers

  • Data Register
  • Control  Register
  • Status Register
  • Slave select Register

Clock Polarity and Clock Phase

SPI modes of operation

  • Mode 0 (CPOL=0 &     CPHA=0)
  • Mode     1(CPOL =0&CPHA =1)
  • Mode     2 (CPOL=1 &CPHA=0)
  • Mode     3(CPOL=1&CPHA=1)


SPI configurations

  • Independent slave configuration
  • Daisy chain configuration
× Hit me for quick assistance