Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Takashi Mitsuhashi

dblp:87/3767 · DBLP profile ↗
← Back
11ranked-venue papers
3as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 11 · 3 first-authorApplied, interdisciplinary, general and emerging 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
6 papers
Electronic design automation · 67% Integrated circuit design · 17% Energy-efficient computing · 17%

Topics — the 14 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.051997
Layout Driven Re-synthesis for Low Power Consumption LSIs · DAC 1997
Power and Ground Network Topology Optimization for Cell Based VLSIs · DAC 1992
Programs for verifying circuit connectivity of mos/lsi mask artwork · DAC 1982
Energy-efficient computing
low-power design
0.011997
Layout Driven Re-synthesis for Low Power Consumption LSIs · DAC 1997
Integrated circuit design
low-power circuit design
0.011992
Power and Ground Network Topology Optimization for Cell Based VLSIs · DAC 1992
Integrated circuit design
power delivery network
0.011992
Power and Ground Network Topology Optimization for Cell Based VLSIs · DAC 1992
Electronic design automation › physical design › power delivery network design
power/ground network optimization
0.011992
Power and Ground Network Topology Optimization for Cell Based VLSIs · DAC 1992
Electronic design automation
physical verification
0.021987
A Resistance Calculation Algorithm and Its Application to Circuit Extraction · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987
An integrated mask artwork analysis system · DAC 1980
Electronic design automation
power estimation
0.011997
Layout Driven Re-synthesis for Low Power Consumption LSIs · DAC 1997
Electronic design automation › physical design
layout verification
0.031982
Programs for verifying circuit connectivity of mos/lsi mask artwork · DAC 1982
An integrated mask artwork analysis system · DAC 1980
A layout checking system for large scale integrated circuits · DAC 1977
Electronic design automation › physical design
parasitic extraction
0.011987
A Resistance Calculation Algorithm and Its Application to Circuit Extraction · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987
Electronic design automation › interconnect modeling
resistance calculation
0.011987
A Resistance Calculation Algorithm and Its Application to Circuit Extraction · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987
Electronic design automation
hardware verification and test
0.011982
Programs for verifying circuit connectivity of mos/lsi mask artwork · DAC 1982
Electronic design automation › physical verification
mask verification
0.011982
Programs for verifying circuit connectivity of mos/lsi mask artwork · DAC 1982
Electronic design automation › hardware verification and test
hardware verification
0.011980
An integrated mask artwork analysis system · DAC 1980
Electronic design automation › hardware verification and test
logic simulation
0.011980
An integrated mask artwork analysis system · DAC 1980

Methods — techniques the papers use, named apart from their topics

