Harmonic Participation Sieve for Electronic Network Design: Switch Fabric Reduction, Power Grid Routing, and Relay Network Optimization
Authors/Creators
Description
We apply the Harmonic Participation Sieve, a graph-theoretic edge ranking algorithm previously validated in 3D physics simulation and neural network pruning, to three electronic network design problems.
A breadth-first spanning tree guarantees connectivity, while a harmonic participation score ranks each connection by its structural importance.
Applied to a 16×16 switch fabric, the sieve removes 28.8% of switches while retaining 100% of available paths and maintaining an identical minimum hop count.
Applied to a 20×20 VLSI power grid, it identifies 56 critical copper traces for maximum-width routing, versus 397 redundant traces for minimum-width routing.
Applied to a 64-node relay network, it removes 30.6% of links while preserving maximum-throughput path capacity.
Algorithm licensed under PolyForm Noncommercial 1.0.0.
Notes
Files
pirolo2026_electronics_hte.pdf
Files
(366.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:f2aac9a55ff3400be9f5628f23c5c4bc
|
163.7 kB | Preview Download |
|
md5:d9f67284da49674f748089468115c27b
|
202.7 kB | Preview Download |
Additional details
Software
- Repository URL
- https://zenodo.org/uploads/20573427
- Programming language
- Python