• DocumentCode
    2701371
  • Title

    XOR realization using KH-map

  • Author

    Khalid, A. T M Shafiqul ; Awwal, A.A.S.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Wright State Univ., Dayton, OH, USA
  • Volume
    1
  • fYear
    1996
  • fDate
    20-23 May 1996
  • Firstpage
    280
  • Abstract
    Logic design using XOR gates is becoming more popular due to testability and cost effectiveness. For the design of logic circuits, the K-map is still an unparallel tool to a logic designer. Due to the geometric constraints of the K-map, the derivation of the XOR relation is not as simple as those incorporating the AND-OR relation. However, for large problems one must rely on a mechanical approach such as computer simulation where intuition is less effective. The KH-map is a newly proposed technique for mapping large logic functions in a limited physical system and offers a better way of realizing minimized logic functions. This paper gives some rules that can be effectively used in realizing XOR-relations from an KH-map
  • Keywords
    logic design; logic gates; minimisation of switching nets; K-map; KH-map; XOR gates; XOR-relations; computer simulation; cost effectiveness; geometric constraint; logic circuit; logic designer; minimized logic function; rules; testability; unparallel tool; Binary decision diagrams; Circuit testing; Clocks; Computer science; Costs; Logic circuits; Logic design; Logic functions; Logic testing; Mirrors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Aerospace and Electronics Conference, 1996. NAECON 1996., Proceedings of the IEEE 1996 National
  • Conference_Location
    Dayton, OH
  • ISSN
    0547-3578
  • Print_ISBN
    0-7803-3306-3
  • Type

    conf

  • DOI
    10.1109/NAECON.1996.517658
  • Filename
    517658