Demo Data from VLDB 2026 / reviewers in the wild / expert
Hiroto Yasuura
dblp:43/4149
· DBLP profile ↗
51ranked-venue papers
6as first author
0since 2021 · last 2017
0000-0002-8387-5405ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 41 · 5 first-authorApplied, interdisciplinary, general and emerging computing · 8Software engineering, systems software and programming languages · 7Security and privacy · 4Theory of computation · 2 · 1 first-authorArtificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
9 papers |
Electronic design automation · 41% Reconfigurable computing and FPGAs · 28% Embedded and real-time systems · 14% | |
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% | |
| Theoretical computer science
2 papers |
Logic in computer science · 90% Algorithms and data structures · 10% |
Topics — the 20 heaviest of 22, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Reconfigurable computing and FPGAs › FPGA accelerator
FPGA-based genetic algorithm |
0.0 | 1 | 2000 | An FPGA-based genetic algorithm machine (poster abstract) · FPGA 2000 |
Compilers and program optimization › compiler construction
compiler generation |
0.0 | 1 | 1997 | Memory-CPU Size Optimization for Embedded System Designs · DAC 1997 |
Embedded and real-time systems
embedded system design |
0.0 | 1 | 1997 | Memory-CPU Size Optimization for Embedded System Designs · DAC 1997 |
Electronic design automation › design management
design reuse |
0.0 | 1 | 1994 | Design Reuse: Fact or Fiction? (Panel) · DAC 1994 |
Reconfigurable computing and FPGAs › FPGA accelerator
FPGA coprocessor |
0.0 | 1 | 2000 | An FPGA-based genetic algorithm machine (poster abstract) · FPGA 2000 |
Electronic design automation › hardware verification and test
formal verification |
0.0 | 1 | 1990 | NES: The Behavioral Model for the Formal Semantics of a Hardware Design Language UDL/I · DAC 1990 |
Electronic design automation
hardware description language |
0.0 | 1 | 1990 | NES: The Behavioral Model for the Formal Semantics of a Hardware Design Language UDL/I · DAC 1990 |
Electronic design automation › hardware verification and test
hardware verification |
0.0 | 1 | 1990 | NES: The Behavioral Model for the Formal Semantics of a Hardware Design Language UDL/I · DAC 1990 |
Electronic design automation › hardware verification and test
logic simulation |
0.0 | 2 | 1987 | High-Speed Logic Simulation on Vector Processors · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987 An Interactive Simulation System for structured logic design - ISS · DAC 1982 |
Logic in computer science
formal semantics |
0.0 | 1 | 1989 | Semantics of a Hardware Design Language for Japanese Standardization · DAC 1989 |
Electronic design automation
hardware verification and test |
0.0 | 1 | 1987 | High-Speed Logic Simulation on Vector Processors · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987 |
Integrated circuit design › digital circuit design
arithmetic circuit design |
0.0 | 1 | 1985 | High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree · IEEE Trans. Computers 1985 |
Integrated circuit design › digital circuit design › arithmetic circuit design
multiplier design |
0.0 | 1 | 1985 | High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree · IEEE Trans. Computers 1985 |
Integrated circuit design › digital circuit design › arithmetic circuit design › multiplier design
redundant binary multiplier |
0.0 | 1 | 1985 | High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree · IEEE Trans. Computers 1985 |
Electronic design automation
interactive simulation |
0.0 | 1 | 1982 | An Interactive Simulation System for structured logic design - ISS · DAC 1982 |
Integrated circuit design
VLSI design |
0.0 | 1 | 1982 | The Parallel Enumeration Sorting Scheme for VLSI · IEEE Trans. Computers 1982 |
High-performance computing › supercomputer architecture
vector supercomputer |
0.0 | 1 | 1987 | High-Speed Logic Simulation on Vector Processors · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987 |
Integrated circuit design › VLSI design
cellular array |
0.0 | 1 | 1982 | The Parallel Enumeration Sorting Scheme for VLSI · IEEE Trans. Computers 1982 |
Integrated circuit design › digital circuit design
logic design |
0.0 | 1 | 1982 | An Interactive Simulation System for structured logic design - ISS · DAC 1982 |
Algorithms and data structures › sequence algorithms
sorting |
0.0 | 1 | 1982 | The Parallel Enumeration Sorting Scheme for VLSI · IEEE Trans. Computers 1982 |
Methods — techniques the papers use, named apart from their topics
system cost minimization · 0.0genetic algorithm · 0.0nondeterministic event sequence model · 0.0vectorization · 0.0event-driven simulation · 0.0compiler-driven simulation · 0.0bus connected cellular array · 0.0wallace tree · 0.0redundant binary addition tree · 0.0pipeline processing · 0.0hardware description language · 0.0VLSI design · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | ASP-DAC 2017 keynote speech I-3: Design of society: Beyond digital system designabstractSummary form only given. The progress of digital system design and production technologies have produced social innovation by Information Communication Technology (ICT). Most social systems and our daily lives are fully supported by ICT. The progress has been accelerated exponentially and destructive innovations have occurred in various fields in industries and societies. Governments emphasize Industry 4.0 or Society 5.0 and people are looking for new businesses with IoT and AI with Big Data. In this talk, I will look back on the growth of ICT and look forward to future society which we will create using ICT. We can say that design technology of digital systems is now expanding to design of societies. Hiroto Yasuura |
ASP-DAC | 1 |
| 2012 | Neutron-induced soft error rate estimation for SRAM using PHITSabstractThis paper presents a novel neutron-induced soft-error-rate (SER) estimation tool with a particle transport code: PHITS. The proposed tool can calculate the SER according to various data patterns and the layout of the memory cells in an SRAM. As layouts, two kinds of an NMOS-PMOS-NMOS 6T and an inside-out PMOS-NMOS-PMOS versions are considered. The proposed tool distinguishes a single-event-upset (SEU) SER, a horizontal multiple-cell-upset (MCU) SER, and a vertical MCU SER using an extracting function. The horizontal MCU SER in the inside-out version of the PMOS-NMOS-PMOS 6T SRAM cell layout was expected to be 26-41% less than that of the general NMOS-PMOS-NMOS 6T cell layout. Shusuke Yoshimoto, Takuro Amashita, Masayoshi Yoshimura, Yusuke Matsunaga, Hiroto Yasuura, Shintaro Izumi, Hiroshi Kawaguchi 0001, Masahiko Yoshimoto |
IOLTS | 5 |
| 2011 | Multiple-bit-upset and single-bit-upset resilient 8T SRAM bitcell layout with divided wordline structureabstractThis paper presents a new 8T (8-transistor) SRAM cell layout mitigating multiple-bit upset (MBU) in a divided wordline structure. Because bitlines along unselected columns are not activated, the divided wordline structure eliminates a half-select problem and achieves low-power operation, which is often preferred for low-power / low-voltage applications. However, the conventional 8T SRAM with the divided wordline structure engenders MBUs because all bits in the same word are physically adjoining. Consequently, error correction coding (ECC) techniques are difficult to apply. This paper presents a new 8T cell layout pattern that separates internal latches in SRAM cells using both an n-well and a p-substrate. We investigated an SEU cross section of nMOS that is 3.5-4.5 times higher than that of pMOS. Using an iRoC TFIT simulator, we confirmed that the proposed 8T cell has better neutron-induced MBU tolerance. The MBU in the proposed 8T SRAM is improved by 90.70% and the MBU soft error rate (SER) is decreased to 3.46 FIT at 0.9 V when ECC is implemented. Additionally, we conducted Synopsys 3-D TCAD simulation, which indicates that the LET threshold (LETth) in single-event upset (SEU) is also improved by 66.47% in the proposed 8T SRAM by a common-mode effect. Shusuke Yoshimoto, Takuro Amashita, D. Kozuwa, Taiga Takata, Masayoshi Yoshimura, Yusuke Matsunaga, Hiroto Yasuura, Hiroshi Kawaguchi 0001, Masahiko Yoshimoto |
IOLTS | 7 |
| 2010 | An Information Platform for Low-Literate VillagersabstractPresently, 75% of the world's population do not have access to the Internet. Most of them are people at the BOP (Base of the Pyramid, the poorest but largest economic group in the world). Many of the efforts to popularize ICT focus on increasing villagers' access to facilities and on training in ICT use to demonstrate the power of ICT to bring financial or social benefits. Users are viewed as information consumers only. We have developed an information platform where BOP can be both information producers and owners. In order to generate and upload web contents, the challenges observed are the villagers' text literacy limitations, the limited capability of the devices they use, and the available network capability. In order to overcome these limitations, we propose a BoP adaptation layer in the current social information infrastructure. This paper introduces the BOP adaptation layer concept, its architecture, and an example of how a low-literate village farmer can generate and upload his/her product information on the web. Ashir Ahmed, Lutfe Kabir, Hiroto Yasuura |
AINA | 3 |
| 2010 | An Identifiable Yet Unlinkable Authentication System with Smart Cards for Multiple Services
Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, Hiroto Yasuura |
ICCSA (4) | 5 |
| 2010 | A Replacement Strategy for Canary Flip-FlopsabstractThe deep sub micron semiconductor technologies increase parameter variations. The increase in parameter variations requires excessive design margin that has serious impact on performance and power consumption. In order to eliminate the excessive design margin, we are investigating canary Flip-Flop (FF). Canary FF requires additional circuits consisting of an FF and a comparator. Thus, it suffers large area overhead. In order to reduce the area overhead, this paper proposes a selective replacement method for canary FF and evaluates it. In the case of Renesas's M32R processor, the area overhead of 2% is achieved. Yuji Kunitake, Toshinori Sato 0001, Hiroto Yasuura |
PRDC | 3 |
| 2009 | Dependable VLSI: device, design and architecture: how should they cooperate?abstractVLSI dependability is one of the most significant issues in the modern world. Here the panelists will discuss the key technologies for it as well as the cost optimization among device, design and architecture. Shuichi Sakai, Hidetoshi Onodera, Hiroto Yasuura, James C. Hoe |
ASP-DAC | 3 |
| 2009 | Large Scale Business-academia Collaboration in Master Education Course
Noriaki Sakamoto, Mitsuaki Fukase, Tsunenori Mine, Shigeru Kusakabe, Tsuneo Nakanishi, Yoichi Omori, Mohammad Mesbah Uddin, Keijiro Araki, Akira Fukuda, Hiroto Yasuura, Teruaki Kitasuka |
CSEDU (2) | 10 |
| 2008 | A Secure High-Speed Identification Scheme for RFID Using Bloom FiltersabstractAs pervasive computing environments become popular, RFID tags are introduced into our daily life. However, there exists a privacy problem that an adversary can trace users' behavior by linking the tag's ID. Although a Hash-chain scheme can solve this privacy problem, the scheme needs a long identification time or a large amount of memory. In this paper, we propose an efficient identification scheme using Bloom filters, which are space-efficient probabilistic data structures. Our Bloom pre-calculation scheme provides a high-speed identification with a small amount of memory by storing pre-calculated outputs of the tags in Bloom filters. Yasunobu Nohara, Sozo Inoue, Hiroto Yasuura |
ARES | 3 |
| 2008 | Simultaneous optimization of memory configuration and code allocation for low power embedded systemsabstractThis paper proposes a hybrid memory architecture which consists of the following two regions; 1) a dynamic power conscious region which uses low Vdd and Vth and 2) a static power conscious region which uses high Vdd and Vth. This paper also proposes an optimization problem for finding the optimal memory division ratio, the code allocation, ²ratio and Vdd so as to minimize the total power consumption of the memory under constraints of static noise margin (SNM), memory access delay and area overhead. Experimental results demonstrate that the total power consumption can be reduced by 50.8% with 7.7% memory array area overhead without degradations of SNM and access delay. Tadayuki Matsumura, Tohru Ishihara, Hiroto Yasuura |
ACM Great Lakes Symposium on VLSI | 3 |
| 2008 | A Note on Biometrics-based Authentication with Portable Device
Shinsuke Ohtsuka, Satoshi Kawamoto, Shigeru Takano, Kensuke Baba, Hiroto Yasuura |
SECRYPT | 5 |
| 2007 | A Software Technique to Improve Yield of Processor Chips in Presence of Ultra-Leaky SRAM Cells Caused by Process VariationabstractExceptionally leaky transistors are increasingly more frequent in nano-scale technologies due to lower threshold voltage and its increased variation. Such leaky transistors may even change position with changes in the operating voltage and temperature, and hence, redundancy at circuit-level is not sufficient to tolerate such threats to yield. We show that in SRAM cells this leakage depends on the cell value and propose a first software-based runtime technique that suppresses such abnormal leakages by storing safe values in the corresponding cache lines before going to standby mode. Analysis shows the performance penalty is, in the worst case, linearly dependent to the number of so-cured cache lines while the energy saving linearly increases by the time spent in standby mode. Analysis and experimental results on commercial processors confirm that the technique is viable if the standby duration is more than a small fraction of a second. Maziar Goudarzi, Tohru Ishihara, Hiroto Yasuura |
ASP-DAC | 3 |
| 2006 | Systematic Error Detection for RFID ReliabilityabstractIn this paper, we propose an approach to increase the reliability of RFID (radio frequency identification), not relying on the performance of each devices, but relying on a mechanism of entire networked system, which manages objects and/or people in the real world with RFID tags. We identified there exist many factors to reduce the accurate identifications of RFID tags, which results in the reduction of the total-system reliability. Moreover, we show the effect of our approach in diverse parameters such as the number of misidentifications, the length of transportations, the number of RFID readers. Sozo Inoue, Hiroto Yasuura, Daisuke Hagiwara |
ARES | 2 |
| 2005 | A variation-aware low-power coding methodology for tightly coupled busesabstractThis paper describes a novel low-power coding methodology for buses. Ultra deep submicron technology and system-on-chip have resulted in a considerable portion of power consumption on buses, in which the major sources of the power consumption are the transition activities on the signal lines and the coupling capacitances of the lines. In addition, we enter an era of considering variation of the effective coupling capacitances. We address power reduction including these phenomena by using variable length coding. Experimental results show the effectiveness of our methodology. Masanori Muroyama, Kosuke Tarumi, Koji Makiyama, Hiroto Yasuura |
ASP-DAC | 4 |
| 2003 | Quality-driven design by bitwidth optimization for video applicationsabstractThis paper presents a novel system-level design methodology, called quality-driven design for video applications by bitwidth optimization (QDDV). An output quality adaptive approach based on a forward and a backward propagation technique, which are effective bitwidth analysis and output-quality-based bitwidth analysis are also presented for variable bitwidth optimization. In order to illustrate the potential of the proposed methodology, MPEG-2 video is used as the driver application. Experimental results show the effectiveness of the methodology. Hiroto Yasuura |
ASP-DAC | 2 |
| 2003 | Reduction of crosstalk noise by optimizing 3-D configuration of the routing gridabstractIn this paper, we propose novel physical design techniques for a sub-quarter micron system-on-a-chip (SoC). By appropriately optimizing the routing grid space or the cell utilization ratio, the coupling effects are almost eliminated. By employing our proposed techniques on a 0.13μm six-layer physical design, the longest path delay is significantly decreased by 15% maximum without the need for process improvement. This significant delay reduction, which corresponds to a half generation of process progress, greatly accelerates the performance of SoCs. Atsushi Sakai, Takashi Yamada, Yoshifumi Matsushita, Hiroto Yasuura |
ASP-DAC | 4 |
| 2003 | A Power Reduction Scheme for Data Buses by Dynamic Detection of Active BitsabstractTo transfer a small number, we inherently need the small number of bits. But all bit lines on a data bus change their status and redundant power is consumed. To reduce the redundant power consumption, we introduce a concept named active bits. In this paper, we propose a power reduction scheme for data buses using the active bits. Suppressing switching activity of inactive bits, we can reduce redundant power consumption. We propose various power reduction techniques using active bits and the implementation methods. Experimental results illustrate 20% - 35% on average and up to 54.2% switching activity reduction. Masanori Muroyama, Akihiko Hyodo, Takanori Okuma, Hiroto Yasuura |
DSD | 4 |
| 2003 | Towards the Digitally Named World -Challenges for New Social Infrastructures based on Information TechnologiesabstractIn the 21st century, social infrastructures, such as economic systems, transportation systems and governmental service systems, are redesigned and reconstructed based on information technologies. In this paper, basic information technologies of the new social infrastructures are proposed. The personal identifier (PID) system for bidirectional authentication and an RFID tag system will play important roles in the new social infrastructures. Using PID and RFID tag, we can bridge a gap between the real world and the virtual world on computers automatically. We call the society, in which all persons and goods have their own digital names and recognizable both in the real and virtual world, "Digitally Named World". The systems require technologies of SoC, networking, security and software. Technical challenges and social requirements for the new technologies are presented. Hiroto Yasuura |
DSD | 1 |
| 2003 | Routing methodology for minimizing 1nterconnect energy dissipationabstractIn this paper, we propose a new physical design technique for sub-quarter micron system-on-a-chip (SoC). By optimizing the routing grid configuration for the automatic place and route methodology, coupling effects such as crosstalk noise and coupled energy dissipation are almost eliminated with only a small cost to the runtime. Experiments are performed on the design of an image processing circuit using a sub-quarter micron CMOS process with multi-layered interconnects. Simply by employing our proposed technique, net switching energy dissipation can be reduced by about 10% maximum without any area penalty. This significant energy reduction greatly accelerates the performance of SoCs. Atsushi Sakai, Takashi Yamada, Yoshifumi Matsushita, Hiroto Yasuura |
ACM Great Lakes Symposium on VLSI | 4 |
| 2003 | Reduction of coupling effects by optimizing the 3-D configuration of the routing gridabstractIn this brief, we propose a new physical design technique for a subquarter micrometer system-on-a-chip (SoC). By optimizing the individual layer's routing grid space, coupling effects such as crosstalk noise, crosstalk-induced delay variations, and coupling power consumption are almost eliminated with little runtime penalty. Experiments are performed on the design of an image processing circuit using a subquarter micron CMOS process with multilayer interconnects. Simply by employing our proposed technique, the maximum delay and the power consumption can be decreased simultaneously by up to 15% and 10%, respectively, without any other process improvements. Atsushi Sakai, Takashi Yamada, Yoshifumi Matsushita, Hiroto Yasuura |
IEEE Trans. Very Large Scale Integr. Syst. | 4 |
| 2002 | A Design for a Low-Power Digital Matched Filter Applicable to W-CDMAabstractThis paper presents a design for a low-power digital matched filter (DMF) applicable to Wideband-Code Division Multiple Access (W-CDMA), which is a Direct-Sequence Spread-Spectrum (DS-SS) communication system. The proposed architectural approach to reducing the power consumption focuses on the reception registers and the correlation-calculating unit (CCU), which dissipate the majority of the power in a DMF The main features are asynchronous latch clock generation for the reception registers, parallelism of the correlation calculation operations and bit manipulation for chip-correlation operations. A DMF is designed in compliance with the W-CDMA specifications incorporating the proposed techniques, and its properties are evaluated by computer simulations at the gate level using 0.18-/spl mu/m CMOS standard cell array technology. The results of the simulations show a power consumption of 9.3 mW (@15.6MHz, 1.6V), which is only about 30% of the power consumption of conventional DMFs. Shoji Goto, Takashi Yamada, Norihisa Takayarna, Yoshifumi Matsushita, Yasoo Harada, Hiroto Yasuura |
DSD | 6 |
| 2002 | A low-power digital matched filter for spread-spectrum systemsabstractA Digital Matched Filter (DMF) is an essential device for Direct-Sequence Spread-Spectrum (DS-SS) communication systems. Reducing the power consumption of a DMF is especially critical for battery-powered terminals. The reception registers and the correlation-calculating unit dissipate the majority of the power in a DMF. In this paper we discuss this problem and propose a low-power architectural approach to a DMF. The total switching activity factor and the switched capacitance are reduced. As a result of power analysis at the gate level, the implementation of the proposed architecture in a standard 0.18-μm CMOS technology achieved a reduction in the power consumption of more than 70%. Shoji Goto, Takashi Yamada, Norihisa Takayama, Yoshifumi Matsushita, Yasoo Harada, Hiroto Yasuura |
ISLPED | 6 |
| 2002 | Reducing access energy of on-chip data memory considering active data bitwidthabstractThis paper presents a new concept called active data bitwidth, which is the effective data length of data bus. By means of profiling the active data bitwidth dynamically, we present a novel low-energy memory access technique for on-chip data memory design. By reducing the redundant access energy of data memory, our experimental results of two real applications, show that we can achieve significant energy reduction. Compared to the monolithic memory, for JPEG, 52.2%; for MPEG-2 84.2%, the energy reduction is reported. Compared to the memory banking technique, 12.3% energy reduction for JPEG and 65.9% for MPEG-2 is reported. Takanori Okuma, Masanori Muroyama, Hiroto Yasuura |
ISLPED | 4 |
| 2002 | Power analysis techniques for SoC with improved wiring modelsabstractThis paper proposes two techniques for improving the accuracy of gate-level power analysis for system-on-a-chip (SoC). Takeshi Sakamoto, Takashi Yamada, Mamoru Mukuno, Yoshifumi Matsushita, Yasoo Harada, Hiroto Yasuura |
ISLPED | 6 |
| 2001 | A system-level energy minimization approach using datapath width optimizationabstractArticle A system-level energy minimization approach using datapath width optimization Share on Authors: Yun Cao Department of Computer Science and Communication Engineering, Kyushu University, 6-1 Kasuga-koen, Kasuga-shi, Fukuoka 816-8580, Japan Department of Computer Science and Communication Engineering, Kyushu University, 6-1 Kasuga-koen, Kasuga-shi, Fukuoka 816-8580, JapanView Profile , Hiroto Yasuura Department of Computer Science and Communication Engineering, Kyushu University, 6-1 Kasuga-koen, Kasuga-shi, Fukuoka 816-8580, Japan Department of Computer Science and Communication Engineering, Kyushu University, 6-1 Kasuga-koen, Kasuga-shi, Fukuoka 816-8580, JapanView Profile Authors Info & Claims ISLPED '01: Proceedings of the 2001 international symposium on Low power electronics and designAugust 2001 Pages 231–236https://doi.org/10.1145/383082.383142Online:06 August 2001Publication History 14citation314DownloadsMetricsTotal Citations14Total Downloads314Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access Hiroto Yasuura |
ISLPED | 2 |
| 2000 | One language or more?: how can we design an SoC at a system level?abstractNo abstract available. Masaharu Imai, Gary Smith 0001, Steven Schulz, Karen Bartleson, Daniel Gajski, Wolfgang Rosenstiel, Peter Flake, Hiroto Yasuura |
ASP-DAC | 8 |
| 2000 | A Bus Delay Reduction Technique Considering CrosstalkabstractAs the CMOS technology scaled down, the horizontal coupling capacitance between adjacent wires plays a dominant part in wire load, crosstalk interference becomes a serious problem for VLSI design. We focused on the delay increase caused by crosstalk. On-chip bus delay is maximized by the crosstalk effect when adjacent wires simultaneously switch for opposite signal transition directions. This paper proposes a bus delay reduction technique by intentional skewing signal transition timing of adjacent wires. An approximated equation of bus delay shows our delay reduction technique is effective for a repeater-inserted bus. The result of SPICE simulation shows that the total bus delay reduction by from 5% to 20% can be achieved. Kei Hirose, Hiroto Yasuura |
DATE | 2 |
| 2000 | A Power Reduction Technique with Object Code Merging for Application Specific Embedded ProcessorsabstractIn this paper, a power reduction technique which merges frequently executed sequences of object codes into a set of single instructions is proposed. The merged sequence of object codes is restored by an instruction decompressor before decoding the object codes. The decompressor is implemented by a ROM. In many programs, only a few sequences of object codes are frequently executed. Therefore, merging these frequently executed sequences into a single instruction leads to a significant energy reduction. Our experiments with actual read only memory (ROM) modules and some benchmark program demonstrate significant energy reductions up to more than 65% at best case over an instruction memory without the object code merging. Tohru Ishihara, Hiroto Yasuura |
DATE | 2 |
| 2000 | Analysis and Minimization of Test Time in a Combined BIST and External Test ApproachabstractIn this paper, an, analysis of test time by CBET (which is an acronym for Combination of BIST and External Test) test approach is presented. The analysis validates that CBET test approach can achieve shorter testing time than both external test and BIST in many situations. An efficient test time minimization algorithm for CBET-based LSIs is also proposed. It uses several characteristics of CBET test approach derived by the analysis to reduce computation time to find the optimum test sets. The algorithm helps designers to save their precious design time. Makoto Sugihara, Hiroto Yasuura, Hiroshi Date |
DATE | 2 |
| 2000 | An FPGA-based genetic algorithm machine (poster abstract)abstractNo abstract available. Barry Shackleford, Etsuko Okushi, Mitsuhiro Yasuda, Hisao Koizumi, Katsuhiko Seo, Takashi Iwamoto, Hiroto Yasuura |
FPGA | 7 |
| 1998 | Power-Pro: Programmable Power Management ArchitectureabstractThis paper presents Power-Pro architecture (Programmable Power Management Architecture), a novel processor architecture for power reduction. Power-Pro architecture has following two functionalities: (i) Supply voltage and clock frequency can be dynamically varied. (ii) Active data-path width can be dynamically adjusted to requirement of application programs. For the application programs which require less performance or less data-path width, Power-Pro architecture realize dramatic power reduction. Tohru Ishihara, Hiroto Yasuura |
ASP-DAC | 2 |
| 1998 | Module Selection Using Manufacturing InformationabstractSince manufacturing processes inherently fluctuate, LSI chips which are produced from the same design have different propagation delays. However, the difference in delays caused by the process fluctuation has rarely been considered in most high-level synthesis systems which were developed before. This paper presents a new approach to module selection in high-level synthesis, which exploits difference in functional unit delays. First, a module library model which assumes the probabilistic nature of functional unit delays is presented. Then, we propose a module selection problem and an algorithm which minimizes the cost per faultless chip. Experimental results demonstrate that the proposed algorithm finds the optimal module selection which would not have been explored without manufacturing information. Hiroyuki Tomiyama, Hiroto Yasuura |
ASP-DAC | 2 |
| 1998 | Instruction Scheduling for Power Reduction in Processor-Based System DesignabstractThis paper proposes an instruction scheduling technique to reduce power consumed for off-chip driving. The technique minimizes the switching activity of a data bus between an on-chip cache and a main memory when instruction cache misses occur. The scheduling problem is formulated and a scheduling algorithm is also presented. Experimental results demonstrate the effectiveness and the efficiency of the proposed algorithm. Hiroyuki Tomiyama, Tohru Ishihara, Akihiko Inoue, Hiroto Yasuura |
DATE | 4 |
| 1998 | Voltage scheduling problem for dynamically variable voltage processorsabstractThis paper presents a model of dynamically variable voltage processor and basic theorems for power-delay optimization. A static voltage scheduling problem is also proposed and formulated as an integer linear programming (ILP) problem. In the problem, we assume that a core processor can vary its supply voltage dynamically, but can use only a single voltage level at a time. For a given application program and a dynamically variable voltage processor, a voltage scheduling which minimizes energy consumption under an execution time constraint can be found. Tohru Ishihara, Hiroto Yasuura |
ISLPED | 2 |
| 1998 | A novel test methodology for core-based system LSIs and a testing time minimization problemabstractIn this paper, we propose a novel test methodology for core-based system LSIs. Our test methodology aims to decrease testing time for core-based system LSIs. Considering testing time reduction, our test methodology is based on BIST and ATPG. The main contributions of this paper are summarized as follows. (i). BIST is efficiently combined with external testing to relax the limitation of the external primary inputs and outputs. (ii). External testing for one of cores and BISTs for the others are performed in parallel to reduce the total testing time. (iii). The testing time minimization problem for core-based system LSIs is formulated as a combinatorial optimization problem to select the optimal set of test vectors from given sets of test vectors for each core. Makoto Sugihara, Hiroshi Date, Hiroto Yasuura |
ITC | 3 |
| 1997 | Memory-CPU Size Optimization for Embedded System DesignsabstractEntire systems embedded in a chip and consistingof a processor, memory, and system-specific peripheral hardwareare now commonly contained in commodity electronicdevices. Cost minimization of these systems is of paramounteconomic importance to manufactures of these devices. Byemploying a variable configuration processor in conjunctionwith a multi-precision compiler generator there are situationsin which considerable system cost reduction can be obtainedby synthesizing a CPU that is narrower than the largest variablein the application program. Barry Shackleford, Mitsuhiro Yasuda, Etsuko Okushi, Hisao Koizumi, Hiroyuki Tomiyama, Hiroto Yasuura |
DAC | 6 |
| 1997 | A High-Performance Hardware Implementation of a Survival-Based Genetic Algorithm
Barry Shackleford, Etsuko Okushi, Mitsuhiro Yasuda, Hisao Koizumi, Katsuhiko Seo, Takashi Iwamoto, Hiroto Yasuura |
ICONIP (1) | 7 |
| 1997 | Code placement techniques for cache miss rate reductionabstractIn the design of embedded systems with cache memories, it is important to minimize the cache miss rates to reduce power consumption of the systems as well as improve the performance. In this article, we propose two code placement methods ( a simplified method and a refined one) to reduce miss rates of instruction caches. We first define a simplified code placement problem without an attempt to minimize the code size. The problem is formulated as an integer linear programming (ILP) problem, by which an optimal placement can be found. Experimental results show that the simplified method reduces cache misses by an average of 30% (max. 77%). However, the code size obtained by the simplified method tends to be large, which inevitably leads to a larger memory size. In order to overcome this limitation, we further propose a refined code placement method in which the code size provided by the system designers must be satisfied. The effectiveness of the refined method is also demonstrated. Hiroyuki Tomiyama, Hiroto Yasuura |
ACM Trans. Design Autom. Electr. Syst. | 2 |
| 1996 | Basic experimentation on accuracy of power estimation for CMOS VLSI circuitsabstractIn this paper, we discuss on accuracy of several kinds of power dissipation model for CMOS VLSI circuits. Some researchers have proposed several efficient power estimation methods for CMOS circuits. However, we do not know how accurate they are because we have not established a method to compare the estimated results of power consumption with that of actual VLSI chip. To evaluate the accuracy of several kind of power dissipation model such as chip-level, block-level and gate-level etc., we examined as follows: (i) Measuring power consumption of actual micro-processors. (ii) Estimating power consumption with several kinds of power dissipation model. (iii) Comparing (i) with (ii). The experimental results show as follows: (1) Power estimation at gate level is accurate enough. (2) Estimating power of a clock tree independently makes estimation more accurate. Tohru Ishihara, Hiroto Yasuura |
ISLPED | 2 |
| 1996 | On the Computational Power of Binary Decision Diagram with Redundant Variables
Tetsuya Yamada, Hiroto Yasuura |
Formal Methods Syst. Des. | 2 |
| 1994 | Design Reuse: Fact or Fiction? (Panel)abstractDesign reuse is expected to be a key enabler for system designs in the 90's. Proponents claim that design reuse increases competitiveness through better quality, improved predictability and better productivity. On the other hand, skeptics say that design reuse is not realizable due to several barriers including rapid changes in technology, lack of standardized libraries and the presence of human, as opposed to technical barriers. Is design reuse a reality? How much is reused in practice? Where is it most applicable? Do concrete metrics exist for reusability? The panel will assess the track record of design reuse and discuss its status and future. Nikil Dutt, David Agnew, Raúl Camposano, Antun Domic, Manfred Wiesel, Hiroto Yasuura |
DAC | 6 |
| 1993 | A Micro-Vectorprocessor Architecture: Performance Modeling and BenchmarkingabstractThis paper proposes and examines some architectural features suitable for micro-vectorprocessors. Due to the I/O-pin bottleneck, micro-vectorprocessors should save the off-chip memory bandwidth by exploiting the on-chip register bandwidth instead. Those features include the vector-instruction-level multithreading and FIFO vector registers. There are three variations of multithreading:periodic, forced, and round-robin. The paper also formulates the performance of micro-vectorprocessors with such architectural features. And then, the paper evaluates the performance attainable by those micro-vectorprocessors with such architectural features. And then, the paper evaluates the performance attainable by those micro-vectorprocessors through software simulation. From the benchmark results, it is found that the vector-instruction-level multithreading and FIFO vector registers can improve the performance of the micro-vectorprocessors with the half memory bandwidth comparable to that of ones with the full memory bandwidth. Furthermore, forced multithreading is found to be tolerant to the large memory access latency. From these results, the paper concludes that the forced multithreading at the vector-instruction level is a good candidate for the architectural features suitable to micro-vectorprocessors. Takashi Hashimoto, Kazuaki J. Murakami, Tetsuo Hironaka, Hiroto Yasuura |
International Conference on Supercomputing | 4 |
| 1990 | NES: The Behavioral Model for the Formal Semantics of a Hardware Design Language UDL/IabstractThis paper describes a new behavioral model of hardware, named NES (Nondeterministic Event Sequence) model, which was developed for the purpose of defining formal semantics of the gate level and the register transfer level hardware description languages. The NES model is a generalization of the event driven simulation, and can be a basis of synthesis and verification as well as simulation. We introduce basic concepts, formal definition, and a description method of the NES model. Nagisa Ishiura, Hiroto Yasuura, Shuzo Yajima |
DAC | 2 |
| 1990 | Extraction of Functional Information from Combinatorial CircuitsabstractA technique is presented for functional information extraction, which is the transformation of design descriptions from the logic circuit level to the functional level. The authors have developed a functional information extraction system, FINES, which can deal with both logic functions and arithmetic functions. The technique has made use of the characteristics of the functions in order to perform function extraction independent of the circuit structures.> M. Ohmura, Hiroto Yasuura, Keikichi Tamaru |
ICCAD | 2 |
| 1990 | Formal semantics of UDL/I and its applications to CAD/DA toolsabstractUDL/I is a hardware design language for ASIC design developed in a Japanese LSI design language standardization project. A formal semantics of UDL/I is presented. There is no established way to define semantics of hardware design languages, because there is no general computation model for them. A definition method of formal semantics for UDL/I and semantics suitable for a standard language are developed. The basic idea is that the semantics of the language should be defined independently of simulators. The language provides an abstract model of hardware. The role of the language designer is to provide an abstract model of hardware which is natural and general for hardware designers and CAD engineers. The authors introduce a novel behavior model of hardware and define the semantics with a nondeterministic feature.> Hiroto Yasuura, Nagisa Ishiura |
ICCD | 1 |
| 1989 | Semantics of a Hardware Design Language for Japanese StandardizationabstractWe propose a new approach to define a formal semantics of a hardware design language (HDL) in Japanese LSI design language standardization project. Our approach is to separate the definition of semantics from simulators. Since the semantics includes nondeterminism, we can describe vagueness of circuit behavior such as dispersion of delays without linguistic ambiguity. We introduce a new computation model of hardware behaviour called NES (Nondeterministic Event Sequence) model. NES model is a very simple model of the computation in digital systems and provides an intuitive understanding of concurrent behaviour of HDL description without loss of mathematical strictness. Hiroto Yasuura, Nagisa Ishiura |
DAC | 1 |
| 1987 | High-Speed Logic Simulation on Vector ProcessorsabstractIn this paper, we propose logic simulation techniques using vector processors, or supercomputers with pipeline architecture, as a new approach to accelerating simulation speed. In order to use vector processors efficiently, we have to tune up the coding scheme or the basic algorithms to be suitable for vector processing. We developed three types of new simulation techniques for vector processing, which are dedicated for (1) zero-delay simulation of combinational circuits, (2) zero-delay simulation of synchronous sequential circuits, and (3) simulation with delay consideration. The first two are based on the compiler-driven method and the last on the event-driven method. We implemented logic simulators based on the above techniques on the FACOM VP-100 and VP-200 at Kyoto University and on the HITAC S-810/20 at the University of Tokyo. The maximum performance is about 7.7 x 10 /sup 9/ gate-evaluations per second for combinational circuit simulation, 1.4 x 10 /sup 9/ gate-evaluations per second for sequential circuit simulation (on the VP-200), and 230 x 10 /sup 3/ events per second for timing simulation (on the S-810/20). These results are comparable to the performance of hardware simulation engines. Moreover, our techniques are so straightforward that we can implement them on most of the recent vector processors without serious modifications Nagisa Ishiura, Hiroto Yasuura, Shuzo Yajima |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |
| 1985 | High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition TreeabstractA high-speed VLSI multiplication algorithm internally using redundant binary representation is proposed. In n bit binary integer multiplication, n partial products are first generated and then added up pairwise by means of a binary tree of redundant binary adders. Since parallel addition of two n-digit redundant binary numbers can be performed in a constant time independent of n without carry propagation, n bit multiplication can be performed in a time proportional to log2 n. The computation time is almost the same as that by a multiplier with a Wallace tree, in which three partial products will be converted into two, in contrast to our two-to-one conversion, and is much shorter than that by an array multiplier for longer operands. The number of computation elements of an n bit multiplier based on the algorithm is proportional to n2. It is almost the same as those of conventional ones. Furthermore, since the multiplier has a regular cellular array structure similar to an array multiplier, it is suitable for VLSI implementation. Thus, the multiplier is excellent in both computation speed and regularity in layout. It can be implemented on a VLSI chip with an area proportional to n2 log2 n. The algorithm can be directly applied to both unsigned and 2's complement binary integer multiplication. Naofumi Takagi, Hiroto Yasuura, Shuzo Yajima |
IEEE Trans. Computers | 2 |
| 1982 | An Interactive Simulation System for structured logic design - ISSabstractAn Interactive Simulation System (ISS) is presented. ISS is an integrated interactive CAD system for logic design, and is configurated “module oriented” to support structured logic design. An Interactive Simulator (IS) is used for design verification. A designer can control simulation steps interactively in IS, and he can find design errors early using a good interactive interface. A Structured Hardware Design Language (SHDL) is used to describe logic designs. Takeshi Sakai, Yoshiyuki Tsuchida, Hiroto Yasuura, Yasushi Ooi, Yoshitsugu Ono, Hiroshi Kano, Shinji Kimura, Shuzo Yajima |
DAC | 3 |
| 1982 | The Parallel Enumeration Sorting Scheme for VLSIabstractWe propose a new parallel sorting scheme, called the parallel enumeration sorting scheme, which is suitable for VLSI implementation. This scheme can be introduced to conventional computer systems without changing their architecture. In this scheme, sorting is divided into two stages, the ordering process and the rearranging one. The latter can be efficiently performed by central processing units or intelligent memory devices. For implementations of the ordering process by VLSI technology, we design a new hardware algorithm of parallel enumeration sorting circuits whose processing time is linearly proportional to the number of data for sorting. Data are serially transmitted between the sorting circuit and memory devices and the total communication between them is minimized. The basic structure used in the algorithm is called a bus connected cellular array structure with pipeline and parallel processing. The circuit consists of a linear array of one type of simple cell and two buses connecting all cells for efficient global communications in the circuit. The sorting circuit is simple, regular and small enough for realization by today's VLSI technology. We discuss several applications of the sorting circuit and evaluate its performance. Hiroto Yasuura, Naofumi Takagi, Shuzo Yajima |
IEEE Trans. Computers | 1 |
| 1981 | Width and Depth of Combinational Logic Circuits
Hiroto Yasuura |
Inf. Process. Lett. | 1 |