Advertisement

Convolution on Finite Groups and Fixed-Polarity Polynomial Expressions

  • Radomir S. Stanković
  • Jaakko T. Astola
  • Claudio Moraga
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5717)

Abstract

This paper discusses relationships among convolution matrices and fixed-polarity matrices for polynomial expressions of discrete functions on finite groups. Switching and multiple-valued functions are considered as particular examples of discrete functions on finite groups. It is shown that if the negative literals for variables are defined in terms of the shift operators on domain groups, then there is a relationship between the polarity matrices and convolution matrices. Therefore, the recursive structure of polarity matrices follows from the recursive structure of convolution matrices. This structure is determined by the assumed decomposition of the domain groups for the considered functions.

Keywords

Convolution Finite groups Polynomial expressions Spectral representations 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Almaini, A.E.A., Thomposin, P., Hanson, D.: Tabular techniques for Reed-Muller logic. Int. J. Electronics 70, 23–34 (1991)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Jabir, A.M., Pradhan, D., Mathew, J.: GfXpress: A technique for synthesis and optimization of GF(2m) polynomials. IEEE Trans. CAD 27(4), 698–711 (2008)CrossRefGoogle Scholar
  3. 3.
    Falkowski, B.J., Rahardja, S.: Efficient computation of quaternary fixed polarity Reed-Muller expansions. IEE Proc. Computers and Digital Techniques 142(5), 345–352 (1995)CrossRefGoogle Scholar
  4. 4.
    Janković, D., Stanković, R.S., Moraga, C.: Optimization of GF(4) expressions using the extended dual polarity property. In: Proc. 33rd Int. Symp. on Multiple-Valued Logic, Tokyo, Japan, pp. 50–56. IEEE Press, Los Alamitos (2003)Google Scholar
  5. 5.
    Malyugin, V.D.: Paralleled Calculations by Means of Arithmetic Polynomials. Physical and Mathematical Publishing Company, Russian Academy of Sciences, Moscow (1997) (in Russian)zbMATHGoogle Scholar
  6. 6.
    Stanković, R.S., Karpovsky, M.G.: Remarks on calculation of autocorrelation on finite dyadic groups by local transformations of decision diagrams. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2005. LNCS, vol. 3643, pp. 301–310. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Stanković, R.S., Moraga, C., Astola, J.T.: From Fourier expansions to arithmetic- Haar expressions on quaternion groups. Applicable Algebra in Engineering, Communication and Computing AAECC 12, 227–253 (2001)Google Scholar
  8. 8.
    Stanković, R.S., Moraga, C., Astola, J.T.: Derivatives for multiple-valued functions induced by Galois field and Reed-Muller-Fourier expressions. In: Proc. 34th Int. Symp. on Multiple-Valued Logic, Toronto, Canada, May 19-22, pp. 184–189 (2004)Google Scholar
  9. 9.
    Tan, E.C., Yang, H.: Optimization of Fixed-polarity Reed-Muller circuits using dual-polarity property. Circuits Systems Signal Process. 19(6), 535–548 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Yanushkevich, S.N., Miller, D.M., Shmerko, V.P., Stanković, R.S.: Decision Diagram Techniques for Micro- and Nanoelectronic Design Handbook. CRC Press, Taylor & Francis (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Radomir S. Stanković
    • 1
    • 2
  • Jaakko T. Astola
    • 1
    • 2
  • Claudio Moraga
    • 1
    • 2
  1. 1.Dept. of Computer Science, Faculty of Electronics, Niš, Serbia Dept. of Signal ProcessingTampere University of TechnologyTampereFinland
  2. 2.European Centre for Soft Computing, 33600 Mieres, Spain &, Technical University of DortmundDortmundGermany

Personalised recommendations