"NAND 게이트"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
(→‎노트: 새 문단)
 
 
(같은 사용자의 중간 판 3개는 보이지 않습니다)
1번째 줄: 1번째 줄:
 
== 노트 ==
 
== 노트 ==
  
−
* Based on the results, we proposed a model for a multi-channel optical router and logic NAND gate.<ref name="ref_2a13">[https://pubs.rsc.org/en/content/articlelanding/2020/ra/d0ra01379j Multi-channel router and logic NAND gate from multiple Autler–Townes splitting controlled by phase transition]</ref>
 
−
* The routing action results from primary and secondary TAT-splitting, while the NAND gate was realized by the primary dressed states.<ref name="ref_2a13" />
 
 
* The NAND gate is a digital logic gate that behaves according to the truth table to the right.<ref name="ref_1af5">[https://electronics.fandom.com/wiki/NAND_gate NAND gate]</ref>
 
* The NAND gate is a digital logic gate that behaves according to the truth table to the right.<ref name="ref_1af5">[https://electronics.fandom.com/wiki/NAND_gate NAND gate]</ref>
 
* The NAND gate is the easiest to manufacture, and also has the property of functional completeness.<ref name="ref_1af5" />
 
* The NAND gate is the easiest to manufacture, and also has the property of functional completeness.<ref name="ref_1af5" />
40번째 줄: 38번째 줄:
 
===소스===
 
===소스===
 
  <references />
 
  <references />
 +
 +
==메타데이터==
 +
===위키데이터===
 +
* ID :  [https://www.wikidata.org/wiki/Q575178 Q575178]
 +
===Spacy 패턴 목록===
 +
* [{'LOWER': 'nand'}, {'LEMMA': 'gate'}]

2021년 2월 17일 (수) 01:55 기준 최신판

노트

  • The NAND gate is a digital logic gate that behaves according to the truth table to the right.[1]
  • The NAND gate is the easiest to manufacture, and also has the property of functional completeness.[1]
  • That is, any other logic function (AND, OR, etc.) can be implemented using only NAND gates.[1]
  • In this instructable, we are going to construct NOT, AND, OR gates using NAND gates only.[2]
  • Do we simply say that a NAND gate is an axiom?[3]
  • Everything can be implemented all the way down to NAND gates.[3]
  • A decoder using NAND gates is shown below.[4]
  • The NAND gate is a combination of an AND gate and NOT gate.[5]
  • The NAND gate provides the false or low output only when their outputs is high or true.[5]
  • The function completeness means any types of gates can be implemented by using the NAND gate.[5]
  • Like NOR gates, NAND gates are so-called "universal gates" that can be combined to form any other kind of logic gate.[6]
  • A NOT gate is made by joining the inputs of a NAND gate.[6]
  • An AND gate is made by following a NAND gate by a NOT gate as shown below.[6]
  • If the truth table for a NAND gate is examined, it can be seen that if any of the inputs are 0, then the output will be 1.[6]
  • The NAND gate or “NotAND” gate is the combination of two basic logic gates, the AND gate and the NOT gate connected in series.[7]
  • The Boolean expression given for a NAND gate is that of logical addition and it is opposite to AND gate.[7]
  • The symbol of the NAND gate is represented as a combination of AND gate and NOT gate.[7]
  • The inputs of the NAND gate are directly connected to the transistor bases.[7]
  • But the same task can be accomplished with NAND gates only since NAND's are universal gates.[8]
  • A NAND gate is made using transistors and junction diodes.[9]
  • The NAND gate is significant because any boolean function can be implemented by using a combination of NAND gates.[9]
  • The NAND gate has the property of functional completeness, which it shares with the NOR gate.[9]
  • An entire processor can be created using NAND gates alone.[9]
  • A two-input NAND gate is a digital combination logic circuit that performs the logical inverse of an AND gate.[10]
  • The symbol and truth table for a NAND gate is shown in Figure 1.[10]
  • All other logical operators can be implemented using only NAND gates connected in different configurations.[10]
  • The Logic NAND Gate is generally classed as a “Universal” gate because it is one of the most commonly used logic gate types.[11]
  • This article is about NAND Logic in the sense of building other logic gates using just NAND gates.[12]
  • For NAND Gates, see NAND gate .[12]
  • A NOT gate is made by joining the inputs of a NAND gate together.[12]
  • An XOR gate is made by connecting four NAND gates as shown below.[12]
  • This will allow you to play around with a NAND gate and have a look at the truth table for yourself.[13]
  • You can play with your own simulation of a NAND gate on the website circuitverse.org.[13]
  • This arrangement of transistors is called a NAND gate, and you’ll learn about why later.[13]
  • Now, rather than drawing two transistors every time we want to represent a NAND gate, we can use a symbol that looks like this.[13]

소스

  1. ↑ 1.0 1.1 1.2 NAND gate
  2. ↑ NOT, AND, OR Gates Using NAND Gates
  3. ↑ 3.0 3.1 How is the NAND gate implemented? (Conceptually)
  4. ↑ NAND Gate and Logical Networks
  5. ↑ 5.0 5.1 5.2 Logic Circuit & Truth Table
  6. ↑ 6.0 6.1 6.2 6.3 Digital Circuits/NAND Logic
  7. ↑ 7.0 7.1 7.2 7.3 NAND Gate: Definition, Symbol and truth table of NAND gate, Diagram
  8. ↑ NAND Gate
  9. ↑ 9.0 9.1 9.2 9.3 NAND gate
  10. ↑ 10.0 10.1 10.2 Glossary Definition for NAND Gate
  11. ↑ Logic NAND Gate Tutorial with NAND Gate Truth Table
  12. ↑ 12.0 12.1 12.2 12.3 NAND logic
  13. ↑ 13.0 13.1 13.2 13.3 Creating NAND gates

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'nand'}, {'LEMMA': 'gate'}]
원본 주소 "https://wiki.mathnt.net/index.php?title=NAND_게이트&oldid=51603"