Abstract
New classes of Linearly Independent Ternary Arithmetic (LITA) transforms being the bases of ternary arithmetic polynomial expansions are introduced here. Recursive equations defining the LITA transforms and the corresponding butterfly diagrams are shown. Various properties and relations between introduced classes of new transforms are discussed. Computational costs to calculate LITA transforms and applications of corresponding polynomial expansions in logic design are also discussed.
Similar content being viewed by others
REFERENCES
Falkowski, B.J. and Rahardja, S., Family of Fast Linearly Independent Logic Transformations, IEEE Trans. Circuits Systems-II: Analog Digital Signal Processing, 1997, vol. 44, no. 8, pp. 646–655.
Perkowski, M.A., A Fundamental Theorem for EXOR Circuits, Proc. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, Kebschull, U., Schubert, E., and Rosenstiel,W., Eds., Hamburg, Germany, 1993, pp. 52–60.
Rahardja, S. and Falkowski, B.J., Fast Linearly Independent Arithmetic Expansions, IEEE Trans. Computers, 1999, vol. 48, no. 9, pp. 991–999.
Boole, G., The Laws of Thought, London: Macmillan, 1854.
Tosic, Z., PhD Dissertation, Yugoslavia: Univ. of Beograd, 1972.
Zhegalkin, I.I., On the Technique of Calculation the Sentences in Symbolic Logic, Mat. Sb., 1927, vol. 34, pp. 9–28.
Lechner, R., Harmonic Analysis of Switching Functions, in Recent Developments in Switching Theory, Mukhopadhyay, F., Ed., New York: Academic, 1971.
Muller, D.E., Applications of Boolean Algebra to Switching Circuit Design and to Error Detection, IRE Trans. Electronic Computers, 1954, vol. 3, pp. 6–12.
Reed, I.S., A Class of Multiple-error-correcting Codes and the Decoding Scheme, IRE Trans. Inf. Theory, 1954, vol. 4, pp. 38–49.
Karpovsky, M.G., Finite Orthogonal Series in Design of Digital Devices, New York: Wiley, 1976.
Puwar, S., Polynomial Representation of Spectral Coefficients, Electron. Lett., 1992, vol. 28, no. 15, pp. 1264–1265.
Calingaert, P., Switching Function Canonical Forms Based on Commutative and Associative Binary Operations, Trans. AIEE, 1961, vol. 52, pp. 804–814.
Davio, P., Deschamps, J.P., and Thayse, A., Discrete and Switching Functions, New York: McGraw-Hill, 1978.
Falkowski, B.J., Forward and Inverse Transformations between Haar Wavelet and Arithmetic Functions, Electron. Lett., 1998, vol. 34, no. 11, pp. 1084–1085.
Stankovic, R.S., A Note of the Relation between Reed-Muller Expansions and Walsh Transforms, IEEE Trans. Electromagnetic Compatibility, 1982, vol. 24, no. 1, pp. 68–70.
Stankovic, R.S., Stojic, M.R., and Stankovic, M.S., Recent Developments in Abstract Harmonic Analysis with Applications in Signal Processing, Belgrade: Science Publisher, 1996.
Kumar, S.K. and Breuer, M.A., Probabilistic Aspects of Boolean Switching Functions via a New Transform, J. ACM, 1981, vol. 28, pp. 502–520.
Parker, K.P. and McCluskey, E.J., Probabilistic Treatment of General Combinatorial Networks, IEEE Trans. Computers, 1975, vol. 24, pp. 668–670.
Stankovic, R.S., Some Remarks about Spectral Transform Interpretation of MTBDDs and EVBDDs, Proc. 1st IEEE/ACM Asia and South Pacific Design Automation Conference, Makuhari, Japan, 1995, pp. 385–390.
Aizenberg, N.N. and Trofimlyuk, O.T., Conjunctive Transformation of Discrete Signals and Their Applications to Testing and Detection of Monotonic Boolean Functions, Kibernetika, 1981, no. 1, pp. 138–139.
Falkowski, B.J. and Chang, C.H., Properties and Methods of Calculating Generalized Arithmetic and Adding Transforms, IEE Proc. Circuits, Devices Systems, 1997, vol. 144, no. 5, pp. 249–258.
Falkowski, B.J. and Chang, C.H., An Efficient Algorithm for the Calculation of Generalized Arithmetic and Adding Transforms from Disjoint Cubes of Boolean Functions, VLSI Design, 1999, vol. 9, no. 2, pp. 135–146.
Kukharev, G.A., Shmerko, V.P., and Zaitseva, E.N., Algoritmy i sistolicheskie protsessory dlya obrabotki mnogoznachnykh dannykh (Multiple-Valued Data Processing Algorithms and Systolic Processors), Minsk: Nauka i Tekhnika, 1990.
Kukharev, G.A., Shmerko, V.P., and Yanushkevich, S.N., Tekhnika parallel'noi obrabotki binarnykh dannykh na SBIS (Parallel Processing of Binary Data in VLSI), Minsk: Vysheishaya Shkola, 1991.
Shmerko, V.P., Synthesis of Arithmetic Forms of Boolean Functions Using the Fourier Transform, Avtom. Telemekh., 1989, no. 5, pp. 134–142.
Stankovic, R.S., Spectral Transform Decision Diagrams in Simple Questions and Simple Answers, Belgrade: Science Publisher, 1998.
Falkowski, B.J. and Chang, C.H., Mutual Conversions between Generalized Arithmetic Expansions and Free Binary Decision Diagrams, IEE Proc. Circuits, Devices Systems, 1998, vol. 145, no. 4, pp. 219–228.
Lai, Y.T., Pedram, M., and Vrudhula, S.B.K., EVBDD-based Algorithms for Integer Linear Programming, Spectral Transformation, and Functional Decomposition, IEEE Trans. Computer-Aided Design Integrated Circuits Systems, 1994, vol. 13, no. 8, pp. 959–975.
Moraga, C., Sasao, T., and Stankovic, R., A Unifying Approach to Edge-Valued and Arithmetic Transform Decision Diagrams, Avtom. Telemekh., 2002, no. 1, pp. 140–153.
Stankovic, R.S., Arithmetic Transform TDDs for Generation of Arithmetic Expressions, 1st Int. Workshop on Spectral Techniques and Logic Design for Future Digital Systems, Tampere, Finland, 2000, pp. 79–94.
Yanushkevich, S.N., Logic Differential Calculus in Multi-Valued Logic Design, Szczecin: Inst. of Computer Sci. and Inf. Syst., 1998.
Falkowski, B.J., A Note on the Polynomial Form of Boolean Functions and Related Topics, IEEE Trans. Computers, 1999, vol. 48, no. 8, pp. 860–864.
Falkowski, B.J., Shmerko, V.P., and Yanushkevich, S.N., Arithmetical Logic-Its Status and Achievements, Invited Paper, Proc. 4th Int. Conf. on Applications of Computer Systems, Szczecin, Poland, 1997, pp. 208-223.
Shmerko, V.P. and Mikhailov, S.V., Review of Publications in the Former Soviet Union on Spectral Methods of Logic Data Processing and Logic Differential Calculus, Proc. 5th Int. Workshop on Spectral Techniques, Beijing, China, 1994, pp. 48–54.
Artyukhov, V.L., Kondratev, V.N., and Shalyto, A.A., Generating Boolean Functions via Arithmetic Polynomials, Avtom. Telemekh., 1988, no. 4, pp. 138–147.
Malyugin, V.D., Switching Circuits Reliability, Avtom. Telemekh., 1964, no. 9.
Malyugin, V.D., Representation of Boolean Functions by Arithmetic Polynomials, Avtom. Telemekh., 1982, no. 4, pp. 84–93.
Malyugin, V.D., Realization of Corteges of Boolean Functions by Linear Arithmetic Polynomials, Avtom. Telemekh., 1984, no. 2, pp. 114–122.
Malyugin, V.D., Arithmetical Representations of Petri Nets, Avtom. Telemekh., 1987, no. 5, pp. 156–164.
Malyugin, V.D. and Sokolov, V.V., Intensive Logical Computation, Avtom. Telemekh., 1993, no. 4, pp. 160–167.
Malyugin, V.D., Parallel'nye logicheskie vychisleniya posredstvom arifmeticheskikh polinomov (Parallel Calculations by Means of Arithmetical Polynomials), Moscow: Nauka, 1997.
Kondratev, V.N. and Shalito, A.A., Realization of Systems of Boolean Functions by Linear Arithmetic Polynomials, Avtom. Telemekh., 1993, no. 3, pp. 135–151.
Dziurzanski, P., Malyugin, V., Shmerko, V., and Yanushkevich, S., Linear Models of Circuits Based on the Multivalued Components, Avtom. Telemekh., 2002, no. 6, pp. 99–119.
Strazdins, I., The Polynomial Algebra of Multivalued Logic, Algebra, Combinatorics Logic Computer Sci., 1983, vol. 42, pp. 777–785.
Antonenko, V.M., Ivanov, A.A., and Shmerko, V.P., Linear Arithmetic Forms of k-Valued Logic Functions and Their Implementation on Systolic Arrays, Avtom. Telemekh., 1995, no. 3, pp. 139–151.
Shmerko, V.P., Antonenko, V.M., and Trushkin, S.Y., Method to Synthesize Linear Arithmetical Polynomials of MVL-Functions, Proc. 5th Int. Workshop on Spectral Techniques, Beijing, China, 1994, pp. 55–58.
Stankovic, R.S., Stankovic, M., and Jankovic, D., Spectral Transforms in Switching Theory, Definitions and Calculations, Belgrade: Science Publisher, 1998.
Yanushkevich, S.N., Systolic Algorithms to Synthesize Arithmetical Polynomial Forms for k-Valued Logic Functions, Avtom. Telemekh., 1994, no. 12, pp. 128–141.
Poretski, P.S., On the Method for Solving Logical Equations and on the Inverse Methods for Mathematical Logic, Sobranie Protokolov Zasedanii Fiz. Mat., Kazan. Univ., 1884, vol. 2, pp. 161–330.
Postelov, D.A. and Tosic, Z., Polynomial Representation in Mulivalued Logic, in Synthesis of Discrete Automata and Controllers, Moscow: Nauka, 1986, pp. 139–146.
Falkowski, B.J. and Fu, C., Ternary Arithmetic Polynomial Expansions based on New Transforms, Proc. IEEE 36th Int. Symp. on Circuits and Systems, Bangkok, Thailand, 2003, vol. 4, pp. 564–567.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Falkowski, B.J., Cheng Fu Family of Ternary Arithmetic Polynomial Expansions Based on New Transforms. Automation and Remote Control 65, 857–870 (2004). https://doi.org/10.1023/B:AURC.0000030900.15286.61
Issue Date:
DOI: https://doi.org/10.1023/B:AURC.0000030900.15286.61