Skip to main content
SpringerLink
Log in

Fibonacci Arithmetic Expressions

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

In this paper, we extend the arithmetic (AR) expressions for functions on finite dyadic groups to functions used in Fibonacci interconnection topologies. We have introduced the Fibonacci-Arithmetic (FibAR) expressions for representation of these functions. We discussed the optimization of FibARs with respect to the number of non-zero coefficients through the Fixed-Polarity FibARs defined by using different polarities for the Fibonacci variables. In this way, we provide a base to extend the application of ARs and related powerful CAD design tools for switching functions to functions in Fibonacci interconnection topologies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Komamiya, Y., Theory of Relay Networks for the Transformation between the Decimal and Binary System, Bull. of E.T.L., 1951, vol. 15, no. 8, pp. 188–197.

    Google Scholar 

  2. Komamiya, Y., Theory of Computing Networks, Proc. of the First National Congr. for Applied Mathematics, 1952, pp. 527–532.

  3. Komamiya, Y., Theory of Computing Networks, Researchers of the Applied Mathematics Section of Electrotechnical Laboratory in Japanase Government, 2 Chome, Nagata-cho, Chiyodaku, Tokyo, 1959, p. 40.

  4. Sintez elektronnykh vychislitel'nykh i upravlyayushchikh skhem (Synthesis of Electronic Calculation and Control Networks), Moscow: Inostrannaya Literatura, 1954.

  5. Malyugin, V.D., Parallel'nye logicheskie vychisleniya posredstvom arifmeticheskikh polinomov (Paralleled Calculation by Means of Arithmetic Polynomials), Moscow: Nauka, 1997.

    Google Scholar 

  6. Sasao, T., Switching Theory for Logic Synthesis, New York: Kluwer, 1999.

    Google Scholar 

  7. Kukharev, G.A., Shmerko, V.P., and Yanushkievich, S.N., Tekhnika parallel'noi obrabotki binarnykh dannykh na SBIS (Techniques of Binary Data Parallel Procesing for VLSI), Minsk: Vysheyshaja Shcola, 1991.

    Google Scholar 

  8. Malyugin, V.D., Kukharev, G.A., and Shmerko, V.P., Proobrazovaniya polinomial'nykh form bulevykh funktsii (Transforms of Polynomial Forms of Boolean Functions), Moscow: Inst. Probl. Upravlen., 1986, pp. 1–48.

    Google Scholar 

  9. Malyugin, V.D., On a Polynomial Realization of a Cortege of Boolean Functions, Dokl. Akad. Nauk SSSR, 1982, vol. 265, no. 6.

    Google Scholar 

  10. Moraga, C., Advances in Sepctral Techniques, Berichte zur angewandten Inforamtik, Universität Dortmund, 1998.2, ISSN 0946-2341.

  11. Representations of Discrete Functions, Sasao, T. and Fujita, M., Eds., New York: Kluwer, 1996.

  12. Sasao, T., Representations of Logic Functions by using EXOR Operators, in [11], pp. 29-54.

  13. Stankovi?, R.S., Some Remarks about Spectral Interpretation of MTBDDS and EVBDDs, Proc. ASPDAC' 95, Makuhari Messe, Chiba, Japan, 1995, pp. 385–390.

  14. Stankovi?, R.S., Spectral Transform Decision Diagrams in Simple Questions and Simple Answers, Belgrade: Nauka, 1998.

    Google Scholar 

  15. Stankovi?, R.S., Sasao, T., and Moraga, C., Spectral Transform Decision Diagrams, in Representations of Discrete Functions, Sasao, M. and Fujita, M., Eds., Norwell: Kluwer, 1996, pp. 55–92.

    Google Scholar 

  16. Stankovi?, R.S., Functional Decision Diagrams for Multiple-valued Functions, Proc. 25th Int. Symp. on Multiple-Valued Logic, Bloomington, Indiana, USA, 1995, pp. 284–289.

  17. Drechsler, R. and Becker, B., Binary Decision Diagrams, Theory and Implementation, New York: Kluwer, 1998.

    Google Scholar 

  18. Falkowski, B.J. and Cahng, C.H., Properties and Methods of Calcualtion Generalized Arithmetic and Adding Transforms, IEE Proc. Circuits, Devices, Syst., 1997, vol. 144, no. 5, pp. 249–258.

    Google Scholar 

  19. Falkowski, B.J. and Chang, C.H., Mutual Conversions between Generalized Arithmetic and Free Binary Decision Diagrams, IEE Proc. Circuits, Devices, Syst., 1998, vol. 145, no. 4, pp. 219–228.

    Google Scholar 

  20. Stankovi?, R.S. and Sasao, T., Decision Diagrams for Representation of Discrete Functions: Uniform Interpretation and Classification, Proc. ASP-DAC'98, Yokohama, Japan, 1998.

  21. Agaian, S., Astola, J., and Egiazarian, K., Binary Polynomial Transforms and Nonlinear Digital Filters, New York: Marcel Dekker, 1995.

    Google Scholar 

  22. Stakhov, A.P., Algorithmic Measurement Theory, Znanie, 1979, no. 6.

  23. Egiazarian, K. and Astola, J., Discrete Orthogonal Transforms Based on Fibonacci-type Recursion, Proc. IEEE Digital Signal Processing Workshop (DSPWS-96), Norway, 1996.

  24. Egiazarian, K., Gevorkian, D., and Astola, J., Time-varying Filter Banks andMultiresolution Transforms Based on Generalized Fibonacci Topology, Proc. 5th IEEE Int. Workshop on Intelligent Signal Proc. and Communication Systems, Kuala Lumpur, Malaysia, 1997, S16.5.1–S16.5.4.

  25. Egiazarian, K., Astola. J., and Agaian, S., Orthogonal Transforms Based on Generalized Fibonacci Recursions, Proc. 2nd Int. Workshop on Spectral Techniques and Filter Banks, Brandenburg, Germany, 1999.

  26. Egiazarian, K. and Astola, J., On Generalized Fibonacci Cubes and Unitary Transforms, Appl. Algebra Eng. Commun. Computing, 1997, vol. AAECC 8, pp. 371–377.

    Google Scholar 

  27. Agaian, S., Astola, J., Egiazarian, K., and Kuosmanen, P., Decompositional Methods for Stack Filtering using Fibonacci p-codes, Signal Processing, 1995, vol. 41, no. 1, pp. 101–110.

    Google Scholar 

  28. Akers, S.B., Binary Decision Diagrams, IEEE Trans. Computers, 1978, vol. C-27, no. 6, pp. 509–516.

    Google Scholar 

  29. Bryant, R.E., Graph-based Algorithms for Boolean Functions Manipulation, IEEE Trans. Computers, 1986, vol. C-35, no. 8, pp. 667–691.

    Google Scholar 

  30. Clarke, E.M., McMillan, K.L., Zhao, X., and Fujita, M., Spectral Transforms for Extremely Large Boolean Functions, in Proc. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expression in Circuit Design, Hamburg, 1993, pp. 86–90.

  31. Stankovi?, R.S., Stankovi?, M., Astola, J.T., and Egiazarian, K., Fibonacci Decision Diagrams and Spectral Fibonacci Decision Diagrams, Proc. 30th Int. Symp. on Multiple-Valued Logic, Portland, Oregon, USA, 2000, pp. 206–211.

Download references

Author information

Authors and Affiliations

  1. Tampere International Center for Signal Processing, Tampere University of Technology, Tampere, Finland

    J. T. Astola & K. Egiazarian

  2. Dept. of Computer Science, Faculty of Electronics, University of Niš, Niš, Serbia

    M. Stanković & R. S. Stanković

Authors
  1. J. T. Astola
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Egiazarian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Stanković
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. R. S. Stanković
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Astola, J.T., Egiazarian, K., Stanković, M. et al. Fibonacci Arithmetic Expressions. Automation and Remote Control 65, 842–856 (2004). https://doi.org/10.1023/B:AURC.0000030899.21673.8e

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:AURC.0000030899.21673.8e

Keywords

Search

Navigation