Post #1601326
2026-04-19 10:58 UTC
Any algo nerd here ?
I got some basic analog elements ( transistors, ... ) and a bunch of analog switches between them ( about 162 of them ).
Then I have a netlist representing a circuit I'd like implemented.
And the question is how do I get from the circuit netlist to a configuration of switches that implements that netlist.
If a configuration exists, I want to find it. Ideally find all of them so I can "rank" them. I can't blindly try all of them, 2^162 is ... big.
Replies (1)
-
@tnt@chaos.social 2026-04-19 11:00
At first I was thinking graph homomorphism, making a graph representing all available components and nets and switches, then one describing the connectivity I want and search for subgraphs. But because sometime you need to go through 2 or 3 switches, ATM I can't immediately thing of how that would map.