Skip to main content
SpringerLink
Log in
Book cover

International Conference on Hybrid Information Technology

ICHIT 2012: Convergence and Hybrid Information Technology pp 619–626Cite as

Universal Multiple Processing Unit Using Graph

  • Conference paper

  • 1064 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 310))

Abstract

This paper presents a method of constructing the universal multiple processing element unit(UMPEU) based on Graph. The proposed method is as following. Firstly we propose transformation operators in order to construct the graph using properties of graph. Secondly we construct the transformation table of graph using above transformation operators. Finally we construct the graph using transformation table. The proposed UMPEU is capable of constructing the graph for any prime number and integer value of finite fields. Also the UMPEU is applied to fault-tolerant computing system, pipeline class, parallel processing network, switching function and its circuits.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Green, D.: Modern Logic Design. Addison-Wesley company (1986)

    Google Scholar 

  2. Hwang, K.: Computer Arithmetic principles, architecture, and design. John Wiley & Sons (1979)

    Google Scholar 

  3. Arazi, B.: On the Sythesis of De-Bruijn Sequences. Information and Control 49, 81–90 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  4. Lempel, A.: On a Homomorphism of the DE-Bruijn Graph and its Applications to the Design of Feedback Shift Registers. IEEE Trans. Comut. C-19(12), 1204–1209 (1970)

    Article  MathSciNet  Google Scholar 

  5. Sridhar, M.A., Reghavendra, C.S.: Fault-Tolerant Networks based on the De Bruijn Graph. IEEE Trans. Comut. 41(11), 1167–1174 (1991)

    Article  Google Scholar 

  6. Artin, E.: Galois Theory, NAPCO Graphic arts, Inc., Wisconsin (1971)

    Google Scholar 

  7. Gould, R.: Graph Theory. The Bejamin/Cummings Publishing Company, Inc. (1988)

    Google Scholar 

  8. Lidi, R., Niederreiter, H.: Introduction to finite fields and their applications, Cambridge (2009)

    Google Scholar 

  9. Geiselmann, W., Steinwandt, R.: A Redundant Representation of GF(qn) for designing Arithmetic Circuit. IEEE Trans. Comput. 52(7), 848–853 (2003)

    Article  MATH  Google Scholar 

  10. Reyhani-Masoleh, A., Hasan, M.A.: Fast Normal basis Multiplication Using general Purpose Processors. IEEE Tran. Comput. 52(11), 1379–1390 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, CAST, The Korea National University of Transportation, 50 Daehak-ro, Chungju-si, Chungbuk, 380-702, Korea

    Chun-Myoung Park

Authors
  1. Chun-Myoung Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Engineering, Hannam University, 70 Hannamro, Daedeuk-gu, Daejeon, Korea

    Geuk Lee

  2. Computer Science and Information Systems, University of Limerick, Limerick, Ireland

    Daniel Howard

  3. University of Warsaw and Infobright Inc., Poland

    Dominik Ślęzak

  4. School of Information and Communication Engineering, Sang JI University, Wonju, Kangwon, Korea

    You Sik Hong

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, CM. (2012). Universal Multiple Processing Unit Using Graph. In: Lee, G., Howard, D., Ślęzak, D., Hong, Y.S. (eds) Convergence and Hybrid Information Technology. ICHIT 2012. Communications in Computer and Information Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32692-9_78

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32692-9_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32691-2

  • Online ISBN: 978-3-642-32692-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation