Advertisement

Automation and Remote Control

, Volume 66, Issue 7, pp 1081–1100 | Cite as

Modular Forms of Systems of k-valued Functions of the Algebra of Logic

  • O. A. Fin’ko
Determinate Systems
  • 22 Downloads

Abstract

Methods of realization of the k-valued functions of the algebra of logic by the modular forms of arithmetic polynomials based on “weighing” by the numbers k i (i = 0, 1, 2, ...) were considered. The modular polynomial and matrix (number-theoretic) transformations were examined and extended to the case of systems of k-valued functions. A new principle of designing the modular form of one arithmetic polynomial to realize systems of k-valued functions in terms of the Chinese remainder theorem was proposed. The results obtained provide advantages in terms of complexity of the analytical description and realization of the k-valued functions.

Keywords

Mechanical Engineer System Theory Analytical Description Modular Form Chinese Remainder Theorem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. 1.
    Karpenko, A.S., Multivalued Logics, in Logika i komp’yuter (Logic and Computer), Moscow: Nauka, 1997, vol. 4.Google Scholar
  2. 2.
    Aslanova, N.Kh. and Faradzhev, R.G., On Arithmetic Representation of the Functions of Multi-valued Logic and Parallel Algorithm to Determine This Representation, Avtom. Telemekh., 1992, no. 2, pp. 120–131.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    Kukharev, G.A., Shmerko, V.P., and Zaitseva, E.N., Algoritmy i sistolicheskie protsessory dlya obrabotki mnogoznachnykh dannykh (Algorithms and Systolic Processors for Multi-valued Data), Minsk: Nauka i Tekhnika, 1990.Google Scholar
  5. 5.
    Toshich, Zh., Arithmetic Representations of Logic Functions, in Diskretnye avtomaty i seti svyazi (Discrete Automata and Communication Networks), Moscow: Nauka, 1970.Google Scholar
  6. 6.
    Strazdins, J., The Polynomial Arithmetic of Multivalued Logic, Algebra, Combinat. Logic Comput. Sci. 1986, vol. 42, pp. 777–785.Google Scholar
  7. 7.
    Fin’ko, O.A., Number-theoretic Transformation-based Logical Calculations, in Tr. II Mezhdunar. konf. po problemam upravleniya (MKPU II) (Proc. Second Int. Conf. on Control Problems), Moscow: Trapeznikov Inst. of Control Sciences, 2003, pp. 159–166.Google Scholar
  8. 8.
    Fin’ko, O.A., Realization of Systems of Large-scale Boolean Functions by the Methods of Modular Arithmetics, Avtom. Telemekh., 2004, no. 6, pp. 37–60.Google Scholar
  9. 9.
    Malyugin, V.D., Parallel’nye logicheskie vychisleniya posredstvom arifmeticheskikh polinomov (Parallel Logic Computations by Arithmetic Polynomials), Moscow: Nauka, 1997.Google Scholar
  10. 10.
    Shmerko, V.P., Design of the Arithmetic Forms of Boolean Functions Using the Fourier Transform, Avtom. Telemekh., 1989, no. 5, pp. 134–142.Google Scholar
  11. 11.
    Knuth, D.E., The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, Reading: Addison-Wesley, 1969. Translated under the title Iskusstvo programmirovaniya. Tom 2: Poluchislennye algoritmy, Moscow: Vil’yams, 2000.Google Scholar
  12. 12.
    Fin’ko, O.A., Polynomial Arithmetics of the Multi-valued Logic Functions, Izv. Vuzov, Priborostroenie, 2004, vol. 47, no.5, pp. 41–46.Google Scholar
  13. 13.
    Bukhshtab, A.A., Teoriya chisel (Theory of Numbers), Moscow: Prosveshchenie, 1966.Google Scholar
  14. 14.
    Fin’ko, O.A., Using Digital Signal Processing to Realize Intensive Logical Computations, in 6-ya Mezhdunar. konf. “Tsifrovaya obrabotka signalov i ee primenenie” (DSPA-2004) (Sixth Int. Conf. “Digital Signal Processing and its Application” (DSPA-2004)), Moscow: Radiotekhnika, 2004, vol. 1, pp. 265–268.Google Scholar
  15. 15.
    Amerbaev, V.M., Teoreticheskie osnovy mashinnoi arifmetiki (Theoretical Fundamentals of Computer Arithmetics), Alma-Ata: Nauka, 1976.Google Scholar

Copyright information

© MAIK “Nauka/Interperiodica” 2005

Authors and Affiliations

  • O. A. Fin’ko
    • 1
  1. 1.KrasnodarRussia

Personalised recommendations