|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
The Constrained-Input Problem
January 1975 (vol. 24 no. 1)
pp. 102-106
| ASCII Text | x | ||
| F.M. Brown, "The Constrained-Input Problem," IEEE Transactions on Computers, vol. 24, no. 1, pp. 102-106, January, 1975. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1975.224089, author = {F.M. Brown}, title = {The Constrained-Input Problem}, journal ={IEEE Transactions on Computers}, volume = {24}, number = {1}, issn = {0018-9340}, year = {1975}, pages = {102-106}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1975.224089}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - The Constrained-Input Problem IS - 1 SN - 0018-9340 SP102 EP106 EPD - 102-106 A1 - F.M. Brown, PY - 1975 KW - Boolean algebra KW - Boolean equations KW - functional decomposition KW - input constraints. VL - 24 JA - IEEE Transactions on Computers ER - | |||
Given a combinational output function f and an input constraint f = 0, there is a set G( f, f) of output functions equivalent to f with respect to f. A function belongs to G( f, f), that is, provided its evaluations agree with those of f for all argument combinations satisfying the constraint f = 0. We define the constrained-input problem as that of generating G( f, f), given f and f. A general solution for this problem is developed. Applications to the "don't-care" problem and to translator synthesis are discussed.
Index Terms:
Boolean algebra, Boolean equations, functional decomposition, input constraints.
Citation:
F.M. Brown, "The Constrained-Input Problem," IEEE Transactions on Computers, vol. 24, no. 1, pp. 102-106, Jan. 1975, doi:10.1109/T-C.1975.224089
Usage of this product signifies your acceptance of the Terms of Use.