메뉴 건너뛰기




Volumn 1, Issue , 1992, Pages 17-20

Canonical Restricted mixed-polarity exclusive sums of products

Author keywords

[No Author keywords available]

Indexed keywords

NETWORKS (CIRCUITS);

EID: 33747741998     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCAS.1992.230025     Document Type: Conference Paper
Times cited : (3)

References (40)
  • 1
    • 0020847569 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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
  • 7
    • 0000950864 scopus 로고
    • 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
  • 11
    • 85067211936 scopus 로고
    • 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 scopus 로고
    • 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
  • 14
    • 0347827640 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • Electronic Systems Engineering Series
    • GREEN, D., "Modern Logic Design", Electronic Systems Engineering Series, 1986.
    • (1986) Modern Logic Design
    • Green, D.1
  • 21
    • 0026111177 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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
  • 26
    • 0023315037 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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
  • 33
    • 0015434912 scopus 로고
    • 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
  • 36
    • 0025596051 scopus 로고
    • 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 scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.