-
1
-
-
0020847569
-
Efficient computer method for EXOR logic design
-
CDT
-
BESSLICH, PH. V., "Efficient Computer Method for EXOR Logic Design", Proc. IEE, Vol. 130, Part E, CDT, No. 6., pp. 203-206, 1983.
-
(1983)
Proc. IEE
, vol.130
, Issue.6
, pp. 203-206
-
-
Besslich, Ph.V.1
-
2
-
-
85067178745
-
An efficient algorithm for logic synthesis of mod-2 sums expressions
-
Paris, France, May, Proc. IEEE Compu. Soc. Press
-
BESSUCH, PH. V., and M. W. Riege, "An Efficient Algorithm for Logic Synthesis of Mod-2 Sums Expressions", EuroASIC, Paris, France, May 1991, Proc. IEEE Compu. Soc. Press.
-
(1991)
EuroASIC
-
-
Bessuch, Ph.V.1
Riege, M.W.2
-
3
-
-
0015586257
-
Minimization of ring-sum expansions of boolean functions
-
BIOUL, G., DAVIO, D., and DESCHAMPS J. P.. "Minimization of ring-sum expansions of Boolean functions", Philips Research Report, Vol. 28, pp. 17-36, 1973.
-
(1973)
Philips Research Report
, vol.28
, pp. 17-36
-
-
Bioul, G.1
Davio, D.2
Deschamps, J.P.3
-
4
-
-
85067180152
-
On the minimization of and-exor expressions
-
BRAND, D., and SASAO. T., "On the Minimization of And-Exor Expressions", 23 FTC, pp. 1-9, 1990.
-
(1990)
23 FTC
, pp. 1-9
-
-
Brand, D.1
Sasao, T.2
-
5
-
-
0001568326
-
Switching function canonical forms based on commutative and associative binary operations
-
January
-
CAUNGAERT, P., "Switching function canonical forms based on commutative and associative binary operations", AIEE Trans., Vol. 79, pp. 808-814, January 1961.
-
(1961)
AIEE Trans.
, vol.79
, pp. 808-814
-
-
Caungaert, P.1
-
6
-
-
0003507101
-
-
PhD. Dissert., Harvard Univ., Cambr., MA, Dec
-
COHN, M., "Switching Function Canonical Forms over Integer Fields", PhD. Dissert., Harvard Univ., Cambr., MA, Dec. 1960.
-
(1960)
Switching Function Canonical Forms over Integer Fields
-
-
Cohn, M.1
-
7
-
-
0000950864
-
Inconsistent canonical forms of switching functions
-
April
-
COHN, M., "Inconsistent canonical forms of switching functions", IRE Trans. Electron. Comput., Vol. EC-11, p. 284, April 1962.
-
(1962)
IRE Trans. Electron. Comput.
, vol.EC-11
, pp. 284
-
-
Cohn, M.1
-
9
-
-
85067173834
-
-
M. S. Thesis, Univ. of CA, Berkeley, Dec. 4, CA, 94720
-
CSANKY, L., "On the Generalized Reed-Muller Canonical Form of Boolean Functions", M. S. Thesis, Univ. of CA, Berkeley, Dec. 4, 1972, CA, 94720.
-
(1972)
On the Generalized Reed-muller Canonical Form of Boolean Functions
-
-
Csanky, L.1
-
10
-
-
85067211227
-
-
Nov. 15, Univ. of CA, Berkeley, CA 94720
-
CSANKY, L., "Topics for the Qualifying Examination", Nov. 15, 1973, Univ. of CA, Berkeley, CA 94720.
-
(1973)
Topics for the Qualifying Examination
-
-
Csanky, L.1
-
11
-
-
85067211936
-
Canonical restricted mixed-polarity exclusive sums of products and the efficient algorithm for their minimization
-
CSANKY, L., PERKOWSKI, M. A., and SCHAEFER, I., "Canonical Restricted Mixed-Polarity Exclusive Sums of Products and the Efficient Algorithm for their Minimization", PSU Report, 1991.
-
(1991)
PSU Report
-
-
Csanky, L.1
Perkowski, M.A.2
Schaefer, I.3
-
12
-
-
84941530793
-
Ring-sum expansions of boolean functions
-
Polyt. Inst. of Brooklyn. Apr. 13-15
-
DAVIO, M., "Ring-Sum Expansions of Boolean Functions", Proc. of the Symp. on Computers and Automata, Polyt. Inst. of Brooklyn. Apr. 13-15, pp. 411-418, 1971.
-
(1971)
Proc. of the Symp. on Computers and Automata
, pp. 411-418
-
-
Davio, M.1
-
13
-
-
0004255173
-
-
McGraw-Hill Book Co., Inc., New York
-
DAVIO, M., DESCHAMPS, J. P., and THAYSE, A., "Discrete and Switching Functions", McGraw-Hill Book Co., Inc., New York, 1978.
-
(1978)
Discrete and Switching Functions
-
-
Davio, M.1
Deschamps, J.P.2
Thayse, A.3
-
14
-
-
0347827640
-
FPGA devices require FPGA-specific synthesis tools
-
Nov.
-
DETJENS, E., "FPGA devices require FPGA-specific synthesis tools", Computer Design, p. 124, Nov. 1990.
-
(1990)
Computer Design
, pp. 124
-
-
Detjens, E.1
-
15
-
-
0001652787
-
On minimal modulo-2 sum of products for switching functions
-
October
-
EVEN, S., KOHAVI, I., and PAZ, A., "On minimal modulo-2 sum of products for switching functions", IEEE Trans. on Electron. Computers, pp. 671-674, October 1967.
-
(1967)
IEEE Trans. on Electron. Computers
, pp. 671-674
-
-
Even, S.1
Kohavi, I.2
Paz, A.3
-
16
-
-
0020781761
-
Exclusive-OR representations of boolean functions
-
July
-
FLEISHER, H., TAVEL, M., and YEAGER, J., "Exclusive-OR representations of Boolean functions", IBM J. Res. Develop., Vol. 27, pp. 412-416, July 1983.
-
(1983)
IBM J. Res. Develop.
, vol.27
, pp. 412-416
-
-
Fleisher, H.1
Tavel, M.2
Yeager, J.3
-
17
-
-
0023289113
-
A computer algorithm for minimizing reed-muller canonical forms
-
February
-
FLEISHER, H., TAVEL, M., and YEAGER, J., "A Computer Algorithm for Minimizing Reed-Muller Canonical Forms", IEEE Trans. on Computers, Vol. C-36, No. 2, February 1987.
-
(1987)
IEEE Trans. on Computers
, vol.C-36
, Issue.2
-
-
Fleisher, H.1
Tavel, M.2
Yeager, J.3
-
20
-
-
0003653784
-
-
Electronic Systems Engineering Series
-
GREEN, D., "Modern Logic Design", Electronic Systems Engineering Series, 1986.
-
(1986)
Modern Logic Design
-
-
Green, D.1
-
21
-
-
0026111177
-
Families of reed-muller canonical forms
-
Jan.
-
GREEN, D., "Families of Reed-Muller canonical forms", Int. J. Electronics, Vol. 70, No. 2, pp. 259-280, Jan. 1991.
-
(1991)
Int. J. Electronics
, vol.70
, Issue.2
, pp. 259-280
-
-
Green, D.1
-
22
-
-
0024136029
-
A fast algorithm to minimize multi-output mixed-polarity generalized reed-muller forms
-
June 12-June 15
-
HELLTWELL, M., and PERKOWSKI, M. A., "A Fast Algorithm to Minimize Multi-Output Mixed-Polarity Generalized Reed-Muller Forms", Proc. 25-th ACM/IEEE DAC, paper 28.2, pp. 427-432, June 12-June 15, 1988.
-
(1988)
Proc. 25-th ACM/IEEE DAC
, pp. 427-432
-
-
Helltwell, M.1
Perkowski, M.A.2
-
23
-
-
0016037294
-
A note on easily testable realizations for logical functions
-
KODANDAPANI, K. L., "A note on easily testable realizations for logical functions", IEEE Trans. Comp., Vol. C-23, pp. 332-333, 1974.
-
(1974)
IEEE Trans. Comp.
, vol.C-23
, pp. 332-333
-
-
Kodandapani, K.L.1
-
25
-
-
85067203921
-
-
Dept. Comp. Sci., Univ. of Victoria, CA, DCS-135-IR, July
-
LUI, P. K., and J. MUZIO, "Boolean Matrix Transforms for the Parity Spectrum and the Minimization of Modulo-2 Canonical Expansions", Dept. Comp. Sci., Univ. of Victoria, CA, DCS-135-IR, July 1990.
-
(1990)
Boolean Matrix Transforms for the Parity Spectrum and the Minimization of Modulo-2 Canonical Expansions
-
-
Lui, P.K.1
Muzio, J.2
-
26
-
-
0023315037
-
XOR PLDs simplify design of counters and other devices
-
MONOLTTIC MEMORIES, INC., May 28
-
MONOLTTIC MEMORIES, INC., "XOR PLDs simplify design of counters and other devices", EDN, May 28, 1987.
-
(1987)
EDN
-
-
-
27
-
-
84941440832
-
Minimization of ring-sum expansion of mixed polarity
-
Greensboro, Oct
-
MUKERJEE, M. R., "Minimization of Ring-Sum Expansion of Mixed Polarity", AMSE Symp. on Modeling and Simulation, Greensboro, Oct. 1990.
-
(1990)
AMSE Symp. on Modeling and Simulation
-
-
Mukerjee, M.R.1
-
28
-
-
0018432013
-
Minimization of modulo-2 sum of products
-
February
-
PAPAKONSTANTINOU, G., "Minimization of modulo-2 sum of products", IEEE Trans. on Computers., Vol. C-28, pp. 163-167, February 1979.
-
(1979)
IEEE Trans. on Computers.
, vol.C-28
, pp. 163-167
-
-
Papakonstantinou, G.1
-
29
-
-
0025671723
-
An exact algorithm to minimize mixed-radix exclusive sums of products for incompletely specified boolean functions
-
May
-
PERKOWSKI, M. A., and CHRZANOWSKA-JESKE, M., "An Exact Algorithm to Minimize Mixed-Radix Exclusive Sums of Products for Incompletely Specified Boolean Functions", Proc. Intern. Symp. on Circ. and Syst., May 1990.
-
(1990)
Proc. Intern. Symp. on Circ. and Syst.
-
-
Perkowski, M.A.1
Chrzanowska-Jeske, M.2
-
30
-
-
0025675355
-
Two learning methods for a tree-search combinatorial optimizer
-
Scottsdale, Arizona, March
-
PERKOWSKI, M. A., DYSKO, P., and FALKOWSKI, B. J., "Two Learning Methods for a Tree-Search Combinatorial Optimizer", Proc. of IEEE Intern. Phoenix Conf. on Comp. and Comm., Scottsdale, Arizona, March 1990.
-
(1990)
Proc. of IEEE Intern. Phoenix Conf. on Comp. and Comm.
-
-
Perkowski, M.A.1
Dysko, P.2
Falkowski, B.J.3
-
31
-
-
85067176479
-
-
PSU Report
-
PERKOWSKI, M. A., SCHAEFER, I., and CSANKY, L., "Logic Minimization of Regular Arrays with EXOR and NAND Gates", PSU Report, 1991.
-
(1991)
Logic Minimization of Regular Arrays with EXOR and NAND Gates
-
-
Perkowski, M.A.1
Schaefer, I.2
Csanky, L.3
-
33
-
-
0015434912
-
Easily testable realizations for logic functions
-
Nov.
-
REDDY, S. M., "Easily Testable Realizations for Logic Functions", IEEE Trans. on Comput., Vol. C-21, No. 11, pp. 1183-1188, Nov. 1972.
-
(1972)
IEEE Trans. on Comput.
, vol.C-21
, Issue.11
, pp. 1183-1188
-
-
Reddy, S.M.1
-
35
-
-
85067203697
-
On the complexity of MOD-2 sum PLA
-
FTS86-17, Nov. 17
-
SASAO, T.. and BESSLICH, P.. "On the Complexity of MOD-2 Sum PLA", Institute of Electronics and Communication Engineers of Japan, FTS86-17, pages 1-8, Nov. 17, 1986.
-
(1986)
Institute of Electronics and Communication Engineers of Japan
, pp. 1-8
-
-
Sasao, T.1
Besslich, P.2
-
36
-
-
0025596051
-
EXMIN: A simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued input two-valued output functions
-
May
-
SASAO. T., "EXMIN: A Simplification Algorithm for Exclusive-OR-Sum-of-Products Expressions for Multiple-Valued Input Two-Valued Output Functions", Proc. of 20th Int. Symp. on Multiple-Valued Logic, pp. 128-135, May 1990.
-
(1990)
Proc. of 20th Int. Symp. on Multiple-valued Logic
, pp. 128-135
-
-
Sasao, T.1
-
38
-
-
0025486986
-
An improved algorithm for the minimization of mixed polarity reed-muller representations
-
Sept.
-
SAUL, J. M., "An Improved Algorithm for the Minimization of Mixed Polarity Reed-Muller Representations", Proc. ICCD'90, pp. 372-375, Sept. 1990.
-
(1990)
Proc. ICCD'90
, pp. 372-375
-
-
Saul, J.M.1
|