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

Takeshi Ihara

dblp:20/2413 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2016
0000-0003-0540-2183ORCID · corroborated

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

Systems, architecture and hardware · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 2 first-authorComputer networks · 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
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › routing › detailed routing
grid routing
0.212015
Self-Aligned Double and Quadruple Patterning Aware Grid Routing Methods · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2015
Electronic design automation › physical design › lithography
multiple patterning lithography
0.212015
Self-Aligned Double and Quadruple Patterning Aware Grid Routing Methods · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2015
Electronic design automation
physical design
0.212015
Self-Aligned Double and Quadruple Patterning Aware Grid Routing Methods · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2015
Electronic design automation › physical design
routing
0.212015
Self-Aligned Double and Quadruple Patterning Aware Grid Routing Methods · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2015

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

graph coloring · 0.2dummy pattern flipping · 0.2
YearPublicationVenuePosition
2016 Grid-based Self-Aligned Quadruple Patterning aware two dimensional routing pattern
Takeshi Ihara, Toshiyuki Hongo, Atsushi Takahashi 0001, Chikaaki Kodama
DATE1
2015 Effective two-dimensional pattern generation for self-aligned double patterning
abstract
In nano-scale systems, design for manufacturability is essentially required. For sub 20 nm technology node, Self-Aligned Double Patterning (SADP) is an important manufacturing technique, and complex two-dimensional patterns are requested to be fabricated by SADP. However all two-dimensional patterns cannot be fabricated by SADP. In this paper, two-dimensional patterns that satisfy connection requirements as well as manufacturability by SADP are effectively derived by our proposed approach in which partially pre-colored two-color base grid is used.
Takeshi Ihara, Atsushi Takahashi 0001, Chikaaki Kodama
ISCAS1
2015 Self-Aligned Double and Quadruple Patterning Aware Grid Routing Methods
abstract
Although self-aligned double and quadruple patterning (SADP, SAQP) have promising processes for sub-20 nm node advanced technologies and beyond, not all layouts are compatible with them. In advanced technologies, feasible wafer image should be generated effectively by utilizing SADP and SAQP where a wafer image is determined by a selected mandrel pattern. However, predicting a mandrel pattern is not easy since it is different from the wafer image (or target pattern). In this paper, we propose new routing methods for spacer-is-dielectric (SID)-type SADP, SID-type SAQP, and spacer-is-metal (SIM)-type SADP to generate a feasible layout satisfying the connection requirements. Routing algorithms comprising simple connecting and cutting rules are performed on a new grid structure where two (SID-type SADP) or three colors (SID-type SAQP and SIM-type SADP) are assigned alternately to grid-nodes. Then a mandrel pattern is selected without complex coloring or decomposition methods. Also, we try to reduce hotspots (potentially defective regions) by the proposed dummy pattern flipping for SID-type SADP. In experiments, feasible layouts meeting the connection requirements are generated and the effectiveness of the proposed framework is confirmed.
Chikaaki Kodama, Hirotaka Ichikawa, Koichi Nakayama, Fumiharu Nakajima, Shigeki Nojima, Toshiya Kotani, Takeshi Ihara, Atsushi Takahashi 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.7
2005 BAM: branch aggregation multicast for wireless sensor networks
abstract
In this paper, we propose a multicast protocol, called BAM: branch aggregation multicast, for wireless sensor networks. The main contribution of BAM is a reduction in the radio communication load, which is a dominant factor of sensor energy consumption. BAM does not use any control packet such as join/leave messages and does not manage multicast groups. BAM is highly compatible with existing wireless sensor protocols, such as routing protocols, MAC protocols, and other kinds of energy efficient protocols. BAM implementation is quite simple and BAM works on various networks even if some sensors are not BAM-capable. BAM is composed of two aggregation techniques. One is single hop aggregation (S-BAM) and the other is multiple paths aggregation (M-BAM). S-BAM aggregates radio transmission within single hop and enables just single transmission to multiple intended receivers. M-BAM aggregates multiple paths into fewer ones and limits the range of radio transmission. S-BAM is designed to reduce redundant communication at every branch and M-BAM is designed to reduce the number of branches. SM-BAM, the combination of S-BAM and M-BAM, can reduce the radio communication load thus enabling energy efficient multicast communication. We evaluated BAM in three ways, qualitative evaluation by theoretical analysis, quantitative evaluation through computer simulations, and experiments using CrossBow's MICA2. Our results show that BAM is a very energy efficient multicast protocol that well supports wireless sensor networks.
Akihito Okura, Takeshi Ihara, Akira Miura
MASS2
2000 Mobile IP Route Optimization Method for a Carrier-Scale IP Network
abstract
The current mobile IP specification forces all packets forwarded to a mobile terminal (MT) to be routed via that terminal's home agent (HA), which often leads to triangular routing, which in turn causes data transmission delay and wastes network resources. IETF (Internet Engineering Task Force) is studying a solution that can optimize the route length, but this solution requires the implementation of additional functions on all correspondent nodes, so it will not be realistic. The paper proposes the use of mobile IP border gateways (MBGs) to optimize the routing in a carrier-scale network and reduce the processing burden on the HA without adding more functions to the correspondent nodes, and shows the effect of reducing the route length and the HA's load. We also propose a hierarchical arrangement of foreign agents (FAs) to reduce the processing burden on MBGs.
Takeshi Ihara, Hiroyuki Ohnishi, Yasushi Takagi
ICECCS1