Field-Programmable Gate Array (FPGA) technology allows for the creation of unique hardware implementations based on mass-produced chips. The process of project prototyping for such systems using Hardware Description Languages (HDLs) remains complex, even with modern tools. The comparison of HDL coding styles, for example, a behavioral case statement against a structural binary-tree decomposition, shows that the choice is capable of affecting post-implementation timing and area. The performed study, using the open-source yosys/nextpnr toolchain, shows that the validity of such a comparison is decided by the fabric domain. Logic that falls through to generic Look-Up Table (LUT) mapping is governed by the mapper’s heuristic fixed point rather than by source intent: on the crossbar, the behavioral and structural netlists become identical in cell composition; on the priority encoder, the verdict reverses; and on the barrel shifter, the LUT area collapses, so the comparison does not isolate the coding-style variable. It was measured that the keepₕierarchy attribute restores a meaningful comparison at ~17% LUT cost (N = 8) and provides a structural invariant to the ABC mapper variant, but the behavioral result is mapper-sensitive and the N = 4 verdict reverses under the legacy -noabc9 mapper (Cohen’s d from +2. 4 to −1. 6). By contrast, logic that involves a dedicated primitive before LUT mapping—an adder bound to the carry chain or a multiplier bound to a DSP block—yields source-meaningful verdicts that do not reverse with a mapper. Replication on a second fabric (Lattice iCE40) confirms that this behavior is fabric- rather than vendor-specific. The main contribution of this work is the proposed first fabric-domain characterization of synthesis canonicalization as a methodological hazard for cross-HDL FPGA studies on open-source toolchains, which identifies the two-phase synthesis mechanism that delimits it and supplies a decision rule (inspect post-synthesis composition) to identify whether a given comparison is susceptible.
Kulanov et al. (Wed,) studied this question.