Login | Register

A Functional Verification Methodology for an Improved Coverage of System-on-Chips

Title:

A Functional Verification Methodology for an Improved Coverage of System-on-Chips

Mani Paret, Jomu George (2015) A Functional Verification Methodology for an Improved Coverage of System-on-Chips. PhD thesis, Concordia University.

[img]
Preview
Text (application/pdf)
ManiParet_PhD_S2015.pdf - Accepted Version
Available under License Spectrum Terms of Access.
1MB

Abstract

The increasing popularity of System-on-Chip (SoC) circuits results in many new design challenges. One major challenge is to ensure the functional correctness of such complicated circuits. Functional verification is a verification technique used to verify the functional correctness of SoCs. Coverage Directed Test Generation (CDTG) is an essential part of functional verification, where the objective is to generate input stimulus that maximize the coverage of a design. Coverage helps to determine how well the input stimulus verified the design under verification. CDTG techniques analyze coverage results and adapt the input stimulus generation process to improve the coverage. One of the important component of CDTG based tools is the constraint solver. The time efficiency of the verification process depends on the efficiency of the solver. But the constraint solvers associated with CDTG tools require large amount of memory and time to generate input stimuli for SoCs. The solvers cannot generate solutions which are evenly distributed in search space, in order to attain the required coverage.


The aim of this thesis is to provide a practical framework that enables the generation of evenly distributed input stimuli. A basic feature of the search space (data set) is that it contains k sub populations or clusters. Partitioning the search space into clusters and generating solutions from the partitions can improve the evenness of the solutions generated by the solver. Hence one of our main contribution is a novel domain partitioning algorithm. The domain partitioning algorithm relies on solution generated by a consistency search algorithm developed for our purpose. The number of partitions (required by the domain partitioning algorithm) is determined by using an algorithm which can find the optimal number of clusters present in a data set. To demonstrate the effectiveness of our approach, we apply our methodology on Constraint Satisfaction Problems (CSPs) and some real life applications.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Electrical and Computer Engineering
Item Type:Thesis (PhD)
Authors:Mani Paret, Jomu George
Institution:Concordia University
Degree Name:Ph. D.
Program:Electrical and Computer Engineering
Date:16 January 2015
Thesis Supervisor(s):Otmane, Ait Mohamed
ID Code:979928
Deposited By: JOMU GEORGE MANI PARET
Deposited On:16 Jul 2015 12:58
Last Modified:18 Jan 2018 17:50
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Back to top Back to top