Skip to main content
SpringerLink
Log in

Boolean process

  • Published:
Science in China Series E: Technological Sciences Aims and scope Submit manuscript

Abstract

Boolean algebra successfully describes the logical behavior of a digital circuit, and has been widely used in electronic circuit design and test. With the development of high speed VLSIs it is a drawback for Boolean algebra to be unable to describe circuit timing behavior. Therefore a Boolean process is defined as a family of Boolean variables relevant to the time parametert. A real-valued sample of a Boolean process is a waveform. Waveform functions can be manipulated formally by using mathematical tools. The distance, difference and limit of a waveform polynomial are defined, and a sufficient and necessary condition of the limit existence is presented. Based on this, the concept of sensitization is redefined precisely to demonstrate the potential and wide application possibility. The new definition is very different from the traditional one, and has an impact on determining the sensitizable paths with maximum or minimum length, and false paths, and then designing and testing high performance circuits.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Moszkowski, B., A temporal logic for multilevel reasoning about hardware,Computer, 1985, 18(2): 10.

    Article  Google Scholar 

  2. Amblard, P., Caspi, P., Halbwachs, N., Use of time functions to describe and explain circuit behavior,IEE Proceedings, Pt. E, 1986, 122(5): 271.

    Google Scholar 

  3. Min, Y., Boolean process—An analytical approach to circuit representation, inProc. IEEE Third Asian Test Symposium, Nara, Japan, Bangalore: IEEE Computer Society Press, 1994, 249–254.

    Google Scholar 

  4. Min, Y., Zhao, Z., Li, Z., Boolean process—An analytical approach to circuit representation (II), inProc. IEEE Fourth Asian Test Symposium, India, Bangalore: IEEE Computer Society Press, 1995, 26–32.

    Google Scholar 

  5. Min, Y., Zhao, Z., Li, Z., Analytical delay models for delay testing, inProc. VLSI Design Conf. 96, India, Bangalore: IEEE Computer Society Press, 1996.

    Google Scholar 

  6. Lam, W. K. C., Brayton, R. K.,Timed Boolean Functions, Boston: Kluwer Academic Publishers, 1994, 273.

    MATH  Google Scholar 

  7. McCluskey, E. J., Transients in combinational logic circuits, inRedundancy Techniques for Computing Systems, Washington, D. C.: Spartan Book, 1962, 9–46.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Fault-Tolerant Computing, CAD Laboratory, Institute of Computing Technology, Chinese Academy of Sciences, 100080, Beijing, China

    Yinghua Min, Zhongcheng Li & Zhuxing Zhao

Authors
  1. Yinghua Min
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhongcheng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhuxing Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Project supported by the National Natural Science Foundation of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Min, Y., Li, Z. & Zhao, Z. Boolean process. Sci. China Ser. E-Technol. Sci. 40, 250–257 (1997). https://doi.org/10.1007/BF02916600

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02916600

Keywords

Search

Navigation