
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Dragan Jankovi?, Radomir S. Stankovi?, Claudio Moraga, "Optimization of Polynomial Expressions by Using the Extended Dual Polarity," IEEE Transactions on Computers, vol. 58, no. 12, pp. 17101725, December, 2009.  
BibTex  x  
@article{ 10.1109/TC.2009.113, author = {Dragan Jankovi? and Radomir S. Stankovi? and Claudio Moraga}, title = {Optimization of Polynomial Expressions by Using the Extended Dual Polarity}, journal ={IEEE Transactions on Computers}, volume = {58}, number = {12}, issn = {00189340}, year = {2009}, pages = {17101725}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2009.113}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Optimization of Polynomial Expressions by Using the Extended Dual Polarity IS  12 SN  00189340 SP1710 EP1725 EPD  17101725 A1  Dragan Jankovi?, A1  Radomir S. Stankovi?, A1  Claudio Moraga, PY  2009 KW  Switching functions KW  multiplevalued functions KW  ReedMuller expressions KW  polynomial expressions KW  fixedpolarity expressions. VL  58 JA  IEEE Transactions on Computers ER   
[1] G.D. De Micheli, R. Brayton, and A. SangiovanniVincentelli, “Optimal State Assignment for Finite State Machines,” IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, vol. 4, no. 3, pp. 269284, July 1985.
[2] R. Drechsler, H. Hengster, H. Schaefer, J. Hartman, and B. Becker, “Testability of 2Level AND/EXOR Circuits,” J. Electronic Testing, Theory and Application, vol. 14, no. 3, pp. 173192, 1999.
[3] E. Dubrova, “MultipleValued Logic Synthesis and Optimization,” Logic Synthesis and Verification, S. Hassoun and T. Sasao, eds., pp.89114, Kluwer Academic Publishers, 2002.
[4] E. Dubrova and P. Farm, “A Conjunctive Canonical Expansion of MultipleValued Functions,” Proc. 32nd IEEE Int'l Symp. MultipleValued Logic, pp.1518, May 2002.
[5] E.V. Dubrova and J.C. Muzio, “Generalized ReedMuller Canonical Form for a MultipleValued Algebra,” MultipleValued Logic, vol. 1, pp. 6584, 1996.
[6] E. Dubrova and H. Sack, “Probabilistic Verification of MultipleValued Functions,” Proc. 30th Int'l Symp. MultipleValued Logic, pp. 2325, May 2000.
[7] B.J. Falkowski and F. Cheng, “Family of Fast Transforms over GF(3) Logic,” Proc. 33rd Int'l Symp. MultipleValued Logic, pp. 1619, May 2003.
[8] B.J. Falkowski and C.H. Chang, “Optimization of PartiallyMixedPolarity ReedMuller Expansions,” Proc. Int'l Symp. Circuits and Systems (ISCAS '99), vol. 1, pp. 383386, May/June 1999.
[9] B.J. Falkowski and S. Rahardja, “Efficient Computation of Quaternary Fixed Polarity ReedMuller Expansions,” IEE Proc. Computers and Digital Techniques, vol. 142, no. 5, pp. 345352, Sept. 1995.
[10] P. Farm, E. Dubrova, R.S. Stanković, and J. Astola, “Conjunctive Decomposition for MultipleValued Input BinaryValued Output Functions,” Proc. TISCP Workshop Spectral Methods and Multirate Signal Processing (SMMSP '02), pp. 227234, Sept. 2002.
[11] M. Gao, J.H. Jiang, Y. Jiang, Y. Li, S. Sinha, and R. Brayton, “MVSIS,” Proc. Int'l Workshop Logic Synthesis, pp. 138144, June 2001.
[12] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. N.Y. Freeman, 1979.
[13] D.H. Green, “Dual Forms of ReedMuller Expansions,” IEE Proc. Computers and Digital Techniques, vol. 141, no. 3, pp. 184192, 1994.
[14] A.M. Jabir, D. Pradhan, and J. Mathew, “GfXpress: A Technique for Synthesis and Optimization of GF($2^{m}$ ) Polynomials,” IEEE Trans. ComputerAided Design of Integrated Circuits and Systems, vol. 27, no. 4, pp. 698711, Apr. 2008.
[15] A.M. Jabir, D. Pradhan, and J. Mathew, “An Efficient Technique for Synthesis and Optimization of Polynomials in GF($2^{m}$ ),” Proc. IEEE Int'l Conf. Computer Aided Design, pp. 151157, Nov. 2006.
[16] D. Janković, “Tabular Technique for the Fixed Polarity Arithmetic Transform Calculation,” Proc. Electronics, Telecomm., Computers and Nuclear Eng. Conf. (ETRAN), 2003.
[17] D. Janković, R.S. Stanković, and R. Drechsler, “Cube Tabular Technique for Calculation of Fixed Polarity ReedMuller Expressions and Applications,“ Proc. Workshop Computational Intelligence and Informational Technologies, pp. 8188, June 2001.
[18] D. Janković, R.S. Stanković, and R. Drechsler, “Efficient Calculation of Fixed Polarity Polynomial Expressions for MultiValued Logic Function,” Proc. 32nd Int'l Symp. MultipleValued Logic, pp.7682, May 2002.
[19] D. Janković, R.S. Stanković, and C. Moraga, “Optimization of Kronecker Expressions Using the Extended Dual Polarity Property,” Proc. XXXVII Int'l Scientific Conf. Information, Comm. and Energy Systems and Technologies (ICEST), pp. 749752, 2002.
[20] D. Janković, R.S. Stanković, and C. Moraga, “Optimization of GF(4) Expressions Using the Extended Dual Polarity Property,” Proc. 33rd Int'l Symp. MultipleValued Logic, pp. 5056, May 2003.
[21] D. Janković, R.S. Stanković, and C. Moraga, “Optimization of Arithmetic Expressions Using the Dual Polarity Property,” Proc. First Balkan Conf. Informatics (BCI '03), pp. 402410, Nov. 2003.
[22] D. Janković, R.S. Stanković, and C. Moraga, ”Arithmetic Expressions Optimization Using Dual Polarity Property,” Serbian J. Electrical Eng., vol. 1, no. 1, pp. 7180, Nov. 2003.
[23] M.G. Karpovsky, R.S. Stanković, and C. Moraga, “Spectral Techniques in Binary and MultipleValued Switching Theory. A Review of Results in the Decade 19912000,” Proc. 31st Int'l Symp. MultipleValued Logic, pp. 4146, May 2001.
[24] J.C. Muzio and T.C. Wesselkamper, MultipleValued Switching Theory. Adam Hilger, 1986.
[25] D. Pradhan, “A Theory of Galois Switching Functions,” IEEE Trans. Computers, vol. 27, no. 3, pp. 239248, Mar. 1978.
[26] D. Pradhan, A. Singh, T. Rajaprabhu, and A.M. Jabir, “Switching Theory: A Uniform Framework for MultiLevel Verification,” Proc. 14th Int'l Workshop Logic and Synthesis, June 2005.
[27] S. Rahardja and B.J. Falkowski, “Efficient Algorithm to Calculate ReedMuller Expansions over $GF$ (4),” IEE Proc. Circuits, Devices and Systems, vol. 148, no. 6, pp. 289295, 2001.
[28] S.M. Reddy, “Easily Testable Realizations for Logic Functions,” IEEE Trans. Computers, vol. 21, no. 11, pp. 11831188, Nov. 1972.
[29] R. Rudel and A. SangiovanniVincentelli, “MultipleValued Minimization for PLA Optimization,” IEEE Trans. CAD/ICAS, vol. 5, no. 9, pp. 727750, Sept. 1987.
[30] A. Sarabi and M.A. Perkowski, “Fast Exact and QuasiMinimal Minimization of Highly Testable Fixed Polarity AND/XOR Canonical Networks,” Proc. 29th Design Automation Conf., pp.3035, June 1992.
[31] T. Sasao, “MultipleValued Logic and Optimization of Programmable Logic Arrays,” IEEE Trans. Computers, vol. 21, no. 4, pp. 7180, Apr. 1988.
[32] T. Sasao, “EXMIN—a Simplification Algorithm for ExclusiveorSumofProduct Expressions for MultipleValued Input TwoValued Output Functions,” Proc. 20th Int'l Symp. MultipleValued Logic, pp. 128135, May 1990.
[33] T. Sasao, “A Transformation of MultipleValued Input TwoValued Output Functions and Its Application to Simplification of ExclusiveorSumofProducts Expressions,” Proc. 21st Int'l Symp. MultipleValued Logic, pp. 270279, May 1991.
[34] T. Sasao, “Easily Testable Realizations for Generalized ReedMuller Expressions,” IEEE Trans. Computers, vol. 46, no. 6, pp.709716, June 1997.
[35] T. Sasao, Switching Theory for Logic Synthesis. Kluwer Academic Publishers, 1999.
[36] T. Sasao and J.T. Butler, “A Design Method for LookUp Table Type FPGA by PseudoKronecker Expansions,” Proc. 24th Int'l Symp. MultipleValued Logic, pp. 97104, May 1994.
[37] R.S. Stanković, Spectral Transform Decision Diagrams in Simple Questions and Simple Answers. Nauka, 1998.
[38] R.S. Stanković, D. Janković, and C. Moraga, “ReedMullerFourier versus Galois Field Representations of FourValued Logic Functions,” Proc. 28th Int'l Symp. MultipleValued Logic, pp. 186191, May 1998.
[39] R.S. Stanković and C. Moraga, “ReedMullerFourier Representations of MultipleValued Functions over Galois Fields of Prime Cardinalty,” U. Kebschull, E. Schubert, and W. Rosensteil, eds., Proc. IFIP WG 10.5 Workshop Applications of the ReedMuller Expansion in Circuit Design, pp. 115124, 1993.
[40] E.C. Tan and H. Yang, “Fast Tabular Technique for FixedPolarity ReedMuller Logic with Inherent Parallel Processes,” Int'l J. Electronics, vol. 85, no. 85, pp. 511520, 1998.
[41] E.C. Tan and H. Yang, “Optimization of FixedPolarity ReedMuller Circuits Using DualPolarity Property,” Circuits Systems Signal Process, vol. 19, no. 6, pp. 535548, 2000.
[42] C. Tsai and M. MarekSadowska, “Generalized ReedMuller Forms as a Tool to Detect Symmetries,” IEE Proc. Computers and Digital Techniques, vol. 141, no. 6, pp. 369374, Nov. 1994.
[43] C. Tsai and M. MarekSadowska, “Boolean Functions Classification via Fixed Polarity ReedMuller Forms,” IEEE Trans. Computers, vol. 46, no. 2, pp. 173186, Feb. 1997.
[44] C.S. Wallace, “A Suggestion for a Fast Multiplier,” IEEE Trans. Computers, vol. 13, no. 1, pp. 1417, Feb. 1964.