Browse > Article
http://dx.doi.org/10.6109/jkiice.2013.17.9.2091

A Study on the Partition Operating Circuit Design based on Directed Graph  

Park, Chun-Myoung (Department of Computer Engineering, Korea National University of Transportation)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.17, no.9, 2013 , pp. 2091-2096 More about this Journal
Abstract
This paper present a method of efficiency circuit design based on directed graph which was represented by tree structure relationship between input and output of nodes. In this paper, we introduce the concept of mathematical analysis based on tree structure which was designed by optimal localized computable circuit. Using the proposed circuit design algorithms in this paper, it is possible to design circuit which directed tree graph have any node number. The proposed method is more effective, regularity and extensibility than former method.
Keywords
Graph; directed graph; matrix; finite field; circuit design;
Citations & Related Records
연도 인용수 순위
  • Reference
1 E.Artin, Galois Theory, NAPCO Graphic arts, Inc., Wilconsin. 2007.
2 Robert J.McEliece, Finite Fields for Computer Scientists and Engineers, Kluwer Academic Publisher, 2000.
3 R.J.Wilson and J.J.Watkins, GRAPH An Introductory Approach, John Wiley & Sons, Inc. 2005.
4 Douglas B.West, Introduction to Graph Theory, Prentice Hall, Inc. 2006.
5 S. Tamaki, M. Kamemiya, and T, Higuchi, "Code Assignment Algorithm for Highly Parallel MVL Combinational Circuits," IEEE ISMVL, pp.382-388, May, 2008.
6 M. Nakajima and M. Kameyama, "Design of MVL Linear Digital Circuits for Highly Parallel-ary Operations," IEEE Proc. ISMVL, pp.223-230, May, 2009.