S. Moore, R. Mullins, Paul A. Cunningham, Ross J. Anderson, G. Taylor
{"title":"Improving smart card security using self-timed circuits","authors":"S. Moore, R. Mullins, Paul A. Cunningham, Ross J. Anderson, G. Taylor","doi":"10.1109/ASYNC.2002.1000311","DOIUrl":"https://doi.org/10.1109/ASYNC.2002.1000311","url":null,"abstract":"We demonstrate how 1-of-n encoded speed-independent circuits provide a good framework for constructing smart card functions that are resistant to side channel attacks and fault injection. A novel alarm propagation technique is also introduced. These techniques have been used to produce a prototype smart card chip: a 16-bit secure processor with Montgomery modular exponentiator and smart card UART.","PeriodicalId":288201,"journal":{"name":"Proceedings Eighth International Symposium on Asynchronous Circuits and Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129703374","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":"Point to point GALS interconnect","authors":"G. Taylor, S. Moore, R. Mullins, Peter Robinson","doi":"10.1109/ASYNC.2002.1000297","DOIUrl":"https://doi.org/10.1109/ASYNC.2002.1000297","url":null,"abstract":"Reliable, low-latency channel communication between independent clock domains may be achieved using a combination of clock pausing techniques, self-calibrating delay lines and an asynchronous interconnect. Such a scheme can be used for point-to-point communication in a globally asynchronous locally synchronous (GALS) system, a possible methodology for managing the predicted increase in clock domains. We present interface wrapper circuits which permit communication between a locally synchronous producer and a locally synchronous consumer via an asynchronous interconnect. Such interfaces can also be used to mix asynchronous and synchronous modules. Clock pausing is used to guarantee that metastability will never result in failure. Arbitration between channel communication and the local clock is performed concurrently so that metastability resolution will rarely delay the clock. Simulation results show that the maximum performance of one data item per consumer clock cycle is achieved when the producer: consumer clock ratio is equal or greater to one.","PeriodicalId":288201,"journal":{"name":"Proceedings Eighth International Symposium on Asynchronous Circuits and Systems","volume":"9 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130131043","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}
A. Kondratyev, Oriol Roig, Lawrence Neukom, K. Fant, A. Taubin
{"title":"Checking delay-insensitivity: 10/sup 4/ gates and beyond","authors":"A. Kondratyev, Oriol Roig, Lawrence Neukom, K. Fant, A. Taubin","doi":"10.1109/ASYNC.2002.1000305","DOIUrl":"https://doi.org/10.1109/ASYNC.2002.1000305","url":null,"abstract":"Wire and gate delays are accounted to have equal, or nearly equal, effect on circuit behavior in modern design techniques. This paper introduces a new approach to verifying circuits whose behavior is independent of component delays (delay-insensitive). It shows that for a particular way of implementing a delay-insensitive circuit, through a Null Convention Logic methodology, the complexity of the verification task might be significantly reduced. This method is implemented using Satisfiability (SAT) solvers and is successfully tested on realistic design examples having tens of thousands of gates.","PeriodicalId":288201,"journal":{"name":"Proceedings Eighth International Symposium on Asynchronous Circuits and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130397787","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":"Design and performance analysis of buffers: a constructive approach","authors":"R. H. Mak","doi":"10.1109/ASYNC.2002.1000304","DOIUrl":"https://doi.org/10.1109/ASYNC.2002.1000304","url":null,"abstract":"This paper presents a theoretical framework to analyse the correctness of VLSI programs for buffers and to compare the performance of the corresponding circuits. A very simple calculus consisting of only two operators is presented that suffices to establish the functional correctness of complicated buffer designs. Furthermore, sequence functions are presented both as a formalism to show absence of deadlock and as a vehicle for performance analysis. It is shown that the class of square FIFOs is optimal in the sense that no buffer of the same capacity and I/O-distance can accommodate a larger range of occupancies, when run at its minimum cycle time. Moreover, the theory accurately predicts the size of the range of occupancies that has been found experimentally.","PeriodicalId":288201,"journal":{"name":"Proceedings Eighth International Symposium on Asynchronous Circuits and Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129214749","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}
M. Greenstreet, Anthony Winstanley, Aurélien Garivier
{"title":"An event spacing experiment","authors":"M. Greenstreet, Anthony Winstanley, Aurélien Garivier","doi":"10.1109/ASYNC.2002.1000295","DOIUrl":"https://doi.org/10.1109/ASYNC.2002.1000295","url":null,"abstract":"Events in self-timed rings can propagate evenly spaced or as bursts. By studying these phenomena, we obtain a better understanding of the underlying dynamics of self-timed pipelines, which is a necessary precursor to utilizing these dynamics to obtain higher performance. We show that standard bounded delay models are inadequate to discriminate between bursting and evenly spaced behaviours and show that an extension of the Charlie Diagrams provides a framework for understanding these phenomena. This paper describes our novel analytical approaches and the design and fabrication of a chip to test our theoretical models.","PeriodicalId":288201,"journal":{"name":"Proceedings Eighth International Symposium on Asynchronous Circuits and Systems","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132530165","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}
H. Jacobson, P. Kudva, P. Bose, P. Cook, S. Schuster
{"title":"Synchronous interlocked pipelines","authors":"H. Jacobson, P. Kudva, P. Bose, P. Cook, S. Schuster","doi":"10.1109/ASYNC.2002.1000291","DOIUrl":"https://doi.org/10.1109/ASYNC.2002.1000291","url":null,"abstract":"Locality principles are becoming paramount in controlling advancement of data through pipelined systems. Achieving fine grained power down and progressive pipeline stalls at the local stage level is therefore becoming increasingly, important to enable lower dynamic power consumption while keeping introduced switching noise under control as well as avoiding global distribution of timing critical stall signals. It has long been known that the interlocking properties of as asynchronous pipelined systems have a potential to provide such benefits. However it has not been understood how such interlocking can be achieved in synchronous pipelines. This paper presents a novel technique based on local clock gating and synchronous handshake protocols that achieves stage level interlocking characteristics in synchronous pipelines similar to that of asynchronous pipelines. The presented technique is directly applicable to traditional synchronous pipelines and works equally well for two-phase clocked pipelines based on transparent latches, as well as one-phase clocked pipelines based on master-slave latches.","PeriodicalId":288201,"journal":{"name":"Proceedings Eighth International Symposium on Asynchronous Circuits and Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116920739","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":"Relative timing based verification of timed circuits and systems","authors":"P. Beerel, K. Stevens, Hoshik Kim","doi":"10.1109/ASYNC.2002.1000302","DOIUrl":"https://doi.org/10.1109/ASYNC.2002.1000302","url":null,"abstract":"Aggressive timed circuits, including synchronous and asynchronous self-resetting circuits, are particularly challenging to design and verify due to complicated timing constraints that must hold to ensure correct operation. Identifying a small, sufficient, and easily verifiable set of relative timing constraints simplifies both design and verification. However, the manual identification of these constraints is a complex and error-prone process. This paper presents the first systematic algorithm to generate and optimize relative timing constraints sufficient to guarantee correctness. The algorithm has been implemented in our RTCG tool and has been applied to several real-life circuits. In all cases, the tool successfully generates a sufficient set of easily verifiable relative timing constraints. Moreover the generated constraint sets are the same size or smaller than that of the hand-optimized constraints.","PeriodicalId":288201,"journal":{"name":"Proceedings Eighth International Symposium on Asynchronous Circuits and Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126112173","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":"Asynchronous circuit synthesis by direct mapping: interfacing to environment","authors":"A. Bystrov, A. Yakovlev","doi":"10.1109/ASYNC.2002.1000303","DOIUrl":"https://doi.org/10.1109/ASYNC.2002.1000303","url":null,"abstract":"Direct mapping helps avoid algorithmic complexity which is inherent in logic synthesis methods. However, existing techniques for direct mapping of Petri net specifications to asynchronous control circuit do not deliver in performance due to logic overhead and inefficient interface to the environment. The paper presents a direct mapping method for Signal Transition Graphs (STGs) targetted at lower latency between input and output events. It is based on two behaviour-preserving transformations applied to the initial STG model: output exposition and environment tracking. The former allows interface signals to be generated concurrently to internal transitions. The latter prevents creation of coding conflicts. Subsequent refinement combines the use of the tracking and input signals in the control of the output flip-flops so as to optimise the circuit size by removing some tracking components. The depth of final logic in the design examples is one or two gates. The comparison to logic synthesis methods indicates lower output latency and greater size. The proposed direct-mapping method allows using fast transistor-level implementations for tracking and output signals with well-localised relative timing constraints.","PeriodicalId":288201,"journal":{"name":"Proceedings Eighth International Symposium on Asynchronous Circuits and Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114256364","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":"Probabilistic timing analysis of asynchronous systems with moments of delays","authors":"Rohan Angrish, Supratik Chakraborty","doi":"10.1109/ASYNC.2002.1000300","DOIUrl":"https://doi.org/10.1109/ASYNC.2002.1000300","url":null,"abstract":"Finding time separation of events is a fundamental problem in the analysis of asynchronous systems. When component delays have statistical variations, it is both interesting and useful to compute moments of time separation of events. Traditionally, Monte Carlo simulation has been used for this purpose. However Monte Carlo simulation requires knowledge of the probability distributions of component delays, which is often difficult to ascertain. Much more easily available are parameters like the statistical mean and variance of component delays. Unfortunately, with only these parameters, Monte Carlo simulation cannot be reliably applied. Yet another disadvantage of Monte Carlo simulation is the large number of runs needed before the error term becomes small enough to be acceptable. This paper describes a polynomial-time algorithm for computing bounds on the first two moments of times of occurrence of events in an acyclic timing constraint graph, given only means and variances of component delays. We present experimental results demonstrating the effectiveness of our algorithm.","PeriodicalId":288201,"journal":{"name":"Proceedings Eighth International Symposium on Asynchronous Circuits and Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116517320","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-speed QDI asynchronous pipelines","authors":"Recep O. Ozdag, P. Beerel","doi":"10.1109/ASYNC.2002.1000292","DOIUrl":"https://doi.org/10.1109/ASYNC.2002.1000292","url":null,"abstract":"This paper introduces two new high-speed quasi delay insensitive (QDI) asynchronous pipeline templates. These new high throughput templates support complex non-linear pipeline structures and are well suited for fine-grain pipelining. Timing analysis and HSPICE simulations show that these templates are 20% and 40% faster than known QDI counterparts.","PeriodicalId":288201,"journal":{"name":"Proceedings Eighth International Symposium on Asynchronous Circuits and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129634095","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}