IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 46  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
VLD, HWS, ICD 2024-02-28
16:45
Okinawa
(Primary: On-site, Secondary: Online)
Research on Routing Method for Spacer-Is-Metal Type Self-Aligned Double Patterning
Koki Tanaka, Takuto Amari, Kunihiro Fujiyoshi (TUAT) VLD2023-105 HWS2023-65 ICD2023-94
SIM type Self-Aligned Double Patterning is one of the process technologies wiring with a pitch half of the exposure-poss... [more] VLD2023-105 HWS2023-65 ICD2023-94
pp.36-41
VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] 2023-11-17
14:50
Kumamoto Civic Auditorium Sears Home Yume Hall
(Primary: On-site, Secondary: Online)
An Improved Routing Method by SAT for Set-Pair Routing Problem
Koki Nagakura, Kunihiro Fujiyoshi (TUAT) VLD2023-77 ICD2023-85 DC2023-84 RECONF2023-80
A set-pair routing problem is a single-layer routing problem in which combinations of these pins to be connected by rout... [more] VLD2023-77 ICD2023-85 DC2023-84 RECONF2023-80
pp.243-248
MSS, CAS, SIP, VLD 2023-07-07
12:00
Hokkaido
(Primary: On-site, Secondary: Online)
Polygon Fracturing Method Considering Maximum Size Limit
Taiki Matsuzaki, Kunihiro Fujiyoshi (TUAT) CAS2023-22 VLD2023-22 SIP2023-38 MSS2023-22
The exposure data, which serves as input for variable shaped-beam mask writing, must be a set of rectangles, and it is c... [more] CAS2023-22 VLD2023-22 SIP2023-38 MSS2023-22
pp.107-112
HWS, VLD 2023-03-03
09:30
Okinawa
(Primary: On-site, Secondary: Online)
Global routing method imitating car path search
Yusuke Yamaguchi, Kunihiro Fujiyoshi (TUAT) VLD2022-100 HWS2022-71
Routing in LSI layout design is divided into two stages: global routing and detailed routing. In global routing, a path ... [more] VLD2022-100 HWS2022-71
pp.143-148
CAS, CS 2023-03-02
09:55
Fukuoka Kitakyushu International Conference Center
(Primary: On-site, Secondary: Online)
A Study on Improving Monte Carlo Tree Search Efficiency for Combinatorial Optimization Problems
Yusuke Kobayashi, Kunihiro Fujiyoshi (TUAT) CAS2022-112 CS2022-89
(To be available after the conference date) [more] CAS2022-112 CS2022-89
pp.95-100
CAS, CS 2023-03-02
10:20
Fukuoka Kitakyushu International Conference Center
(Primary: On-site, Secondary: Online)
Parameterizarion Method for Rapid Solving by Duplicating Spins in Ising Model
Kasumi Fukui, Kunihiro Fujiyoshi (TUAT) CAS2022-113 CS2022-90
The solution of combinatorial optimization problems based on the Ising Model is expected to find a quasi-optimal
soluti... [more]
CAS2022-113 CS2022-90
pp.101-106
VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] 2022-11-28
13:55
Kumamoto  
(Primary: On-site, Secondary: Online)
A Routing Method by SAT for Set-Pair Routing Problem
Koki Nagakura, Rintaro Yokoya, Kunihiro Fujiyoshi (Tokyo Univ of A and T) VLD2022-21 ICD2022-38 DC2022-37 RECONF2022-44
Set-pair routing problem is a single-layer routing problem in which a one-to-one connection is made between equal number... [more] VLD2022-21 ICD2022-38 DC2022-37 RECONF2022-44
pp.13-18
CAS, NLP 2022-10-21
11:15
Niigata
(Primary: On-site, Secondary: Online)
Rapid Solving by Duplicating Spins in Ising Model
Kasumi Fukui, Kunihiro Fujiyoshi (TUAT) CAS2022-30 NLP2022-50
The solution of combinatorial optimization problems based on the Ising model may obtain a quasi-optimal solution by mapp... [more] CAS2022-30 NLP2022-50
pp.56-59
VLD, HWS [detail] 2022-03-07
09:10
Online Online Improved placement-method of standard cells considering parallel routing
Takeru Furuyashiki, Kunihiro Fujiyoshi (TUAT) VLD2021-76 HWS2021-53
Recently, a minimal fab has been proposed for the purpose of small-quantity production of LSI at low cost and in a short... [more] VLD2021-76 HWS2021-53
pp.1-6
VLD, DC, RECONF, ICD, IPSJ-SLDM
(Joint) [detail]
2021-12-02
14:45
Online Online Extension of Channel Routing Method for Two-Layer Routing Problem including inside Terminals
Kaito Ishigami, Kunihiro Fujiyoshi (TUAT) VLD2021-43 ICD2021-53 DC2021-49 RECONF2021-51
Channel routing method is known that it can efficiently route rectangular regions called channels, which have fixed term... [more] VLD2021-43 ICD2021-53 DC2021-49 RECONF2021-51
pp.150-155
VLD, DC, RECONF, ICD, IPSJ-SLDM
(Joint) [detail]
2021-12-02
15:10
Online Online An Improved Method of Layout Pattern Classification with Creating Representative Clip
Tomoya Masutani, Ishino Shuhei, Kunihiro Fujiyoshi (TUAT) VLD2021-44 ICD2021-54 DC2021-50 RECONF2021-52
Layout of VLSI is designed according to design rules, however, hotspots may remain due to feature size shrinking. Recent... [more] VLD2021-44 ICD2021-54 DC2021-50 RECONF2021-52
pp.156-161
SIP, CAS, VLD, MSS 2021-07-06
10:25
Online Online A Method of Layout Pattern Classification with Creating Representative Clip
Tomoya Masutani, Shuhei Ishino, Kunihiro Fujiyoshi (TUAT) CAS2021-10 VLD2021-10 SIP2021-20 MSS2021-10
In recent years, we group layout clips of hotspots of similar pattern to create library, which is used to detect hotspot... [more] CAS2021-10 VLD2021-10 SIP2021-20 MSS2021-10
pp.48-53
VLD, DC, CPSY, RECONF, ICD, IE, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC
(Joint) [detail]
2019-11-15
15:20
Ehime Ehime Prefecture Gender Equality Center A Method of Parallel Computing for Detailed Routing on Ample Areas
Yuya Shijo, Kunihiro Fujiyoshi (TUAT) VLD2019-50 DC2019-74
There are studies that apply parallel computing to routing problems in LSI design, in order to speed up the routing desi... [more] VLD2019-50 DC2019-74
pp.179-184
CAS, CS 2019-03-08
11:05
Kanagawa Shonan Institute of Technology A Study on the Problem which Monte-Carlo-Tree-Search can Search Efficiently
Tetsuhiro Kitade, Kunihiro Fujiyoshi (TUAT) CAS2018-140 CS2018-108
Monte-Carlo-Tree-Search is expected to be effective for the solution search of a combinatorial optimization problem and ... [more] CAS2018-140 CS2018-108
pp.9-14
HWS, VLD 2019-02-27
13:30
Okinawa Okinawa Ken Seinen Kaikan Routing Algorithm to Achieve Circular Wire for SIM-Type SADP
Shun Akatsuka, Kunihiro Fujiyoshi (TUAT) VLD2018-98 HWS2018-61
Wires of Spacer-Is-Metal (SIM) type Self-Aligned Double Patterning (SADP) is peculiar since wires is circular when dummy... [more] VLD2018-98 HWS2018-61
pp.31-36
VLD, DC, CPSY, RECONF, CPM, ICD, IE, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC
(Joint) [detail]
2018-12-05
14:40
Hiroshima Satellite Campus Hiroshima Improved Routing Method for Two Layer Self-Aligned Double Patterning
Shoya Tamura, Kunihiro Fujiyoshi (TUAT) VLD2018-45 DC2018-31
Self-Aligned Double Patterning (SADP) enables us to fabricate fine wiring under ArF immersion lithography. However, when... [more] VLD2018-45 DC2018-31
pp.37-42
MSS, CAS, IPSJ-AL [detail] 2018-11-12
14:25
Shizuoka   A Study on Spin Update Method of Ising Model
Yuki Naito, Kunihiro Fujiyoshi (TUAT) CAS2018-61 MSS2018-37
Ising model, which consists of spins and interactions of them, is a novel way to solve combinatorial optimization proble... [more] CAS2018-61 MSS2018-37
pp.19-24
CAS, SIP, MSS, VLD 2018-06-15
15:05
Hokkaido Hokkaido Univ. (Frontier Research in Applied Sciences Build.) A Rough Placement Method Using Multi-Objective Genetic Algorithm
Shohei Shirageyama, Kunihiro Fujiyoshi (TUAT) CAS2018-29 VLD2018-32 SIP2018-49 MSS2018-29
In placement problem of LSI layout design, the main purpose is to minimize the wiring length.
Analytical placement has ... [more]
CAS2018-29 VLD2018-32 SIP2018-49 MSS2018-29
pp.149-154
CAS, SIP, MSS, VLD 2018-06-15
15:25
Hokkaido Hokkaido Univ. (Frontier Research in Applied Sciences Build.) Routing Algorithm to Achieve Circular Wire for SIM-Type SADP
Shun Akatsuka, Kunihiro Fujiyoshi (TUAT) CAS2018-30 VLD2018-33 SIP2018-50 MSS2018-30
Wires of Spacer-Is-Metal (SIM) type Self-Aligned Double Patterning (SADP) is peculiar since wires is circular when dummy... [more] CAS2018-30 VLD2018-33 SIP2018-50 MSS2018-30
pp.155-160
ICD, CPSY, CAS 2017-12-15
12:00
Okinawa Art Hotel Ishigakijima A faster searching method for polyhedral packing problem
Yutaka Matsushita, Kunihiro Fujiyoshi (TUAT) CAS2017-108 ICD2017-96 CPSY2017-105
Polyhedral packing problem is to pack given polyhedrons consisting of only planes perpendicular to one of x, y or z in a... [more] CAS2017-108 ICD2017-96 CPSY2017-105
pp.181-186
 Results 1 - 20 of 46  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan