
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A.A. Malik, R.K. Brayton, A.R. Newton, A.L. SangiovanniVincentelli, "TwoLevel Minimization of Multivalued Functions with Large Offsets," IEEE Transactions on Computers, vol. 42, no. 11, pp. 13251342, November, 1993.  
BibTex  x  
@article{ 10.1109/12.247837, author = {A.A. Malik and R.K. Brayton and A.R. Newton and A.L. SangiovanniVincentelli}, title = {TwoLevel Minimization of Multivalued Functions with Large Offsets}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {11}, issn = {00189340}, year = {1993}, pages = {13251342}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.247837}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  TwoLevel Minimization of Multivalued Functions with Large Offsets IS  11 SN  00189340 SP1325 EP1342 EPD  13251342 A1  A.A. Malik, A1  R.K. Brayton, A1  A.R. Newton, A1  A.L. SangiovanniVincentelli, PY  1993 KW  twolevel minimization; multivalued functions; large offsets; reduced offsets; logic functions; multivalued reduced offsets; logic design; manyvalued logics; minimisation of switching nets. VL  42 JA  IEEE Transactions on Computers ER   
Extends the theory of reduced offsets to logic functions with multivalued inputs. The authors show that the use of multivalued reduced offsets provides the same flexibility that is available with the use of the offset. Offsetbased minimization of multivalued functions with large offsets often takes long computation time and requires very large memory and sometimes is not possible within reasonable time and memory. Such functions can be minimized effectively using reduced offsets.
[1] D. W. Brown, "A statemachine synthesizerSMS," inProc. 18th Design Automation Conf., pp. 301304, Nashville, June 1981.
[2] R. Brayton, G. Hachtel, C. McMullen, and A. SangioVincentelli,Logic Minimization Algorithms for VLSI Synthesis. Boston, MA: Kluwer Academic, 1984.
[3] S. J. Hong, R. G. Cain, and D. L. Ostapko, "MINI: A heuristic approach for logic minimization,"IBM J. Res. Dev., vol. 18, pp. 443458, Sept. 1974.
[4] A. A. Malik, R. Brayton, A. R. Newton, and A. SangiovanniVincentelli, "A modified approach to twolevel minimization," inProc. Int. Conf. ComputerAided Design, Santa Clara, CA, Nov. 1988, pp. 106109.
[5] A. A. Malik, R. Brayton, A. R. Newton, and A. SangiovanniVincentelli, "Reduced offsets for minimization of binaryvalued functions,"IEEE Trans. ComputerAided Design, vol. 10, pp. 413426, Apr. 1991.
[6] T. Sasao, "An application of multiplevalued logic to a design of programmable logic arrays," inProc. 8th Int. Symp. Multiple Valued Logic, 1978.
[7] R. L. Rudell, "Multiplevalued logic minimization for PLA/synthesis," Electron. Res. Lab., College of Engineering, Univ. of California, Berkeley, Tech. Rep. M86/65, 1986.
[8] G. De Micheliet al., "Optimal state assignment for finite state machines,"IEEE Trans. Comput.Aided Design, vol. CAD4, pp. 269285, July 1985.
[9] A. A. Malik, "Optimization of primitive gate networks using multiple output twolevel minimization," inProc. 29th Design Automation Conf., Anaheim, CA, June 1992, pp. 106109.