Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

A Study on the Constructing the Function using Extension Edge Valued Graph

모서리값 확장 그래프를 사용한 함수구성에 관한연구

  • Received : 2012.08.03
  • Accepted : 2012.09.18
  • Published : 2013.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

In recently years, many digital logic systems based on graph theory are analyzed and synthesized. This paper presented a method of constructing the function using edge valued extension graph which is based on graph theory. The graph is applied to a new data structure. from binary graph which is recently used in constructing the digital logic systems based on the graph theory. We discuss the mathematical background of literal and reed-muller expansion, and we discuss the edge valued extension graph which is the key of this paper. Also, we propose the algorithms which is the function derivation based on the proposed edge valued extension graph. That is the function minimization method of the n-variables m-valued functions and showed that the algorithm had the regularity with module by which the same blocks were made concerning about the schematic property of the proposed algorithm.

본 논문에서는 최근의 디지털논리시스템의 함수구성시에 도입되고 있는 그래프이론에 바탕을 둔 새로운 형태의 데이터구조 형태인 모서리값 확장 그래프를 추출하는 알고리즘을 제안하였다. 이를 위해 수학적 배경으로는 리터럴 함수와 리드 뮬러 확장에 대해 논의하였으며, 본 논문의 근간인 모서리 확장 그래프의 도출에 대해 논의하였다. 또한, 모서리 확장 그래프로부터 임의의 m치 n변수의 축약된 함수구성을 도출하는 알고리즘을 제안하였으며 이를 예에 적용하여 그 타당성을 보였다. 제안된 알고리즘의 규칙성을 고려하여 동일부분을 모듈화함으로써 일반성을 가짐을 보였다.

Keywords

References

  1. D.Green, Modern Logic Design, Addison-Wesley Publishing Company, 2008.
  2. David C.Rine, Computer Science and MVL Theory and Applications, North-Holland Publishing Company, 1977.
  3. M.K, "Toward the age of the beyond binary electronics and system," ISMVL 90, pp.162-166, North Carolina U.S.A. May. 1990.
  4. R.Gould, Graph Theory, The Benjamin/Cummings Publishing Company, Inc. 1988.
  5. R. J.Wilson and J.J.Watkins, GRAPH an Introductory Approach, John Wiley & Sons, Inc. 2006.
  6. D. B.West, Introduction to Graph Theory, Prentice- Hall, 2003.
  7. S.B.Aker, "Binary Decision Diagrams," IEEE Trans. Comput., vol.C-27, no.6, pp.509-516, Jun. 1978. https://doi.org/10.1109/TC.1978.1675141
  8. R.E.Bryant,"Graph-Based Algorithms for Boolean Function Manipulations," IEEE Trans., Comput., vol.C-35, no.8, pp.677-691, Aug. 1996
  9. D. M. Miller,"MVL Design Tools," IEEE Proc. of ISMVL, Sacramento, California, pp.2-11, may. 1993.
  10. Yung-Te Lai, M. Pedram and S. B. K. Vrudhula, "Formal Verification using Edge-Valued Binary Decision Diagrams," IEEE Trans. On Computers, vol.45, no.2, Feb. 1996.
  11. C.M.Park, "Switching function Implementation based on Graph,"JKIMICSvol.15, no.9, pp1965-1970, Sep., 2011.