Automatic synthesis on table lookup-based PGAs

Presents a synthesis method for table lookup-based PGAs. It uses three decomposition techniques followed by an area or speed oriented mapping. Among the three available alternatives, the lexicographical factorization is dedicated to cope with severe wiring problems. Results are given for a large set of benchmarks and compared with the best existing results available both in terms of the number of devices and the depth related to the critical path.<
>