Saurabh Kotiyal, H. Thapliyal, Nagarajan Ranganathan
{"title":"Mach-Zehnder Interferometer Based All Optical Reversible NOR Gates","authors":"Saurabh Kotiyal, H. Thapliyal, Nagarajan Ranganathan","doi":"10.1109/ISVLSI.2012.72","DOIUrl":"https://doi.org/10.1109/ISVLSI.2012.72","url":null,"abstract":"Reversible logic has promising applications in dissipation less optical computing, low power computing, quantum computing etc. Reversible circuits do not lose information, and there is a one to one mapping between the input and the output vectors. In recent years researchers have implemented reversible logic gates in optical domain as it provides high speed and low energy computations. The reversible gates can be easily fabricated at the chip level using optical computing. The all optical implementation of reversible logic gates are based on semiconductor optical amplifier (SOA) based Mach-Zehnder interferometer (MZI). The Mach-Zehnder interferometer has advantages such as high speed, low power, easy fabrication and fast switching time. In the existing literature, the NAND logic based implementation is the only implementation available for reversible gates and functions. There is a lack of research in the direction of NOR logic based implementation of reversible gates and functions. In this work, we propose the NOR logic based all optical reversible gates referred as all optical TNOR gate and all optical PNOR gate. The proposed all optical reversible NOR logic gates can implement the reversible boolean logic functions with reduced optical cost and propagation delay compared to their implementation using existing all optical reversible NAND gates. The advantages in terms of optical cost and delay is illustrated by implementing 13 standard boolean functions that can represent all 256 possible combinations of three variable boolean function.","PeriodicalId":398850,"journal":{"name":"2012 IEEE Computer Society Annual Symposium on VLSI","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129871949","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}
{"title":"Analysis of Reversible Logic Based Sequential Computing Structures Using Quantum Mechanics Principles","authors":"Matthew Morrison, Nagarajan Ranganathan","doi":"10.1109/ISVLSI.2012.60","DOIUrl":"https://doi.org/10.1109/ISVLSI.2012.60","url":null,"abstract":"Significant debate exists in the literature with regards to the permissibility of feedback in reversible computing nanotechnologies. Feedback allows for reuse of logical subroutines, which is a desired functionality of any computational device. Determining whether loop back is allowed is paramount to assessing the robustness of reversible logic in any quantum design. In this paper, the fundamental discoveries in entropy and quantum mechanics that serve as the foundations for reversible logic are reviewed. The fundamentals for implementation of reversibility in computing are shown. Then, definitions are presented for a sequential reversible logic structure. A sequential reversible logic structure is proven to have an identical number of feedback-dependent inputs and feedback-producing outputs, and new metrics for measuring the probability of each output state are presented. Using these metrics, the reversibility of each clock cycle of such a device is verified. Therefore, we demonstrate that any reversible logic structure with feedback is physically reversible.","PeriodicalId":398850,"journal":{"name":"2012 IEEE Computer Society Annual Symposium on VLSI","volume":"04 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130008124","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}
{"title":"Synthesis of Multithreshold Threshold Gates","authors":"Maciej Nikodem, Marek A. Bawiec, J. Biernat","doi":"10.1109/ISVLSI.2012.58","DOIUrl":"https://doi.org/10.1109/ISVLSI.2012.58","url":null,"abstract":"This paper presents novel synthesis algorithm capable of generating Multithreshold Threshold Gate (MTTG) structure for arbitrary Boolean function. Algorithm draws from dedicated efficient threshold decomposition procedure that represents Boolean function as a min/max composition of threshold functions. Since the proposed threshold decomposition procedure outputs minimal number of thresholds therefore the resulting gate is compact - for k-threshold n-input Boolean function at most (k+1)(n+1) NDR elements in a (k+1)-level gate structure, and (k+1)n transistors are required.","PeriodicalId":398850,"journal":{"name":"2012 IEEE Computer Society Annual Symposium on VLSI","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126872860","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}
{"title":"A DFT Methodology for Repairing Embedded Memories of Large MPSoCs","authors":"Kunal P. Ganeshpure, S. Kundu","doi":"10.1109/ISVLSI.2012.17","DOIUrl":"https://doi.org/10.1109/ISVLSI.2012.17","url":null,"abstract":"Memory Built-In Self-Test (MBIST) is used to test large memories embedded in Multi-Processor System on Chip (MPSoC). With increase in memory size, memory repair becomes necessary to improve yield. Memory repair consists of complex offline analysis requiring (i) fault diagnosis and (ii) optimizing reconfiguration based on failure map and available spare resources. This paper presents an embedded repair scheme that uses resources within a MPSoC. The main challenge involves establishing integrity of such internal resources before they are used for repair. We propose a layered approach to testing that (i) tests local processor cache first and uses (ii) software based self-testing of limited processor functions using (iii) a small program loaded into a cache from tester, which then (iv) serves as a vehicle for memory repair. This repaired memory can store and run larger software-based self-test programs to test the remaining systems. Software simulation is used to demonstrate feasibility of the proposed DFT scheme and test methodology. The main advantages of this approach are (i) avoidance of memory testers that are typically necessary for memory repair, (ii) avoiding additional hardware to support repair by using existing resources and (iii) testing all components using a logic tester.","PeriodicalId":398850,"journal":{"name":"2012 IEEE Computer Society Annual Symposium on VLSI","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116203825","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}
{"title":"Hardware Comparison of the ISO/IEC 29192-2 Block Ciphers","authors":"Neil Hanley, Máire O’Neill","doi":"10.1109/ISVLSI.2012.25","DOIUrl":"https://doi.org/10.1109/ISVLSI.2012.25","url":null,"abstract":"As ubiquitous computing becomes a reality, sensitive information is increasingly processed and transmitted by smart cards, mobile devices and various types of embedded systems. This has led to the requirement of a new class of lightweight cryptographic algorithm to ensure security in these resource constrained environments. The International Organization for Standardization (ISO) has recently standardized two low-cost block ciphers for this purpose, Clefia and Present. In this paper we provide the first comprehensive hardware architecture comparison between these ciphers, as well as a comparison with the current National Institute of Standards and Technology (NIST) standard, the Advanced Encryption Standard.","PeriodicalId":398850,"journal":{"name":"2012 IEEE Computer Society Annual Symposium on VLSI","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128823993","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}
{"title":"A Wide Band Locking Range Quarter-PhaseGenerator PLL Using 0.13um BiCMOS Technology","authors":"Xuelian Liu, J. McDonald","doi":"10.1109/ISVLSI.2012.69","DOIUrl":"https://doi.org/10.1109/ISVLSI.2012.69","url":null,"abstract":"This paper presents a quarter-phase 32GHz PLL using 0.13um SiGe BiCMOS technology for a high speed microprocessor. The PLL characterizes a 3-state phase frequency detector (PFD), a charge pump loop filter, a VCO, a frequency doubler and a feedback 1/32 frequency divider. The VCO used in this PLL is a four -- stage ring oscillator that has a wide tuning range with a feed-forward interpolation topology for coarse frequency tuning and varactor diodes load capacitance variation for fine frequency tuning. The PLL has a wide locking range from 24.4 GHz to 39 GHz with a phase noise of-102dBc/Hz at 1MHz offset.","PeriodicalId":398850,"journal":{"name":"2012 IEEE Computer Society Annual Symposium on VLSI","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123971125","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}
{"title":"A Case Study in Developing an Efficient Multi-threaded EDA Parser: Synopsys SDF Parser","authors":"Prakash Shanbhag, C. Gopalakrishnan, Saibal Ghosh","doi":"10.1109/ISVLSI.2012.78","DOIUrl":"https://doi.org/10.1109/ISVLSI.2012.78","url":null,"abstract":"Traditional EDA flows are made up of different point tools stitched together to progress from higher levels of design abstraction to physical level chip details. Data, intent, and constraints are passed on through this flow via intermediate text files. Some of these files such as the Standard Delay Format (SDF) files, are significantly large in size, and may run into gigabytes. Parsing of these files is a challenge. Core EDA algorithms have more recently started embracing the concept of parallelism using multi-core processors. This has started increasing the contribution of the time taken by the parser in the whole flow, increasing the need to improve the parser performance. The authors propose a methodology for efficient multi-threading of parsers in EDA in [2]. This paper is a companion paper detailing the application of the methodology on the Synopsys SDF Parser. Performance improvements in the range of 4X on 8-core machines was observed on implementing this methodology.","PeriodicalId":398850,"journal":{"name":"2012 IEEE Computer Society Annual Symposium on VLSI","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117100133","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}
{"title":"Adaptive Stackable 3D Cache Architecture for Manycores","authors":"E. Guthmuller, I. Panades, A. Greiner","doi":"10.1109/ISVLSI.2012.36","DOIUrl":"https://doi.org/10.1109/ISVLSI.2012.36","url":null,"abstract":"With the emergence of many core architectures, the need of on-chip memories such as caches grows faster than the number of cores. Moreover the bandwidth to off-chip memories is saturating. Big memory caches can alleviate the pressure to off-chip accesses. In this paper, we present an adaptive 3Dcache architecture taking advantage of dense vertical connections in stacked chips. Then we propose a dynamically adaptive mechanism to optimize the use of the aforementioned 3D cache architecture according to the workload needs. Finally, we analyze the gain on memory accesses and on software execution time in a realistic model of many core architecture and we study the hardware cost of our proposal, showing that our approach can lead to a 50% reduction of both external memory accesses and application execution time.","PeriodicalId":398850,"journal":{"name":"2012 IEEE Computer Society Annual Symposium on VLSI","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121512069","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}
{"title":"Testing of Trusted CMOS Data Converters","authors":"A. Srivastava, R. Soundararajan","doi":"10.1109/ISVLSI.2012.23","DOIUrl":"https://doi.org/10.1109/ISVLSI.2012.23","url":null,"abstract":"In this work, we present testing of trusted CMOS data converters using DeltaIDDQ and on-chip linear ramp histogram techniques. DeltaIDDQ technique can be efficiently used to detect faults taking process variation into effect. We present design for an on-chip testability of CMOS analog-to-digital converter using linear-ramp histogram technique. The paper discusses a brief overview of the histogram technique, the formulae used to calculate the ADC parameters, the design implemented in 0.5μm n-well CMOS process, the results and effectiveness of the design. The on-chip linear ramp histogram technique can be seamlessly combined with DeltaIDDQ technique for improved testability, increased fault coverage and reliable operation.","PeriodicalId":398850,"journal":{"name":"2012 IEEE Computer Society Annual Symposium on VLSI","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132594974","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}
{"title":"A Novel Design of Secure and Private Circuits","authors":"M. Gomathisankaran, A. Tyagi","doi":"10.1109/ISVLSI.2012.55","DOIUrl":"https://doi.org/10.1109/ISVLSI.2012.55","url":null,"abstract":"Secure and tamper evident computing systems can be built by encrypting both code and data. Even such secure execution environments assume the existence of a trusted processor boundary inside which the data and code are decrypted before actually using them for computation. This leaves such secure systems vulnerable against side-channel attacks. In general there are two approaches to solve this problem. First approach is to design cryptographic algorithms which can tolerate some information leakage. Second approach is to remove the correlation between the leaked information and the secret. We propose a novel circuit design technique which uses the second approach.","PeriodicalId":398850,"journal":{"name":"2012 IEEE Computer Society Annual Symposium on VLSI","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114840830","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}