{"title":"Evaluation of temporal formulas based on \"checking by spheres\"","authors":"Wiktor B. Daszczuk","doi":"10.1109/DSD.2001.952267","DOIUrl":"https://doi.org/10.1109/DSD.2001.952267","url":null,"abstract":"Classical algorithms of evaluation of temporal CTL formulas are constructed \"bottom-up\". A formula must be evaluated completely to give the result. In the paper, a new concept of \"top-down\" evaluation of temporal QsCTL (CTL with state quantifiers) formulas, called \"Checking By Spheres\" is presented. The new algorithm has two general advantages: the evaluation may be stopped on certain conditions in early steps of the algorithm (not the whole formula and not whole state space should be analyzed), and state quantification may be used in formulas (even if a range of a quantifier is not statically obtainable).","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126018605","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}
G. Steven, Rubén Anguera, C. Egan, F. Steven, L. Vintan
{"title":"Dynamic branch prediction using neural networks","authors":"G. Steven, Rubén Anguera, C. Egan, F. Steven, L. Vintan","doi":"10.1109/DSD.2001.952279","DOIUrl":"https://doi.org/10.1109/DSD.2001.952279","url":null,"abstract":"Dynamic branch prediction in high-performance processors is a specific instance of a general time series prediction problem that occurs in many areas of science. In contrast, most branch prediction research focuses on two-level adaptive branch prediction techniques, a very specific solution to the branch prediction problem. An alternative approach is to look to other application areas and fields for novel solutions to the problem. In this paper, we examine the application of neural networks to dynamic branch prediction. Two neural networks are considered: a lecturing vector quantisation (LVQ) Network and a backpropagation network. We demonstrate that a neural predictor can achieve misprediction rates comparable to conventional two-level adaptive predictors and suggest that neural predictors merit further investigation.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"102 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132477180","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":"Self-testing of user-programmed FPGAs based on the concept of linear segments","authors":"P. Tomaszewicz, M. Rawski","doi":"10.1109/DSD.2001.952287","DOIUrl":"https://doi.org/10.1109/DSD.2001.952287","url":null,"abstract":"A method for the development of a test plan for BIST-based exhaustive testing of a circuit implemented with an in-system reconfigurable FPGA is presented. A test plan for application-dependent testing of an FPGA is based on the concept of logic cones and linear segments. Linear segments that satisfy single-generator compatibility requirement can be combinationally-exhaustively tested in parallel and are merged into a test group. The number of test groups corresponds to the number of test sessions. A tool has been developed to implement the proposed algorithm of computing logic cones and linear segments. The presented experimental results are used to develop heuristic rules that control the computing process.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125382419","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 wireless interconnection network for parallel processing","authors":"Jacek Marczynski, D. Tabak","doi":"10.1109/DSD.2001.952342","DOIUrl":"https://doi.org/10.1109/DSD.2001.952342","url":null,"abstract":"A small interconnection network, using wireless technology for a parallel processing system, is introduced. The communication between the processor nodes in an experimental eight-processor system is described. A wireless network protocol is proposed. A design of an interconnection network for different wireless communication techniques is presented. A discussion about advantages and disadvantages of the proposed WINS, compared to similar systems, is offered. The discussion includes comments on how the system may develop in the future.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128122090","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}
F. Lesser, J. Cuveland, V. Lindenstruth, C. Reichling, R. Schneider, M. Schulz
{"title":"A MIMD-based multi threaded real-time processor for pattern recognition","authors":"F. Lesser, J. Cuveland, V. Lindenstruth, C. Reichling, R. Schneider, M. Schulz","doi":"10.1109/DSD.2001.952335","DOIUrl":"https://doi.org/10.1109/DSD.2001.952335","url":null,"abstract":"This peeper describes the development of a multiprocessor architecture that integrates data acquisition and numerical processing for a hard real-time environment. Within 3.9 /spl mu/s 15/spl times/19 ADC, samples have to be captured and analyzed. The first segment describes the function and architecture of an application-specific preprocessor that performs data acquisition and in parallel, executes a hard-coded algorithm on the data. The second segment describes a four-way MIMD processor that works on the delta prepared by the preprocessor. The architecture of the chip and critical design issues are discussed. The architecture allows the concurrent execution of multiple threads and provides efficient means for inter-thread communication. This paper focuses on the architecture and functionality. Results of the tests of the preprocessing stage are presented. Seventy-five thousand of these chips will be integrated in a highly specialized computing system for a heavy ion experiment planned to be commissioned at CERN in 2005. Each chip will handle the data of 17 channels. A prototype of the preprocessor has been implemented and tested successfully. The test of this part shows the correctness of the design. The MIMD processor is completely specified and the implementation is under way.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121455885","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":"Reconfigurable computing: a new business model-and its impact on SoC design","authors":"R. Hartenstein","doi":"10.1109/DSD.2001.952125","DOIUrl":"https://doi.org/10.1109/DSD.2001.952125","url":null,"abstract":"Making gate arrays obsolete, FPGAs are successfully proceeding from niche to mainstream. Like microprocessor usage, FPGA application is RAM-based, but by structural programming (also called \"(re)configuration\") instead of procedural programming. Now both, host and accelerator are RAM-based and as such also available on the same chip: a new approach to SoC design. Now also accelerator definition may be-at least partly-conveyed from vendor site to customer site. A new business model is needed. But this paradigm switch is still ignored: FPGAs do not repeat the RAM-based success story of the software industry. There is not yet a configware industry, since mapping applications onto FPGAs mainly uses hardware syntheses method. From a decade of world-wide research on Reconfigurable Computing another breed of reconfigurable platforms is an emerging future competitor to FPGAs. Supporting roughly single bit wide configurable logic blocks (CLBs) the mapping tools are mainly based on gate level methods-similar to CAD for hardware logic. In contrast to this fine-grained arrays of coarse-grained reconfigurable datapath units (rDPUs) with drastically reduced reconfigurability overhead: to directly configure high level parallelism. But the \"von Neumann\" paradigm does not support soft datapaths because \"instruction fetch\" is not done at run time, and, since most reconfigurable computing arrays do not run parallel processes, but multiple pipe networks instead.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115202307","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":"On the use of mutations in Boolean minimization","authors":"P. Fiser, J. Hlavicka","doi":"10.1109/DSD.2001.952308","DOIUrl":"https://doi.org/10.1109/DSD.2001.952308","url":null,"abstract":"The paper presents a new method of Boolean function minimization based on an original approach to implicant generation by inclusion of literals. The selection of these newly included literals, as well as the subsequent rejection of some others to obtain prime implicants, is based on heuristics working with the frequency of literal occurrence. Instead of using this data directly, some mutations are used in certain places in the algorithm. The technique of mutations and their influence on the quality of the result obtained is evaluated. The BOOM system implementing the proposed method is efficient especially for functions with several hundreds of input variables, whose values are defined only for a small part of their range. It has been tested both on standard benchmarks and on problems of a much larger dimension, generated randomly. These experiments proved that the new algorithm is very fast and that for large circuits it delivers better results than the state-of-the-art ESPRESSO.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115333907","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":"Evaluation of delay fault testability of LUT functions for improved efficiency of FPGA testing","authors":"A. Krasniewski","doi":"10.1109/DSD.2001.952312","DOIUrl":"https://doi.org/10.1109/DSD.2001.952312","url":null,"abstract":"Testing delay faults in FPGAs differs significantly from testing delay faults in circuits whose combinational sections can be represented as gate networks. Based on delay fault testability conditions, formulated in a form suitable for analysis of LUT-based FPGAs, we develop an original method for the evaluation of delay fault testability of LUT functions. It relies on an indicator called delay fault activation profile. The proposed method supports an analysis and comparison of different procedures for the enhancement of detectability of FPGA delay faults that rely on transformations of user-defined functions of LUTs in the combinational logic block under test. We demonstrate the effectiveness of our method by applying it to prove the efficiency and to optimize a specific procedure for the transformation of LUT functions which preserves the blocking capability and input-output transition pattern of original functions.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124988348","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}
V. Aue, J. Kneip, Matthias Weiss, M. Bolle, G. Fettweis
{"title":"A design methodology for high performance ICs: wireless broadband radio baseband case study","authors":"V. Aue, J. Kneip, Matthias Weiss, M. Bolle, G. Fettweis","doi":"10.1109/DSD.2001.952112","DOIUrl":"https://doi.org/10.1109/DSD.2001.952112","url":null,"abstract":"In this paper, we provide an overview of the hardware-software design flow that has been applied to the design of a platform based SoC for the HiperLAN/2 and IEEE 802.11a wideband wireless communication standards. Starting from a high-level description in MATLAB, the design framework is used to gain important information for the HW/SW partitioning. Step by step the MATLAB description is refined down to an embedded assembler implementation. Simultaneously, the framework is used to generate cycle true reference data for simulations on several abstraction levels. A universal interface concept allows the exchange of modules of different abstraction levels in a cosimulation. This way, a high confidence level for the design verification is achieved, and design and verification time is substantially reduced.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"2007 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125584945","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":"Traffic scheduling coprocessor with schedulability analysis capability","authors":"E. Martins, J. Fonseca","doi":"10.1109/DSD.2001.952254","DOIUrl":"https://doi.org/10.1109/DSD.2001.952254","url":null,"abstract":"The low processing power of typical fieldbus nodes used in real-time applications usually limits the sort of message scheduling that can be done, and precludes any kind of on-line schedulability analysis. Moving these computationally intensive tasks to dedicated hardware is an effective way to remove this limitation and achieve the best temporal determinism. This paper presents a traffic scheduling and schedulability analyser coprocessor targeted for centralised scheduling fieldbus systems. The FPGA-based coprocessor generates message schedules according to one of three different scheduling policies, and allows the number of message and their respective parameters to be change dynamically. The schedulability analyser capability supports on-line admission control of new messages. The paper starts by discussing the basic feature which such a coprocessor should include. Then the coprocessor architecture is described together with several relevant implementation details. Finally the worst case execution times of its two main functions are derived, validating the coprocessor's feasibility.","PeriodicalId":285358,"journal":{"name":"Proceedings Euromicro Symposium on Digital Systems Design","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125725541","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}