Novel Totally Self-Checking Berger Code Checker Designs Based on Generalized Berger Code Partitioning

@article{Rao1993NovelTS,
  title={Novel Totally Self-Checking Berger Code Checker Designs Based on Generalized Berger Code Partitioning},
  author={T. Ramalingeswara Rao and Gui Liang Feng and Mahadev S. Kolluru and Jien-Chung Lo},
  journal={IEEE Trans. Computers},
  year={1993},
  volume={42},
  pages={1020-1024}
}
Novel totally self-checking (TSC) Berger code checker designs are presented in this correspondence. We derive the generalized Berger check partitioning and prove that a TSC Berger code checker can be constructed from a TSC m-out-of-n checker. For a TSC Berger code checker design, no two-output checker exists for information length 2r-1 , for any positive nonzero r. The presented approach solves this open problem. 
BETA

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

and C

  • A. M. Paschalis, D. Nikolos
  • Halatsis, “Efficient modular design of TSC…
  • 1988

Sequin

  • Y. Tamir, H C.
  • “Design and applications of self-testing…
  • 1984

The design of totally self-checking circuits for a class of unordered codes,

  • J. E. Smith
  • J. Des. Autom. Fault-Tolerant Comput.,
  • 1977

Anderson

  • D. A
  • “Design of self-checking digital networks using…
  • 1971
1 Excerpt

Similar Papers

Loading similar papers…