K-feasible cut
Beginner
A way to cut out a piece of a circuit that needs only a few input signals, few enough to fit in one lookup table.
Novice
For one gate, a set of at most K signals that every path from the circuit’s inputs to that gate must pass through. The logic between the cut and the gate depends only on those K signals, so one K-input lookup table can replace all of it.
Expert
A cut C of node n with |C| ≤ K; the cone between C and n is a function of at most K inputs. Cuts are enumerated bottom-up by merging the fanins’ cut sets and dropping dominated cuts; LUT mapping picks one cut per mapped node.
Explained in From hardware code to bitstream (Architectures).
See also: Technology mapping, Logic depth.