Skip to main content

Remarks on Systems, Beads, and Bead Sets

  • Conference paper
Computer Aided Systems Theory - EUROCAST 2013 (EUROCAST 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8112))

Included in the following conference series:

  • 1963 Accesses

Abstract

Beads are a particular class of binary sequences with interesting properties due to which they can be related to Binary decision diagrams. Recently, the concept of beads was extended to integer sequences and sequences over finite fields and used in the classification of logic functions in terms of decision diagrams. In this paper, sets of beads and integer beads are used to estimate the equality of structure of digital systems implementing logic functions.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Astola, J.T., Stanković, R.S.: Fundamentals of Switching Theory and Logic Design. Springer (2006)

    Google Scholar 

  2. Knuth, D.E.: Art of Computer Programming, vol. 4, Fascicle 1, Section 7.1.4, The Bitwise Tricks & Techniques, Binary Decision Diagrams. Addison-Wesley Professional (2009)

    Google Scholar 

  3. Stanković, M., Stojković, S., Moraga, C.: Mapping Decision Diagrams for Multiple-Valued Logic Functions into Threshold Logic Networks. In: Proc. 41st Int. Symp. on Multiple-Valued Logic, Tuusula, Finland, May 23-25, pp. 111–116 (2011)

    Google Scholar 

  4. Minato, S.: Graph-based representations of discrete functions. In: Sasao, T., Fujita, M. (eds.) Representations of Discrete Functions, pp. 1–28. Kluwer Academic Publishers (1996)

    Google Scholar 

  5. Pichler, F.: Walsh functions and linear system theory. In: Proc. 1970 Symp. Application of Walsh Functions, Washington, D.C., pp. 175–182 (1970)

    Google Scholar 

  6. Syuto, M., Shen, J., Tanno, K., Ishizuka, O.: Multi-input variable-threshold circuits for multi-valued logic functions. In: Proc. 30th Int. Symp. on Multiple-Valued Logic, Portland, Oregon, USA, May 23-25, pp. 27–32 (2000)

    Google Scholar 

  7. Stanković, S., Astola, J., Stanković, R.S.: Remarks on beads and shapes of decision diagrams for the representation of discrete functions. In: Proc. 10th Int. Workshop on Boolean Problems, September 19-21, pp. 49–57 (2011)

    Google Scholar 

  8. Stanković, S., Stanković, R.S., Astola, J.: Remarks on shapes of decision diagrams and classes of multiple-valued functions. In: Proc. 42nd Int. Symp. on Multiple-Valued Logic, Victoria, Vanada, May 13-15 (2012)

    Google Scholar 

  9. Stanković, R.S., Moraga, C., Astola, J.T.: Foruier Analysis on Finite Non-Abelian Groups with Applications in Signal Processing and System Design. Wiley/IEEE Press (2005)

    Google Scholar 

  10. Tan, E.C., Chia, C.Y.: Alternative algorithm for optimisation of Reed-Muller universal logic module networks. IEE Proc. Comput. Digit. Tech. 143(6), 385–390 (1996)

    Article  MathSciNet  Google Scholar 

  11. Xu, L., Almaini, A.E.A., Miller, J.F., McKenzie, L.: Reed-Muller universal logic module networks. IEE Proc. E 140(2), 105–108 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stanković, R.S., Astola, J.T., Moraga, C., Stanković, S. (2013). Remarks on Systems, Beads, and Bead Sets. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory - EUROCAST 2013. EUROCAST 2013. Lecture Notes in Computer Science, vol 8112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53862-9_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-53862-9_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53861-2

  • Online ISBN: 978-3-642-53862-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics