Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3254))

  • 1266 Accesses

Abstract

A novel constant-time fault-secure binary counter is presented. This counter is appropriate for performance aware safety critical systems. This is achieved due its ability to read its binary output on-the-fly. The safety scheme is based on parity prediction technique achieving concurrent on-line testing. The experimental results exhibit high levels of safe operation, keeping the performance of the Constant Time Binary Counter almost linear to its size increase, while area overhead is lower than that of any counter based on a multichannel technique.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Stan, M.R., Tenca, A.F., Ercegovac, M.D.: Long and Fast Up/Down Counters. IEEE Transactions on Computers 47, 722–735 (1998)

    Article  Google Scholar 

  2. Kakarountas, A.P., Theodoridis, G., Papadomanolakis, K.S., Goutis, C.E.: A Novel High- Speed Counter with Counting Rate Independent of the Counter’s Length. In: Proceedings of IEEE International Conference on Electronics, Circuits and Systems, ICECS (2003)

    Google Scholar 

  3. Karaolis, E., Nikolaidis, S., Goutis, C.E.: Fault-secure Binary Counter Design. In: Proceedings of IEEE International Conference on Electronics, Circuits and Systems (ICECS), pp. 1659–1662 (1999)

    Google Scholar 

  4. Papadomanolakis, K.S., Kakarountas, A.P., Sklavos, N., Goutis, C.E.: A Fast Johnson- Mobius Encoding Scheme for Fault-secure Binary Counters. In: Proceedings of Design, Automation and Test in Europe, DATE (2002)

    Google Scholar 

  5. von Neumann, J.: Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components. Princeton University Press, Princeton (1956)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karatasos, D., Kakarountas, A., Theodoridis, G., Goutis, C. (2004). A Novel Constant-Time Fault-Secure Binary Counter. In: Macii, E., Paliouras, V., Koufopavlou, O. (eds) Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation. PATMOS 2004. Lecture Notes in Computer Science, vol 3254. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30205-6_76

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30205-6_76

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23095-3

  • Online ISBN: 978-3-540-30205-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics