摘要 |
An architectural concept for field programmable gate array circuits is presented based on a universal fabric of cells called look-up tables arranged in a direct, repeatable spatial grid. It is predicated upon an analogy between Boolean functions and cellular automata wherein an m-variable look-up table defines a universal cellular automata of neighborhood size m. Its unique features include universal implementation of Boolean functions, low interconnect demand, no specialized routing resources, high regularity (periodic structures), fault tolerance, and ease in testability.
|