wire capacitance estimation · 0.0remapping · 0.0re-placement · 0.0finite element method · 0.0direct admittance matrix derivation · 0.0design rule checking · 0.0circuit parameter extraction · 0.0
YearPublicationVenuePosition
1998 A Clock-Gating Method for Low-Power LSI Design
abstract
This paper describes an automated layout design technique for the gated-clock design. Two issues must be considered for gated-clock circuits to work correctly. One is to minimize the skew for gated-clock nets. The other is to keep timing constraints for enable-logic parts. We propose the layout design technique to taking these things into consideration. We developed gated-clock tree synthesizer for the first issue, and timing constraints generator and clock delay estimator for the second. We applied it to a practical gated-clock circuit. By our technique, the clock-skew could be less than 0.2 ns keeping timing constraints for enable-logic parts.
Takeshi Kitahara, Fumihiro Minami, Toshiaki Ueda, Kimiyoshi Usami, Seiichi Nishio, Masami Murakata, Takashi Mitsuhashi
ASP-DAC7
1997 Layout Driven Re-synthesis for Low Power Consumption LSIs
abstract
A new technology re-mapping method named LDR (Layout Driven Re-synthesis), which is applied after placement, is proposed. LDR executes re-mapping and re-placement simultaneously in order to minimize power consumption with placement information. High switching activity nets are concealed inside the re-mapped cells or are shortened by re-placement in LDR. To estimate power consumption, LDR uses static power estimator for combinational circuits. LDR also calculates wire capacitances accurately based on placement information to evaluate power. Experimental results show that 20 % power reduction compared with original circuits is performed by proposed method. 1 Introduction Lowpower LSI design becomes important. For example, for portable equipments, power consumption is critical design concern because of limited battery life time. For high performance computers, expencive package cost for cooling is major problem. There are many conventional methods to reduce power consumption in logic s...
Masako Murofushi, Takashi Ishioka, Masami Murakata, Takashi Mitsuhashi
DAC4
1996 Switching activity analysis for sequential circuits using Boolean approximation method
abstract
We propose an incremental probabilistic approach to calculate the signal probabilities and switching activities of the internal nodes of sequential logic circuits. Spatio-temporal correlations are fully considered by using Multi-Terminal Binary Decision Diagrams (MTBDD) with real number valued terminals. The running time of our approach is short because the depth of the MTBDD does not depend on circuit size but only on the user-specified unrolling number, which is usually 2 or 3. Experimental results show that our approach is 100-times faster than logic simulation and 10-times more accurate than the previous approach which ignores all correlations.
Taku Uchino, Fumihiro Minami, Masami Murakata, Takashi Mitsuhashi
ISLPED4
1995 Fanout-tree restructuring algorithm for post-placement timing optimization
abstract
This paper proposes a fanout-tree restructuring algorithm for post-placement timing optimization to meet timing constraints. The proposed algorithm restructures a fanout-tree by finding a tree in a graph which represents a multi-terminal net, and inserts buffer cells and resizes cells based on an accurate interconnection RC delay without degrading routability. The algorithm has been implemented and applied to a number of layout data generated by timing driven placement. Application results show a 17% reduction in circuit delay on the average.
T. Aoki, Masami Murakata, Takashi Mitsuhashi, Nobuyuki Goto
ASP-DAC3
1995 Switching activity analysis using Boolean approximation method
abstract
This paper presents a novel algorithm to estimate the signal probability and switching activity at all nodes in a combinational logic circuit under a zero-delay model without constructing global BDDs. By using Taylor expansion technique, the first-order signal correlation effects due to reconvergent fan-out nodes are taken into account. High accuracy is achieved by considering the dependency of the signal probability and switching activity on each primary input. High speed is also achieved by using the incremental approach for probability calculation. Our approach is able to handle large circuits, since it does not need to construct global BDDs for the probability calculation. The analysis of the time complexity and the experimental results show the running time of our approach to be about 100 times shorter than that of the most accurate approach previously proposed and that our approach has comparable accuracy. The error of the total power estimation is about 0.5% on average.
Taku Uchino, Fumihiro Minami, Takashi Mitsuhashi, Nobuyuki Goto
ICCAD3
1992 Power and Ground Network Topology Optimization for Cell Based VLSIs
Takashi Mitsuhashi, Ernest S. Kuh
DAC1
1990 FOLM-Planner: A New Floorplanner with a Frame Overlapping Floorplan Model Suitable for SOG (Sea-of-Gates) Type Gate Arrays
abstract
A floorplanner, FOLM-planner, suitable for SOG gate arrays is presented. FOLM-planner is based on a 'frame overlapping floorplan model, which is free from unnecessary constraints caused by conventional floorplan models, and is easy to use for satisfying timing constraints. FOLM-planner aims at minimizing the net length among frames and controlling frame overlaps for efficient usage of a chip area. To accomplish these objectives, FOLM-planner uses a newly developed force directed method for frame reshaping as well as moving. Experimental results have shown that FOLM layout can shorten the net length inside a frame without the total net length becoming longer.>
Masako Murofushi, Masaaki Yamada, Takashi Mitsuhashi
ICCAD3
1987 A Resistance Calculation Algorithm and Its Application to Circuit Extraction
abstract
This paper describes a resistance calculation program for a layout verification system called EMAP. A new resistance calculation algorithm, based on the finite-element method, and a generalized resistor model, used in this program, are discussed. Contact resistance effects, pinch resistors, and other kinds of resistance appearing in LSI's are considered in the proposed model. The proposed two-dimensional model, in which an inherent three-dimensional structure of resistors is embedded, allows efficient and accurate resistance calculation. The resistance value for an arbitrarily shaped multiregional resistivity and multiport resistor can be calculated efficiently by the proposed algorithm. The algorithm, called direct admittance matrix derivation, makes it possible to eliminate the tedious boundary condition treatment, and provides efficient matrix manipulation. Implementation techniques and related algorithms are discussed; these include resistor recognition from mask artwork, mesh generation for finite elements, node numbering for matrix bandwidth reduction, some properties of matrices appearing in the proposed algorithm, and a circuit representation method for the derived matrices. Some implementation results are also discussed.
Takashi Mitsuhashi, Kenji Yoshida
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1982 Programs for verifying circuit connectivity of mos/lsi mask artwork
Makoto Takashima, Takashi Mitsuhashi, Toshiaki Chiba, Kenji Yoshida
DAC2
1980 An integrated mask artwork analysis system
abstract
A new LSI artwork analysis and processing system, called EMAP, is described with algorithms, a database schema and applications. EMAP provides the designer with the artwork verification and processing tools which include mask artwork processing, geometrical design rule checking, connectivity analysis and electrical circuit parameter calculation. The circuit connectivity data derived from the mask artwork data is used for input to a logic simulator, a timing simulator, a circuit simulator and a circuit schematic generator.
Takashi Mitsuhashi, Toshiaki Chiba, Makoto Takashima, Kenji Yoshida
DAC1
1977 A layout checking system for large scale integrated circuits
Kenji Yoshida, Takashi Mitsuhashi, Yasuo Nakada, Toshiaki Chiba, Kiyoshi Ogita, Shinji Nakatsuka
DAC2