Mirsalehi M, Gaylord T K
Appl Opt. 1990 Aug 10;29(23):3339-44. doi: 10.1364/AO.29.003339.
Direct implementations of digital functions by truth table look-up techniques are of increasing importance in both optical and electronic processing. A major issue in these techniques is the logical minimization of the Boolean algebraic expressions for the functions being implemented. For most cases of practical interest, these minimizations require extensive computer time. In this paper, analytic expressions are derived that provide complete information about the absolute minimum sum-of-products representations for binary addition, with and without an input carry, and binary subtraction, with and without an input borrow. These expressions are applicable to any word length.
通过真值表查找技术直接实现数字功能在光学和电子处理中都变得越来越重要。这些技术中的一个主要问题是对要实现的函数的布尔代数表达式进行逻辑最小化。对于大多数实际感兴趣的情况，这些最小化需要大量的计算机时间。在本文中，推导了分析表达式，这些表达式提供了关于带进位输入和不带进位输入的二进制加法以及带借位输入和不带借位输入的二进制减法的绝对最小积之和表示的完整信息。这些表达式适用于任何字长。
