Abstract
Similar as in the binary case, the optimization of polynomial representations of multiplevalued (MV) logic functions is possible by using different polarities for variables which leads to the fixed polarity polynomial expressions. There is few methods for calculation of coefficients in these expressions. In this paper, we define a tabular technique (TT) for calculation of fixed-polarity polynomial expressions for MV functions as a generalization of the corresponding methods for Fixed-polarity Reed-Muller (FPRM) expressions for switching functions. All useful features of tabular techniques for FPRMs, as for example, simplicity of involved opera- tions and high possibilities for parallelization of the calculation procedure, are preserved. The proposed method can be applied for Kronecker polynomial representation of MV functions.
The method permits to calculate the polynomial expression for a given function and specified polarity by starting from the expression for an arbitrary polarity. Moreover, it can be used for fixed-polarity expressions where an extended set of complements is allowed, as for example, in Reed-Muller-Fourier expressions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Almaini, A.E.A., McKenzie, L., “Tabular techniques for generating Kronecker expansion”, IEE Proc.Comput. Digit. Tech., Vol. 143, No. 4, July 1996, 205–212.
Almaini, A.E.A., Thompson, P., Hanson, D., “Tabular techniques for Reed-Muller logic”, Int. J. Electron., Vol 70, No.1, 1991, 23–34.
Drechsler, R., Hengster, H., Schäfer, H., Hartman, J., Becker, B., “Testability of 2-Level AND/EXOR Circuits”, in Journal of Electronic Testing, Theory and Application (JETTA), Vol.14, No. 3, June 1999, 173–192.
Drechsler, R, Becker, B., Binary Decision Diagrams — Theory and Implementation, Kluwer Academic Publishers, 1998.
Falkowski, B.J., Schäfer, Perkowski, M.A.,“A fast computer methods for the calculation of disjoint cubes for completely and incompletely specified Boolean functions”, in Proc. 33rd Midwest Symp. on circuits and Systems, Calgary, Canada, 1990, 1119–1122.
Falkowski, B. J., Perkowski, M.A., “An algorithm for the generation of disjoint cubes for completely and incompletely specified Boolean functions”, Int. J. Electronics, 1991, 70(3), 533–538.
Harking, B., Moraga, C., “Efficient derivation of Reed-Muller expansions in multiple-valued logic systems”, Proc. 22nd Int. Symp. on Multiple-valued Logic, 192, 436–441.
Sarabi, A., Perkowski, M.A., “Fast exact and quasy-minimal minimization of highly testable fixed polarity AND/XOR canonical networks”, Proc. Design Automation Conference, June 1992, 30–35.
Sasao, T., Besslich, P., “On the complexity of mod-2 sum PLAs”, IEEE Transactions on Computers, Vol. 21, 1990, 1183–1188.
Stanković, R.S., Drechsler, Rolf, “Circuit design from Kronecker Galois field decision diagrams for multiple-valued functions”, Int. Symp. on Multiple-valued Logic Antigonish, Nova Scotia, 1997.
Stanković, R.S., Moraga, C., “Reed-Muller-Fourier representations of multiple-valued functions”, in Recent Developments in Abstract Harmonic Analysis with Applications in Signal Processing, Nauka, Belgrade, 1996, 205–216.
Stanković, R.S., Janković, D., Moraga, C, “Reed-Muller-Fourier representations versus Galois field representations for four-valued logic functions”, Proc. 3rd Int. Workshop on Applications of the Reed-Muller Expansion in Circuit Design, September 19-20, 1997, Oxford, UK, pp. 269–278.
Tan, E.C., Yang, H., “Fast tabular technique for fixed-polarity Reed-Muller logic with inherent parallel processes”, Int. J. Electronics, Vol. 85, No.85, 1998, 511–520.
Tran, A., “Graphical method for the conversion of minterms to Reed-Muller coefficients and the minimization of EX-OR switching functions”, IEE Proc. Comput. Digit. Tech., Vol. 134, 1987, 93–99.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Janković, D., Stanković, R.S., Drechsler, R. (2002). Tabular Techniques for MV Logic. In: Sołdek, J., Pejaś, J. (eds) Advanced Computer Systems. The Springer International Series in Engineering and Computer Science, vol 664. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8530-9_35
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8530-9_35
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4635-7
Online ISBN: 978-1-4419-8530-9
eBook Packages: Springer Book Archive