Control Systems and Computers, N4, 2017, Article 4

Upr. sist. maš., 2017, Issue 4 (270), pp. 32-42.

UDC 519.718
 
Rytsar Bohdan Ye., Doctor Sc., Professor, Department of Radioelectronic Devices Systems, Institute of Telecommunications, Radioelectronics and Electronic Engineering, L’viv polytechnic National University, Ad.: Bandera srt., 12, L’viv, Ukraine, e-mail: bohdanrytsar@gmail.com

A Simple Minimization Method of the Variables Number in the Complete and Incomplete Logic System Functions. Part 1

A new minimization method of the variables number in complete and incomplete logic functions, based on the procedure of conjuncterms splitting is proposed. The advantages of the proposed method are illustrated by examples of determining nonessential variables in the functions, which are borrowed from the well-known publications.
 
 
Keywords: minimization of the variablesnumber, logic function, nonessential variable, conjuncterm, splitting procedure.
 
  1. Zakrevskij, A.D., Pottosin, Ju.V., Cheremisinova, L.D., 2007.”Logicheskie osnovy proektirovanija diskretnyh ustrojstv”, M.: Fizmatlit, pp. 269–277. (In Russian).
  2. Kambayashi, Y., 1979. “Logic design of programmable logic arrays”, IEEE Trans. on Computers, C-28, 9, pp. 609–617.
  3. Sasao, T., 2011.”Reduction of the Number of Variables”, Memory-Based Logic Synthesis, Springer Science+Business Media, pp. 119–135, www.springer.com/us/book/9781441981035
  4. Mishchenko, A., Files, C., Perkowski M. et al., 2000. “Implicit algorithm for multi-valued input support manipulation”, Proc. 4thIntl. Workshop on Boolean Problems, Sept. 2000, Freiberg, Germany.
  5. Sasao, T., 2000. “On the number of dependent variables for incompletely specified multiple-valued functions”, 30th Int. Symp. Multiple-Valued Logic, Portland, Oregon, U.S.A., May 23–25, pp. 91–97, http://dblp.uni-trier.de/db/conf/ismvl/ismvl2000.html#Sasao00
  6. Majewski, W., 1997. Uklady logiczne. Wybrane zagadnienia, Warszawa, WPW, 180 p.
  7. Sasao, T., 2008. “On the number of variables to represent sparse logic functions”, ICCAD-2008, San Jose, CA, USA, Nov. 10–13, pp. 45–51, http://alcom.ee.ntu.edu.tw/system/privatezone/meetingfile/200903100035361.pdf.
  8. Sasao, T., 2009. “On the number of LUTs to realize sparse logic functions”, Int.Workshop on Logic and Synthesis (IWLS-2009), Berkeley, CA, U.S.A., July 31 – Aug. 2, pp. 64–71, http://www.lsi-cad.comsasao/Papers/files/ IWLS2009_ sasao.pdf.
  9. Rytsar B. Reduktsiya nesuttyevykh zminnykh systemy bul’ovykh funktsiy, Visn. NU Radioelektronika i telekomunikatsiyi, 2001, N 428, P. 184–189. (In Ukrainian).
  10. Rytsar, B.Ye., 2004. Teoretyko-mnozhynni optymizatsiyni metody lohichnoho syntezu kombinatsiynykh merezh: Dys. … d.t.n., L’viv, 348 p. (In Ukrainian).
  11. Rytsar, B., Romanowski, P., Shvay, A., 2010. “Set-theoretical Constructions of Boolean Functions and theirs Applications in Logic Synthesis”, Fundamenta Informaticae, 99 (3), pp. 339–354.
Received  21.05.2017