Switching functions constructed by Galois extension fields
作者： Iwaro Takahashi
DOI: 10.1016/S0019-9958(81)90629-X
关键词:
摘要: Every digital information processing is essentially represented by a set n functions of m variables on {0, 1}. We propose method to reduce such one polynomial variable GF (2 N ) (extension field over (2)). Such polynomials have remarkable properties based Frobenius transforms, which are serve for effective designs and productions switching circuits.
elsevier.com
sci-hub.se 参考文章(7)
R. C. Mullin, Ian F. Blake, The mathematical theory of coding ,(2014)
Benjauthrit, Reed, On the Fundamental Structure of Galois Switching Functions IEEE Transactions on Computers. ,vol. 27, pp. 757- 762 ,(1978) , 10.1109/TC.1978.1675185
Boonsieng Benjauthrit, Irving S. Reed, Galois Switching Functions and Their Applications IEEE Transactions on Computers. ,vol. 25, pp. 78- 86 ,(1976) , 10.1109/TC.1976.5009207
D.K. Pradhan, A.M. Patel, Reed-Muller Like Canonic Forms for Multivalued Functions IEEE Transactions on Computers. ,vol. 24, pp. 206- 210 ,(1975) , 10.1109/T-C.1975.224186
Thomas C. Bartee, David I. Schneider, Computation with finite fields Information & Computation. ,vol. 6, pp. 79- 98 ,(1963) , 10.1016/S0019-9958(63)90129-3
A. Mukhopadhyay, G. Schmitz, Minimization of Exclusive or and Logical Equivalence Switching Circuits IEEE Transactions on Computers. ,vol. C-19, pp. 132- 140 ,(1970) , 10.1109/T-C.1970.222878
K.S. Menger, A Transform for Logic Networks IEEE Transactions on Computers. ,vol. 18, pp. 241- 250 ,(1969) , 10.1109/T-C.1969.222637