கானோ வரைபடம்: திருத்தங்களுக்கு இடையிலான வேறுபாடு
உள்ளடக்கம் நீக்கப்பட்டது உள்ளடக்கம் சேர்க்கப்பட்டது
சி + கட்டுரை தற்போது தொகுக்கப்படுகிறது; தொடுப்பிணைப்பி வாயிலாக |
பக்கத்தை '{{தொகுக்கப்படுகிறது}} கானோ வரைபடம் என...' கொண்டு பிரதியீடு செய்தல் அடையாளங்கள்: Replaced Visual edit |
||
| வரிசை 3: | வரிசை 3: | ||
== References == |
== References == |
||
{{reflist|refs=<ref name="Aiken_1952">{{cite book |title=Synthesis of electronic computing and control circuits |orig-year=January 1951 |date=1952 |edition=second printing, revised |chapter=Chapter V: Minimizing charts |pages=preface, 50–67 |author-first1=Howard H. |author-last1=Aiken |author-link1=Howard H. Aiken |author-first2=Gerrit |author-last2=Blaauw |author-link2=Gerrit Blaauw |author-first3=William |author-last3=Burkhart |author-first4=Robert J. |author-last4=Burns |author-first5=Lloyd |author-last5=Cali |author-first6=Michele |author-last6=Canepa |author-first7=Carmela M. |author-last7=Ciampa |author-first8=Charles A. |author-last8=Coolidge, Jr. |author-first9=Joseph R. |author-last9=Fucarile |author-first10=J. Orten |author-last10=Gadd, Jr. |author-first11=Frank F. |author-last11=Gucker |author-first12=John A. |author-last12=Harr |author-first13=Robert L. |author-last13=Hawkins |author-first14=Miles V. |author-last14=Hayes |author-first15=Richard |author-last15=Hofheimer |author-first16=William F. |author-last16=Hulme |author-first17=Betty L. |author-last17=Jennings |author-first18=Stanley A. |author-last18=Johnson |author-first19=Theodore |author-last19=Kalin |author-first20=Marshall |author-last20=Kincaid |author-first21=E. Edward |author-last21=Lucchini |author-first22=William |author-last22=Minty |author-first23=Benjamin L. |author-last23=Moore |author-first24=Joseph |author-last24=Remmes |author-first25=Robert J. |author-last25=Rinn |author-first26=John W. |author-last26=Roche |author-first27=Jacquelin |author-last27=Sanbord |author-first28=Warren L. |author-last28=Semon |author-first29=Theodore |author-last29=Singer |author-first30=Dexter |author-last30=Smith |author-first31=Leonard |author-last31=Smith |author-first32=Peter F. |author-last32=Strong |author-first33=Helene V. |author-last33=Thomas |author-first34=An |author-last34=Wang |author-link34=An Wang |author-first35=Martha L. |author-last35=Whitehouse |author-first36=Holly B. |author-last36=Wilkins |author-first37=Robert E. |author-last37=Wilkins |author-first38=Way Dong |author-last38=Woo |author-first39=Elbert P. |author-last39=Little |author-first40=M. Scudder |author-last40=McDowell |location=Write-Patterson Air Force Base |publisher=[[Harvard University Press]] (Cambridge, Massachusetts, USA) / Geoffrey Cumberlege Oxford University Press (London) |url=https://archive.org/stream/in.ernet.dli.2015.509288/2015.509288.Synthesis-Of#page/n6/mode/1up |access-date=2017-04-16 |quote=[…] Martha Whitehouse constructed the minimizing charts used so profusely throughout this book, and in addition prepared minimizing charts of seven and eight variables for experimental purposes. […] Hence, the present writer is obliged to record that the general algebraic approach, the switching function, the vacuum-tube operator, and the minimizing chart are his proposals, and that he is responsible for their inclusion herein. […]}} (NB. Work commenced in April 1948.)</ref> |
|||
<ref name="Phister_1959">{{cite book |title=Logical design of digital computers |author-first=Montgomery |author-last=Phister, Jr. |publisher=[[John Wiley & Sons Inc.]] |date=1959 |orig-year=December 1958 |location=New York, USA |isbn=0471688053<!-- |id=ISBN978-0471688051? --> |pages=75–83 |url=https://archive.org/stream/in.ernet.dli.2015.74854/2015.74854.Logical-Design-Of-Digital-Computers#page/n0/mode/1up}}</ref> |
|||
<ref name="Curtis_1962">{{cite book |title=A new approach to the design of switching circuits |author-first=H. Allen |author-last=Curtis |publisher=[[D. van Nostrand Company]] |date=1962 |location=Princeton}}</ref> |
|||
<ref name="Karnaugh_1953">{{cite journal |author-last=Karnaugh |author-first=Maurice |author-link=Maurice Karnaugh |title=The Map Method for Synthesis of Combinational Logic Circuits |journal=[[Transactions of the American Institute of Electrical Engineers]] part I |volume=72 |issue=9 |pages=593–599 |date=November 1953 |orig-year=1953-04-23<!-- available for printing -->, 1953-03-17<!-- sent in --> |id=Paper 53-217 |doi=10.1109/TCE.1953.6371932 |url=http://philectrosophy.com/documents/The%20Map%20Method%20For%20Synthesis%20of.pdf |access-date=2017-04-16 |dead-url=no |archive-url=https://web.archive.org/web/20170416232229/http://philectrosophy.com/documents/The%20Map%20Method%20For%20Synthesis%20of.pdf |archive-date=2017-04-16}} (NB. Also contains a short review by [[Samuel H. Caldwell]].)</ref> |
|||
<ref name="Brown_2012">{{cite book |title=Boolean Reasoning - The Logic of Boolean Equations |author-first=Frank Markham |author-last=Brown |edition=<!-- 2012 -->reissue of 2nd |publisher=[[Dover Publications, Inc.]] |location=Mineola, New York |date=2012 |orig-year=2003, 1990 |isbn=978-0-486-42785-0}} [<!-- 1st edition -->http://www2.fiit.stuba.sk/~kvasnicka/Free%20books/Brown_Boolean%20Reasoning.pdf<!-- https://web.archive.org/web/20170416231752/http://www2.fiit.stuba.sk/~kvasnicka/Free%20books/Brown_Boolean%20Reasoning.pdf -->]</ref> |
|||
<ref name="Wakerly_1994">{{cite book |title=Digital Design: Principles & Practices |author-last=Wakerly |author-first=John F. |year=1994 |publisher=[[Prentice Hall]] |location=New Jersey, USA |isbn=0-13-211459-3 |pages=222, 48–49}} (NB. The two page sections taken together say that K-maps are labeled with [[Gray code]]. The first section says that they are labeled with a code that changes only one bit between entries and the second section says that such a code is called Gray code.)</ref> |
|||
<ref name="Belton_1998">{{cite web |author-first=David |author-last=Belton |date=April 1998 |url=http://www.ee.surrey.ac.uk/Projects/Labview/minimisation/karrules.html |title=Karnaugh Maps – Rules of Simplification |access-date=2009-05-30 |dead-url=no |archive-url=https://web.archive.org/web/20170418140519/http://www.ee.surrey.ac.uk/Projects/Labview/minimisation/karrules.html |archive-date=2017-04-18}}</ref> |
|||
<ref name="Dodge_2016">{{cite web |title=Simplifying Logic Circuits with Karnaugh Maps |author-first=Nathan B. |author-last=Dodge |date=September 2015 |publisher=[[The University of Texas at Dallas]], [[Erik Jonsson School of Engineering and Computer Science]] |url=http://www.utdallas.edu/~dodge/EE2310/lec5.pdf |access-date=2017-04-18 |dead-url=no |archive-url=https://web.archive.org/web/20170418140824/https://www.utdallas.edu/~dodge/EE2310/lec5.pdf |archive-date=2017-04-18}}</ref> |
|||
<ref name="Cook_2012">{{cite web |author-last=Cook |author-first=Aaron |title=Using Karnaugh Maps to Simplify Code |publisher=Quantum Rarity |url=http://www.quantumrarity.com/archives/255 |access-date=2012-10-07 |dead-url=no |archive-url=https://web.archive.org/web/20170418141624/http://www.quantumrarity.com/archives/255 |archive-date=2017-04-18}}</ref> |
|||
<ref name="Marquand_1881">{{cite journal |title=XXXIII: On Logical Diagrams for ''n'' terms |author-first=Allan |author-last=Marquand |author-link=Allan Marquand |journal=[[The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science]] |issue=75 |series=5 |date=1881 |volume=12 |doi=10.1080/14786448108627104 |pages=266–270 |url=http://www.tandfonline.com/doi/abs/10.1080/14786448108627104 |access-date=2017-05-15}} (NB. Quite many secondary sources erroneously cite this work as "A logical diagram for ''n'' terms" or "On a logical diagram for ''n'' terms".)</ref> |
|||
<ref name="Veitch_1952">{{cite journal |author-last=Veitch |author-first=Edward W. |author-link=Edward Veitch |title=A Chart Method for Simplifying Truth Functions |journal=ACM Annual Conference/Annual Meeting: Proceedings of the 1952 ACM Annual Meeting (Pittsburg) |publisher=[[Association for Computing Machinery|ACM]] |location=New York, USA |pages=127–133 |date=1952-05-03 |orig-year=1952-05-02 |doi=10.1145/609784.609801}}</ref> |
|||
<ref name="Svoboda_1956_1">{{cite book |title=Graficko-mechanické pomůcky užívané při analyse a synthese kontaktových obvodů |trans-title=Utilization of graphical-mechanical aids for the analysis and synthesis of contact circuits |journal=Stroje na zpracování informací [Symphosium IV on information processing machines] |author-first=Antonín |author-last=Svoboda |author-link=Antonín Svoboda (computer scientist) |location=Prague |publisher=Czechoslovak Academy of Sciences, Research Institute of Mathematical Machines |language=Czech |date=1956 |volume=IV |pages=9–21}}</ref> |
|||
<ref name="Svoboda_1956_2">{{cite book |title=Graphical Mechanical Aids for the Synthesis of Relay Circuits |journal=Nachrichtentechnische Fachberichte (NTF), Beihefte der Nachrichtentechnischen Zeitschrift (NTZ) |publisher=[[Vieweg-Verlag]] |location=Braunschweig, Germany |author-first=Antonín |author-last=Svoboda |author-link=Antonín Svoboda (computer scientist) |date=1956}}</ref> |
|||
<ref name="Svoboda_1979">{{cite book |title=Advanced Logical Circuit Design Techniques |author-first1=Antonín |author-last1=Svoboda |author-link1=Antonín Svoboda (computer scientist) |author-first2=Donnamaie E. |author-last2=White |date=2016 |orig-year=1979-08-01 |edition=retyped electronic reissue |publisher=[[Garland STPM Press]] (original issue) / WhitePubs (reissue) |isbn=978-0-8240-7014-4<!-- 1990 1st issue --> |url=http://www.donnamaie.com/Advanced_logic_ckt/Advanced_Logical_Circuit_Design_Techniques%20sm.pdf |access-date=2017-04-15 |dead-url=no |archive-url=https://web.archive.org/web/20170414163013/http://www.donnamaie.com/Advanced_logic_ckt/Advanced_Logical_Circuit_Design_Techniques%20sm.pdf |archive-date=2017-04-14}} [http://www.donnamaie.com/<!-- https://web.archive.org/web/20170415220158/http://www.donnamaie.com/ -->] [https://books.google.com/books?id=g3uzAAAAIAAJ]</ref> |
|||
<ref name="Händler_1958">{{cite book |title=Ein Minimisierungsverfahren zur Synthese von Schaltkreisen: Minimisierungsgraphen |language=German |author-first=Wolfgang |author-last=Händler |publisher=[[Technische Hochschule Darmstadt]] |date=1958 |id=D 17 |type=Dissertation |url=https://books.google.com/books?id=D58TAQAAIAAJ}} (NB. Although written by a German, the title contains an [[anglicism]]; the correct German term would be "Minimierung" instead of "Minimisierung".)</ref> |
|||
<ref name="Hotz_1974">{{cite book |title=Schaltkreistheorie |language=German |trans-title=Switching circuit theory |author-first=Günter |author-last=Hotz |publisher=[[Walter de Gruyter & Co.]] |series=DeGruyter Lehrbuch |date=1974 |isbn=3-11-00-2050-5 |page=117 |quote=[…] Der Kreisgraph von ''Händler'' ist für das Auffinden von [[prime implicant|Primimplikanten]] gut brauchbar. Er hat den Nachteil, daß er schwierig zu zeichnen ist. Diesen Nachteil kann man allerdings durch die Verwendung von Schablonen verringern. […] [The circle graph by ''Händler'' is well suited to find [[prime implicant]]s. A disadvantage is that it is difficult to draw. This can be remedied using stencils.]}}</ref> |
|||
<ref name="ISER_1">{{cite web |title=Informatik Sammlung Erlangen (ISER) |date=2012-03-13 |publisher=[[Friedrich-Alexander Universität]] |location=Erlangen, Germany |language=German |url=https://www.rrze.fau.de/wir-ueber-uns/kooperationen/iser.shtml |access-date=2017-04-12 |dead-url=yes |archive-url=https://web.archive.org/web/20170516154655/https://www.rrze.fau.de/wir-ueber-uns/kooperationen/iser.shtml |archive-date=2017-05-16}} (NB. Shows a picture of a ''{{lang|de|Kreisgraph}}'' by ''Händler''.)</ref> |
|||
<ref name="ISER_2">{{cite web |title=Informatik Sammlung Erlangen (ISER) - Impressum |date=2012-03-13 |publisher=[[Friedrich-Alexander Universität]] |location=Erlangen, Germany |language=German |url=http://www.iser.uni-erlangen.de:80/index.php?ort_id=327&tree=0 |access-date=2017-04-15 |dead-url=no |archive-url=https://web.archive.org/web/20120226004316/http://www.iser.uni-erlangen.de/index.php?ort_id=327&tree=0 |archive-date=2012-02-26}} (NB. Shows a picture of a ''{{lang|de|Kreisgraph}}'' by ''Händler''.)</ref> |
|||
<ref name="Broy_1990">{{cite book |title=Informatik und Mathematik |language=German |trans-title=Computer Sciences and Mathematics |chapter=Geschichte der Schaltalgebra |trans-chapter=History of circuit switching algebra |author-first=Heinz |author-last=Zemanek |author-link=Heinz Zemanek |editor-first=Manfred |editor-last=Broy |editor-link=Manfred Broy |orig-year=1990 |date=2013 |publisher=[[Springer-Verlag]] |isbn=9783642766770 |pages=43–72 |url=https://books.google.com/books?id=y5GfBgAAQBAJ |quote=Einen Weg besonderer Art, der damals zu wenig beachtet wurde, wies W. Händler in seiner Dissertation […] mit einem Kreisdiagramm. […]}} [https://link.springer.com/chapter/10.1007%2F978-3-642-76677-0_3] (NB. Collection of papers at a colloquium held at the [[Bayerische Akademie der Wissenschaften]], |
|||
1989-06-12/14, in honor of [[Friedrich L. Bauer]].)</ref> |
|||
<ref name="Bauer-Wirsing_1991">{{cite book |author-first1=Friedrich Ludwig |author-last1=Bauer |author-link1=Friedrich Ludwig Bauer |author-first2=Martin |author-last2=Wirsing |author-link2=Martin Wirsing |title=Elementare Aussagenlogik |publisher=[[Springer-Verlag]] |language=German |location=Berlin / Heidelberg |date=March 1991 |isbn=978-3-540-52974-3 |pages=54–56, 71, 112–113, 138–139 |url=https://books.google.com/books?id=Ff58BwAAQBAJ |quote=[…] handelt es sich um ein Händler-Diagramm […], mit den Würfelecken als Ecken eines 2<sup>m</sup>-gons. […] Abb. […] zeigt auch Gegenstücke für andere Dimensionen. Durch waagerechte Linien sind dabei Tupel verbunden, die sich nur in der ersten Komponente unterscheiden; durch senkrechte Linien solche, die sich nur in der zweiten Komponente unterscheiden; durch 45°-Linien und 135°-Linien solche, die sich nur in der dritten Komponente unterscheiden usw. Als Nachteil der Händler-Diagramme wird angeführt, daß sie viel Platz beanspruchen. […]}}</ref> |
|||
<ref name="Colloquium_1960">{{cite book |editor-first1=Ernst Ferdinand |editor-last1=Peschl |editor-link1=Ernst Ferdinand Peschl |editor-first2=Heinz |editor-last2=Unger |editor-link2=:de:Heinz Unger (Mathematiker) |title=Colloquium über Schaltkreis- und Schaltwerk-Theorie - Vortragsauszüge vom 26. bis 28. Oktober 1960 in Bonn - Band 3 von Internationale Schriftenreihe zur Numerischen Mathematik [International Series of Numerical Mathematics] (ISNM) |language=German |volume=3 |chapter=Zum Gebrauch von Graphen in der Schaltkreis- und Schaltwerktheorie |author-first=Wolfgang |author-last=Händler |location=Institut für Angewandte Mathematik, [[Universität Saarbrücken]], Rheinisch-Westfälisches Institut für Instrumentelle Mathematik |publisher=[[Springer Basel AG]] / [[Birkhäuser Verlag Basel]] |date=2013 |orig-year=1961 |isbn=978-3-0348-5771-0 |doi=10.1007/978-3-0348-5770-3 |url=https://books.google.com/books?id=myTnoAEACAAJ |pages=169–198}} [https://link.springer.com/chapter/10.1007%2F978-3-0348-5770-3_10]</ref> |
|||
<ref name="Kortum_1964_12">{{cite journal |title=Minimierung von Kontaktschaltungen durch Kombination von Kürzungsverfahren und Graphenmethoden |author-first=Herbert |author-last=Kortum |author-link=:de:Herbert Kortum |journal=messen-steuern-regeln (msr) |language=German |publisher={{ill|Verlag Technik|de}} |date=1965 |volume=8 |issue=12 |pages=421–425}}</ref> |
|||
<ref name="Kortum_1965_1">{{cite journal |title=Konstruktion und Minimierung von Halbleiterschaltnetzwerken mittels Graphentransformation |author-first=Herbert |author-last=Kortum |author-link=:de:Herbert Kortum |journal=messen-steuern-regeln (msr) |language=German |publisher={{ill|Verlag Technik|de}} |date=1966 |volume=9 |issue=1 |pages=9–12}}</ref> |
|||
<ref name="Kortum_1965_3">{{cite journal |title=Weitere Bemerkungen zur Minimierung von Schaltnetzwerken mittels Graphenmethoden |author-first=Herbert |author-last=Kortum |author-link=:de:Herbert Kortum |journal=messen-steuern-regeln (msr) |language=German |publisher={{ill|Verlag Technik|de}} |date=1966 |volume=9 |issue=3 |pages=96–102}}</ref> |
|||
<ref name="Kortum_1965_5">{{cite journal |title=Weitere Bemerkungen zur Behandlung von Schaltnetzwerken mittels Graphen |author-first=Herbert |author-last=Kortum |author-link=:de:Herbert Kortum |journal=messen-steuern-regeln (msr) |language=German |publisher={{ill|Verlag Technik|de}} |date=1966 |volume=9 |issue=5 |pages=151–157}}</ref> |
|||
<ref name="Kortum_1967_6">{{cite journal |title=Über zweckmäßige Anpassung der Graphenstruktur diskreter Systeme an vorgegebene Aufgabenstellungen |author-first=Herbert |author-last=Kortum |author-link=:de:Herbert Kortum |journal=messen-steuern-regeln (msr) |language=German |publisher={{ill|Verlag Technik|de}} |date=1967 |volume=10 |issue=6 |pages=208–211}}</ref> |
|||
<ref name="Tafel_1971">{{cite book |title=Einführung in die digitale Datenverarbeitung |language=German |trans-title=Introduction to digital information processing |chapter=4.3.5. Graphenmethode zur Vereinfachung von Schaltfunktionen |author-first=Hans Jörg |author-last=Tafel |publisher=[[Carl Hanser Verlag]] |date=1971 |location=[[RWTH]], Aachen, Germany |publication-place=Munich, Germany |isbn=3-446-10569-7 |pages=98–105, 107–113}}</ref> |
|||
<ref name="Steinbuch-Wagner_1967">{{cite book |title=Taschenbuch der Nachrichtenverarbeitung |language=German |editor-first1=Karl W. |editor-last1=Steinbuch |editor-link1=Karl W. Steinbuch |editor-first2=Siegfried W. |editor-last2=Wagner |author-first1=Erich R. |author-last1=Berger |author-first2=Wolfgang |author-last2=Händler |date=1967 |orig-year=1962 |edition=2 |publisher=[[Springer-Verlag OHG]] |location=Berlin, Germany |id=Title No. 1036 |lccn=67-21079 |pages=64, 1034–1035, 1036, 1038 |quote=[…] Übersichtlich ist die Darstellung nach ''Händler'', die sämtliche Punkte, numeriert nach dem ''[[Gray-Code]]'' […], auf dem Umfeld eines Kreises anordnet. Sie erfordert allerdings sehr viel Platz. […] [''Händler's'' illustration, where all points, numbered according to the ''[[Gray code]]'', are arranged on the circumference of a circle, is easily comprehensible. It needs, however, a lot of space.]}}</ref> |
|||
<ref name="Steinbuch-Weber_1974">{{cite book |title=Taschenbuch der Informatik - Band II - Struktur und Programmierung von EDV-Systemen |language=German |editor-first1=Karl W. |editor-last1=Steinbuch |editor-link1=Karl W. Steinbuch |editor-first2=Wolfgang |editor-last2=Weber |editor-first3=Traute |editor-last3=Heinemann |date=1974 |orig-year=1967 |edition=3 |volume=2 |work=Taschenbuch der Nachrichtenverarbeitung |publisher=[[Springer-Verlag]] |location=Berlin, Germany |isbn=3-540-06241-6 |lccn=73-80607 |pages=25, 62, 96, 122–123, 238}}</ref>}} |
|||
16:03, 15 மார்ச்சு 2018 இல் நிலவும் திருத்தம்
 | இந்தக்கட்டுரையினை தற்பொழுது இன்னொருவர் சிறிது நேரத்துக்கு தொகுத்துக் கொண்டிருக்கிறார். எனவே இந்த அறிவிப்பு இருக்கும் வரை, நீங்கள் இதனைத் தொகுப்பதைத் தவிர்க்கவும். இப்பக்கம் இறுதியாக 16:03, 15 மார்ச்சு 2018 (ஒ.அ.நே) (6 ஆண்டுகள் முன்னர்) தொகுக்கப்பட்டது. இது சில மணித்தியாலங்களாகத் தொகுக்கப்படாதிருப்பின், இந்த வார்ப்புருவை நீக்குங்கள். இவ்வார்புருவை நீங்கள் இப்பக்கத்தில் இணைத்திருந்தால், பல அமர்வுகளுக்கிடையே {{வேலை நடந்துகொண்டிருக்கிறது}} எனப் பயன்படுத்துக. |
கானோ வரைபடம் என்பது பூலிய இயற்கணிதக் கோவைகளைச் சுருக்குவதற்கான ஒரு வழிமுறை ஆகும்.