Logic Gate

Warning: mkdir() [function.mkdir]: Permission denied in /home/webs/affiliatelib2/CacheManager.php on line 12

Warning: mkdir() [function.mkdir]: No such file or directory in /home/webs/affiliatelib2/CacheManager.php on line 12

Warning: fopen(/home/templatecore2cache//*cluesnet.com/54/548fb8fb5145e139614d86ddfdd5b8ccb9c85dfc.tc2cache) [function.fopen]: failed to open stream: No such file or directory in /home/webs/affiliatelib2/CacheManager.php on line 130

Warning: fwrite(): supplied argument is not a valid stream resource in /home/webs/affiliatelib2/CacheManager.php on line 131

Warning: fclose(): supplied argument is not a valid stream resource in /home/webs/affiliatelib2/CacheManager.php on line 132

A logic gate performs a logical operation on one or more logic inputs and produces a single logic output. The logic normally performed is Boolean logic and is most commonly found in digital circuits. Logic gates are primarily implemented electronics using diodes or transistors, but can also be constructed using electromagnetic relays, fluidics, optics, or even machine elements.

Logic gates A logic gate takes one or more logic-level inputs and produces a single logic-level output. Because the output is also a logic level, an output of one logic gate can connect to the input of one or more other logic gates.

In electronic logic, a logic level is represented by a certain voltage (which depends on the type of electronic logic in use). Each logic gate requires power so that it can source and sink currents to achieve the correct output voltage. In logic circuit diagrams the power is not shown, but in a full electronic schematic, power connections are required. There are 7 positive logic gates and each gate has two laws or rules.

Truth table A truth table is a table that describes the behaviour of a logic gate. It lists the value of the output for every possible combination of the inputs and can be used to simplify the number of logic gates and level of nesting in an electronic circuit. In general the truth table does not lead to an efficient implementation; a minimization procedure, using Karnaugh maps, the Quine–McCluskey algorithm or a Publicad is required for reducing the circuit complexity.

Background The simplest form of electronic logic is diode logic. This allows AND and OR gates to be built, but not inverters, and so is an incomplete form of logic. To build a complete logic system, thermionic valve (vacuum tubes) or transistors can be used. The simplest family of logic gates using bipolar transistors is called resistor-transistor logic, or RTL. Unlike diode logic gates, RTL gates can be cascaded indefinitely to produce more complex logic functions. These gates were used in early integrated circuits. For higher speed, the resistors used in RTL were replaced by diodes, leading to diode-transistor logic, or DTL. It was then discovered that one transistor could do the job of two diodes in the space of one diode, so transistor-transistor logic, or TTL, was created. In some types of chip, to reduce size and power consumption still further, the bipolar transistors were replaced with complementary field-effect transistors (MOSFETs), resulting in complementary metal-oxide-semiconductor (CMOS) logic.

For small-scale logic, designers now use prefabricated logic gates from Logic families such as the Transistor-transistor logic 7400 series invented by Texas Instruments and the CMOS 4000 series invented by RCA, and their more recent descendants. These devices usually contain transistors with multiple emitters, used to implement the AND function, which are not available as separate components. Increasingly, these fixed-function logic gates are being replaced by programmable logic devices, which allow designers to pack a huge number of mixed logic gates into a single integrated circuit. The field-programmable nature of programmable logic devices such as FPGAs has removed the 'hard' property of hardware; it is now possible to change the logic design of a hardware system by reprogramming some of its components, thus allowing the features or function of a hardware implementation of a logic system to be changed.

Electronic logic gates differ significantly from their relay-and-switch equivalents. They are much faster, consume much less power, and are much smaller (all by a factor of a million or more in most cases). Also, there is a fundamental structural difference. The switch circuit creates a continuous metallic path for current to flow (in either direction) between its input and its output. The semiconductor logic gate, on the other hand, acts as a high-gain voltage electronic amplifier, which sinks a tiny current at its input and produces a low-impedance voltage at its output. It is not possible for current to flow between the output and the input of a semiconductor logic gate.

Another important advantage of standardised semiconductor logic gates, such as the 7400 and 4000 families, is that they are cascadable. This means that the output of one gate can be wired to the inputs of one or several other gates, and so on ad infinitum, enabling the construction of circuits of arbitrary complexity without requiring the designer to understand the internal workings of the gates.

In practice, the output of one gate can only drive a finite number of inputs to other gates, a number called the 'fanout limit', but this limit is rarely reached in the newer CMOS logic circuits, as compared to Transistor-transistor logic circuits. Also, there is always a delay, called the 'propagation delay', from a change in input of a gate to the corresponding change in its output. When gates are cascaded, the total propagation delay is approximately the sum of the individual delays, an effect which can become a problem in high-speed circuits.

Logic gates and hardware Sheffer stroke#NAND gate and NOR gate logic gates are the two pillars of logic, in that all other types of Boolean logic gates (i.e., AND Gate, OR Gate, NOT Gate, XOR gate, XNOR gate) can be created from a suitable network of just NAND or just NOR gate(s). They can be built from relays or transistors, or any other technology that can create an inverter and a two-input AND or OR gate.Hence the NAND and NOR gates are called the universal gates.

For an input of 2 variables, there are 16 possible boolean algebraic functions. These 16 functions are enumerated below, together with their outputs for each combination of inputs variables.

{| class="wikitable"|- bgcolor=#ddeeff align=center|rowspan=2 bgcolor=#ddeeff|INPUT || bgcolor=#ddeeff| A || 0 || 0 || 1 || 1|- bgcolor=#ddeeff align=center| bgcolor=#ddeeff| B || 0 || 1 || 0 || 1|- bgcolor=#ddffdd align=center|rowspan=16 bgcolor=#ddeeff|OUTPUT || bgcolor=#ddeeff| 0 || 0 || 0 || 0 || 0|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| A AND B || 0 || 0 || 0 || 1|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| A > B * || 0 || 0 || 1 || 0|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| A || 0 || 0 || 1 || 1|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| A < B * || 0 || 1 || 0 || 0|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| B || 0 || 1 || 0 || 1|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| A XOR B || 0 || 1 || 1 || 0|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| A OR B || 0 || 1 || 1 || 1|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| A NOR B || 1 || 0 || 0 || 0|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| A XNOR B || 1 || 0 || 0 || 1|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| NOT B || 1 || 0 || 1 || 0|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| A ≥ B * || 1 || 0 || 1 || 1|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| NOT A || 1 || 1 || 0 || 0|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| A ≤ B * || 1 || 1 || 0 || 1|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| A NAND B || 1 || 1 || 1 || 0|- bgcolor=#ddffdd align=center|bgcolor=#ddeeff| 1 || 1 || 1 || 1 || 1|}

The four functions labeled with a "*" are the logical implication functions: "A ≤ B" can be read as "A implies B"; it follows that "A > B" is "A does not imply B". These four functions are less common and are usually not implemented directly as logic gates.

Logic gates are a vital part of many digital circuits, and as such, every kind is available as an IC. For examples, see the 4000 series of CMOS logic chips or the 7400 TTL series.

Symbols There are two sets of symbols in common use, both now defined by American National Standards Institute/Institute of Electrical and Electronics Engineers Std 91-1984 and its supplement ANSI/IEEE Std 91a-1991. The "distinctive shape" set, based on traditional schematics, is used for simple drawings and is quicker to draw by hand. It is sometimes unofficially described as "military", reflecting its origin if not its modern usage. The "rectangular shape" set, based on International Electrotechnical Commission 60617-12, has rectangular outlines for all types of gate, and allows representation of a much wider range of devices than is possible with the traditional symbols. The IEC's system has been adopted by other standards, such as EN 60617-12:1999 in Europe and British Standard EN 60617-12:1999 in the United Kingdom.

The goal of IEEE Std 91-1984 was to provide a uniform method of describing the complex logic functions of digital circuits with schematic symbols. These functions were more complex than simple AND and OR gates. They could be medium scale circuits such as a 4-bit counter to a large scale circuits such as a microprocessor. The 1984 version did not include the "distinctive shape" symbols. These were added to the 1991 supplement with this note: "The distinctive-shape symbol is, according to IEC Publication 617, Part 12, not preferred, but is not considered to be in contradiction to that standard."

In the 1980s, schematics were the predominate method to design both circuit boards and custom ICs known as gate arrays. Today custom ICs and the field-programmable gate array are typically designed with Hardware description language (HDL) such as Verilog or VHDL. The need for complex logic symbols has diminished and distinctive shape symbols are still the predominate style.

{]| | | A \cdot B|{| class="wikitable" align=right|- bgcolor="#ddeeff" align="center"|colspan=2|INPUT || OUTPUT|- bgcolor="#ddeeff" align="center"| A || B || A AND B|- bgcolor="#ddffdd" align="center"|0 || 0 || 0|- bgcolor="#ddffdd" align="center"|0 || 1 || 0|- bgcolor="#ddffdd" align="center"|1 || 0 || 0|- bgcolor="#ddffdd" align="center"|1 || 1 || 1|}|-| OR gate| | | A+B|{| class="wikitable" align=right|- bgcolor="#ddeeff" align="center"|colspan=2|INPUT || OUTPUT|- bgcolor="#ddeeff" align="center"| A || B || A OR B|- bgcolor="#ddffdd" align="center"|0 || 0 || 0|- bgcolor="#ddffdd" align="center"|0 || 1 || 1|- bgcolor="#ddffdd" align="center"|1 || 0 || 1|- bgcolor="#ddffdd" align="center"|1 || 1 || 1|}|-| NOT gate| | | \overline{A}|{| class="wikitable" align=right|- bgcolor="#ddeeff" align="center"|INPUT || OUTPUT|- bgcolor="#ddeeff" align="center"| A || NOT A|- bgcolor="#ddffdd" align="center"|0 || 1|- bgcolor="#ddffdd" align="center"|1 || 0|}|-| colspan="5" |In electronics a NOT gate is more commonly called an inverter. The circle on the symbol is called a bubble, and is generally used in circuit diagrams to indicate an inverted (active-low) input or output. another site that describes the logic gate bubble|-| Sheffer stroke#NAND gate| | | \overline{A \cdot B}|{| class="wikitable" align=right|- bgcolor="#ddeeff" align="center"|colspan=2|INPUT || OUTPUT|- bgcolor="#ddeeff" align="center"| A || B || A NAND B|- bgcolor="#ddffdd" align="center"|0 || 0 || 1|- bgcolor="#ddffdd" align="center"|0 || 1 || 1|- bgcolor="#ddffdd" align="center"|1 || 0 || 1|- bgcolor="#ddffdd" align="center"|1 || 1 || 0|}|-| NOR gate| | | \overline{A + B}|{| class="wikitable" align=right|- bgcolor="#ddeeff" align="center"|colspan=2|INPUT || OUTPUT|- bgcolor="#ddeeff" align="center"| A || B || A NOR B|- bgcolor="#ddffdd" align="center"|0 || 0 || 1|- bgcolor="#ddffdd" align="center"|0 || 1 || 0|- bgcolor="#ddffdd" align="center"|1 || 0 || 0|- bgcolor="#ddffdd" align="center"|1 || 1 || 0|}|-| colspan="5" |In practice, the cheapest gate to manufacture is usually the NAND gate. Additionally, Charles Peirce showed that NAND gates alone (as well as NOR gates alone) can be used to reproduce all the other logic gates.

Symbolically, a NAND gate can also be shown using the OR shape with bubbles on its inputs, and a NOR gate can be shown as an AND gate with bubbles on its inputs. This reflects the equivalency due to De Morgan's laws, but it also allows a diagram to be read more easily, or a circuit to be mapped onto available physical gates in packages easily, since any circuit node that has bubbles at both ends can be replaced by a simple bubble-less connection and a suitable change of gate. If the NAND is drawn as OR with input bubbles, and a NOR as AND with input bubbles, this gate substitution occurs automatically in the diagram (effectively, bubbles "cancel"). This is commonly seen in real logic diagrams - thus the reader must not get into the habit of associating the shapes exclusively as OR or AND shapes, but also take into account the bubbles at both inputs and outputs in order to determine the "true" logic function indicated.

Two more gates are the exclusive-OR or XOR function and its inverse, exclusive-NOR or XNOR. The two input Exclusive-OR is true only when the two input values are different, false if they are equal, regardless of the value. If there are more than two inputs, the gate generates a true at its output if the number of trues at its input is odd (). In practice, these gates are built from combinations of simpler logic gates.|-| XOR gate| | | A \oplus B|{| class="wikitable" align=right|- bgcolor="#ddeeff" align="center"|colspan=2|INPUT || OUTPUT|- bgcolor="#ddeeff" align="center"| A || B || A XOR B|- bgcolor="#ddffdd" align="center"|0 || 0 || 0|- bgcolor="#ddffdd" align="center"|0 || 1 || 1|- bgcolor="#ddffdd" align="center"|1 || 0 || 1|- bgcolor="#ddffdd" align="center"|1 || 1 || 0|}|-| XNOR gate| | | \overline{A \oplus B}|{| class="wikitable" align=right|- bgcolor="#ddeeff" align="center"|colspan=2|INPUT || OUTPUT|- bgcolor="#ddeeff" align="center"| A || B || A XNOR B|- bgcolor="#ddffdd" align="center"|0 || 0 || 1|- bgcolor="#ddffdd" align="center"|0 || 1 || 0|- bgcolor="#ddffdd" align="center"|1 || 0 || 0|- bgcolor="#ddffdd" align="center"|1 || 1 || 1|}|}

List of logic gate ICs The 7400 series has several ICs that contain just two-input logic gates:{| class="wikitable"|-! IC No. !! Gate|-| 7400| NAND|-| 7402| NOR|-| 7404| NOT gate|-| 7408| AND|-| 7432| OR|-| 7486| XOR|}

DeMorgan equivalent symbols By use of De Morgan's laws, an AND gate can be turned into an OR gate by inverting the sense of the logic at its inputs and outputs. This leads to a separate set of symbols with inverted inputs and the opposite core symbol. These symbols can make circuit diagrams for circuits using active low signals much clearer and help to show accidental connection of an active high output to an active low input or vice-versa.

Storage of bits Related to the concept of logic gates (and also built from them) is the idea of storing a bit of information. The gates discussed up to here cannot store a value: when the inputs change, the outputs immediately react. It is possible to make a storage element either through a capacitor (which stores charge due to its physical properties) or by feedback. Connecting the output of a gate to the input causes it to be put through the logic again, and choosing the feedback correctly allows it to be preserved or modified through the use of other inputs. A set of gates arranged in this fashion is known as a "Latch (electronics)", and more complicated designs that utilise Clock signals (signals that oscillate with a known period) and change only on the rising edge are called edge-triggered "flip-flop (electronics)s". The combination of multiple flip-flops in parallel, to store a multiple-bit value, is known as a register. When using any of these gate setups the overall system has memory; it is then called a sequential system since its output can be influenced by its previous state(s).

These registers or capacitor-based circuits are known as computer computer storage. They vary in performance, based on factors of speed, complexity, and reliability of storage, and many different types of designs are used based on the application.

Three-state logic gates

Three-state, or 3-state, logic gates have three states of the output: high (H), low (L) and high-impedance (Z). The high-impedance state plays no role in the logic, which remains strictly binary. These devices are used on Electrical buses to allow multiple chips to send data. A group of three-states driving a line with a suitable control circuit is basically equivalent to a multiplexer, which may be physically distributed over separate devices or plug-in cards.

In electronics, a high output would mean the output is sourcing current from the positive power terminal (positive voltage). A low output would mean the output is sinking current to the negative power terminal (zero voltage). High impedance would mean that the output is effectively disconnected from the circuit.

'Tri-state', a widely-used synonym of 'three-state', is a trademark of the National Semiconductor.

Miscellaneous Logic circuits include such devices as multiplexers, processor register, arithmetic logic units (ALUs), and computer storage, all the way up through complete microprocessors which can contain more than a 100 million gates. In practice, the gates are made from field effect transistors (FETs), particularly metal-oxide-semiconductor FETs (MOSFETs).

In Reversible computing, Toffoli gates are used.

History and development The earliest logic gates were made mechanically. Charles Babbage, around 1837, devised the Analytical Engine. His logic gates relied on mechanical gearing to perform operations. Electromagnetic relays were later used for logic gates. In 1891, Almon Strowger patented a device containing a logic gate switch circuit (). Strowger's patent was not in widespread use until the 1920s. Starting in 1898, Nikola Tesla filed for patents of devices containing logic gate circuits (see List of Tesla patents). Eventually, vacuum tubes replaced relays for logic operations. Lee De Forest's modification, in 1907, of the vacuum tube can be used as AND logic gate. Ludwig Wittgenstein introduced a version of the 16-row truth table in #Logic gates and hardware above, as proposition 5.101 of Tractatus Logico-Philosophicus (1921). Claude E. Shannon introduced the use of Boolean algebra in the analysis and design of switching circuits in 1937. Walther Bothe, inventor of the coincidence circuit, got part of the 1954 Nobel Prize in physics, for the first modern electronic AND gate in 1924. Active research is taking place in molecular logic gates.

See also

Ampheck
And-inverter graph
Boolean algebra topics
Boolean function
Digital circuit
Minilog
Fanout
Flip-flop (electronics)
Karnaugh map
Logic family
Logical graph
NMOS logic
Race hazard
Reversible computing
Truth table
Venn diagram
Zeroth-order logic

References

Symbols for logic gates. Twenty First Century Books, Breckenridge, CO.
Tesla's invention of the AND logic gate. Twenty First Century Books, Breckenridge, CO.
Wireless Remote Control and the Electronic Computer Logic logic elements
" LEGO Logic Gates". goldfish.org.uk, 2005.