Most Karnaugh maps care only about either SoP representations or PoS representations. I have to implement a circuit which minimizes the number of gates and I noticed that certain circuits can be minimized by using XOR gates, although the K-map/Quine-McCluskey technique do not really seem to take the XOR gate into account.(adsbygoogle = window.adsbygoogle || []).push({});

Why is this? Does anyone know how to read XOR gates off of a K-map, i.e. prime implicants which can be simplified via an XOR gate? I would imagine it has something to do with the "checkerboard" arrangement of the 0s and 1s on the K-map but that is only a tentative guess. I need an expert's opinion.

Thanks in advance! Really appreciate it.

BiP

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Recognizing XOR gates in K-maps

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads - Recognizing gates maps | Date |
---|---|

Combination Gates | Jan 1, 2018 |

Designing a 2-bit full adder using nothing but NAND gates? | Nov 12, 2017 |

How to recognize the true Hynix memory chip? | Feb 7, 2017 |

How to recognize series versus parallel paths in complex schematics | Jul 13, 2012 |

How to recognize patterns in an analog waveform? | Nov 14, 2011 |

**Physics Forums - The Fusion of Science and Community**