|Article title||LIBRARY IMPLEMENTATION OF MODULAR ARITHMETIC OPERATIONS, BASED ON LOGIC FUNCTIONS MINIMIZATION ALGORITHMS|
|Authors||V.M. Amerbaev, R.A. Solovyev, D.V. Telpukhov|
|Section||SECTION VI. COMPUTER COMPLEXES OF NEW GENERATION AND NEUROCOMPUTERS|
|Month, Year||07, 2013 @en|
|Abstract||The paper is devoted to the development of the library of modular arithmetic blocks for modular computing structures. It is proposed to implement adders and multipliers in the form of logical functions, minimized with the use of modern heuristic algorithms. This allows one to build effective modular units in terms of area and performance. In addition, this method is universal in terms of choice of moduli. Besides all, in conjunction with the proposed algorithm of hardware reduction, adequate values of space requirements for 5-6 bit moduli were achieved. The effectiveness of the proposed methods is verified experimentally.|
|Keywords||Modular computing structures; logic functions minimization; heuristic algorithms; Espresso.|
|References||1. McCluskey Jr., Edward J. Minimization of Boolean Functions // Bell Systems Technical Journal. – 1956. – Vol. 35. – P. 1417-1444.
2. Rudell, Richard L. Multiple-Valued Logic Minimization for PLA Synthesis // Research Report, Memorandum No. UCB/ERL M86-65 (Berkeley) 1986.
4. Omondi A., Premkumar B. Residue Number Systems: Theory and Implementation. London: Imperial College Press 2007. – 312 p.
5. Soderstrand M.A. A new hardware implementation of modulo adders for residue number systems // Proceedings, 26th Midwest Symposium on Circuits and Systems. – 1983. – P. 412-415.