布林關係可以用來表達兩域之間的多對多映射。
在邏輯化簡時考量布林關係可以利用邏輯電路中潛在的彈性最佳化電路。
在本文中，我們提出了考量布林關係邏輯最佳化的方法。
我們的方法會找出適合的子電路，並透過布林關係改變區域性的電路功能同時進行最佳化，而不改變原本電路整體功能。
我們在MCNC的電路上進行實驗，這些測試電路已經沒辦法透過ABC中的resyn2最佳化。
實驗結果顯示，透過我們的方法，已經高度優化電路中的節點個數可以進一步地降低。
此外，當我們的方法跟ABC 中的resyn2輪流重複執行的話，平均可以減少6\%的電路節點．

Boolean Relation (BR) is a many-to-many mapping between two domains. Logic optimization considering BR can exploit the potential flexibility existed in logic networks to minimize the circuits. In this paper, we present a logic optimization approach considering BR. The approach identifies a proper sub-circuit and locally changes its functionality by solving the corresponding BR in the sub-circuit without altering the overall functionality of the circuit. We conducted experiments on a set of MCNC benchmarks that cannot be further optimized by the resyn2 script in ABC. The experimental results show that the node counts of the highly optimized benchmarks can be further reduced. Additionally, when we apply our approach followed by the resyn2 script repeatedly, we can obtain 6\% improvements in average.

中文摘要 i
Abstract ii
Acknowledgement iii
Contents iv
List of Tables vi
List of Figures vii 1
Introduction 1
2 A motivational example 4
3 Preliminaries 6
3.1 BooleanRelation ............................. 6
3.2 BRSolving ................................ 6
3.3 Many-to-oneBooleanfunction...................... 7
4 Algorithm 8
4.1 ExtractingFlexibility........................... 8
4.2 BuildingBooleanRelation ........................ 12
4.3 SolvingBooleanRelation......................... 14
5 Experimental results 18
6 Conclusion 21

[1] D. Baneres, J. Cortadella, and M. kishinevsky, “A recursive paradigm to solve boolean relations,” in Proc. DAC, pp. 416-421, June 2004.
[2] Berkeley Logic Synthesis and Verification Group, “ABC: a system for sequential synthesis and verification,” Available: https://people.eecs.berkeley.edu/∼alanmi/abc/.
[3] R. Brayton and F. Somenzi. “An exact minimizer for Boolean relations,” in Proc. ICCAD, pp. 316-319, 1989.
[4] Y. C. Chen, and C. Y. Wang, “Fast node merging with don’t cares using logic implications,” in Proc. TCAD, vol. 29, no. 11, pp. 1827–1832, Nov. 2010
[5] O. Coudert, J. Madre, and H. Fraisse, “A new viewpoint on two-level logic minimization,” in Proc. DAC, pp. 625-630, June 1993.
[6] A. Ghosh, S. Devadas, and A. Newton, “Heuristic minimization of boolean relations using testing techniques.” in Proc. TCAD, 1990.
[7] S. Jeong, and F. Somenzi, “A new algorithm for the binate covering problem and its application to the minimization of Boolean relations,” in Proc. ICCAD, pp. 417-420, 1992.
[8] E. L. Lawler, “An approach to multilevel boolean minimization,” Journal of the ACM, 1964.
[9] B. Lin and F. Somenzi. “Minimization of symbolic relations,” in Proc. ICCAD, pp. 88-91, 1990.
[10] E. J. McCluskey, “Minimization of boolean functions,” Bell Syst. tech J., vol. 35, no. 5, pp. 1417-1444, Nov. 1956.
[11] P. McGeer, J. Sanghavi, and R. K. Brayton, “Espresso-signature: A new exact minimizer for logic functions,” in Proc. TVLSI, pp. 618-624, 1993.
[12] A. Mishchenko, and R. K. Brayton, “Simplification of non-deterministic multi- valued networks,” in Proc. ICCAD, November, 2002.
[13] A. Mishchenko, and R. K. Brayton, “A theory of non-deterministic networks,” in Proc. TCAD, June, 2006.
[14] W.Quine, “The problem of simplifying truth functions,” American Mathemat- ical Monthly, vol. 59, no. 8, pp. 521-531, 1952.
[15] H. Savoj, “Improvements in technology independent optimization of logic cir- cuits,” Proc. of IWLS’97.
[16] H. Savoj, and R. K. Brayton, “The use of observability and external don’t-care for the simplification of multi-level networks,” Proc. DAC, pp. 291-301, 1990.
[17] Y.Watanabe, and R. K. Brayton, “Heuristic minimization of multi-valued rela- tions,” in Proc. TCAD, pp. 1458-1472, Oct. 1993.
[18] S. Yang, “Logic synthesis and optimization benchmarks user guide: Version 3.0,” Microelectronics Center of North Carolina, 1991.