Comments on: Using Perl to map FPGA pins from a board design to UCF pin constraints https://billauer.se/blog/2009/03/perl-script-netlist-ucf-orcad-schematic/ Anything I found worthy to write down. Thu, 26 Mar 2026 13:15:15 +0000 hourly 1 http://wordpress.org/?v=3.1.2 By: eli https://billauer.se/blog/2009/03/perl-script-netlist-ucf-orcad-schematic/comment-page-1/#comment-885 eli Tue, 30 Jul 2013 16:56:13 +0000 https://billauer.se/blog/?p=72#comment-885 Hi, I'm afraid I can't offer a piece of generic advice here. Having written a script or two of that sort, it boils down to munching the data in a way that is specific to your project. It's just a lot of dirty hacking, unfortunately. Hi,

I’m afraid I can’t offer a piece of generic advice here. Having written a script or two of that sort, it boils down to munching the data in a way that is specific to your project.

It’s just a lot of dirty hacking, unfortunately.

]]> By: Anurag Gupta https://billauer.se/blog/2009/03/perl-script-netlist-ucf-orcad-schematic/comment-page-1/#comment-884 Anurag Gupta Tue, 30 Jul 2013 16:26:45 +0000 https://billauer.se/blog/?p=72#comment-884 Hi, I am working on a similar problem and would appreciate if you could please help me out. I have 4 netlists(die, interposer, substrate and test baord) and I want to use perl to check the daisy chain connectivity. That is if I provide a test-in file that has starting pins for all daisy chain(from the test board), my output file should have all the connected points across all 4 tiers with the last point being a pin on the test board. Could you please suggest an algorithm/approach to tackle this challenging problem?I would be really grateful. Thank You Anurag Hi,

I am working on a similar problem and would appreciate if you could please help me out.

I have 4 netlists(die, interposer, substrate and test baord) and I want to use perl to check the daisy chain connectivity. That is if I provide a test-in file that has starting pins for all daisy chain(from the test board), my output file should have all the connected points across all 4 tiers with the last point being a pin on the test board.
Could you please suggest an algorithm/approach to tackle this challenging problem?I would be really grateful.

Thank You
Anurag

]]>