Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/6951
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Patel, Urmish | - |
dc.date.accessioned | 2016-09-02T08:59:44Z | - |
dc.date.available | 2016-09-02T08:59:44Z | - |
dc.date.issued | 2016-06-01 | - |
dc.identifier.uri | http://hdl.handle.net/123456789/6951 | - |
dc.description.abstract | Nowadays, System-on-chip (SoC) becomes more complex. SoC have large number of core and various IP. Physical dimension of devices are also deceasing as well. Due to smaller dimension it is difficult to access the test point. Here DFT techniques come to picture. Increasing coverage (Access all components of SoC in stand- alone mode or functional mode) and decreasing test cost is very emerging topic in research areas. Adding extra module DFT module in SoC also requires conventional verification. DFT module increase complexity of SoC but it help to generate specific test vector which helps reducing test pattern ultimate reducing the chip cost. There are various DFT techniques like BIST, MBIST and scan chain insertion. Here we seen how to test the standalone analog IP through TCU and pattern simulation for various fault model. | en_US |
dc.publisher | Institute of Technology | en_US |
dc.relation.ispartofseries | 14MECV30; | - |
dc.subject | EC 2014 | en_US |
dc.subject | Project Report | en_US |
dc.subject | Project Report 2014 | en_US |
dc.subject | EC Project Report | en_US |
dc.subject | EC (VLSI) | en_US |
dc.subject | VLSI | en_US |
dc.subject | VLSI 2014 | en_US |
dc.subject | 14MEC | en_US |
dc.subject | 14MECV | en_US |
dc.subject | 14MECV30 | en_US |
dc.title | DFT Verification and Pattern Simulation for Analog IP | en_US |
dc.type | Dissertation | en_US |
Appears in Collections: | Dissertation, EC (VLSI) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
14MECV30.pdf | 14MECV30 | 2.79 MB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.