{"title":"Autonomous Design in VLSI: Growing and Learning on Silicon","authors":"L. Krundel, D. Mulvaney, V. Chouliaras","doi":"10.1109/ISVLSI.2010.109","DOIUrl":"https://doi.org/10.1109/ISVLSI.2010.109","url":null,"abstract":"To-day no good solutions are known for the problem of a performing machine immersed within static or dynamic environments and meeting unexpected, unpredictable, unknown, new situations. Perhaps because no method can be found for the direct design of solutions that would meet this requirement, furthermore now in great demand. This paper presents the work we are developing to address that particular problem, of which abundant solutions ironically appear second nature to myriads of biological creatures.","PeriodicalId":187530,"journal":{"name":"2010 IEEE Computer Society Annual Symposium on VLSI","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131357981","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":"Mixed-Signal Diverse Redundant System for Safety Critical Applications in FPGA","authors":"Romuald Girardey, M. Hübner, J. Becker","doi":"10.1109/ISVLSI.2010.11","DOIUrl":"https://doi.org/10.1109/ISVLSI.2010.11","url":null,"abstract":"The aim of this study is to design an architecture which increases the functional safety of a process automation sensor as defined by the standard IEC61508. Furthermore this architecture can increase the availability of the sensor. It is based on a triple modular redundancy with a combination of an FPGA and FPAAs, which means it is a mixed-signal diverse redundancy. The study also takes into account the latest development of the standard: the second edition which brings new requirements to on-chip redundancy in FPGAs. The paper exposes the advantages of this mixed-signal diverse redundancy and the progress of the realization.","PeriodicalId":187530,"journal":{"name":"2010 IEEE Computer Society Annual Symposium on VLSI","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115669517","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 Reverse Converter for the Enhanced Moduli Set {2n-1, 2n+1, 22n, 22n+1-1} Using CRT and MRC","authors":"A. S. Molahosseini, K. Navi","doi":"10.1109/ISVLSI.2010.105","DOIUrl":"https://doi.org/10.1109/ISVLSI.2010.105","url":null,"abstract":"The moduli set {2n–1, 2n, 2n+1, 22n+1–1} has been newly introduced for residue number system (RNS) as an arithmetic-friendly large dynamic range moduli set which can lead to a fast RNS arithmetic unit. In this paper, we present a reverse converter for the moduli set {2n–1, 2n+1, 22n, 22n+1–1} which is derived from the moduli set {2n–1, 2n, 2n+1, 22n+1–1} by enhancing modulo 2n to 22n. With this enhancement the DR increased to 6n+1 bits, while the speed of moduli set for arithmetic unit is not changed. The reverse converter for the moduli set {2n–1, 2n, 2n+1, 22n+1–1} is obtained by considering an existing Chinese remainder theorem (CRT)-based design of reverse converter for the subset {22n, 2n–1, 2n+1} along with a two-channel mixed-radix conversion (MRC) algorithm for the composite set {22n (22n–1), 22n+1–1}.","PeriodicalId":187530,"journal":{"name":"2010 IEEE Computer Society Annual Symposium on VLSI","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114441975","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":"Bitstream Efficiency of Field Programmable One-Hot Arrays","authors":"M. Arnold, P. Vouzis, Jung H. Cho","doi":"10.1109/ISVLSI.2010.117","DOIUrl":"https://doi.org/10.1109/ISVLSI.2010.117","url":null,"abstract":"Field Programmable One-Hot Arrays (FPOHAs) have simple cells which are suitable to implement control-rich algorithms, where one-hot encoding is preferred. We present the cell design for the FPOHA and describe a modified open-source one-hot tool, known as Verilog Implicit To One-hot (VITO), to synthesize one-hot designs into FPOHA configurations without global optimization. We compare the bitstream sizes for FPOHAs and FPGAs using artificial benchmarks. In theory, optimal FPOHA layouts could have bitstream sizes half that of FPGAs. The observed FPOHA sizes synthesized from VITO may not be optimal, but are still often more efficient than FPGA sizes.","PeriodicalId":187530,"journal":{"name":"2010 IEEE Computer Society Annual Symposium on VLSI","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125546169","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 Sub-1μA Low-Power FSK Modulator for Biomedical Sensor Circuits","authors":"K. Zhu, M. Haider, S. Yuan, S. Islam","doi":"10.1109/ISVLSI.2010.74","DOIUrl":"https://doi.org/10.1109/ISVLSI.2010.74","url":null,"abstract":"Low-power wireless telemetry is extremely important for non-invasive monitoring of biomedical sensor signals. Usually for successful monitor of various physiological parameters, an implantable sensor incorporates a transmitter unit to send the sensor data outside of the human body for further diagnostics. This paper reports a new low-power frequency shift keying (FSK) modulator for a biomedical sensor circuits. With a very simple architecture, this circuit integrates the modulation functionality into the oscillator itself by using the data signal to control the oscillation frequency. Besides, it can generate tunable carrier frequencies for different data signals. The carrier frequency can range from 5 MHz to tens of MHz with configurable tuning for adaptable data rate applications. In addition, the data rate from 450kbps to several Mbps can be achieved for common applications. The modulator is implemented in a 0.35 μm bulk-CMOS process with a power supply voltage of 2.5 V. For a carrier frequency of 10MHz the entire unit consumes less than 1 μA current which makes the design very suitable for low-power biomedical application. The circuit has already been submitted for monolithic integration.","PeriodicalId":187530,"journal":{"name":"2010 IEEE Computer Society Annual Symposium on VLSI","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130020981","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":"Data-Flow Driven Equivalence Checking for Verification of Code Motion Techniques","authors":"C. Karfa, D. Sarkar, C. Mandal","doi":"10.1109/ISVLSI.2010.58","DOIUrl":"https://doi.org/10.1109/ISVLSI.2010.58","url":null,"abstract":"Code motion techniques are extensively used in the pre-synthesis optimization and the scheduling phases of high-level synthesis (HLS) of digital circuits for control intensive behaviours. A formal verification method for checking correctness of code motion techniques is presented in this paper. Finite state machine with datapath (FSMD) models have been used to represent the input and the output behaviours of each synthesis step. The method consists in introducing cut points in one FSMD, visualizing its computations as concatenation of paths from cutpoints to cutpoints, and identifying equivalent finite path segments in the other FSMD, the process is then repeated with the FSMDs interchanged. It has been underlined in this work that for non-uniform code motions, identifying equivalent path segment involves model checking of specific data-flow driven properties. Unlike many other reported techniques, the method is capable of verifying both uniform and non-uniform code motion techniques. The method is tested on the synthesis results of a high-level synthesis tool called SPARK for several HLS benchmarks. Experimental results demonstrate the effectiveness of the method.","PeriodicalId":187530,"journal":{"name":"2010 IEEE Computer Society Annual Symposium on VLSI","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129228958","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 Delay Model of Two-Cycle NoC Router in 2D-Mesh Network","authors":"Shubo Qi, Jinwen Li, Zuocheng Xing, Xiaomin Jia, Minxuan Zhang","doi":"10.1109/ISVLSI.2010.22","DOIUrl":"https://doi.org/10.1109/ISVLSI.2010.22","url":null,"abstract":"With the increasing number of processor cores in chip multi-processors (CMPs), 2D Mesh has been gaining wide acceptance for inter-core on-chip communication. Program performance is more sensitive to the router latency than to the link bandwidth. This paper presents a low latency Dynamic Virtual Output Queues Router (DVOQR), which can reduce the router latency to two cycles by leveraging look-ahead routing computation and virtual output queues scheme. The router delay model of DVOQR is derived based on the logical effect theory, and validated against Synopsys PrimeTime in TSMC 65nm technology. Results show that the critical path delay of the flit switch stage is more sensitive to the depth of unified dynamic buffer than to the link bandwidth. The critical path delay of DVOQR increases FO4 when the depth of Unified Dynamic Buffer (UDB) doubled. The frequency of DVOQR can reach 2.5GHz, which is improved by 20% compared to the virtual channel router, while the router only takes up 0.404mm2.","PeriodicalId":187530,"journal":{"name":"2010 IEEE Computer Society Annual Symposium on VLSI","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116533845","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":"High-Level Synthesis Methodologies for Delay-Area Optimized Coarse-Grained Reconfigurable Coprocessor Architectures","authors":"S. Xydis, K. Pekmestzi, D. Soudris, G. Economakos","doi":"10.1109/ISVLSI.2010.8","DOIUrl":"https://doi.org/10.1109/ISVLSI.2010.8","url":null,"abstract":"As Very Large Scale Integration (VLSI) process technology continues to scale down transistor sizes, modern computing devices are becoming extremely complex. In order to face this complexity explosion, the shifting of design methodologies towards higher level of abstraction has been proposed. This high level view of the design procedure enables the automated synthesis of applications’ architecture that is written in an application-level description i.e. C/C++. Additionally, it allows designers to explore the tradeoffs between different system and implementation parameters to conclude in an efficient design solution. The work done during this PhD thesis targets the exploration and optimization of the design solutions in a global manner, by focusing on the combined development of novel (i) system-level automated design methodologies/tools and (ii) circuit-level techniques for a specific class of system architectures - reconfigurable systems. Reconfigurable Computing has been proposed as a new paradigm to address the conflicting design requirements for high performance and area efficiency. Towards this direction, fine- and coarse-grained reconfigurable coprocessor architectures have been presented. Unlike fine-grained, coarse-grained architectures (CGA) operate at the word level of granularity exhibiting better power and performance features, close to ASIC solutions [1]. However, a performance-area-power gap still exists for CGAs to overcome ASIC implementations [2]. Thus, new fundamental design problems/questions has been raised. Does this gap be a bridgeable one? How can CGAs shift even closer to ASIC datapaths? In order to address the aforementioned problems, we identified that hardware sharing at the bit-level generates CGAs with performance and area characteristics closer to ASICs than the existing ones. Thus, this thesis proposes new architectural templates and the corresponding high level synthesis methodologies to enable a new shifting on the state-of-the-art of CGAs.","PeriodicalId":187530,"journal":{"name":"2010 IEEE Computer Society Annual Symposium on VLSI","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129207267","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":"XMSIM: EXtensible Memory SIMulator for Early Memory Hierarchy Evaluation","authors":"Theodoros Lioris, G. Dimitroulakos, K. Masselos","doi":"10.1109/ISVLSI.2010.106","DOIUrl":"https://doi.org/10.1109/ISVLSI.2010.106","url":null,"abstract":"This paper presents a memory hierarchy evaluation framework for multimedia applications. It takes as input a high level C code application description and a memory hierarchy specification and provides statistics characterizing the memory operation. Essentially the tool is a specialized C++ data type library which is used to replace the application's data types with others that monitor memory access activity. XMSIM's operation is event driven which means that every access to a specific data structure is converted to a message towards the memory model which subsequently emulates memory hierarchy operation. The memory model is highly parametric allowing a large number of alternatives to be modeled. XMSIM's main advantage is its modularity allowing the designer to alter specific aspects of the memory operation beyond the predefined ones. The main features are the capability to: 1) simulate any subset of the application's data types, 2) user defined mapping of data to memories, 3) simultaneously simulate multiple memory hierarchy scenarios, 4) immediate feedback to code transformations effect on memory hierarchy behavior, 5) verification utilities for the validation of code transformations.","PeriodicalId":187530,"journal":{"name":"2010 IEEE Computer Society Annual Symposium on VLSI","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116783403","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":"Modeling and Simulation of Multi-operation Microcode-Based Built-In Self Test for Memory Fault Detection and Repair","authors":"R. K. Sharma, A. Sood","doi":"10.1109/ISVLSI.2010.88","DOIUrl":"https://doi.org/10.1109/ISVLSI.2010.88","url":null,"abstract":"As embedded memory area on-chip is increasing and memory density is growing, problem of faults is growing exponentially. Newer test algorithms are developed for detecting these new faults. These new March algorithms have much more number of operations than the March algorithms existing earlier. An architecture implementing these new algorithms is presented here. This is illustrated by implementing the newly defined March SS algorithm. Along with the fault diagnosis a word-oriented memory Built-in Self Repair methodology, which supports on-the-fly memory repair, is employed to repair the faulty locations indicated by the MBIST controller presented.","PeriodicalId":187530,"journal":{"name":"2010 IEEE Computer Society Annual Symposium on VLSI","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132913146","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}