earticle

논문검색

Delivering High Performance Result with Efficient Use of K-Map

초록

영어

The Karnaugh map popularly known as the K-map is a method to simplify a given Boolean expression. The Karnaugh Map (K-Map) based technique breaks down beyond six variable. Telecommunication engineer at Bells lab Maurice Karnaugh refined the works of Edward Veitch ad created these k maps. The results are transferred from truth table to the rectangular grid numbering of cells is done according to a special code called Gray code and then assigning the 0s & 1s to the cells of the grids. After that Recognition of the pattern of collecting most number of entries starts. Now write the minimal expression for the required truth table. With the help of k maps one can get a rapid overview of interdisciplinary field in a short time.

목차

Abstract
 1. Introduction
  1.1 Benefits of Using
 2. History
 3. Working
 4. Conclusion
 5. Future Scope
 References

저자정보

  • Rishabh Mehta Department of Computer Science, Chitkara University, Chandigarh, India
  • Ramesh Saini Department of Computer Science, Chitkara University, Chandigarh, India
  • Nishant Mudgal Department of Computer Science, Chitkara University, Chandigarh, India
  • Minal Dhankar Department of Computer Science, Maharaja Surajmal Institute, Janakpuri, Delhi, India

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.