IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
... (for ESS/CS/ES/ISS)
Tech. Rep. Archives
... (for ES/CS)
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2015-05-14 10:05
NP-completeness of Routing Problem with Bend Constraint
Toshiyuki Hongo, Atsushi Takahashi (Tokyo Tech)
Abstract (in Japanese) (See Japanese page) 
(in English) Self-Aligned Quadruple Patterning (SAQP) in which side-wall process is repeated twice is an important manufacturing technique to realize tiny routing pattern in next generation lithography, however, every routing pattern is not realized.
In order to obtain SAQP feasible routing patterns, a routing pattern generation method in which a special 3-color grid is used was proposed.
In the routing pattern generation method, routing is classified into three according to the manufacturing process of SAQP.
Among them, routing corresponding to the last manufacturing process neither allow to branch off nor to bend at several grids.
Therefore, an algorithm that obtains a path between two vertices that satisfies bend constraint is required to obtain a routing that corresponds to the last manufacturing process.
In this paper, the problem deciding whether there exists a path that satisfies the bend constraint is proved to be NP-complete in general.
Keyword (in Japanese) (See Japanese page) 
(in English) Self-Aligned Quadruple Patterning / Bend Constraint / Routing Problem / NP-complete / / / /  
Reference Info. IEICE Tech. Rep., vol. 115, no. 21, VLD2015-3, pp. 13-18, May 2015.
Paper # VLD2015-3 
Date of Issue 2015-05-07 (VLD) 
ISSN Print edition: ISSN 0913-5685  Online edition: ISSN 2432-6380

Conference Information
Committee VLD IPSJ-SLDM  
Conference Date 2015-05-14 - 2015-05-14 
Place (in Japanese) (See Japanese page) 
Place (in English) Kitakyushu International Conference Center 
Topics (in Japanese) (See Japanese page) 
Topics (in English) System Design, etc. 
Paper Information
Registration To VLD 
Conference Code 2015-05-VLD-SLDM 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) NP-completeness of Routing Problem with Bend Constraint 
Sub Title (in English)  
Keyword(1) Self-Aligned Quadruple Patterning  
Keyword(2) Bend Constraint  
Keyword(3) Routing Problem  
Keyword(4) NP-complete  
1st Author's Name Toshiyuki Hongo  
1st Author's Affiliation Toyko Institute of technology (Tokyo Tech)
2nd Author's Name Atsushi Takahashi  
2nd Author's Affiliation Toyko Institute of technology (Tokyo Tech)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Date Time 2015-05-14 10:05:00 
Presentation Time 25 
Registration for VLD 
Paper # IEICE-VLD2015-3 
Volume (vol) IEICE-115 
Number (no) no.21 
Page pp.13-18 
#Pages IEICE-6 
Date of Issue IEICE-VLD-2015-05-07 

[Return to Top Page]

[Return to IEICE Web Page]

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