Module place 

Non-ideality-aware placement — operand adjacency as a matching resource.

The Pelgrom distance gradient makes a tile’s gain error grow with its operand separation, so placement is not cosmetic: a sensitivity-blind scatter of a deep chain accumulates distance-gain error the budget must then carry. The aware placer greedily seats each tile at the free site minimizing pitch distance to its operand tiles (deterministic tie-break: row-major). place_blind is the deliberate straw man — maximum-stride scatter — kept public so the anti-vacuity lock can prove the cost function earns its keep.

Structs

AnalogPlacement

Per-cell site assignment on the target’s tile array.

Functions

place_analog

Greedy operand-adjacent placement: seat cells in SSA order, each at the free site with the smallest total pitch distance to its already-placed operands (row-major tie-break — deterministic, reproducible).

place_blind

The deliberate straw man: maximum-stride scatter (successive cells thrown to opposite corners), used by the anti-vacuity lock to prove aware placement pays.