Abstract
We describe an optimization method for combinational and sequential logic networks, with emphasis on scalability. The proposed resynthesis (a) is capable of substantial logic restructuring, (b) is customizable to solve a variety of optimization tasks, and (c) has reasonable runtime on industrial designs. The approach uses don't-cares computed for a window surrounding a node and can take into account external don't-cares (e.g., unreachable states). It uses a SAT solver for all aspects of Boolean manipulation: computing don't-cares for a node in the window, and deriving a new Boolean function of the node after resubstitution. Experimental results on 6-input LUT networks after a high effort synthesis show substantial reductions in area and delay. When applied to 20 large academic benchmarks, the LUT counts and logic levels are reduced by 45.0% and 12.2%, respectively. The longest runtime for synthesis and mapping is about two minutes. When applied to a set of 14 industrial benchmarks ranging up to 83K 6-LUTs, the LUT counts and logic levels are reduced by 11.8% and 16.5%, respectively. The longest runtime is about 30 minutes.
- Altera Corp. 2011. Altera Stratix IV FPGA family overview. http://www.altera.com/products/devices/stratix-fpgas/stratix-iv/overview/stxiv-overview.html.Google Scholar
- Berkeley Verification and Synthesis Research Group (BVSRG). 2011. ABC: A system for sequential synthesis and verification, release 80802. http://www.eecs.berkeley.edu/~alanmi/abc/.Google Scholar
- Betz, V., Rose, J., and Marquardt, A. 1999. Architecture and CAD for Deep-Submicron FPGAs. Kluwer Academic Publishers. Google Scholar
Digital Library
- Bjesse, P. and Claessen, K. 2000. SAT-Based verification without state space traversal. In Proceedings of the International Conference on Formal Methods in Computer-Aided Design (FMCAD'00). Lecture Notes in Computer Science, vol. 1954, Springer, 372--389. Google Scholar
Digital Library
- Case, M. L., Mishchenko, A., and Brayton, R. K. 2006. Inductively finding a reachable state space over-approximation. In Proceedings of the International Workshop on Logic and Synthesis (IWLS'06). 172--179. http://www.eecs.berkeley.edu/~alanmi/publications/2006/iwls06_inv.pdf.Google Scholar
- Case, M. L., Mishchenko, A., and Brayton, R. K. 2008. Cut-Based inductive invariant computation. In Proceedings of the International Workshop on Logic and Synthesis (IWLS'08). 253--258. http://www.eecs. berkeley.edu/~alanmi/publications/2008/iwls08_ind.pdf.Google Scholar
- Chang, K.-H., Markov, I. L., and Bertacco, V. 2007. Fixing design errors with counterexamples and resynthesis. In Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC'07). 944--949. Google Scholar
Digital Library
- Chen, K.-C. and Cong, J. 1992. Maximal reduction of lookup-table-based FPGAs. In Proceedings of the Design Automation and Test in Europe Conference (DATE'92). 224--229. Google Scholar
Digital Library
- Chen, D. and Cong, J. 2004. DAOmap: A depth-optimal area optimization mapping algorithm for FPGA designs. In Proceedings of the International Conference on Computer-Aided Design (ICCAD'04). 752--757. Google Scholar
Digital Library
- Cong, J., Lin, Y., and Long, W. 2002. SPFD-Based global rewiring. In Proceedings of the International Symposium on Field Programmable Gate Arrays (FPGA'02). 77--84. Google Scholar
Digital Library
- Een, E. and Sörensson, N. 2003. An extensible SAT-solver. In Proceedings of the SAT'03 Conference. http://www.cs.chalmers.se/Cs/Research/FormalMethods/MiniSat/.Google Scholar
- Goldberg, E. and Novikov, Y. 2003. Verification of proofs of unsatisfiability for CNF formulas. In Proceedings of the Design Automation and Test in Europe Conference (DATE'03). 886--891. Google Scholar
Digital Library
- Kravets, V. N. and Kudva, P. 2004. Implicit enumeration of structural changes in circuit Optimization. In Proceedings of the Design Automation Conference (DAC'04). 438--441. Google Scholar
Digital Library
- Lee, C.-C., Jiang, J.-H. R., Huang, C.-Y., and Mishchenko, A. 2007. Scalable exploration of functional dependency by interpolation and incremental SAT solving. In Proceedings of the International Conference on Computer Aided Design (ICCAD'07). 227--233. http://www.eecs.berkeley.edu/~alanmi/publications/2007/iccad07_fd.pdf. Google Scholar
Digital Library
- McMillan, K. L. 2003. Interpolation and SAT-based model checking. In Proceedings of the International Conference on Computer-Aided Verification (CAV'03). Lecture Notes in Computer Science, vol. 2725, Springer, 1--13.Google Scholar
Cross Ref
- McMillan, K. 2005. Don't-Care computation using k-clause approximation. In Proceedings of the International Workshop on Logic and Synthesis (IWLS'05). 153--160.Google Scholar
- Mishchenko, A., Steinbach, B., and Perkowski, M. A. 2001. An algorithm for bi-decomposition of logic functions. In Proceedings of the Design Automation Conference (DAC'01). 103--108. Google Scholar
Digital Library
- Mishchenko, A. and Brayton, R. 2005. SAT-Based complete don't-care computation for network optimization. In Proceedings of the Design Automation and Test in Europe Conference (DATE'05). 418--423. http://www.eecs.berkeley.edu/~alanmi/publications/2005/date05_satdc.pdf. Google Scholar
Digital Library
- Mishchenko, A. and Brayton, R. 2006. Scalable logic synthesis using a simple circuit structure. In Proceedings of the International Workshop on Logic and Synthesis (IWLS'06). 15--22. http://www.eecs. berkeley.edu/~alanmi/publications/2006/iwls06_sls.pdf.Google Scholar
- Mishchenko, A., Chatterjee, S., and Brayton, R. 2006a. DAG-Aware AIG rewriting: A fresh look at combinational logic synthesis. In Proceedings of the Design Automation Conference (DAC'06). 532--536. http://www.eecs.berkeley.edu/~alanmi/publications/2006/dac06_rwr.pdf. Google Scholar
Digital Library
- Mishchenko, A., Zhang, J. S., Sinha, S., Burch, J. R., Brayton, R., and Chrzanowska-Jeske, M. 2006b. Using simulation and satisfiability to compute flexibilities in Boolean networks. IEEE Trans. Comput. Aid. Des. 25, 5, 743--755. http://www.eecs.berkeley.edu/~alanmi/publications/2005/tcad05_s&s.pdf. Google Scholar
Digital Library
- Mishchenko, A., Chatterjee, S., Brayton, R., and Een, E. 2006c. Improvements to combinational equivalence checking. In Proceedings of the International Conference on Computer-Aided Design (ICCAD'06). 836--843. http://www.eecs.berkeley.edu/~alanmi/publications/2006/iccad06_cec.pdf. Google Scholar
Digital Library
- Mishchenko, A., Chatterjee, S., and Brayton, R. 2007a. Improvements to technology mapping for LUT-based FPGAs. IEEE Trans. Comput. Aid. Des. 26, 2, 240--253. http://www.eecs.berkeley.edu/~alanmi/publications/2006/tcad06_map.pdf. Google Scholar
Digital Library
- Mishchenko, A., Cho, S., Chatterjee, S., and Brayton, R. 2007b. Combinational and sequential mapping with priority cuts. In Proceedings of the International Conference on Computer-Aided Design (ICCAD'07). http://www.eecs.berkeley.edu/~alanmi/publications/2007/iccad07_map.pdf. Google Scholar
Digital Library
- Mishchenko, A., Brayton, R., and Chatterjee, S. 2008a. Boolean factoring and decomposition of logic networks. In Proceedings of the International Conference on Computer-Aided Design (ICCAD'08). 38--44. http://www.eecs.berkeley.edu/~alanmi/publications/2008/iccad08_lp.pdf. Google Scholar
Digital Library
- Mishchenko, A., Brayton, R., Jiang, J.-H. R., and Jang, S. 2009. Scalable don't care based logic optimization and resynthesis. In Proceedings of the International Symposium on Field Programmable Gate Arrays (FPGA'09). 151--160. http://www.eecs.berkeley.edu/~alanmi/publications/2009/fpga09_mfs.pdf. Google Scholar
Digital Library
- Mishchenko, A., Case, M. L., Brayton, R., and Jang, S. 2008b. Scalable and scalably-verifiable sequential synthesis. In Proceedings of the International Conference on Computer-Aided Design (ICCAD'08). 234--241. Google Scholar
Digital Library
- Muroga, S., Kambayashi, Y., Lai, H. C., and Culliney, J. N. 1989. The transduction method- Design of logic networks based on permissible functions. IEEE Trans. Comput. 38, 10, 1404--1424. Google Scholar
Digital Library
- Pan, P. and Lin, C.-C. 1998. A new retiming-based technology mapping algorithm for LUT- based FPGAs. In Proceedings of the International Symposium on Field Programmable Gate Arrays (FPGA'98). 35--42. Google Scholar
Digital Library
- Plaza, S., Chang, K.-H., Markov, I. L., and Bertacco, V. 2007. Node mergers in the presence of don't cares. In Proceedings of the Asia South Pacific Design Automation Conference (ASP-DAC'07). 414--419. Google Scholar
Digital Library
- Saluja, N. and Khatri, S. P. 2004. A robust algorithm for approximate compatible observability don't care (CODC) computation. In Proceedings of the Design Automation Conference (DAC'04). 422--427. Google Scholar
Digital Library
- Savoj, H. 1992. Don't cares in multi-level network optimization. Ph.D. dissertation, University of California, Berkeley. Google Scholar
Digital Library
- Sentovich, E., Singh, K. J., Lavagno, L., Moon, C., Murgai, R., et al. 1992. SIS: A system for sequential circuit synthesis. Tech. rep. UCB/ERI, M92/41, ERL, Department of EECS, University of California, Berkeley.Google Scholar
- Xilinx Corp. 2011. Xilinx Virtex-5 product table. http://www.xilinx.com/products/silicon_solutions/fpgas/virtex/virtex5/v5product_table.pdf.Google Scholar
- Yang, Y.-S., Sinha, S., Veneris, A., and Brayton, R. 2007. Automating logic rectification by approximate SPFDs. In Proceedings of the Asia South Pacific Design Automation Conference (ASP-DAC'07). Google Scholar
Digital Library
- Zhu, Q., Kitchen, N., Kuehlmann, A., and Sangiovanni-Vincentelli, A. L. 2006. SAT sweeping with local observability don't-cares. In Proceedings of the Design Automation Conference (DAC'06). 229--234. Google Scholar
Digital Library
Index Terms
Scalable don't-care-based logic optimization and resynthesis
Recommendations
Scalable don't-care-based logic optimization and resynthesis
FPGA '09: Proceedings of the ACM/SIGDA international symposium on Field programmable gate arraysWe describe an optimization method for combinational and sequential logic networks, with emphasis on scalability and the scope of optimization. The proposed resynthesis (a) is capable of substantial logic restructuring, (b) is customizable to solve a ...
Technology Mapping of Speed-Independent Circuits Based on Combinational Decomposition and Resynthesis
EDTC '97: Proceedings of the 1997 European conference on Design and TestThis paper presents a solution to the problem of sequential multi-level logic synthesis of asynchronous speed-independent circuits. The starting point is a technology-independent speed-independent circuit obtained using, e.g., the monotonous cover ...
FPGA area reduction by multi-output function based sequential resynthesis
DAC '08: Proceedings of the 45th annual Design Automation ConferenceWe propose a new resynthesis algorithm for FPGA area reduction. In contrast to existing resynthesis techniques, which consider only single-output Boolean functions and the combinational portion of a circuit, we consider multi-output functions and ...






Comments