
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Fabrizio Luccio, Linda Pagli, "On a New Boolean Function with Applications," IEEE Transactions on Computers, vol. 48, no. 3, pp. 296310, March, 1999.  
BibTex  x  
@article{ 10.1109/12.754996, author = {Fabrizio Luccio and Linda Pagli}, title = {On a New Boolean Function with Applications}, journal ={IEEE Transactions on Computers}, volume = {48}, number = {3}, issn = {00189340}, year = {1999}, pages = {296310}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.754996}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On a New Boolean Function with Applications IS  3 SN  00189340 SP296 EP310 EPD  296310 A1  Fabrizio Luccio, A1  Linda Pagli, PY  1999 KW  Pseudocube KW  pseudoproduct KW  EXORfactor KW  Boolean function KW  algebraic expression KW  logical design. VL  48 JA  IEEE Transactions on Computers ER   
Abstract—Consider a hypercube of
[1] S.B. Akers, “Binary Decision Diagrams,” IEEE Trans. Computers, vol. 27, no. 6, pp. 509516, June 1978.
[2] R.A. Brualdi and H.J. Ryser,Combinatorial Matrix Theory. Cambridge: Cambridge Univ. Press, 1991.
[3] R.E. Bryant, "Symbolic Boolean Manipulation with Ordered BinaryDecision Diagrams," ACM Computing Surveys, vol., 24 no. 3, pp. 293318, 1992.
[4] O. Coudert, “Doing Two Level Logic Minimization 100 Times Faster,” Proc. ACMSIAM Symp. Discrete Algorithms, pp. 112121, San Francisco, 1995.
[5] M. Davio, J.P. Dechamps, and A. Thayse,Discrete and Switching Functions. New York: McGrawHill, 1978.
[6] M.R. Garey and D.S. Johnson,Computers and Intractability. San Francisco: Freeman, 1979.
[7] Z. Kohavi,Switching and Finite Automata Theory. New York: McGrawHill, 1970.
[8] H.C. Lai and S. Muroga, “Logic Networks with Minimum Number of NOR (NAND) Gates for Parity Functions of$n$Variables,” IEEE Trans. Computers, vol. 36, no. 2, pp. 157166, Feb. 1987.
[9] G. Lakuhani, “Minimization of Switching Functions for a MultiLevel EXOR Realization,” Proc. IFIP WG 10.5 Workshop Applications of the ReedMuller Expansion in Circuit Design, pp. 185190, 1995.
[10] F. Luccio and L. Pagli, “Normal Matrices, PseudoCubes and PseudoProducts,” Congressus Numerantium, vol. 127, pp. 3356, 1997.
[11] P.C. McGeer, J. Sanghavi, R.K. Brayton, and A.L. SangiovanniVincentelli, “ESPRESSOSIGNATURE: A New Exact Minimizer for Logic Functions,” IEEE Trans. VLSI, vol. 1, no. 4, pp. 432440, 1993.
[12] D.E. Muller, “Application of Boolean Algebra to Switching Circuit Design and to Error Detection,” IRE Trans. Electronic Computers, vol. 3, pp. 612, 1954.
[13] S. Muroga,Logic Design and Switching Theory. New York: Wiley, 1979.
[14] T. Sasao, “Logic Synthesis with EXOR Logic Gates,” Logic Synthesis and Optimization, T. Sasao, ed. Kluwer Academic, 1993.
[15] T. Sasao, "EXMIN2: A Simplification Algorithm for ExclusiveOR SumofProducts Expressions for MultipleValuedInput TwoValuedOutput Functions," IEEE Trans. ComputerAided Design of Integrated Circuits and Systems, vol. 12, no. 5, pp. 621632, May 1993.
[16] T. Sasao, “Input Variable Assignment and Output Phase Optimization of PLA's,” IEEE Trans. Computers, vol. 33, no. 10, pp. 879894, Oct. 1984.
[17] T. Sasao, “Representation of Logic Functions Using EXOR Operators,” Representation of Discrete Functions, T. Sasao and M. Fujita, eds. Kluwer Academic, 1996.
[18] A. Tran, “Graphical Method for the Convertion of Minterms to ReedMuller Coefficients and the Minimization of ExclusiveOR Switching Functions,” IEE Proc. Part E, vol. 134, pp. 9399, 1987.
[19] C.C. Tsai and M. MarekSadovska, “Generalized ReedMuller Forms as a Tool to Detect Symmetries,” IEEE Trans. Computers, vol. 45, no. 1, pp. 3340, Jan. 1996.
[20] C.C. Tsai and M. MarekSadovska, “Boolean Function Classification via Fixed Polarity ReedMuller Forms,” IEEE Trans. Computers, vol. 46, no. 2, pp. 173186, Feb. 1997.
[21] S. Yang,Logic Synthesis and Optimization Benchmarks, User Guide. Microelectronic Center of North Carolina, 1991. Benchmarks available at:ftp://ftp.mcnc.org/pub/benchmark/Benchmarkdirs LGSynth93/.
[22] K. Yano, Y. Sasaki, K. Rikino, and K. Seki, TopDown PassTransistor Logic Design IEEE J. SolidState Circuits, vol. 31, no. 6, pp. 792803, 1996.
[23] K. Yasuoka, “A Generation Method for ExorSumofProducts Expressions Using Shared Binary Decision Diagrams,” Logic Synthesis and Optimization, T. Saso, ed. Kluwer Academic, 1993.