Skip to main content

Feedback Shift Registers Evolutionary Design Using Reverse Polish Notation

  • Conference paper
  • First Online:
Intelligent Information and Database Systems (ACIIDS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11432))

Included in the following conference series:

  • 1955 Accesses

Abstract

The paper presents the use of Genetic Algorithm in the design of registers with linear and non-linear feedback. Such registers are used, among others, in the diagnostics of digital circuits as Test Pattern Generators, and Test Response Compactors. Of particular importance are the registers that generate the maximum cycle, and in practice, respectively long. The length of the test generator cycle is important to Fault Coverage. The selection of the register feedback structure to achieve the maximum cycle is a difficult task, especially for the register with a non-linear feedback function. It is a novelty to propose coding solutions by means of Reverse Polish Notation, thanks to which the simple mechanism of a stack with automation, realizing a context-free grammar of logical expressions can be used to evaluate these solutions. This form of representation of the genotype of solutions is a certain generalization and gives greater possibilities to search the space of acceptable solutions. Such solutions must be minimized due to the limitation of area overhead on the silicon implementation of the tester. The obtained results indicate that the proposed approach gives positive solutions.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Wunderlich, H.J.: BIST for systems-on-a-chip. Integration VLSI J. 26, 55–78 (1998)

    Article  Google Scholar 

  2. Chodacki, M.: Genetic algorithm as self-test path and circular self-test path design method. Vietnam J. Comput. Sci. 5(3–4), 263–278 (2018)

    Article  Google Scholar 

  3. Bhal, A.S., Dhillon, Z.: LFSR based stream cipher (enhanced A5/1). Int. J. Adv. Comput. Eng. Network. 2(12) (2014)

    Google Scholar 

  4. Roy, S., Karjee, J., Rawat, U.S., Dayama Pratik, N., Dey, N.: Symmetric key encryption technique: a cellular automata based approach in wireless sensor networks. Procedia Comput. Sci. 78, 408–414 (2016)

    Article  Google Scholar 

  5. Dubrova, E.: Generation of full cycles by a composition of NLFSRs. Des. Codes Crypt. 73 (2014). https://doi.org/10.1007/s10623-014-9947-3

    Article  MathSciNet  Google Scholar 

  6. Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-662-07807-5

    Book  MATH  Google Scholar 

  7. Burks, A.W., Warren, D.W., Wright, J.B.: An analysis of a logical machine using parenthesis-free notation. Math. Tables Other Aids Comput. 8(46), 53–57 (1954)

    Article  MathSciNet  Google Scholar 

  8. Hamblin, C.L.: Translation to and from Polish Notation. Comput. J. 5(3), 210–213 (1962)

    Article  Google Scholar 

  9. Dhenakaran, S.S.: Employing reverse Polish Notation in encryption. Adv. Comput. Int. J. (ACIJ) 2(2) (2011)

    Google Scholar 

  10. Chaudhary, N.K., Karmacharya, R., Ghimire, B., Srinivasu, N.: Stack variation in push down automata (PDA). Int. J. Eng. Trends Technol. (IJETT) 4(5) (2013)

    Google Scholar 

  11. Jackson, D.: Parsing and translation of expressions by genetic programming. In: Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, 25–29 June 2005

    Google Scholar 

  12. Rastogi, R., Mondal, P., Agarwal, K.: An exhaustive review for infix to postfix conversion with applications and benefits. In: 2nd International Conference on Computing for Sustainable Global Development (INDIACom), New Delhi, pp. 95–100 (2015)

    Google Scholar 

  13. Mauldin, R.D.: The Scottish Book: Mathematics from the Scottish Cafe, 1st edn. Birkhauser, 1 April 1982

    Google Scholar 

  14. Dubrova, E.: A list of maximum period NLFSRs (2018)

    Google Scholar 

  15. Janicka-Lipska, I., Stokłosa, J.: Boolean feedback functions for full-length nonlinear shift registers. J. Telecommun. Inf. Technol. (JTIT) 4 (2004)

    Google Scholar 

  16. Dubrova, E., Teslenko, M., Tenhunen, H.: On analysis and synthesis of (n, k)-non-linear feedback shift registers. In: Design, Automation & Test in Europe (DATE08) (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Miłosław Chodacki .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chodacki, M. (2019). Feedback Shift Registers Evolutionary Design Using Reverse Polish Notation. In: Nguyen, N., Gaol, F., Hong, TP., Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2019. Lecture Notes in Computer Science(), vol 11432. Springer, Cham. https://doi.org/10.1007/978-3-030-14802-7_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-14802-7_41

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-14801-0

  • Online ISBN: 978-3-030-14802-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics