State Encoding and Minimization Methodology for Self-Checking Sequential Machines

  • Agata Brzozowska
  • Jerzy Greblicki
  • Jerzy Kotowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6927)

Abstract

State encoding methodology and minimization procedure for designing of reliable digital circuit - Totally Self Checking Sequential Machines is considered in this article. We limit considerations to Mealy sequential circuits with inputs, internal states and outputs encoded with any unordered code.

Keywords

Internal State Sequential Machine Sequential Circuit Output Code Combinational Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anderson, D.A., Metze, G.: Design of totally self-checking check circuits for m-out-of-n codes. IEEE Transactions on Computers C-22, 263–269 (1973)CrossRefGoogle Scholar
  2. 2.
    Carter, W.C., Schneider, P.R.: Design of dynamically checked computers. In: Proceedings IFIP Conference, Edinburgh, Scotland, pp. 878–883 (August 1968)Google Scholar
  3. 3.
    David, R., Thevenod-Fosse, P.: Design of totaly self-checking asynchronous modular circuits. J. Des. Autom. Fault-Tolerant Comput. 2, 271–278 (1978)Google Scholar
  4. 4.
    Diaz, M., de Souza, J.M.: Design of self-checking microprogrammed controls. In: Digest of Papers 5th International FTC Symposium, Paris, France, pp. 1371–142 (June 1975)Google Scholar
  5. 5.
    Greblicki, J.W., Piestrak, S.J.: Design of totally self-checking code-disjoint synchronous sequential circuits. In: Hlavicka, J., Maehle, E., Pataricza, A. (eds.) EDDC 1999. LNCS, vol. 1667, pp. 251–266. Springer, Heidelberg (1999)Google Scholar
  6. 6.
    Greblicki, J.W.: Synthesis of sequential circuits using unordered codes. PhD thesis, Wroclaw University of Technology, Wroclaw (October 2003) (in polish)Google Scholar
  7. 7.
    Greblicki, J.W.: CAD software for designing of totally self checking sequential circuits. In: DepCoS – RELCOMEX 2006, pp. 289–296. IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
  8. 8.
    Greblicki, J.W., Kotowski, J.: Design of totally self-checking sequential circuits. In: 2nd International Symposium on Logistics and Industrial Informatics (LINDI), Linz, Austria (September 10-11, 2009)Google Scholar
  9. 9.
    Jha, N.K., Wang, S.-J.: Design and synthesis of self-checking VLSI circuits. IEEE Transactions on Computer–Aided Design of Integrated Circuits 12, 878–887 (1993)CrossRefGoogle Scholar
  10. 10.
    Lai, C.-S., Wey, C.-L.: An efficient output function partitioning algorithm reducing hardware overhead in self-checking circuits and systems. In: Proceedings of 35th Midwest Symposium Circuits System, pp. 1538–1541 (1992)Google Scholar
  11. 11.
    Piestrak, S.J.: PLA implementation of totally self-checking circuits using m-out-of-n codes. In: Proceedings ICCD 1985, International Conference on Computer Design: VLSI in Computers, Port Chester, N.Y, October 1-3, pp. 777–781 (1985)Google Scholar
  12. 12.
    Smith, J.E.: The design of totally self-checking check circuits for a class of unordered codes. J. Des. Autom. Fault–Tolerant Comput. 2, 321–342 (1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Agata Brzozowska
    • 1
  • Jerzy Greblicki
    • 1
  • Jerzy Kotowski
    • 1
  1. 1.Institute of Computer Engineering Control and RoboticsWrocław University of TechnologyWrocławPoland

Personalised recommendations