2016 20th International Symposium on VLSI Design and Test (VDAT)最新文献

筛选
英文 中文
Hardware optimizations for crypto implementations (Invited paper) 加密实现的硬件优化(特邀论文)
2016 20th International Symposium on VLSI Design and Test (VDAT) Pub Date : 2016-05-01 DOI: 10.1109/ISVDAT.2016.8064877
M. Basiri, Sandeep K. Shukla
{"title":"Hardware optimizations for crypto implementations (Invited paper)","authors":"M. Basiri, Sandeep K. Shukla","doi":"10.1109/ISVDAT.2016.8064877","DOIUrl":"https://doi.org/10.1109/ISVDAT.2016.8064877","url":null,"abstract":"Latency, Area, and Power are three important metrics that a VLSI designer wants to optimize. However, often one of these may have to be optimized at the cost of another or the other two. Depending on the application scenario, choice of the metric to optimize is made. In this paper, we consider hardware implementations of a number of cryptographic primitives and present a number of optimizations. We consider three areas of cryptoengineering. They are building physical unclonable functions (PUFs), implementing encryption/decryption algorithms, and side channel proof crypto implementations. The techniques we employ range from area optimization through customized multiplexer design, fusing multiple operations into a single hardware element, folding and unrolling of iterative algorithms, creating reconfigurable implementations to achieve multiple operations with the same set of hardware elements, to techniques of obfuscation to defeat fault injection based attacks on the crypto implementation. All the proposed and existing designs are implemented with 45 nm CMOS library.","PeriodicalId":301815,"journal":{"name":"2016 20th International Symposium on VLSI Design and Test (VDAT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122053204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Formal verification of switched capacitor DC to DC power converter using circuit simulation traces 正式验证的开关电容DC到DC功率转换器使用电路仿真走线
2016 20th International Symposium on VLSI Design and Test (VDAT) Pub Date : 2016-05-01 DOI: 10.1109/ISVDAT.2016.8064894
A. Mishra, S. Roy
{"title":"Formal verification of switched capacitor DC to DC power converter using circuit simulation traces","authors":"A. Mishra, S. Roy","doi":"10.1109/ISVDAT.2016.8064894","DOIUrl":"https://doi.org/10.1109/ISVDAT.2016.8064894","url":null,"abstract":"DC-DC power converters based on switched capacitor circuits are widely used to realize different power supply domains in SOC chips. They can be classified as Analog Mixed Signal circuits. Current approaches to their verification is primarily based on simulating their transistor level netlist in circuit simulators. In this paper an approach to formally verify them using simulation traces is proposed, where the traces are obtained from an actual CMOS design implementation of a switched capacitor DC-DC (SC DC-DC) power converter in Cadence Spectre circuit simulator.","PeriodicalId":301815,"journal":{"name":"2016 20th International Symposium on VLSI Design and Test (VDAT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123318971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Double Patterning Lithography (DPL)-compliant layout construction (DCLC) with area-stitch usage tradeoff 双版式光刻(DPL)-兼容布局结构(DCLC)与面积线使用权衡
2016 20th International Symposium on VLSI Design and Test (VDAT) Pub Date : 2016-05-01 DOI: 10.1109/ISVDAT.2016.8064875
D. Pal, Abir Pramanik, P. Dasgupta, D. K. Das
{"title":"Double Patterning Lithography (DPL)-compliant layout construction (DCLC) with area-stitch usage tradeoff","authors":"D. Pal, Abir Pramanik, P. Dasgupta, D. K. Das","doi":"10.1109/ISVDAT.2016.8064875","DOIUrl":"https://doi.org/10.1109/ISVDAT.2016.8064875","url":null,"abstract":"A layout decomposition in Double Patterning Lithography (DPL) is considered to be potential for processing nodes at or below 32 nm. In this method, two features are assigned different colors corresponding to different exposures if the spacing between them is less than a minimum value defined by design-specific rules. In general, there are cases where such different colors assignment may not be possible even though the inter-feature spacing is less than the specified minimum. This condition is often known as color conflict of adjacent features. Color conflicts are traditionally resolved by splitting the features. This problem is often modeled as a graph-theoretic problem, with color conflicts identified as odd-cycle detection, and the duplication of vertices of the graph arising out of splitting of features of a layout. However, for a given layout, the splitting of features may not always be desirable or even feasible. In this paper, we propose a merge-only technique with conservative application of de-compaction so that the overall area of the layout is minimally affected. We consider layouts having rectilinear features present in the layout and apply the proposed algorithm to obtain a DPL-compliant layout with selective use of stitches keeping the overall layout area fixed. Experimental results with some standard layouts demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":301815,"journal":{"name":"2016 20th International Symposium on VLSI Design and Test (VDAT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128732128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A low-power high-speed hybrid full adder 一种低功耗高速混合全加法器
2016 20th International Symposium on VLSI Design and Test (VDAT) Pub Date : 2016-05-01 DOI: 10.1109/ISVDAT.2016.8064900
Manan Mewada, M. Zaveri
{"title":"A low-power high-speed hybrid full adder","authors":"Manan Mewada, M. Zaveri","doi":"10.1109/ISVDAT.2016.8064900","DOIUrl":"https://doi.org/10.1109/ISVDAT.2016.8064900","url":null,"abstract":"In this paper we present a new hybrid FA design (mix of CMOS and pass transistor logic styles), which aims at achieving higher speed but keeping power dissipation low, and hence targeting low PDP. Our proposed FA and seven other existing FA designs are simulated in spice, using 45 nm low power model file, using standard test bed and test pattern (56 input transitions) [1, 2], and the simulation results of these eight designs are compared in terms of power dissipation, propagation delay and PDP. Simulation results proves that our proposed FA design has the lowest propagation delay and lowest PDP across the simulated supply voltage range and the frequency range.","PeriodicalId":301815,"journal":{"name":"2016 20th International Symposium on VLSI Design and Test (VDAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129992168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Planning based guided reconstruction of corner cases in architectural validation 在架构验证中,基于指导重构的边缘案例的规划
2016 20th International Symposium on VLSI Design and Test (VDAT) Pub Date : 2016-05-01 DOI: 10.1109/ISVDAT.2016.8064887
R. L. Jana, Shashank Kuchibhotla, Soumyajit Dey, P. Dasgupta, Rakesh Kumar
{"title":"Planning based guided reconstruction of corner cases in architectural validation","authors":"R. L. Jana, Shashank Kuchibhotla, Soumyajit Dey, P. Dasgupta, Rakesh Kumar","doi":"10.1109/ISVDAT.2016.8064887","DOIUrl":"https://doi.org/10.1109/ISVDAT.2016.8064887","url":null,"abstract":"Validation of modern microprocessors is a time consuming as well as complex process where constraint-based random test inputs are used to sensitize and monitor whether the hardware execution logic exhibits the desired micro-architectural event sequences. Such testing methods often lead to bug scenarios revealed as simulation traces which serve as the basis for patching the RTL code in order to fix a possible bug. However, the bug fix can be local in nature in the sense that the bug may possibly manifest itself in an alternate execution trace. The present work leverages AI planning to develop techniques for automatic construction of test programs for sensitizing deep architectural bugs by reproducing a bug scenario as different possible sequences of micro-architectural events given that the scenario was initially observed as one such sequence in a simulation trace. Automated generation of such test programs 1) help to evaluate the robustness of a given bug fix or alternatively 2) identify the root cause of the bug so that a proper fix can be carefully planned.","PeriodicalId":301815,"journal":{"name":"2016 20th International Symposium on VLSI Design and Test (VDAT)","volume":"46 13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117241541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Skip-scan: A methodology for test time reduction 跳过扫描:一种减少测试时间的方法
2016 20th International Symposium on VLSI Design and Test (VDAT) Pub Date : 2016-05-01 DOI: 10.1109/ISVDAT.2016.8064869
Binod Kumar, B. Nehru, B. Pandey, Jaynarayan T. Tudu
{"title":"Skip-scan: A methodology for test time reduction","authors":"Binod Kumar, B. Nehru, B. Pandey, Jaynarayan T. Tudu","doi":"10.1109/ISVDAT.2016.8064869","DOIUrl":"https://doi.org/10.1109/ISVDAT.2016.8064869","url":null,"abstract":"Reducing test time is a major challenge in scan based DFT architectures for cost effective test. In this paper, we have proposed a test pattern reordering methodology for dynamic scan architecture. The reconfiguration of scan chain dynamically reduces its length by skipping scan cells with don't care bits. A graph theoretical approach is presented for test pattern reordering to maximise skip. We have calculated theoretical bounds on reduction in test time and segregated test patterns into groups with variable skip-depths. Our results indicate up to 84% reduction in test time. Comparison of this approach with the default ATPG tool pattern and scan chain reordering technique is also done.","PeriodicalId":301815,"journal":{"name":"2016 20th International Symposium on VLSI Design and Test (VDAT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121318193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Design of fault tolerant majority voter for TMR circuit in QCA QCA中TMR电路容错多数投票人设计
2016 20th International Symposium on VLSI Design and Test (VDAT) Pub Date : 2016-05-01 DOI: 10.1109/ISVDAT.2016.8064905
Subrata Chattopadhyay, Shiv Bhushan Tripathi, Mrinal Goswami, B. Sen
{"title":"Design of fault tolerant majority voter for TMR circuit in QCA","authors":"Subrata Chattopadhyay, Shiv Bhushan Tripathi, Mrinal Goswami, B. Sen","doi":"10.1109/ISVDAT.2016.8064905","DOIUrl":"https://doi.org/10.1109/ISVDAT.2016.8064905","url":null,"abstract":"The majority voter plays the core role in the Triple-modular redundancy (TMR) based fault tolerant scheme. This work targets to implement a novel fault tolerant structure of the majority voter for the implementation of TMR using Quantum-dot cellular automata (QCA), a viable alternative nanotechnology to current CMOS VLSI. The proposed fault-tolerant voter circuit itself can tolerate a fault and give error free output by improving the overall system's reliability.","PeriodicalId":301815,"journal":{"name":"2016 20th International Symposium on VLSI Design and Test (VDAT)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116283649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Modeling and yield estimation of SRAM sub-system for different capacities subjected to parametric variations 参数变化下不同容量SRAM子系统的建模与成品率估计
2016 20th International Symposium on VLSI Design and Test (VDAT) Pub Date : 2016-05-01 DOI: 10.1109/ISVDAT.2016.8064840
Pulkit Sharma, Anil Kumar Gundu, M. Hashmi
{"title":"Modeling and yield estimation of SRAM sub-system for different capacities subjected to parametric variations","authors":"Pulkit Sharma, Anil Kumar Gundu, M. Hashmi","doi":"10.1109/ISVDAT.2016.8064840","DOIUrl":"https://doi.org/10.1109/ISVDAT.2016.8064840","url":null,"abstract":"Process variations have become a major challenge with the advancement in CMOS technologies. The performance of memory sub-systems such as Static Random Access Memory (SRAMs) is heavily dependent on these variations. Also, the VLSI industry requires the SRAM bit cell to qualify in the order of less than 0.1ppb to achieve higher Yield (Y). This paper proposes an efficient qualitative statistical analysis and Yield estimation method of SRAM sub-system which considers deviations due to variations in process parameters in bit line differential and input offset of sense amplifier (SA) all together. The Yield of SRAM is predicted for different capacities of SRAM array by developing a statistical model of memory sub-system in 65nm bulk CMOS technology. For the sub-system with 64 bit cells, it is estimated that the probability of failure is 4.802 ∗ 10−13 in a read cycle of frequency 1GHz. Furthermore, the probability of failure for 8MB capacity is 5.035 ∗ 10−7 while for 2GB capacity it increases to 1.289 ∗ 10−5. It is also observed that as the load on one SA per column is doubled, the probability of failure of memory slice increases by 70%. The proposed technique estimates the Yield(Y) for SRAM array to be more than 99.9999.","PeriodicalId":301815,"journal":{"name":"2016 20th International Symposium on VLSI Design and Test (VDAT)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128076349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
FPGA implementation of high speed reconfigurable filter bank for multi-standard wireless communication receivers 多标准无线通信接收机高速可重构滤波器组的FPGA实现
2016 20th International Symposium on VLSI Design and Test (VDAT) Pub Date : 2016-05-01 DOI: 10.1109/ISVDAT.2016.8064855
Sasha Garg, S. Darak
{"title":"FPGA implementation of high speed reconfigurable filter bank for multi-standard wireless communication receivers","authors":"Sasha Garg, S. Darak","doi":"10.1109/ISVDAT.2016.8064855","DOIUrl":"https://doi.org/10.1109/ISVDAT.2016.8064855","url":null,"abstract":"In next generation wireless communication system, wireless transceivers should be able to handle wideband input signals compromising of multiple communication standards. Such multi-standard wireless communication receivers (MWCRs) need filter bank to extract the desired signal of interest from wideband input spectrum and bring it to the baseband for further signal processing tasks such as spectrum sensing, modulation classification, demodulation etc. In MWCRs, rather any wireless receivers, modulated filter banks, such as Discrete Fourier Transform Filter Banks (DFTFB), are preferred due to their advantages such as lower area, delay and power requirements. To support multi-standard operation, reconfigurable DFTFB (RDFTFB) was proposed by integrating DFTFB with the coefficient decimation method. In this paper, an efficient high speed implementation of RDFTFB on Virtex-7 field programmable gate arrays (FPGA) has been proposed. The proposed approach minimizes the critical path delay between clocked registers thereby leading to significant improvement in the maximum operating frequency of the RDFTFB. Numerically, the proposed implementation leads to 89.7% improvement in the maximum frequency at which RDFTFB can be clocked. Furthermore, proposed implementation leads to 18.5% reduction in the dynamic power consumption.","PeriodicalId":301815,"journal":{"name":"2016 20th International Symposium on VLSI Design and Test (VDAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128212390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
T-Gate: Concept of partial polarization in Quantum Dot Cellular Automata t门:量子点元胞自动机中部分极化的概念
2016 20th International Symposium on VLSI Design and Test (VDAT) Pub Date : 2016-05-01 DOI: 10.1109/ISVDAT.2016.8064844
Chiradeep Mukherjee, S. Roy, Saradindu Panda, B. Maji
{"title":"T-Gate: Concept of partial polarization in Quantum Dot Cellular Automata","authors":"Chiradeep Mukherjee, S. Roy, Saradindu Panda, B. Maji","doi":"10.1109/ISVDAT.2016.8064844","DOIUrl":"https://doi.org/10.1109/ISVDAT.2016.8064844","url":null,"abstract":"Quantum Dot Cellular Automata (QCA) plays a pivotal role in the emerging field of Nano electronics as well as in digital finite state machine design arena. Several gates and their proposals exist in this field all of which are recognized for their own characteristics. Majority voter is one of the several schemes of QCA. In this paper, a new gate termed as T-gate is proposed which is validated by thirteen standard functions and two input multiplexer circuit which reflects the reduction in the effective area as compared to the realization of the same by earlier methods. The T-gate can function as a universal logic gate and also as an inverter which can be realized by using fewer numbers of cells. T-gate implementation of 2×1 Multiplexer require no wire crossings and shows noticeable reduction in the cell count.","PeriodicalId":301815,"journal":{"name":"2016 20th International Symposium on VLSI Design and Test (VDAT)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127188951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信