Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2023-11-17 14:50
An Improved Routing Method by SAT for Set-Pair Routing Problem
Koki Nagakura, Kunihiro Fujiyoshi (TUAT) VLD2023-77 ICD2023-85 DC2023-84 RECONF2023-80
Abstract (in Japanese) (See Japanese page) 
(in English) A set-pair routing problem is a single-layer routing problem in which combinations of these pins to be connected by routing is flexible.
The problem requires routing in which minimum the longest routing length and the length difference.
The set-pair routing appears partially in a printed circuit board (PCB).
In addition, several methods have been proposed to find a suboptimal routing solution by using flow graph.
Furthermore, two methods have been proposed for finding the optimal routing solution to this problem, one using the integer linear programming (ILP) solver and the other using the satisfiability problem (SAT) solver.
However, the conventional method using the SAT solver has a huge number of constraints used to control the routing length, and when the routing area is large, it cannot be solved due to insufficient memory.
Therefore, this paper presents an improved routing method for a set-pair routing problem using the SAT solver to solve problems with large routing areas.
Keyword (in Japanese) (See Japanese page) 
(in English) Set-Pair Routing Problem / SAT / / / / / /  
Reference Info. IEICE Tech. Rep., vol. 123, no. 258, VLD2023-77, pp. 243-248, Nov. 2023.
Paper # VLD2023-77 
Date of Issue 2023-11-08 (VLD, ICD, DC, RECONF) 
ISSN Online edition: ISSN 2432-6380
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)
Download PDF VLD2023-77 ICD2023-85 DC2023-84 RECONF2023-80

Conference Information
Committee VLD DC RECONF ICD IPSJ-SLDM  
Conference Date 2023-11-15 - 2023-11-17 
Place (in Japanese) (See Japanese page) 
Place (in English) Civic Auditorium Sears Home Yume Hall 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Design Gaia 2023 -New Field of VLSI Design- 
Paper Information
Registration To VLD 
Conference Code 2023-11-VLD-DC-RECONF-ICD-SLDM 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) An Improved Routing Method by SAT for Set-Pair Routing Problem 
Sub Title (in English)  
Keyword(1) Set-Pair Routing Problem  
Keyword(2) SAT  
Keyword(3)  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Koki Nagakura  
1st Author's Affiliation okyo University of Agriculture and Technology (TUAT)
2nd Author's Name Kunihiro Fujiyoshi  
2nd Author's Affiliation okyo University of Agriculture and Technology (TUAT)
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2023-11-17 14:50:00 
Presentation Time 25 minutes 
Registration for VLD 
Paper # VLD2023-77, ICD2023-85, DC2023-84, RECONF2023-80 
Volume (vol) vol.123 
Number (no) no.258(VLD), no.259(ICD), no.260(DC), no.261(RECONF) 
Page pp.243-248 
#Pages 6 
Date of Issue 2023-11-08 (VLD, ICD, DC, RECONF) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan