EUVIMEDEUVIMED entdecken
Open Access

Efficient, automated escape routing for high-density pad grids: deepest-exit-first algorithm for layer and wire count optimization

Iakov Rachinskiy iD, Dmitrii Rachinskii iD, Jonathan Viventi iD

Journal of Neural Engineering · 2025

DOI: 10.1088/1741-2552/adde85 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Neural Engineering, 2025. Verfasst von Iakov Rachinskiy und 2 weiteren Autor:innen. Beteiligte Einrichtung: Department of Biomedical Engineering, Duke University, Durham, NC, United States of America. Hauptthemen laut MEDLINE: Algorithms, Electrodes, Implanted, Wireless Technology. Die Arbeit nennt 41 Literaturangaben. Der Volltext ist frei in PubMed Central verfügbar. Gefördert von: NIDCD NIH HHS, National Institute on Deafness and Other Communication Disorders, Congressionally Directed Medical Research Programs.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Objective. The burgeoning demand for higher channel count neural interfaces has led to the incorporation of large connectors for connecting electrode channels to recording systems or on-site wireless electronics. However, as these devices are size-constrained for implantation, driving up pad count increases grid density, pushing metal feature sizes to their fabrication limits. Thin-film substrates offer a viable solution, as established microfabrication techniques enhance capabilities over standard electrode manufacturing. Yet, patterning thin-films (TF) still has limitations, requiring multiple layers to wire out the dense grids. This creates a trade-off: more channels require larger connectors and more routing layers, but this reduces flexibility and can make the devices too large for implantation. Approach. In this work we propose an algorithm to efficiently route dense pad grids in the worst scenario case, where traces cannot fit between adjacent pads. We show that the proposed method can route the theoretical maximum number of traces for sufficiently large grids, showing promise for application in very large channel count device designs. Main results. We demonstrate its application on a 1024 channel electrode connected to a dense, flip-chip bonded, wireless recording, application-specific integrated circuit. Comparing the algorithm to standard methods, we achieved improved efficiency in terms of routable traces, number of layers and footprint area. As channel counts increase in TF neural interfaces, escape routing will become more critical . Significance. This algorithm addresses the challenge of mismatched pad density and metal feature size capabilities and automates the design process to ease and accelerate design iteration.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsElectrodes, ImplantedWireless TechnologyEquipment DesignHumans

Stichwörter der Autor:innen

escape routinghigh-density connectorsneural interfacesthin-film substrates

Autor:innen und Institutionen

  • Department of Biomedical Engineering, Duke University, Durham, NC, United States of America.
  • Department of Mathematical Sciences, University of Texas at Dallas, Richardson, TX 75080, United States of America.
  • Department of Neurosurgery, Duke University School of Medicine, Durham, NC, United States of America.
  • Department of Neurobiology, Duke University School of Medicine, Durham, NC, United States of America.
  • Duke Comprehensive Epilepsy Center, Duke University, Durham, NC, United States of America.

ORCID-Profile: Iakov Rachinskiy, Dmitrii Rachinskii, Jonathan Viventi

Förderung

  • NIDCD NIH HHS
  • National Institute on Deafness and Other Communication Disorders
  • Congressionally Directed Medical Research Programs

Zitieren

APA

Rachinskiy, I., Rachinskii, D., & Viventi, J. (2025). Efficient, automated escape routing for high-density pad grids: deepest-exit-first algorithm for layer and wire count optimization. Journal of Neural Engineering. https://doi.org/10.1088/1741-2552/adde85

Vancouver

Rachinskiy I, Rachinskii D, Viventi J. Efficient, automated escape routing for high-density pad grids: deepest-exit-first algorithm for layer and wire count optimization. Journal of Neural Engineering. 2025. doi:10.1088/1741-2552/adde85

BibTeX
@article{Rachinskiy2025,
  author = {Rachinskiy, Iakov and Rachinskii, Dmitrii and Viventi, Jonathan},
  title = {Efficient, automated escape routing for high-density pad grids: deepest-exit-first algorithm for layer and wire count optimization},
  journal = {Journal of Neural Engineering},
  year = {2025},
  doi = {10.1088/1741-2552/adde85}
}
Kostenlos starten →