View in EDS HTML Full Text PDF Full Text

Subgraph matching-based reference placement for printed circuit board designs.

Saved in:
Bibliographic Details
Title: Subgraph matching-based reference placement for printed circuit board designs.
Authors: Zhu, Ziran1 (AUTHOR) zrzhu@seu.edu.cn, Li, Yilin1 (AUTHOR), Su, Miaodi2 (AUTHOR), Zhang, Shu2 (AUTHOR), Su, Haiyuan2 (AUTHOR), Xiao, Yifeng3 (AUTHOR), He, Huan4 (AUTHOR), Chen, Jianli5 (AUTHOR), Chang, Yao-Wen6,7 (AUTHOR)
Source: Journal of Supercomputing. Nov2024, Vol. 80 Issue 16, p24324-24357. 34p.
Subjects: Data structures, Printed circuit design, Circuit complexity, Printed circuits, Isomorphism (Mathematics)
Abstract: Reference placement is promising to handle the increasing complexity in printed circuit board (PCB) designs, which aims to find the isomorphism of the placed template in component combination to reuse the placement. In this paper, we convert the netlist information into a graph and then model the reference placement as a subgraph matching problem. Since the state-of-the-art subgraph matching methods usually recursively search the solutions and suffer from high time and memory consumption in large-scale designs, we develop a novel subgraph matching algorithm D2BS with diversity tolerance and improved backtracking to guarantee matching quality and efficiency. The D2BS algorithm is founded on a data structure called the candidate space (CS) structure. We build and filter the candidate set for each query node according to our designed features to construct the CS structure. During the CS optimization process, a graph diversity tolerance strategy is adopted to achieve efficient inexact matching. Then, hierarchical matching is developed to search the template embeddings in the CS structure guided by branch backtracking and matched-node snatching strategies. Based on the industrial PCB designs, experimental results show that D2BS outperforms the state-of-the-art subgraph matching method in matching accuracy and running time. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 179142458
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Subgraph matching-based reference placement for printed circuit board designs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Zhu%2C+Ziran%22">Zhu, Ziran</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> zrzhu@seu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Li%2C+Yilin%22">Li, Yilin</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Su%2C+Miaodi%22">Su, Miaodi</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Zhang%2C+Shu%22">Zhang, Shu</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Su%2C+Haiyuan%22">Su, Haiyuan</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Xiao%2C+Yifeng%22">Xiao, Yifeng</searchLink><relatesTo>3</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22He%2C+Huan%22">He, Huan</searchLink><relatesTo>4</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Chen%2C+Jianli%22">Chen, Jianli</searchLink><relatesTo>5</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Chang%2C+Yao-Wen%22">Chang, Yao-Wen</searchLink><relatesTo>6,7</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Supercomputing%22">Journal of Supercomputing</searchLink>. Nov2024, Vol. 80 Issue 16, p24324-24357. 34p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Data+structures%22">Data structures</searchLink><br /><searchLink fieldCode="DE" term="%22Printed+circuit+design%22">Printed circuit design</searchLink><br /><searchLink fieldCode="DE" term="%22Circuit+complexity%22">Circuit complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Printed+circuits%22">Printed circuits</searchLink><br /><searchLink fieldCode="DE" term="%22Isomorphism+%28Mathematics%29%22">Isomorphism (Mathematics)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Reference placement is promising to handle the increasing complexity in printed circuit board (PCB) designs, which aims to find the isomorphism of the placed template in component combination to reuse the placement. In this paper, we convert the netlist information into a graph and then model the reference placement as a subgraph matching problem. Since the state-of-the-art subgraph matching methods usually recursively search the solutions and suffer from high time and memory consumption in large-scale designs, we develop a novel subgraph matching algorithm D2BS with diversity tolerance and improved backtracking to guarantee matching quality and efficiency. The D2BS algorithm is founded on a data structure called the candidate space (CS) structure. We build and filter the candidate set for each query node according to our designed features to construct the CS structure. During the CS optimization process, a graph diversity tolerance strategy is adopted to achieve efficient inexact matching. Then, hierarchical matching is developed to search the template embeddings in the CS structure guided by branch backtracking and matched-node snatching strategies. Based on the industrial PCB designs, experimental results show that D2BS outperforms the state-of-the-art subgraph matching method in matching accuracy and running time. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=179142458
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11227-024-06338-9
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 34
        StartPage: 24324
    Subjects:
      – SubjectFull: Data structures
        Type: general
      – SubjectFull: Printed circuit design
        Type: general
      – SubjectFull: Circuit complexity
        Type: general
      – SubjectFull: Printed circuits
        Type: general
      – SubjectFull: Isomorphism (Mathematics)
        Type: general
    Titles:
      – TitleFull: Subgraph matching-based reference placement for printed circuit board designs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Zhu, Ziran
      – PersonEntity:
          Name:
            NameFull: Li, Yilin
      – PersonEntity:
          Name:
            NameFull: Su, Miaodi
      – PersonEntity:
          Name:
            NameFull: Zhang, Shu
      – PersonEntity:
          Name:
            NameFull: Su, Haiyuan
      – PersonEntity:
          Name:
            NameFull: Xiao, Yifeng
      – PersonEntity:
          Name:
            NameFull: He, Huan
      – PersonEntity:
          Name:
            NameFull: Chen, Jianli
      – PersonEntity:
          Name:
            NameFull: Chang, Yao-Wen
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: Nov2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 09208542
          Numbering:
            – Type: volume
              Value: 80
            – Type: issue
              Value: 16
          Titles:
            – TitleFull: Journal of Supercomputing
              Type: main
ResultId 1