123 Views · 79 Downloads · ☆☆☆☆☆ 0.0

Optimal design of linear consecutive systems

PUBLISHED March 18, 2023 (DOI: https://doi.org/10.54985/peeref.2303p3503376)

NOT PEER REVIEWED

Authors

Andrea-Claudia Beiu1 , Roxana-Mariana Beiu2 , Valeriu Beiu2
  1. Eindhoven Univ. Technology
  2. "Aurel Vlaicu" University of Arad

Conference / event

9th ACM International Conference on Nanoscale Computing and Communication (ACM NanoCom 2022), October 2022 (Barcelona, Spain)

Poster summary

A critical issue for few nanometers technologies is the cost-yield balance, clearly tilted by soaring costs. An option to reduce costs, while also increasing yield, is to use reliability enhancement schemes. Unfortunately, these are considered power-hungry (due to redundancy), and entail complex designs. From biology, neurons are prime examples of efficiency, achieving outstanding communication reliabilities, although relying on random ion channels. Aiming to bridge from biology to circuits, we will show how overlooked statistical results (about linear consecutive systems), combined with a Binet-like formula (for Fibonacci numbers of higher orders), allow avoiding lengthy reliability calculations, and present a straightforward neuron-inspired optimal design scheme for reliable communications.

Keywords

Reliability, Network reliability, Consecutive systems

Research areas

Computer and Information Science , Electrical Engineering, Mathematics

References

  1. V. Beiu et al. 2023. Bridging reliability to efficiency. In Proc. Intl. Conf. Comp. Comm. & Ctrl. (ICCCC), Băile Felix, Romania, Springer, 387-400 (2023).
  2. E. F. Moore, C. E. Shannon. 1956. Reliable circuits using less reliable relays – Part I. J. Franklin Inst. 262, 3 (1956), 191-208.
  3. J. M. Kontoleon. 1980. Reliability determination of a r-succesiveout-of-n:F system. IEEE Trans. Rel. R-29, 5 (1980), 437.
  4. D. T. Chiang, S.-C. Niu. 1981. Reliability of consecutive-k-out-of-n:F system. IEEE Trans. Rel. R-30, 1 (1981), 87-89.
  5. A. de Moivre. 1738. The Doctrine of Chances (2nd. ed.). H. Woodfall: London, UK. Available at https://catalog.lindahall.org/discovery/delivery/01LINDAHALL_INST:LHL/1287366660005961
  6. K. Xu et al. 2013. Actin, spectrin and associated proteins form a periodic cytoskeletal structure in axons. Science 339, 6118 (2013), 452-456.
  7. V. Beiu, L. Dăuş. 2014. Reliability bounds for two dimensional consecutive systems. Nano Comm. Nets. 6, 3 (2015), 145-152.
  8. P. M. d’Ocagne. 1883. Sur un algorithme algébrique. Nouv. Ann. Math. 2 (1883), 220-226. Available at http://www.numdam.org/item/?id=NAM_1883_3_2__220_0
  9. D. A. Wolfram. 1998. Solving generalized Fibonacci recurrences. Fibonacci Quart. 36, 2 (1998), 129-145.
  10. G. P. B. Dresden, Z. Du. 2014. A simplified Binet formula for k-generalized Fibonacci numbers. J. Integer Seq. 17, 4 (2014), art. 14.4.7 (1-9).

Funding

  1. EU through the European Regional Development Fund (ERDF) under the Competitiveness Operational Program (COP) (No. POC-A1.1.4-E-2015)
  2. Romanian Ministry of Education and Research, CNCS-UEFISCDI (No. PN-III-P4-ID-PCE-2020-2495)

Supplemental files

  1. Optimal Design of Linear Consecutive Systems   Download

Additional information

Competing interests
No competing interests were disclosed.
Data availability statement
The datasets generated during and / or analyzed during the current study are available from the corresponding author on reasonable request.
Creative Commons license
Copyright © 2023 Beiu et al. This is an open access work distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Rate
Cite
Beiu, A., Beiu, R., Beiu, V. Optimal design of linear consecutive systems [not peer reviewed]. Peeref 2023 (poster).
Copy citation

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More