Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/4742
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lahoti, Pravin Kumar Omprakash | - |
dc.date.accessioned | 2014-08-07T12:03:25Z | - |
dc.date.available | 2014-08-07T12:03:25Z | - |
dc.date.issued | 2014-06-01 | - |
dc.identifier.uri | http://hdl.handle.net/123456789/4742 | - |
dc.description.abstract | The project deals with the verification environment present in a system on chip design. The project is the part of the Intel’s IP Subsystem based project which aims to integrate various IP’s to a main Intel processor to achieve a smart and power efficient design. The key goal of this project is to perform UART and UART BFM verification and quality improvement of UART BFM. Along with this improve the UART functional coverage and code coverage. The project also includes planning for test plan review and finding holes along with Test bench or case review. The functionality of UART and its BFM is validated through the various test cases written in C and hardware languages like system Verilog and OVM (Open Verification Methodology) along with the simulation results. Writing of assertions to check the UART protocol and analyzed the assertions. | en_US |
dc.publisher | Institute of Technology | en_US |
dc.relation.ispartofseries | 12MECV14; | - |
dc.subject | EC 2012 | en_US |
dc.subject | Project Report | en_US |
dc.subject | Project Report 2012 | en_US |
dc.subject | EC Project Report | en_US |
dc.subject | EC (VLSI) | en_US |
dc.subject | VLSI | en_US |
dc.subject | VLSI 2012 | en_US |
dc.subject | 12MEC | en_US |
dc.subject | 12MECV | en_US |
dc.subject | 12MECV14 | en_US |
dc.title | Challenges In Subsystem Verification | en_US |
dc.type | Dissertation | en_US |
Appears in Collections: | Dissertation, EC (VLSI) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
12MECV14.pdf | 12MECV14 | 716.47 kB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.