Method and apparatus for an N-nary logic circuit

Technical Field

The present invention relates to semiconductor devices. More specifically, the present invention relates to a functionally complete family of logic.

Background Art

The majority of processor designs use a logic circuit family known as CMOS (Complementary Metal Oxide Semiconductor). A traditional CMOS logic gate consists of a pair of complementary transistors where one transistor is a P-channel field effect transistor (PFET or p-channel device) and the other transistor is a N-channel field effect transistor (NFET or n-channel device). Before CMOS, previous logic circuit families consisted either of bipolar transistors or just one of the two flavors of FETs. The big advantage of CMOS was that it was possible to construct logic families with a low power consumption because power consumption in CMOS occurs only during the switching of the FETs. Since most semiconductor devices initially constructed using CMOS technology were slow by today's standards, the power consumption of a CMOS device was astonishingly low. CMOS gained rapid favor for its ease of construction and simple design rules as well as its tolerance for noise. As a result of its wide popularity, most manufacturing capacity and design research investment in the last several years went into CMOS, which eventually overtook the other types of logic circuit families in nearly every category. Today, most people regard CMOS as the clear winner and preferred choice for virtually every semiconductor logic design task.

CMOS' advantage, that it consumes power only when the FETs are switching, is also its primary disadvantage. The drive for faster clock rates means that the same CMOS circuit that used so little power in the past now requires ever increasing power. Typical CMOS processor designs today consume power in the neighborhood of 50 watts or more. Such power demands (and their related heat dissipation problems) make designing computer systems very difficult.

The large power consumption of current CMOS designs is forcing many designers to consider other types of logic families. One logic family that lends itself to very high clock rates is non-inverting dynamic logic (also called mousetrap logic, domino logic, or asymmetrical CMOS). Non-inverting dynamic logic requires that all information be available both in its true and its complemented form because dynamic logic generally does not allow inverted signals. Not allowing inverted signals, unfortunately, requires us to have twice as many wires or datapaths than in a similar traditional CMOS design. One wire (or datapath) is for the true of the signal, and one wire (or datapath) is for the false of the signal. In dual rail non-inverting dynamic logic, a high on the true datapath is the same as a high in traditional CMOS, and a high on the false datapath is the same as a low in traditional CMOS. For example, a 2-input AND gate in traditional CMOS has just the two inputs because each bit could be either true or false (high or low). In non-inverting dynamic logic, however, a 2 bit AND gate needs 4 inputs because of the redundant representation of data requirement. Unfortunately, both the redundant representation of data for dual rail non-inverting dynamic logic and its increased switch factor increase the power consumption of logic circuits using this design style because there are more evaluation paths to evaluate and more transistors (overall) that are switching. The prior art for dynamic logic such as <patcit id="pcit0001" dnum="US5208490A"><text>US Pat. No. 5208490 to Yetter</text></patcit> et al or <patcit id="pcit0002" dnum="US5640108A"><text>US Pat. No. 5640108 to Miller</text></patcit> tended to focus on methods for improving the speed and or accuracy (de-glitching) of dynamic logic circuits. None of the prior art for dynamic logic, however, focused on methods or techniques for improving the power consumption of the logic family.

A logic circuit consumes power when conducting current either directly from the power pins to the ground pins or when charging or discharging a capacitor (within the circuit). Most power consumed within a circuit, however, comes from the charging/discharging of the capacitors. A capacitor in a logic circuit occurs due to the inherent or intrinsic physical properties of the circuit that includes the metal wires that are within the circuit itself (i.e., inside the transistors) and the wires in-between the transistors. Metal wires have capacitance that is a function of their dimensional cross section and their proximity to neighboring wires, while the capacitance of transistors is a function of their size. In other words, a logic circuit will consume more power if the circuit contains bigger transistors and or contains more wires or greater lengths of wire. With an increased number of wires and transistors necessary to implement dual-rail non-inverting dynamic logic, this logic family will therefore have a high power consumption to offset its speed advantages.

The present invention overcomes the above power limitations of dual rail dynamic logic by creating a logic family with the speed advantage of dynamic logic without the increased power consumption normally associated with using the logic family.

BEST MODE FOR CARRYING OUT THE INVENTION AND SUMMARY

The present invention is a method and apparatus for a two bit logic circuit that uses 1 of 4 signals where one and only one of the four logic paths is active during an evaluation cycle. The present invention comprises a logic tree circuit that couples to a first set of input logic paths, a second set of input logic paths, and a set of output logic paths, which all use 1 of 4 signals. The logic tree circuit evaluates a given function that includes, for example, an AND/NAND function, an OR/NOR function, or a XOR/Equivalence function. The logic tree circuit uses a single, shared logic tree with multiple evaluation paths for evaluating the function of the logic circuit. The device of the present invention further comprises a precharge circuit that precharges the transistors in the logic tree circuit and an evaluate circuit that controls the logic tree circuit's evaluation where both couple to the logic tree circuit. And finally, a clock signal couples to the precharge circuit and the evaluate circuit.

The present invention further comprises a method and apparatus for a N-NARY logic circuit that uses 1 of N signals wherein one logic path of a plurality of N logic paths has a predefined logic state during an evaluation cycle. The present invention comprises a logic tree circuit coupled to a first plurality of input logic paths, a second plurality of input logic paths, and a plurality of output logic paths where each plurality of logic paths may use one or more 1 of N signals. The logic tree circuit that evaluates a given function that includes, for example, an AND/NAND function, an OR/NOR function, or a XOR/Equivalence function. The logic tree circuit uses a single, shared logic tree with multiple evaluation paths for evaluating the function of the logic circuit. The device of the present invention further comprises a precharge circuit that precharges the transistors in the logic tree circuit and an evaluate circuit that controls the logic tree circuit's evaluation where both couple to the logic tree circuit. And finally, a clock signal couples to the precharge circuit and the evaluate circuit.

The present invention additionally comprises a method and apparatus for an integrated circuit (IC) that uses 1 of N signals to reduce both the circuit's power consumption and the circuit's wire-to-wire effective capacitance. The present invention comprises a logic tree circuit coupled to a first 1 of N input signal, a second I of N input signal, and a 1 of N output signal where the 1 of N signals reduce the device's power consumption and wire to wire capacitance. Other embodiments of the present invention include the use of a 1 of 2 signal, a 1 of 3 signal, a 1 of 4 signal, and a 1 of 8 signal where one and only one of the wires of the signal is active.

The present invention additionally comprises a method and apparatus for routing 2 bits of information with a datapath in a semiconductor device using a 1 of 4 signal. The present invention comprises a first, second, third, and fourth wire for routing a 1 of 4 signal in a semiconductor device. Other embodiments of the present invention include routing 1 of 2 signals, 1 of 3 signals, 1 of 8 signals, and 1 of N signals. One and only one wire of the first, second, third, or fourth wire is active during the evaluation cycle and each active wire represents 2 bits worth of information. Additionally, one and only one wire of the first, second, third, or fourth wire is active during a precharge cycle. The datapath may couple to a logic device. And, other embodiments of the present invention include the ability to route non-inverting signals.

DESCRIPTION OF THE DRAWINGS

To further aid in understanding the invention, the attached drawings help illustrate specific features of the invention and the following is a brief description of the attached drawings: <ul id="ul0001" list-style="none" compact="compact"><li><figref idref="f0001">FIG.1</figref> is a block diagram of a prior art dual rail domino logic circuit for a one bit input.</li><li><figref idref="f0001">FIG.2</figref> is a block diagram of a prior dual rail domino logic circuit for a two bit input.</li><li><figref idref="f0002">FIG.3</figref> illustrates the efficiency of the present invention.</li><li><figref idref="f0002">FIG.4</figref> is a block diagram of an embodiment of an N-NARY logic circuit of the present invention using 1 of 4 signals.</li><li><figref idref="f0003">FIG.5A and 5B</figref> illustrate alternative circuit layouts for output buffers.</li><li><figref idref="f0004">FIG.6</figref> is a circuit diagram of one embodiment of the present invention for the OR/NOR function for a N-NARY logic circuit with a dit (2-bit) device using 1 of 4 signals.</li><li><figref idref="f0005">FIG.7</figref> is a circuit diagram of one embodiment of the present invention for the AND/NAND function for a N-NARY logic circuit with a dit device.</li><li><figref idref="f0006">FIG.8</figref> is a circuit diagram of one embodiment of the present invention for the XOR/Equivalence function for a N-NARY logic circuit with a dit device.</li><li><figref idref="f0007">FIG.9</figref> is a block diagram of an embodiment of an N-NARY logic circuit of the present invention using 1 of 3 signals.</li><li><figref idref="f0007">FIG.10</figref> is a block diagram of one embodiment of the present invention for a two bit input using 1 of 2 signals.</li><li><figref idref="f0008">FIG.11</figref> is a circuit diagram of one embodiment of the present invention for the XOR/Equivalence function for a device using I of 2 signals.</li><li><figref idref="f0009">FIG.12</figref> is a circuit diagram of one embodiment of the present invention for the OR/NOR function for a device using I of 2 signals.</li><li><figref idref="f0009">FIG. 13</figref> is a circuit diagram of one embodiment of the present invention for the AND/NAND function for a device using 1 of 2 signals.</li><li><figref idref="f0010">FIG.14</figref> is a block diagram of an embodiment of an N-NARY logic circuit of the present invention using 1 of 8 signals.</li><li><figref idref="f0011">FIG.15</figref> is a block diagram of an embodiment of an N-NARY logic circuit of the present invention using 1 of N signals.</li><li><figref idref="f0012">FIG.16</figref> is a circuit diagram of an embodiment of the present invention for multiple functions selected with a MUX.</li><li><figref idref="f0013 f0014">FIG.17</figref> is a circuit diagram of an embodiment of the present invention for multiple functions selected with a MUX using a single gate for the functions.</li></ul>

DISCLOSURE OF THE INVENTION

The present invention is a method and apparatus for a N-NARY logic circuit that use 1 of N signals. This disclosure describes numerous specific details that include specific encodings, structures, circuits, and logic functions in order to provide a thorough understanding of the present invention. For example, the present invention describes circuits with AND/NAND, OR/NOR, and XOR/Equivalence logic functions. However, the practice of the present invention includes logic functions other than the previously described ones such as adders, shifters, or multiplexers. One skilled in the art will appreciate that one may practice the present invention without these specific details. Additionally, this disclosure does not describe some well known structures such as transistors, FETs, domino circuits, and dynamic circuits in detail in order not to obscure the present invention,

The present invention describes the fundamental building blocks of a new logic family, the "N-NARY" logic family. The design style using this logic family introduces numerous new concepts, one of which includes the abandonment of strictly binary circuits. While binary signals still exist in this design style, they are uncommon. Instead, trinary and greater signals dominate adders, shifters, Boolean units, and even entire datapaths. In fact, the most common signal type of the present invention is quaternary, or four valued, for which we introduce the word "dit" to indicate the two bits (or dual bits) worth of information represented by the quaternary signal. Since the logic family supports many different signal types other than quaternary, we call the design style "N-NARY".

The N-NARY logic family supports a variety of signal encodings that are of the 1 of N form where N is any integer greater than one. The preferred embodiment of the present invention uses a 1 of 4 encoding that uses four wires to indicate one of four possible values. In the N-NARY design style, a 1 of 4 (or a 1 of N) signal is a bundle of wires kept together throughout the inter-cell route, which requires the assertion of no more than one wire either while recharging or evaluating. A traditional design in comparison would use only two wires to indicate four values by asserting neither, one, or both wires together. The number of additional wires represents one difference of the N-NARY logic style, and on the surface makes it appear unacceptable for use in microprocessor designs. One of N signals are less information efficient than traditional signals because they require at least twice the number of wires, but N-NARY signals have the advantage of including signal validation information, which is not possible with traditional signals. It is this additional information (the fact that when zero wires are asserted the result is not yet known) that indirectly allows us to eliminate P-channel logic and all of the series synchronization elements required in traditional designs.

Another advantage of the N-NARY logic family is that N-NARY signals include both true and false information, which means inverters are never required. This is important in two respects. First, a static design can no more avoid logical inversion than can N-NARY logic. Although not obvious with any signal encoding other than 1 of 2 encoding, N-NARY logic produces the logical inversion at each gate all the time. Static design often requires the inversion of signals, and so places inverters near the signal's destination.

Another advantage about the N-NARY logic family is that it allows the designer to perform logic evaluations using a single type of transistor, for example, N-channel only logic or P-channel only logic. The preferred embodiment of the present invention uses N-channel only devices, while other embodiments provide for P-channel only devices. With the preferred embodiment, there are several benefits to N-channel only evaluation gates relative to traditional static gates. The first is the elimination of P-channel devices on input signals, the second is the elimination of the need to build the complementary function in P-channel devices, and the third is the ability to share the N-channel evaluation "stack" among multiple outputs. Sharing portions of the evaluate "stack" among multiple outputs is not possible with static CMOS gates because it is not possible to obtain each output's function and complement from shared devices in both the P and N-channel stacks. Other dynamic logic families such as MODL, or Multiple Output Dynamic Logic, can produce multiple outputs by leveraging the fact that sub-functions are naturally available within dynamic evaluation stacks. The N-NARY design style does not use sub-functions within evaluation stacks to produce multiple outputs. Instead, the N-NARY design style uses separate evaluation stacks to directly produce the multiple outputs. The N-NARY design style is similar to MODL in its ability to reduce transistor counts, but is superior in its ability to produce fast, power efficient circuits. Compared to static CMOS gates, the savings are dramatic.

Another feature of the N-NARY logic style is the switching speed of the gates. Some embodiments of the N-NARY design style allow the designer to limit the "stack height" or the number of transistors in the evaluation path. For example, one embodiment of the present invention uses no more than 2 transistors in an evaluation path (between the precharge circuit and the evaluate circuit), while another embodiment of the present invention uses no more than 3 transistors in an evaluation path. Other embodiments of the present invention allow for greater stack heights in the evaluation path.

To help understand the N-NARY logic family, one must first look at earlier logic families and design styles. <figref idref="f0001">FIG.1</figref> illustrates a typical prior art dual rail dynamic logic circuit 10 for a one bit input. Since this logic circuit is non-inverting dynamic logic, the input wires leading into the circuit contain information that has both the true and its complemented form of an input data signal. The signal <b>A</b> contains the true form of the signal when high, and the signal <b>AN</b> contains the false form of the signal when high. The input wires or logic paths for the signals <b>A</b> and <b>AN</b> couple to a logic tree circuit 14 that performs a selected logic function to produce an output signal <b>O</b> on the output wires. The output wires or logic paths for the output signal <b>O</b> may have a buffer 18 that inverts the signal and or helps in driving additional logic circuits. A clock signal <b>CK</b> controls the evaluation of the logic tree circuit 14, while an inverted clock signal <b>CKN</b> (that may be the inverse <b>of CK</b> or a separate signal) controls the precharge of the dynamic logic within logic tree circuit 14. In some designs, <b>CK</b> is used for both the precharge device 12 and the evaluate device 16. The fact that the precharge device is a p-channel device and the evaluate device is an n-channel device produces the distinct phases. Referring back to <figref idref="f0001">FIG. 1</figref>, if the function of the logic tree circuit 14 performed an inversion, then a truth table for the function would be the following: <tables id="tabl0001" num="0001"><table frame="all"><tgroup cols="5"><colspec colnum="1" colname="col1" colwidth="10mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><tbody><row><entry namest="col1" nameend="col5" align="center"><b>TABLE 1</b></entry></row></tbody></tgroup><tgroup cols="5"><colspec colnum="1" colname="col1" colwidth="10mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><thead><row><entry align="center" valign="top"><b>a</b></entry><entry align="center" valign="top"><b>o</b></entry><entry align="center" valign="top"><b>A</b></entry><entry align="center" valign="top"><b>AN</b></entry><entry align="center" valign="top"><b>O</b></entry></row></thead><tbody><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry></row></tbody></tgroup></table></tables> In the above table, <b>a</b> represents the Boolean input signal and <b>o</b> represents the Boolean output signal. An additional state not listed in TABLE 1 is <b>A</b> and <b>AN</b> both being high concurrently, which is not possible (it is an invalid state) because by definition for dual rail non-inverting dynamic logic, <b>a</b> must be either <b>A</b> or <b>AN</b>.

<figref idref="f0001">FIG.2</figref> illustrates a typical prior art dual rail dynamic logic circuit 20 for a two bit input <b>(a</b> and <b>b)</b> with input signals <b>A</b> and <b>B</b> and their complemented input signals <b>AN</b> and <b>BN</b>. The input wires for the input signals couple to a logic tree circuit 19 that performs a selected logic function to produce a one bit output <b>(o)</b> for the output signal <b>O.</b> The output wires for the output signal <b>O</b> may have a buffer 18 coupled to the wires that inverts the signal and or helps in driving additional logic circuits. Prior art dynamic circuits such as <patcit id="pcit0003" dnum="US5208490A"><text>US Pat. No. 5208490 to Yetter et al</text></patcit> or <patcit id="pcit0004" dnum="US5640108A"><text>US Pat. No. 5640108 to Miller</text></patcit> or even MODL devices included an additional output signal for the complemented form of the output <b>O.</b> However, these prior art circuits such as Yetter typically used separate logic tree circuits and or separate evaluate devices to generate sub-functions of the output or the complemented form of the output signal. Referring back to <figref idref="f0001">FIG.2</figref>, a clock signal <b>CK</b> controls the evaluation of the logic tree circuit 19, while an inverted clock signal <b>CKN</b> controls the precharge of the dynamic logic within the logic tree circuit 19. If the function of the logic tree circuit 19 performed an OR function, then a truth table for the function would be the following: <tables id="tabl0002" num="0002"><table frame="all"><tgroup cols="8"><colspec colnum="1" colname="col1" colwidth="10mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><colspec colnum="6" colname="col6" colwidth="10mm" /><colspec colnum="7" colname="col7" colwidth="10mm" /><colspec colnum="8" colname="col8" colwidth="10mm" /><thead><row><entry namest="col1" nameend="col8" align="center" valign="top"><b>TABLE 2</b></entry></row><row><entry align="center" valign="top"><b>a</b></entry><entry align="center" valign="top"><b>b</b></entry><entry align="center" valign="top"><b>o</b></entry><entry align="center" valign="top"><b>A</b></entry><entry align="center" valign="top"><b>AN</b></entry><entry align="center" valign="top"><b>B</b></entry><entry align="center" valign="top"><b>BN</b></entry><entry align="center" valign="top"><b>O</b></entry></row></thead><tbody><row><entry align="center">z</entry><entry align="center">z</entry><entry align="center">z</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">z</entry><entry align="center">z</entry><entry align="center">0</entry></row><row><entry align="center">z</entry><entry align="center">z</entry><entry align="center">z</entry><entry align="center">z</entry><entry align="center">z</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry></row><row><entry align="center">1</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry></row></tbody></tgroup></table></tables>

Prior art dynamic logic circuits such as Yetter defined certain inputs to the logic circuit as invalid or do not care states in the truth table. The above table represents these invalid states (or inputs) or do not care states (or inputs) with the symbol z. An additional state not listed in TABLE 2 is where all the signals <b>A, AN, B,</b> and <b>BN</b> are high (or asserted) concurrently. This state is not possible (it is an invalid state) because the definition of dual rail non-inverting dynamic logic requires a to be either <b>A</b> or <b>AN</b> and <b>b</b> to be either <b>B</b> or <b>BN.</b>

One of the disadvantages of prior art dynamic logic circuits are their power consumption. As previously noted, power consumption occurs during the switching of the FETs within a circuit when conductive pathways are open between the power pins and the ground pins or when charging/discharging the capacitors of the circuit.

Power is proportional to the amount of charge moved and the potential it is moved across. When a capacitor discharges, the amount of charge is given by: <maths id="math0001" num="(1)"><math display="block"><mi>Q</mi><mo>=</mo><mi mathvariant="italic">CV</mi></math><img file="EP2293448A2_D0001.tif" /></maths> Where Q is the quantity of charge, C is the capacitance, and V is the voltage.

Thus, the energy involved with charging or discharging a capacitor is given by: <maths id="math0002" num="(2)"><math display="block"><mi>E</mi><mo>=</mo><msup><mi mathvariant="italic">CV</mi><mn>2</mn></msup></math><img file="EP2293448A2_D0002.tif" /></maths>

If we have a circuit with a processor, the power that circuit consumes is given by the energy involved with charging or discharging its capacitance per second: <maths id="math0003" num="(3)"><math display="block"><mi>P</mi><mo>=</mo><msup><mi mathvariant="italic">fsCV</mi><mn mathvariant="italic">2</mn></msup></math><img file="EP2293448A2_D0003.tif" /></maths> Where <i>f</i> is the frequency of the part, and <i>s</i> is the switch factor for the circuit.

The switch factor for a signal is an indication of how often the signal switches per cycle, and is a simple ratio. Typical static CMOS signals may have an average switch factor of approximately 0.20. A dual rail dynamic signal has two wires, one of which is guaranteed to evaluate and precharge. This means that in each cycle, one of the two wires switches twice, for a switch factor of 1.0. In contrast, an N-NARY logic function with a 1 of 4 signal contains four wires, exactly one of which evaluates and then precharges, for a switch factor of 0.50. If the frequency, capacitance, and voltage are held constant for these three logic families, then N-NARY 1 of 4 logic will use half the power that dual rail dynamic logic uses.

Any increase in capacitance will increase the power consumption of a dynamic logic device when it evaluates. One example of an increase in capacitance within a circuit occurs from the wire to wire capacitance from adjoining wires when the adjoining logic paths' or wires are concurrently conducting signals. The prior art dynamic logic circuit of <figref idref="f0001">FIG.2</figref> and Table 2 illustrates the wire to wire capacitance problems with adjoining wires because at least 2 of the input logic paths will be conducting a signal for any given input combination.

The present invention overcomes the above problems by creating the N-NARY logic family that uses 1 of N encoding to reduce the number of conducting (or active) wires or logic paths (carrying signals) that a logic tree will evaluate in a given evaluation cycle. There are a variety of techniques to encode information that includes for example binary encoding where a N-bit binary number can represent 2^N possible values. However, one of our requirements is that there is a value or number representation that indicates when the signal or group of signals is NOT valid (in other words, we expect each signal to indicate its validity). We also want to avoid having adjacent wires having concurrent high signals that leads us to add that one and only one logic path in the 1 of N encoding has an active high signal (or an active high logic state) on it during a single evaluation cycle when the data signal is available. All of these additional conditions prompt us to modify the form of encoding since the convenient arrangement of 2^N values for N bits is no longer possible. As a result, we end up with at least two wires (in most cases) for each single bit of binary information, where each signal indicates when it is valid on the logic path by transitioning to a high state, and where one signal indicates a logical zero when it is high, and another signal indicates a logical one when it is high, which results in the following definition table: <tables id="tabl0003" num="0003"><table frame="all"><tgroup cols="3"><colspec colnum="1" colname="col1" colwidth="10mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="56mm" /><thead><row><entry namest="col1" nameend="col3" align="center" valign="top"><b>TABLE 3</b></entry></row><row><entry align="center" valign="top"><b>A</b></entry><entry align="center" valign="top"><b>AN</b></entry><entry align="center" valign="top"><b>Meaning</b></entry></row></thead><tbody><row><entry>0</entry><entry>0</entry><entry>Value not yet available</entry></row><row><entry>0</entry><entry>1</entry><entry>Value available, zero</entry></row><row><entry>1</entry><entry>0</entry><entry>Value available, one</entry></row><row><entry>1</entry><entry>1</entry><entry>Unused encoding (shouldn't happen)</entry></row></tbody></tgroup></table></tables>

We call the encoding in the above table a 1 of 2 encoding where the encoding efficiency is N possible values per N wires. In the present invention, the definition of the state where the true of the signal <b>(A)</b> and the false or complement of the signal <b>(AN)</b> are (0,0) means that the device of the present invention is in precharge or that the data signal has not arrived. With the timing of the data signal embedded into the signal itself, the transition of either <b>A</b> or <b>AN</b> to high indicates both the arrival of the signal and the value of the signal, i.e., whether it's true (on <b>A</b>) or false (on <b>AN</b>).

We can extend the above encoding rules to additional or multiple bits. For example, with 2 bits (which can use 4 wires as 1 of 4 encoding), we can have four possible combinations for what the two binary bits can have: 0, 1, 2 and 3. For 3 bits (which can use 8 wires as 1 of 8 encoding), we have eight combinations: 0, 1, 2, 3, 4, 5, 6 and 7. The following table illustrates some of the encodings possible with 1 of N encoding: <tables id="tabl0004" num="0004"><table frame="all"><tgroup cols="5"><colspec colnum="1" colname="col1" colwidth="12mm" /><colspec colnum="2" colname="col2" colwidth="12mm" /><colspec colnum="3" colname="col3" colwidth="21mm" /><colspec colnum="4" colname="col4" colwidth="34mm" /><colspec colnum="5" colname="col5" colwidth="36mm" /><thead><row><entry namest="col1" nameend="col5" align="center" valign="top"><b>TABLE 4</b></entry></row><row><entry align="center" valign="top"><b>1 of 3</b></entry><entry align="center" valign="top"><b>1 of 4</b></entry><entry align="center" valign="top"><b>1 of 8</b></entry><entry align="center" valign="top"><b>1 of 16</b></entry><entry align="center" valign="top"><b>Meaning</b></entry></row></thead><tbody><row><entry>000</entry><entry>0000</entry><entry>00000000</entry><entry>0000000000000000</entry><entry>Value not yet available</entry></row><row><entry>001</entry><entry>0001</entry><entry>000000001</entry><entry>0000000000000001</entry><entry>Value available, 0</entry></row><row><entry>010</entry><entry>0010</entry><entry>00000010</entry><entry>0000000000000010</entry><entry>Value available, 1</entry></row><row><entry>100</entry><entry>0100</entry><entry>00000100</entry><entry>0000000000000100</entry><entry>Value available, 2</entry></row><row>&lt;entry /&gt;<entry>1000</entry><entry>00001000</entry><entry>0000000000001000</entry><entry>Value available, 3</entry></row><row>&lt;entry /&gt;&lt;entry /&gt;<entry>00010000</entry><entry>0000000000010000</entry><entry>Value available, 4</entry></row><row>&lt;entry /&gt;&lt;entry /&gt;<entry>00100000</entry><entry>0000000000100000</entry><entry>Value available, 5</entry></row><row>&lt;entry /&gt;&lt;entry /&gt;<entry>01000000</entry><entry>0000000001000000</entry><entry>Value available, 6</entry></row><row>&lt;entry /&gt;&lt;entry /&gt;<entry>10000000</entry><entry>0000000010000000</entry><entry>Value available, 7</entry></row><row>&lt;entry /&gt;&lt;entry /&gt;&lt;entry /&gt;<entry>0000000100000000</entry><entry>Value available, 8</entry></row><row>&lt;entry /&gt;&lt;entry /&gt;&lt;entry /&gt;<entry>0000001000000000</entry><entry>Value available, 9</entry></row><row>&lt;entry /&gt;&lt;entry /&gt;&lt;entry /&gt;<entry>000010000000000</entry><entry>Value available, 10</entry></row><row>&lt;entry /&gt;&lt;entry /&gt;&lt;entry /&gt;<entry>0000100000000000</entry><entry>Value available, 11</entry></row><row>&lt;entry /&gt;&lt;entry /&gt;&lt;entry /&gt;<entry>0001000000000000</entry><entry>Value available, 12</entry></row><row>&lt;entry /&gt;&lt;entry /&gt;&lt;entry /&gt;<entry>0010000000000000</entry><entry>Value available, 13</entry></row><row>&lt;entry /&gt;&lt;entry /&gt;&lt;entry /&gt;<entry>0100000000000000</entry><entry>Value available, 14</entry></row><row>&lt;entry /&gt;&lt;entry /&gt;&lt;entry /&gt;<entry>1000000000000000</entry><entry>Value available, 15</entry></row></tbody></tgroup></table></tables>

Note that 1 of 4 encoding provides 4 possible values or two binary bits worth of information. A 1 of 8 encoding provides 8 possible values or three binary bits worth of information. And, a 1 of 16 encoding provides 16 possible values or four binary bits worth of information.

Since the encoding efficiency is N possible values of information per N wires, the encoding efficiency per wire decreases with the higher one of N encodings (as N increases). An increasing number of wires produce a wire disadvantage for higher one of N encodings: <tables id="tabl0005" num="0005"><table frame="all"><tgroup cols="4"><colspec colnum="1" colname="col1" colwidth="20mm" /><colspec colnum="2" colname="col2" colwidth="14mm" /><colspec colnum="3" colname="col3" colwidth="22mm" /><colspec colnum="4" colname="col4" colwidth="25mm" /><thead><row><entry namest="col1" nameend="col4" align="center" valign="top"><b>TABLE 5</b></entry></row><row><entry align="center" valign="top"><b>Encoding</b></entry><entry align="center" valign="top"><b>Wires</b></entry><entry align="center" valign="top"><b>Binary bits</b></entry><entry align="center" valign="top"><b>Wires per bit</b></entry></row></thead><tbody><row><entry align="right">1 of 2</entry><entry align="right">2</entry><entry align="center">1</entry><entry align="char" char="." charoff="15">2.0</entry></row><row><entry align="right">1 of 3</entry><entry align="right">3</entry><entry align="center">2.0</entry><entry align="char" char="." charoff="15">1.5</entry></row><row><entry align="right">1 of 4</entry><entry align="right">4</entry><entry align="center">2</entry><entry align="char" char="." charoff="15">2.0</entry></row><row><entry align="right">1 of 8</entry><entry align="right">8</entry><entry align="center">3</entry><entry align="char" char="." charoff="15">2.7</entry></row><row><entry align="right">1 of 16</entry><entry align="right">16</entry><entry align="center">4</entry><entry align="char" char="." charoff="15">4.0</entry></row><row><entry align="right">1 of 32</entry><entry align="right">32</entry><entry align="center">5</entry><entry align="char" char="." charoff="15">6.4</entry></row><row><entry align="right">1 of 64</entry><entry align="right">64</entry><entry align="center">6</entry><entry align="char" char="." charoff="15">10.3</entry></row><row><entry align="right">1 of 128</entry><entry align="right">128</entry><entry align="center">7</entry><entry align="char" char="." charoff="15">18.3</entry></row><row><entry align="right">1 of 256</entry><entry align="right">256</entry><entry align="center">8</entry><entry align="char" char="." charoff="15">32.0</entry></row></tbody></tgroup></table></tables>

The degree of encoding determines the encodings wire efficiency. For example, a I of 2 signal requires two wires to encode one bit of information. A 1 of 3 signal requires 3 wires to encode 2 bits of information, which is 1.5 wires per bit of information and is very efficient. A 1 of 4 signal requires four wires to encode four values, or the equivalent of two bits of information. In the I of 2 encoding and 1 of 4 encoding cases, the wire efficiency is two wires per bit of information. A 1 of 8 signal requires eight wires to encode three bits of information, which is 2.7 wires per bit of information, less efficient than the prior encodings. Similarly, 1 of 16, 1 of 32 and 1 of 64 have wire efficiencies of 4, 6.4 and 10.7 respectively. As Table 5 illustrates, 1 of 2 and 1 of 4 encodings are equally efficient, and a 1 of 3 encoding is even more efficient. (1 of e is the most efficient, but is not achievable using on/off signals). For example, six wires can encode three 1 of 2 signals or two 1 of 3 signals. Three I of 2 signals provide eight possible values, while two 1 of 3 signals provide nine, or one more value than the three 1 of 2 signals. Line 24 of <figref idref="f0002">FIG.3</figref> illustrates the wire cost per bit information for the 1 of N encodings. Higher degrees of 1 of N encoding quickly become expensive in terms of wire efficiencies. Unless there is an important functional, topological, or power requirement, it is usually not advantageous to use encodings beyond 1 of 8. Within RAMs, however, the word lines are one example where, due to topology, a 1 of 128 encoding can make perfect sense.

The switch factor of a circuit is important because it directly determines power consumption and indirectly determines circuit speed. The power consumption in a logic circuit varies according to how many wires evaluate per bit of encoded information. If the circuit has high power consumption, we must provide more route resources to connect gates to power and ground and also require that some devices be larger, (especially the evaluate devices in N-NARY cells). Using a 1 of N encoding reduces the power consumption for a given logic circuit. In a given cycle, one data signal in any of the above 1 of N encodings will evaluate, such that a 1 of 2 encoding has 50% of its wires evaluate, a 1 of 3 encoding has 33% of its wires evaluate, a I of 4 encoding has 25% of its wires evaluate, a I of 8 encoding has 12.5% of its wires evaluate, etc. Therefore, more wires provide a power consumption advantage for higher 1 of N encodings: <tables id="tabl0006" num="0006"><table frame="all"><tgroup cols="5"><colspec colnum="1" colname="col1" colwidth="20mm" /><colspec colnum="2" colname="col2" colwidth="14mm" /><colspec colnum="3" colname="col3" colwidth="22mm" /><colspec colnum="4" colname="col4" colwidth="15mm" /><colspec colnum="5" colname="col5" colwidth="36mm" /><thead><row><entry namest="col1" nameend="col5" align="center" valign="top"><b>TABLE 6</b></entry></row><row><entry align="center" valign="top"><b>Encoding</b></entry><entry align="center" valign="top"><b>Wires</b></entry><entry align="center" valign="top"><b>Binary bits</b></entry><entry align="center" valign="top"><b>Per bit</b></entry><entry align="center" valign="top"><b>Power consumption</b></entry></row></thead><tbody><row><entry align="right">1 of 2</entry><entry align="right">2</entry><entry align="center">1</entry><entry align="char" char="." charoff="25">2.0</entry><entry align="char" char="." charoff="10">50.0%</entry></row><row><entry align="right">1 of 3</entry><entry align="right">3</entry><entry align="center">2</entry><entry align="char" char="." charoff="25">1.5</entry><entry align="char" char="." charoff="10">33.3%</entry></row><row><entry align="right">1 of 4</entry><entry align="right">4</entry><entry align="center">2</entry><entry align="char" char="." charoff="25">2.0</entry><entry align="char" char="." charoff="10">25.0%</entry></row><row><entry align="right">1 of 8</entry><entry align="right">8</entry><entry align="center">3</entry><entry align="char" char="." charoff="25">2.7</entry><entry align="char" char="." charoff="10">12.5%</entry></row><row><entry align="right">1 of 16</entry><entry align="right">16</entry><entry align="center">4</entry><entry align="char" char="." charoff="25">4.0</entry><entry align="char" char="." charoff="10">6.3%</entry></row><row><entry align="right">1 of 32</entry><entry align="right">32</entry><entry align="center">5</entry><entry align="char" char="." charoff="25">6.4</entry><entry align="char" char="." charoff="10">3.1%</entry></row><row><entry align="right">1 of 64</entry><entry align="right">64</entry><entry align="center">6</entry><entry align="char" char="." charoff="25">10.3</entry><entry align="char" char="." charoff="10">1.6%</entry></row><row><entry align="right">1 of 128</entry><entry align="right">128</entry><entry align="center">7</entry><entry align="char" char="." charoff="25">18.3</entry><entry align="char" char="." charoff="10">0.8%</entry></row><row><entry align="right">1 of 256</entry><entry align="right">256</entry><entry align="center">8</entry><entry align="char" char="." charoff="25">32.0</entry><entry align="char" char="." charoff="10">0.4%</entry></row></tbody></tgroup></table></tables>

Implementing devices in I of N encodings can either be advantageous or disadvantageous from a power efficiency perspective and depends on the function of the device (e.g., ADD, Boolean AND, OR, etc.). Functions that desire adjacent bit information to be pre-encoded, such as adders, experience a reduced power consumption (power efficiency) advantage for using higher one of N encodings. Functions that do not want adjacent bit information encoded such as OR gates experience a reduced power consumption (power efficiency) disadvantage for higher one of N encodings. Functions that do not alter the values, such as multiplexers and storage elements experience neither a reduced power consumption advantage nor a disadvantage for higher 1 of N encoding. An additional consideration to the reduced power consumption (power efficiency) advantage or disadvantage is the cost of the additional wires per bit, which is an important consideration in constructing transistor gates.

Tables 7 and 8 illustrate the reduced power consumption for 1 of N encodings for different functions. Table 7 illustrates the complexity (the transistor count) of an example OR gate in various 1 of N encodings as follows: <tables id="tabl0007" num="0007"><table frame="all"><tgroup cols="6"><colspec colnum="1" colname="col1" colwidth="20mm" /><colspec colnum="2" colname="col2" colwidth="26mm" /><colspec colnum="3" colname="col3" colwidth="21mm" /><colspec colnum="4" colname="col4" colwidth="29mm" /><colspec colnum="5" colname="col5" colwidth="13mm" /><colspec colnum="6" colname="col6" colwidth="15mm" /><thead><row><entry namest="col1" nameend="col6" align="center" valign="top"><b>TABLE 7</b></entry></row><row><entry align="center" valign="top"><b>Encoding</b></entry><entry align="center" valign="top"><b>Evaluate tree</b></entry><entry align="center" valign="top"><b>Per output</b></entry><entry align="center" valign="top"><b>Evaluate device</b></entry><entry align="center" valign="top"><b>Total</b></entry><entry align="center" valign="top"><b>Per Bit</b></entry></row></thead><tbody><row><entry align="right">1 of 2</entry><entry align="right">4</entry><entry align="right">2 x 4</entry><entry align="center">1</entry><entry align="right">13</entry><entry align="char" char="." charoff="37">13.0</entry></row><row><entry align="right">1 of 4</entry><entry align="right">14</entry><entry align="right">4 x 4</entry><entry align="center">1</entry><entry align="right">31</entry><entry align="char" char="." charoff="37">15.5</entry></row><row><entry align="right">1 of 8</entry><entry align="right">58</entry><entry align="right">8 x 4</entry><entry align="center">1</entry><entry align="right">91</entry><entry align="char" char="." charoff="37">30.3</entry></row><row><entry align="right">1 of 16</entry><entry align="right">242</entry><entry align="right">16 x 4</entry><entry align="center">1</entry><entry align="right">307</entry><entry align="char" char="." charoff="37">76.8</entry></row><row><entry align="right">1 of 32</entry><entry align="right">994</entry><entry align="right">32 x 4</entry><entry align="center">1</entry><entry align="right">1123</entry><entry align="char" char="." charoff="37">224.6</entry></row></tbody></tgroup></table></tables>

Similarly, for a multiplexer, the gate complexity is as follows: <tables id="tabl0008" num="0008"><table frame="all"><tgroup cols="6"><colspec colnum="1" colname="col1" colwidth="20mm" /><colspec colnum="2" colname="col2" colwidth="26mm" /><colspec colnum="3" colname="col3" colwidth="21mm" /><colspec colnum="4" colname="col4" colwidth="29mm" /><colspec colnum="5" colname="col5" colwidth="13mm" /><colspec colnum="6" colname="col6" colwidth="15mm" /><thead><row><entry namest="col1" nameend="col6" align="center" valign="top"><b>TABLE 8</b></entry></row><row><entry align="center" valign="top"><b>Encoding</b></entry><entry align="center" valign="top"><b>Evaluate tree</b></entry><entry align="center" valign="top"><b>Per output</b></entry><entry align="center" valign="top"><b>Evaluate device</b></entry><entry align="center" valign="top"><b>Total</b></entry><entry align="center" valign="top"><b>Per Bit</b></entry></row></thead><tbody><row><entry align="right">1 of 2</entry><entry align="right">6</entry><entry align="right">2 x 4</entry><entry align="center">1</entry><entry align="right">15</entry><entry align="char" char="." charoff="25">15.0</entry></row><row><entry align="right">1 of 4</entry><entry align="right">10</entry><entry align="right">4 x 4</entry><entry align="center">1</entry><entry align="right">27</entry><entry align="char" char="." charoff="25">13.5</entry></row><row><entry align="right">1 of 8</entry><entry align="right">18</entry><entry align="right">8 x 4</entry><entry align="center">1</entry><entry align="right">51</entry><entry align="char" char="." charoff="25">17.0</entry></row><row><entry align="right">1 of 16</entry><entry align="right">34</entry><entry align="right">16 x 4</entry><entry align="center">1</entry><entry align="right">99</entry><entry align="char" char="." charoff="25">24.8</entry></row><row><entry align="right">1 of 32</entry><entry align="right">66</entry><entry align="right">32 x 4</entry><entry align="center">1</entry><entry align="right">195</entry><entry align="char" char="." charoff="25">39.0</entry></row></tbody></tgroup></table></tables>

The OR gate example of Table 7 shows that there is a power efficiency disadvantage to the higher 1 of N encodings when we do not want adjacent information encoded into each bit position. The multiplexer example shows that there actually is an advantage to a 1 of 4 encoding because the multiplexer treats data without regard to its encoding (included within this advantage is that there is a sharing of portions of the evaluate tree and the evaluate device). Note that most structures in a microprocessor are multiplexers.

To summarize the power consumption for 1 ofN encodings as N increases, we have the following table: <tables id="tabl0009" num="0009"><table frame="all"><tgroup cols="7"><colspec colnum="1" colname="col1" colwidth="20mm" /><colspec colnum="2" colname="col2" colwidth="14mm" /><colspec colnum="3" colname="col3" colwidth="22mm" /><colspec colnum="4" colname="col4" colwidth="25mm" /><colspec colnum="5" colname="col5" colwidth="29mm" /><colspec colnum="6" colname="col6" colwidth="29mm" /><colspec colnum="7" colname="col7" colwidth="29mm" /><thead><row><entry namest="col1" nameend="col7" align="center" valign="top"><b>TABLE 9</b></entry></row><row><entry align="center" valign="top"><b>Encoding</b></entry><entry align="center" valign="top"><b>Wires</b></entry><entry align="center" valign="top"><b>Binary bits</b></entry><entry align="center" valign="top"><b>Wires per bit</b></entry><entry align="center" valign="top"><b>Switch factor (power)</b></entry><entry align="center" valign="top"><b>OR transistors per bit</b></entry><entry align="center" valign="top"><b>MUX transistors per bit</b></entry></row></thead><tbody><row><entry align="right">1 of 2</entry><entry align="right">2</entry><entry align="center">1</entry><entry align="char" char="." charoff="8">2.0</entry><entry align="char" char=".">50.0%</entry><entry align="char" char=".">13.0</entry><entry align="char" char=".">15.0</entry></row><row><entry align="right">1 of 4</entry><entry align="right">4</entry><entry align="center">2</entry><entry align="char" char="." charoff="8">2.0</entry><entry align="char" char=".">25.0%</entry><entry align="char" char=".">15.5</entry><entry align="char" char=".">13.5</entry></row><row><entry align="right">1 of 8</entry><entry align="right">8</entry><entry align="center">3</entry><entry align="char" char="." charoff="8">2.7</entry><entry align="char" char=".">12.5%</entry><entry align="char" char=".">30.3</entry><entry align="char" char=".">17.0</entry></row><row><entry align="right">1 of 16</entry><entry align="right">16</entry><entry align="center">4</entry><entry align="char" char="." charoff="8">4.0</entry><entry align="char" char=".">6.3%</entry><entry align="char" char=".">76.8</entry><entry align="char" char=".">24.8</entry></row><row><entry align="right">1 of 32</entry><entry align="right">32</entry><entry align="center">5</entry><entry align="char" char="." charoff="8">6.4</entry><entry align="char" char=".">3.1%</entry><entry align="char" char=".">224.6</entry><entry align="char" char=".">39.0</entry></row></tbody></tgroup></table></tables>

<figref idref="f0002">FIG.3</figref> is an illustration of Table 9 that shows the power efficiency per wire of the present invention as N increases for I of N encodings. Line 22 illustrates the reduction in power consumption for higher 1 ofN encodings. Line 24 illustrates the wires per bit for the I of N encodings. Line 26 illustrates transistors per bit for the multiplexer example (from Table 8), and line 28 illustrates the transistors per bit of the OR example (from Table 7).

From the above, we see that a 1 of 4 encoding appears to have a very good combination of wire and transistor efficiency and low power consumption. Normalizing Table 9 to a 1 of 4 encoding we get the following: <tables id="tabl0010" num="0010"><table frame="all"><tgroup cols="7"><colspec colnum="1" colname="col1" colwidth="20mm" /><colspec colnum="2" colname="col2" colwidth="14mm" /><colspec colnum="3" colname="col3" colwidth="22mm" /><colspec colnum="4" colname="col4" colwidth="25mm" /><colspec colnum="5" colname="col5" colwidth="29mm" /><colspec colnum="6" colname="col6" colwidth="29mm" /><colspec colnum="7" colname="col7" colwidth="29mm" /><thead><row><entry namest="col1" nameend="col7" align="center" valign="top"><b>TABLE 10</b></entry></row><row><entry align="center" valign="top" /><entry align="center" valign="top" /><entry align="center" valign="top" /><entry align="center" valign="top" /><entry namest="col5" nameend="col7" align="center" valign="top"><b>Normalized</b></entry></row><row><entry align="center" valign="top"><b>Encoding</b></entry><entry align="center" valign="top"><b>Wires</b></entry><entry align="center" valign="top"><b>Binary bits</b></entry><entry align="center" valign="top"><b>Wires per bit</b></entry><entry align="center" valign="top"><b>Switch factor (power)</b></entry><entry align="center" valign="top"><b>OR transistors per bit</b></entry><entry align="center" valign="top"><b>MUX transistors per bit</b></entry></row></thead><tbody><row><entry align="right">1 of 2</entry><entry align="right">2</entry><entry align="center">1</entry><entry align="char" char="." charoff="8">2.0</entry><entry align="char" char=".">2.00</entry><entry align="char" char=".">0.8</entry><entry align="char" char=".">1.1</entry></row><row><entry align="right">1 of 4</entry><entry align="right">4</entry><entry align="center">2</entry><entry align="char" char="." charoff="8">2.0</entry><entry align="char" char=".">1.00</entry><entry align="char" char=".">1.0</entry><entry align="char" char=".">1.0</entry></row><row><entry align="right">1 of 8</entry><entry align="right">8</entry><entry align="center">3</entry><entry align="char" char="." charoff="8">2.7</entry><entry align="char" char=".">0.50</entry><entry align="char" char=".">2.0</entry><entry align="char" char=".">1.3</entry></row><row><entry align="right">1 of 16</entry><entry align="right">16</entry><entry align="center">4</entry><entry align="char" char="." charoff="8">4.0</entry><entry align="char" char=".">0.25</entry><entry align="char" char=".">5.0</entry><entry align="char" char=".">1.8</entry></row><row><entry align="right">1 of 32</entry><entry align="right">32</entry><entry align="center">5</entry><entry align="char" char="." charoff="8">6.4</entry><entry align="char" char=".">0.13</entry><entry align="char" char=".">14.5</entry><entry align="char" char=".">2.9</entry></row></tbody></tgroup></table></tables>

The above discussion of the 1 of N encoding of the present invention allows us to define a I of N signal as a plurality of wires (the physical metal trace), one and only one of which can evaluate true, which indicates the signal's value (or predefined logic state). For example, a 1 of 4 signal is a signal composed of 4 wires, and can communicate four different values using 1 of 4 encoding, or two bits of information. Another example is a 1 of 2 signal that is a signal composed of 2 wires, and can communicate two values using 1 of 2 encoding, or one bit of information. And, another example is a 1 of 8 signal that is a signal composed of 8 wires, and can communicate 8 values using 1 of 8 encoding, or three bits of information.

<figref idref="f0002">FIG.4</figref> illustrates one embodiment of the present invention using two sets of 1 of 4 signals for the input signals and a 1 of 4 signal for the output signal. This embodiment of the present invention describes a 2 bit logic gate (a dit) where <b>a</b> is a 2 bit input, <b>b</b> is a 2 bit input, and <b>o</b> is a 2 bit output. In other words, a dit device comprises 4 input bits and 2 output bits. The present invention describes an entire family of 2 bit or dit Boolean logic gates in N-NARY logic using one of N encoding for the signals.

Referring to <figref idref="f0002">FIG.4</figref>, a device 60 comprises a logic tree circuit 61, a precharge circuit 31, and an evaluate circuit 36. Coupled to the logic tree circuit is the 2 bit input signal <b>a,</b> which is a 1 of 4 signal that comprises a plurality of input values <b>A₀, A₁, A₂,</b> and <b>A₃</b> and their associated wires or logic paths using a I of 4 encoding. Additionally coupled to the logic tree circuit is the 2 bit input b, which is another 1 of 4 signal that comprises a plurality of input values <b>B₀, B₁, B₂,</b> and <b>B₃</b> and their associated wires or logic paths using a 1 of 4 encoding. And, coupled to the logic tree circuit is the 2 bit output <b>o</b>, which is a 1 of 4 signal that comprises a plurality of output values <b>O₀, O₁, O₂,</b> and <b>O₃</b> and their associated wires or logic paths using a 1 of 4 encoding. The logic tree circuit 61 performs a logic function on a plurality of input signals that could comprise a variety of functions, for example, the Boolean logic functions AND/NAND, OR/NOR, or XOR/Equivalence. The logic tree circuit 61 comprises one or more FETs with the preferred embodiment of the logic tree circuit comprising N-channel FETs.

Coupled to the wires of the plurality of output signals are the output buffers 34 that aid in driving additional circuits that couple to the output signals. The preferred embodiment of the present invention uses an output buffer with an inverting function as the output buffer 34. Another embodiment of the present invention comprises a non-inverting buffer as the output buffer. And, another embodiment of the present invention does not use an output buffer; instead, the plurality of output signals couples directly to other circuits.

A precharge circuit 31 couples to the logic tree circuit 61 and precharges the dynamic logic of the logic tree circuit. The precharge circuit 31 comprises one or more FETs with the preferred embodiment of the circuit comprising P-channel FETs. Each evaluation path of the logic tree circuit has its own precharge P-FET. Coupled to the precharge circuit 31 is the clock signal <b>CK.</b> A low clock signal on <b>CK</b> will cause the FETs in the logic tree circuit 32 to charge when using P-channel FETs in the precharge tree circuit.

An evaluate circuit 36 couples to the logic tree circuit and controls the evaluation of the logic tree circuit. The evaluate circuit 36 comprises one or more FETs with the preferred embodiment of the circuit comprising a single N-channel FET. Coupled to the evaluate circuit 36 is the clock signal <b>CK.</b> A high clock signal on <b>CK</b> will cause the FETs in the logic tree circuit 32 to evaluate when using N-channel FETs in the evaluate circuit.

If the logic function of logic tree circuit 61 performed an OR/NOR function as found in the circuit of <figref idref="f0004">FIG.6</figref>, then the resulting truth table would be Table 11. The mapping of the 1 of 4 encoding for the output comprises a variety of truth tables other than the example above and is dependent on the circuit design. However, Table 11 illustrates that one and only one logic path of the 1 of N encoding has an active high value (or an active logic state) on it during a single evaluation cycle when the data signals are available. In <figref idref="f0002">FIG.4</figref>, there are 2 sets of 1 of 4 signals for the input signals and a I of 4 signal for the output signal. The present invention provides that the input or output signals may have multiple sets of 1 of N signals using of 1 of N encoding. For example, in each state in Table 11 for the input wires or logic paths <b>A₀</b> through <b>A₃,</b> there is one and only one input logic path or wire that has an active high value on it. In each state in Table 11 for the input logic path <b>B₀</b> through <b>B₃,</b> there is one and only one input logic path or wire that has an active high value on it. And, in each state in Table 11 for the output logic paths <b>O₀</b> through <b>O₃,</b> there is one and only one output logic or wire path that has an active high value on it.

<figref idref="f0003">FIG.5A and 5B</figref> illustrate alternative circuit layouts for output buffers. <figref idref="f0003">FIG.5A</figref> shows a CMOS inverter for inverting the signal on an output logic path. <figref idref="f0003">FIG.5B</figref> shows the preferred embodiment of an output buffer that shows a CMOS inverter for inverting the signal and a feed back keeper transistor for maintaining the level of the dynamic node before the signal evaluates, which gives a logic gate using this buffer a static capability. Additionally, this type of output buffer compensates for parasitic leakages and allows for low speed functionality.

<figref idref="f0004">FIG.6</figref> is a circuit diagram of one embodiment of the present invention for the OR/NOR function using a 1 of 4 encoding. One skilled in the art will appreciate that one function is the inverse of the other function. A device 106 is a dit (a 2 bit) device that has two 2 bit inputs and a 2 bit output that comprises a precharge circuit 31, an evaluate circuit 36, and a logic tree circuit 107. One of the 2 bit input signals comprises a 1 of 4 signal with a plurality of input values <b>A₀, A₁, A₂,</b> and <b>A₃</b> and their associated wires that couple to the logic tree circuit 107 using a 1 of 4 encoding of the present invention. The other 2 bit input comprises a 1 of 4 signal with a plurality of input values <b>B₀, B₁, B₂,</b> and <b>B₃</b> and their associated wires that couple to the logic tree circuit 107 using a 1 of 4 encoding of the present invention. A 1 of 4 signal with a plurality of output values <b>V₀, V₁, V₂,</b> and <b>V₃</b> and their associated wires for the 2 bit output couple to the logic tree circuit 107 using the 1 of 4 encoding of the present invention. Each output signal may comprise an inverting output buffer 34 on the associated wires of the signal. To reduce adding additional capacitance to the device, the preferred embodiment of the present invention uses a single, shared logic tree with multiple evaluation paths for evaluating the function of the logic circuit and for generating the plurality output signals coupled to the logic circuit.

The precharge circuit 31 has a plurality of P-FETs to quickly and fully precharge all of the dynamic logic in the logic tree circuit during the precharge phase of the clock cycle with each evaluation path of the logic tree circuit having its own precharge P-FET. Coupled to the precharge circuit 31 is a clock signal <b>CK</b>. When the clock signal is low, the precharge tree circuit 31 precharges the N-FETs in the logic tree circuit 107.

The evaluate circuit 36 has a single evaluation transistor, which aids in the speed of the clocking of the device and helps avoid races between other devices. Other embodiments of the present invention may use multiple evaluation devices. Coupled to the evaluate circuit 36 is the clock signal <b>CK.</b> When the clock signal is high, the evaluate circuit 36 evaluates the logic tree circuit 107.

The maximum stack height of this embodiment of the present invention is 2 transistors. For example, the transistors <b>B₂</b> and <b>A₂</b> reside on one evaluation path. The transistor <b>A₃</b> on an evaluation path is an example of a stack height of 1.

The logic tree circuit 107 of this embodiment of the present invention performs the OR/NOR logic function with the following output table for the OR function: <tables id="tabl0011" num="0011"><table frame="all"><tgroup cols="12"><colspec colnum="1" colname="col1" colwidth="10mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><colspec colnum="6" colname="col6" colwidth="10mm" /><colspec colnum="7" colname="col7" colwidth="10mm" /><colspec colnum="8" colname="col8" colwidth="10mm" /><colspec colnum="9" colname="col9" colwidth="10mm" /><colspec colnum="10" colname="col10" colwidth="10mm" /><colspec colnum="11" colname="col11" colwidth="10mm" /><colspec colnum="12" colname="col12" colwidth="10mm" /><thead><row><entry namest="col1" nameend="col12" align="center" valign="top"><b>TABLE 11</b></entry></row><row><entry align="center" valign="top"><b>A₃</b></entry><entry align="center" valign="top"><b>A₂</b></entry><entry align="center" valign="top"><b>A₁</b></entry><entry align="center" valign="top"><b>A₀</b></entry><entry align="center" valign="top"><b>B₃</b></entry><entry align="center" valign="top"><b>B₂</b></entry><entry align="center" valign="top"><b>B₁</b></entry><entry align="center" valign="top"><b>B₀</b></entry><entry align="center" valign="top"><b>V₃</b></entry><entry align="center" valign="top"><b>V₂</b></entry><entry align="center" valign="top"><b>V₁</b></entry><entry align="center" valign="top"><b>V₀</b></entry></row></thead><tbody><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row></tbody></tgroup></table></tables>

<figref idref="f0005">FIG.7</figref> is a circuit diagram of one embodiment of the present invention for the AND/NAND function using a 1 of 4 signal with 1 of 4 encoding. One skilled in the art will appreciate that one function is the inverse of the other function. A device 108 is a dit (2 bit) device that has two 2 bit inputs and a 2 bit output that comprises a precharge tree circuit 31, an evaluate device 36, and a logic tree circuit 109. A 1 of 4 signal with a plurality of input values <b>A₀ A₁ A₂,</b> and <b>A₃</b> and their associated wires for the first 2 bit input couples to the logic tree circuit 109 using a 1 of 4 encoding of the present invention. A 1 of 4 signal with a plurality of input values <b>B₀, B₁, B₂,</b> and <b>B₃ and</b> their associated wires for the second 2 bit input couples to the logic tree circuit 109 using a 1 of 4 encoding of the present invention. A 1 of 4 signal with a plurality of output values <b>W₀, W₁, W₂,</b> and <b>W₃</b> and their associated wires for the 2 bit output couples to the logic tree circuit 109 using the 1 of 4 encoding of the present invention. Each output signal may comprise an inverting output buffer 34 on the associated wires of the signal. The device 108 uses a shared logic tree and shared input signals with separate evaluation paths to generate all of the outputs for the specified function. And, the maximum stack height of this embodiment of the present invention is 2 transistors.

The precharge circuit 31 has a plurality of P-FETs to quickly and fully precharge all of the dynamic logic in the logic tree circuit during the precharge phase of the clock cycle with each evaluation path of the logic tree circuit having its own precharge P-FET. Coupled to the precharge circuit 31 is a clock signal <b>CK.</b> When the clock signal is low, the precharge circuit 31 precharges the N-FETs in the logic tree circuit 109.

The evaluate circuit 36 has a single evaluation transistor, which aids in the speed of the clocking of the device and helps avoid races between other devices. Coupled to the evaluate circuit 36 is the clock signal <b>CK.</b> When the clock signal is high, the evaluate circuit 36 evaluates the logic tree circuit 109.

The logic tree circuit 109 of this embodiment of the present invention performs the AND/NAND logic function with the following output table for the AND function: <tables id="tabl0012" num="0012"><table frame="all"><tgroup cols="12"><colspec colnum="1" colname="col1" colwidth="10mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><colspec colnum="6" colname="col6" colwidth="10mm" /><colspec colnum="7" colname="col7" colwidth="10mm" /><colspec colnum="8" colname="col8" colwidth="10mm" /><colspec colnum="9" colname="col9" colwidth="10mm" /><colspec colnum="10" colname="col10" colwidth="10mm" /><colspec colnum="11" colname="col11" colwidth="10mm" /><colspec colnum="12" colname="col12" colwidth="10mm" /><thead><row><entry namest="col1" nameend="col12" align="center" valign="top"><b>TABLE 12</b></entry></row><row><entry align="center" valign="top"><b>A₃</b></entry><entry align="center" valign="top"><b>A₂</b></entry><entry align="center" valign="top"><b>A₁</b></entry><entry align="center" valign="top"><b>A₀</b></entry><entry align="center" valign="top"><b>B₃</b></entry><entry align="center" valign="top"><b>B₂</b></entry><entry align="center" valign="top"><b>B₁</b></entry><entry align="center" valign="top"><b>B₀</b></entry><entry align="center" valign="top"><b>W₃</b></entry><entry align="center" valign="top"><b>W₂</b></entry><entry align="center" valign="top"><b>W₁</b></entry><entry align="center" valign="top"><b>W₀</b></entry></row></thead><tbody><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row></tbody></tgroup></table></tables>

<figref idref="f0006">FIG.8</figref> is a circuit diagram of one embodiment of the present invention for the XOR/Equivalence function using a 1 of 4 encoding. One skilled in the art will appreciate that one function is the inverse of the other function. A device 110 is a dit (2 bit) device that has two 2 bit inputs and a 2 bit output that comprises a precharge circuit 31, an evaluate circuit 36, and a logic tree circuit 111. A 1 of 4 signal with a plurality of input values <b>A₀, A₁, A₂,</b> and <b>A₃</b> and their associated wires for the first 2 bit input couples to the logic tree circuit 107 using a 1 of 4 encoding of the present invention. A 1 of 4 signal with a plurality of input values <b>B₀, B₁, B₂,</b> and <b>B₃</b> and their associated wires for the second 2 bit input couples to the logic tree circuit 111 using a 1 of 4 encoding of the present invention. A 1 of 4 signal with a plurality of output values <b>Y₀, Y₁, Y₂,</b> and <b>Y₃</b> and their associated wires for the 2 bit output couples to the logic tree circuit 111 using the 1 of 4 encoding of the present invention. Each output signal may comprise an inverting output buffer 34 on the associated wire of the signal. The device 110 uses a shared logic tree and shared input signals with separate evaluation paths to generate all of the outputs for the specified function. And, the maximum stack height of this embodiment of the present invention is 2 transistors.

The precharge circuit 31 has a plurality of P-FETs to quickly and fully precharge all of the dynamic logic in the logic tree circuit during the precharge phase of the clock cycle with each evaluation path of the logic tree circuit having its own precharge P-FET. Coupled to the precharge circuit 31 is a clock signal <b>CK</b>. When the clock signal is low, the precharge circuit 31 precharges the N-FETs in the logic tree circuit 111.

The evaluate circuit 36 has a single evaluation transistor, which aids in the speed of the clocking of the device and helps avoid races between other devices. Coupled to the evaluate circuit 36 is the clock signal <b>CK</b>. When the clock signal is high, the evaluate circuit 36 evaluates the logic tree circuit 111.

The logic tree circuit 111 of this embodiment of the present invention performs the XOR/Equivalence logic function with the following output table for the XOR function: <tables id="tabl0013" num="0013"><table frame="all"><tgroup cols="12"><colspec colnum="1" colname="col1" colwidth="10mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><colspec colnum="6" colname="col6" colwidth="10mm" /><colspec colnum="7" colname="col7" colwidth="10mm" /><colspec colnum="8" colname="col8" colwidth="10mm" /><colspec colnum="9" colname="col9" colwidth="10mm" /><colspec colnum="10" colname="col10" colwidth="10mm" /><colspec colnum="11" colname="col11" colwidth="10mm" /><colspec colnum="12" colname="col12" colwidth="10mm" /><thead><row><entry namest="col1" nameend="col12" align="center" valign="top"><b>TABLE 13</b></entry></row><row><entry align="center" valign="top"><b>A₃</b></entry><entry align="center" valign="top"><b>A₂</b></entry><entry align="center" valign="top"><b>A₁</b></entry><entry align="center" valign="top"><b>A₀</b></entry><entry align="center" valign="top"><b>B₃</b></entry><entry align="center" valign="top"><b>B₂</b></entry><entry align="center" valign="top"><b>B₁</b></entry><entry align="center" valign="top"><b>B₀</b></entry><entry align="center" valign="top"><b>Y₃</b></entry><entry align="center" valign="top"><b>Y₂</b></entry><entry align="center" valign="top"><b>Y₁</b></entry><entry align="center" valign="top"><b>Y₀</b></entry></row></thead><tbody><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row></tbody></tgroup></table></tables>

<figref idref="f0007">FIG.9</figref> illustrates one embodiment of the present invention using two sets of 1 of 3 signals for the input signals and a 1 of 3 signal for the output signal with all 1 of 3 signals using 1 of 3 encoding. This embodiment of the present invention describes a 2 bit logic gate where <b>a</b> is a 2 bit input, <b>b</b> is a 2 bit input, and <b>o</b> is a 2 bit output. We know from the design of this logic gate that the output function does not require all of the possible values in the truth table that are available in a 1 of 4 encoding. The reduction in possible values also allows us to use fewer wires in the circuit. Referring to <figref idref="f0007">FIG.9</figref>, a device 30 comprises a logic tree circuit 32, a precharge circuit 31, and an circuit device 36. Coupled to the logic tree circuit is the 2 bit input a that comprises a 1 of 3 signal with a plurality of input values <b>A₀</b>, <b>A₁</b>, and <b>A₂</b> and their associated wires using a 1 of 3 encoding. Additionally coupled to the logic tree circuit is the 2 bit input b that comprises a 1 of 3 signal with a plurality of input values <b>B₀, B₁,</b> and <b>B₂</b> and their associated wires using a 1 of 3 encoding. And, coupled to the logic tree circuit is the 2 bit output <b>o</b> that comprises a 1 of 3 signal with a plurality of output values <b>O₀, O₁,</b> and <b>O₂</b> using a 1 of 3 encoding. The logic tree circuit 32 performs a logic function on a plurality of input signals that could comprise a variety of functions, for example, the Boolean logic functions AND/NAND, OR/NOR, or XOR/Equivalence. The logic tree circuit 32 comprises one or more FETs with the preferred embodiment of the logic tree circuit comprising N-channel FETs.

Coupled to the wires of the 1 of 3 output signal are the output buffers 34 that aid in driving additional circuits that couple to the output signal. The preferred embodiment of the present invention uses an output buffer with an inverting function as the output buffer 34. Another embodiment of the present invention comprises a non-inverting buffer as the output buffer. And, another embodiment of the present invention does not use an output buffer; instead, the plurality of output signal couples directly to other circuits.

A precharge circuit 31 couples to the logic tree circuit 61 and precharges the dynamic logic of the logic tree circuit. The precharge circuit 31 has a plurality of P-FETs to quickly and fully precharge all of the dynamic logic in the logic tree circuit during the precharge phase of the clock cycle with each evaluation path of the logic tree circuit having its own precharge P-FET. Coupled to the precharge circuit 31 is the clock signal <b>CK</b>. A low clock signal on <b>CK</b> will cause the FETs in the logic tree circuit 32 to charge when using P-channel FETs in the precharge circuit.

An evaluate circuit 36 couples to the logic tree circuit and controls the evaluation of the logic tree circuit. The evaluate circuit 36 comprises one or more FETs with the preferred embodiment of the circuit comprising a single N-channel FET. Coupled to the evaluate circuit 36 is the clock signal <b>CK.</b> A high clock signal on <b>CK</b> will cause the FETs in the logic tree circuit 32 to evaluate when using N-channel FETs in the evaluate circuit.

<figref idref="f0007">FIG.10</figref> illustrates one embodiment of the present invention using two sets of 1 of 2 signals for the input signals and a 1 of 2 signal for the output signals all using 1 of 2 encoding. A device 42 comprises a precharge circuit 31, an evaluate circuit 36, and a logic tree circuit 43. The logic tree circuit 43 performs a logic function on the input signals. The logic function could comprise a variety of logic functions including Boolean logic functions such as AND/NAND, OR/NOR, or XOR/Equivalence. The device 42 is a two bit input <b>(a</b> and <b>b)</b> device with a one bit output (<b>o</b>). The two bit input comprises two sets of 1 of 2 signals each with a plurality of input values using 1 of 2 encoding, <b>A₀</b> and <b>A₁,</b> and <b>B₀</b> and B₁. The plurality of input signals couple to the logic tree circuit 43. And, coupled to the logic tree circuit is a 1 of 2 signal with a plurality of output values <b>O</b>₀ and <b>O</b>₁. Each wire of the output 1 of 2 signal may comprise an inverting output buffer 34 on the wire.

If the function of the logic tree circuit 43 is a Boolean OR function, then the logic table for the device 42 is the following: <tables id="tabl0014" num="0014"><table frame="all"><tgroup cols="9"><colspec colnum="1" colname="col1" colwidth="10mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><colspec colnum="6" colname="col6" colwidth="10mm" /><colspec colnum="7" colname="col7" colwidth="10mm" /><colspec colnum="8" colname="col8" colwidth="10mm" /><colspec colnum="9" colname="col9" colwidth="10mm" /><thead><row><entry namest="col1" nameend="col9" align="center" valign="top"><b>TABLE 12</b></entry></row><row><entry align="center" valign="top"><b>a</b></entry><entry align="center" valign="top"><b>b</b></entry><entry align="center" valign="top"><b>o</b></entry><entry align="center" valign="top"><b>A₀</b></entry><entry align="center" valign="top"><b>A₁</b></entry><entry align="center" valign="top"><b>B₀</b></entry><entry align="center" valign="top"><b>B₁</b></entry><entry align="center" valign="top"><b>O₀</b></entry><entry align="center" valign="top"><b>O₁</b></entry></row></thead><tbody><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row></tbody></tgroup></table></tables>

<figref idref="f0008">FIG.11</figref> is a circuit diagram of one embodiment of the present invention for the XOR/Equivalence function using a 1 of 2 encoding. One skilled in the art will appreciate that one function is the inverse of the other function. A device 100 is a 2 bit input and 1 bit output device that comprises a precharge circuit 31, an evaluate circuit 36, and a logic tree circuit 101. The device 100 comprises multiple signals using I of 2 signals using 1 of 2 encoding. One 1 of 2 signal (that corresponds to 1 bit) comprises a plurality of input values <b>A₀</b> and <b>A₁</b> with its associated wires that couples to the logic tree circuit 101, and the 1 of 2 signal (that corresponds to the other 1 bit input) that comprises a plurality of input values <b>B₀</b> and <b>B₁</b> and its associated wires that also couples to the logic tree circuit 101. Additionally, a 1 of 2 output signal with plurality of output values <b>O₀</b> and <b>O₁</b> and its associated wires couples to the logic tree circuit 101 using the 1 of 2 encoding of the present invention. Each wire of the output signal may comprise an inverting output buffer 34 on the associated wire. The preferred embodiment of the present invention uses a single, shared logic tree with multiple evaluation paths for evaluating the function of the logic circuit and for generating the plurality output signals coupled to the logic circuit.

The precharge circuit 31 has a plurality of P-FETs to quickly and fully precharge all of the dynamic logic in the logic tree circuit during the precharge phase of the clock cycle with each evaluation path of the logic tree circuit having its own precharge P-FET. Coupled to the precharge tree circuit 31 is a clock signal <b>CK.</b> When the clock signal is low, the precharge circuit 31 precharges the N-FETs in the logic tree circuit 101.

The evaluate circuit 36 has a single evaluation transistor, which aids in the speed of the clocking of the device and helps avoid races between other devices. Other embodiments of the present invention may use multiple evaluation devices. Coupled to the evaluate circuit 36 is the clock signal <b>CK.</b> When the clock signal is high, the evaluate circuit 36 evaluates the logic tree circuit 101.

The logic tree circuit 101 of this embodiment of the present invention performs the XOR/Equivalence logic function with the following output table for the XOR function: <tables id="tabl0015" num="0015"><table frame="all"><tgroup cols="6"><colspec colnum="1" colname="col1" colwidth="10mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><colspec colnum="6" colname="col6" colwidth="10mm" /><thead><row><entry namest="col1" nameend="col6" align="center" valign="top"><b>TABLE 13</b></entry></row><row><entry align="center" valign="top"><b>A₀</b></entry><entry align="center" valign="top"><b>A₁</b></entry><entry align="center" valign="top"><b>B₀</b></entry><entry align="center" valign="top"><b>B₁</b></entry><entry align="center" valign="top"><b>O₀</b></entry><entry align="center" valign="top"><b>O₁</b></entry></row></thead><tbody><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row></tbody></tgroup></table></tables>

<figref idref="f0009">FIG.12</figref> is a circuit diagram of one embodiment of the present invention for the OR/NOR function using 1 of 2 signals with 1 of 2 encoding. One skilled in the art will appreciate that one function is the inverse of the other function. A device 102 is a 2 bit input and 1 bit output device that comprises a precharge circuit 31, an evaluate circuit 36, and a logic tree circuit 103. A 1 of 2 signal with a plurality of input values <b>A₀, A₁</b> and a 1 of 2 signal with a plurality of input values <b>B₀</b> and <b>B₁</b> couples to the logic tree circuit 103 using a 1 of 2 encoding of the present invention. A1 of 2 signal with a plurality of output values <b>O₀</b> and <b>O₁</b> couples to the logic tree circuit 103 using the 1 of 2 encoding of the present invention. Each wire of the output signal may comprise an inverting output buffer 34 on the associated wire. The device 102 uses a single shared logic tree and shared input signals with separate evaluation paths to generate all of the outputs for the specified function.

The precharge circuit 31 has a plurality of P-FETs to quickly and fully precharge all of the dynamic logic in the logic tree circuit during the precharge phase of the clock cycle with each evaluation path of the logic tree circuit having its own precharge P-FET. Coupled to the precharge circuit 31 is a clock signal <b>CK.</b> When the clock signal is low, the precharge circuit 31 precharges the N-FETs in the logic tree circuit 103.

The evaluate circuit 36 has a single evaluation transistor, which aids in the speed of the clocking of the device and helps avoid races between other devices. Coupled to the evaluate circuit 36 is the clock signal <b>CK.</b> When the clock signal is high, the evaluate circuit 36 evaluates the logic tree circuit 103.

The logic tree circuit 103 of this embodiment of the present invention performs the OR/NOR logic function with the following output table for the OR function: <tables id="tabl0016" num="0016"><table frame="all"><tgroup cols="6"><colspec colnum="1" colname="col1" colwidth="10mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><colspec colnum="6" colname="col6" colwidth="10mm" /><thead><row><entry namest="col1" nameend="col6" align="center" valign="top"><b>TABLE 16</b></entry></row><row><entry align="center" valign="top"><b>A₀</b></entry><entry align="center" valign="top"><b>A₁</b></entry><entry align="center" valign="top"><b>B₀</b></entry><entry align="center" valign="top"><b>B₁</b></entry><entry align="center" valign="top"><b>O₀</b> I</entry><entry align="center" valign="top"><b>O₁</b></entry></row></thead><tbody><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row></tbody></tgroup></table></tables>

<figref idref="f0009">FIG.13</figref> is a circuit diagram of one embodiment of the present invention for the AND/NAND function using a 1 of 2 signal with a 1 of 2 encoding. One skilled in the art will appreciate that one function is the inverse of the other function. A device 104 is a 2 bit input and I bit output device that comprises a precharge circuit 31, an evaluate circuit 36, and a logic tree circuit 105. A 1 of 2 signal with a plurality of input values <b>A₀, A₁</b> and a 1 of 2 signal with a plurality of input values <b>B₀</b> and <b>B₁</b> couple to the logic tree circuit 105 using a 1 of 2 encoding of the present invention. A 1 of 2 signal with a plurality of output values <b>O₀</b> and <b>O₁</b> couples to the logic tree circuit 105 using the 1 of 2 encoding of the present invention. Each wire of the output signal may comprise an inverting output buffer 34 on the associated wire. The device 104 uses a single shared logic tree and shared input signals with separate evaluation paths to generate all of the outputs for the specified function.

The precharge circuit 31 has a plurality of P-FETs to quickly and fully precharge all of the dynamic logic in the logic tree circuit during the precharge phase of the clock cycle with each evaluation path of the logic tree circuit having its own precharge P-FET. Coupled to the precharge circuit 31 is a clock signal <b>CK.</b> When the clock signal is low, the precharge circuit 31 precharges the N-FETs in the logic tree circuit 105.

The evaluate circuit 36 has a single evaluation transistor, which aids in the speed of the clocking of the device and helps avoid races between other devices. Coupled to the evaluate circuit 36 is the clock signal <b>CK.</b> When the clock signal is high, the evaluate circuit 36 evaluates the logic tree circuit 105.

The logic tree circuit 105 of this embodiment of the present invention performs the AND/NAND logic function with the following output table for the AND function: <tables id="tabl0017" num="0017"><table frame="all"><tgroup cols="6"><colspec colnum="1" colname="col1" colwidth="10mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><colspec colnum="6" colname="col6" colwidth="10mm" /><thead><row><entry namest="col1" nameend="col6" align="center" valign="top"><b>TABLE 17</b></entry></row><row><entry align="center" valign="top"><b>A₀</b></entry><entry align="center" valign="top"><b>A₁</b></entry><entry align="center" valign="top"><b>B₀</b></entry><entry align="center" valign="top"><b>B₁</b></entry><entry align="center" valign="top"><b>O₀</b></entry><entry align="center" valign="top"><b>O₁</b></entry></row></thead><tbody><row><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">0</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">0</entry><entry align="center">1</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry></row><row><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry><entry align="center">1</entry><entry align="center">0</entry></row></tbody></tgroup></table></tables>

<figref idref="f0010">FIG. 14</figref> illustrates one embodiment of the present invention using two sets of 1 of 8 signals for the input signals and a 1 of 8 signal for the output signal with all signals using 1 of 8 encoding. This embodiment of the present invention describes a 8 wire logic gate where <b>a</b> is a 1 of 8 input signal, <b>b</b> is a 1 of 8 input signal, and <b>o</b> is a 1 of 8 output signal. Referring to <figref idref="f0010">FIG. 14</figref>, a device 200 comprises a logic tree circuit 201, a precharge circuit 31, and an evaluate circuit 36. Coupled to the logic tree circuit is the 1 of 8 signal a that comprises a plurality of input values <b>A₀, A₁, A₂, A₃, A₄, A₅, A₆,</b> and <b>A₇</b> and their associated wires using a 1 of 8 encoding. Additionally coupled to the logic tree circuit is the 1 of 8 signal <b>b</b> that comprises a plurality of input values <b>B₀, B₁, B₂, B₃, B₄, B₅, B₆,</b> and <b>B₇</b> and their associated wires using a 1 of 8 encoding. And, coupled to the logic tree circuit is the 1 of 8 output signal o that comprises a plurality of output values <b>O₀, O₁, O₂, O₃, O₄, O₅, O₆,</b> and <b>O₇</b> using a 1 of 8 encoding. The logic tree circuit 201 performs a logic function on a plurality of input signals that could comprise a variety of functions, for example, the Boolean logic functions AND/NAND, OR/NOR, or XOR/Equivalence. The logic tree circuit 201 comprises one or more FETs with the preferred embodiment of the logic tree circuit comprising N-channel FETs.

Coupled to the wires of the plurality of output signals are the output buffers 34 that aid in driving additional circuits that couple to the individual wires of the output signal. The preferred embodiment of the present invention uses an output buffer with an inverting function as the output buffer 34. Another embodiment of the present invention comprises a non-inverting buffer as the output buffer. And, another embodiment of the present invention does not use an output buffer; instead, the output signal couples directly to other circuits.

A precharge circuit 31 couples to the logic tree circuit 61 and precharges the dynamic logic of the logic tree circuit. The precharge circuit 31 has a plurality of P-FETs to quickly and fully precharge all of the dynamic logic in the logic tree circuit during the precharge phase of the clock cycle with each evaluation path of the logic tree circuit having its own precharge P-FET. Coupled to the precharge circuit 31 is the clock signal <b>CK.</b> A low clock signal on <b>CK</b> will cause the FETs in the logic tree circuit 32 to charge when using P-channel FETs in the precharge circuit.

An evaluate circuit 36 couples to the logic tree circuit and controls the evaluation of the logic tree circuit. The evaluate circuit 36 comprises one or more FETs with the preferred embodiment of the circuit comprising a single N-channel FET. Coupled to the evaluate circuit 36 is the clock signal <b>CK.</b> A high clock signal on <b>CK</b> will cause the FETs in the logic tree circuit 32 to evaluate when using N-channel FETs in the evaluate circuit.

<figref idref="f0011">FIG.15</figref> illustrates the present invention that comprises a method and apparatus for an N-NARY logic circuit using a 1 ofN encoding. An embodiment of the present invention generally comprises a device 210 that further comprises a logic tree circuit 211, a precharge circuit 31, and an evaluate circuit 36. Coupled to the logic tree circuit is the 1 of N input signal a that comprises a plurality of input values <b>A₀</b> through <b>A_N-1</b> and their associated wires using a 1 of N encoding. Additionally coupled to the logic tree circuit is the 1 of N input signal <b>b</b> that comprises a plurality of input values <b>B₀</b> through <b>B_N-1</b> and their associated wires using a 1 of N encoding. And, coupled to the logic tree circuit is the 1 of N output signal o that comprises a plurality of output values <b>O₀</b> through <b>O_N-1</b> using a 1 of N encoding. Some embodiments of the present invention provide for all of the signals to be of the same type of 1 of N signal, while other embodiments provide for mixing different types of 1 of N signals. The logic tree circuit 21 performs a logic function on a plurality of input signals that could comprise a variety of functions, for example, the Boolean logic functions AND/NAND, OR/NOR, or XOR/Equivalence.

<figref idref="f0012">FIG. 16</figref> is a circuit diagram of an embodiment of the present invention for multiple functions selected with a MUX, for example, a 3:1 dit MUX using N-NARY logic. This embodiment of the present invention uses AND, OR, and XOR as its functions, although the present invention may use other functions as well. A device 220 comprises a precharge circuit 31, a logic tree circuit 221, and an evaluate circuit 36. The precharge circuit and the evaluate circuit operate as previously described. This device uses discrete gates to compute each function separately, and then uses a MUX to select the desired function. Each gate in the first level of device 220 takes two 1 of 4 signals corresponding to input signals <b>a</b> and <b>b</b> as inputs, and produces a 1 of 4 output signal representing its particular function of those inputs. Referring to <figref idref="f0012">FIG.16</figref>, the first level gates that produce the 1 of 4 signal with the plurality of values <b>V₀, V₁, V₂,</b> and <b>V₃</b> could be the OR gate of <figref idref="f0004">FIG.6</figref>, the first level gates that produce the 1 of 4 signal with the plurality of values <b>W₀, W₁, W₂,</b> and <b>W₃</b> could be the AND gate of <figref idref="f0005">FIG.7</figref>, and the first level gates that produce the 1 of 4 signal with the plurality of signals <b>Y₀</b>, <b>Y₁, Y₂,</b> and <b>Y₃</b> could be the XOR gate of <figref idref="f0006">FIG.8</figref>. The second level of the MUX device 220 uses the above three 1 of 4 function results computed in the first level as input signals to the MUX select device. To select a particular function, logic tree circuit 221 uses the 1 of 3 input signals with a plurality values <b>AND, OR,</b> and <b>XOR</b> to select the respective and named function AND, OR, and XOR. The output of device 220 is the 1 of 4 output signal with a plurality of values <b>Z₀, Z₁, Z₂,</b> and <b>Z₃.</b>

<figref idref="f0013 f0014">FIG.17</figref> is a circuit diagram of an embodiment of the present invention for multiple functions selected with a MUX using a single gate for the functions. This embodiment of the present invention uses AND, OR, and XOR as its functions, although the present invention may use other functions as well. A device 230 comprises a precharge circuit 31, a logic tree circuit 231, and an evaluate circuit 36. The precharge circuit and the evaluate circuit operate as previously described. This device performs the same functionality as the device in <figref idref="f0012">FIG.16</figref>, however, this device is more efficient than the device in <figref idref="f0012">FIG.16</figref> because it leverages the fact that certain combinations of inputs and outputs produce the same results for several of the functions (for example, AND with 3, OR with 0, and XOR with 0). This allows us to share nodes in the evaluate tree, which reduces the overall transistor count. Another efficiency is that the MUXed selection of the function to perform is part of the actual gate itself instead of in separate devices as in <figref idref="f0012">FIG.16</figref>. This eliminates the need for a MUX in a separate level, which also considerably reduces the output driver requirements since no intermediate outputs are produced. This design requires a stack height of three versus the two of the previous example, which suggests that this gate will take a little longer to evaluate than the individual gates of the previous example.

The present invention is a method and apparatus for a two bit logic circuit that uses 1 of 4 signals with 1 of 4 encoding where one and only one of the four logic paths is active during an evaluation cycle. The present invention comprises a logic tree circuit that couples to a first 1 of 4 input signal with a set of logic paths, a second 1 of 4 input signal with a set of logic paths, and a 1 of 4 output signal with a set of logic paths, which all use 1 of 4 encoding. The preferred embodiment of the present invention uses 1 of 4 encoding. Other embodiments of present invention include the use of 1 of 2 signals with 1 of 2 encoding, 1 of 3 signals with 1 of 3 encoding, 1 of 8 signals with 1 of 8 encoding, and the general embodiment of 1 ofN signals with 1 ofN encoding. The logic tree circuit evaluates a given function that includes, for example, an AND/NAND function, an OR/NOR function, or an XOR/Equivalence function. The logic tree circuit uses a single, shared logic tree with multiple evaluation paths for evaluating the function of the logic circuit. The device of the present invention further comprises a precharge circuit that precharges the transistors in the logic tree circuit and an evaluate circuit that controls the logic tree circuit's evaluation where both couple to the logic tree circuit. And finally, a clock signal couples to the precharge circuit and the evaluate circuit.

The present invention additionally comprises a method and apparatus for an integrated circuit (IC) that uses I of N signals to reduce both the circuit's power consumption and the circuit's wire to wire capacitance. The present invention comprises a logic tree circuit coupled to a first I ofN input signal, a second 1 of N input signal, and a 1 of N output signal where the 1 of N signals' reduce the signal's power consumption and wire to wire capacitance. Other embodiments of the present invention include the use of a I of 2 signal, 1 of 3 signal, a 1 of 4 signal, and a 1 of 8 signal where one and one of the wires of the signal is active.

The present invention additionally comprises a method and apparatus for routing 2 bits of information with a datapath in a semiconductor device using a I of 4 signal. The present invention comprises a first, second, third, and fourth wire for routing a 1 of 4 signal with 1 of 4 encoding in a semiconductor device. One and only one wire of the first, second, third, or fourth wire is active during the evaluation cycle and each active wire represents 2 bits worth of information. Additionally, one and only one wire of the first, second, third, or fourth wire is active during a precharge cycle. The datapath may couple to a logic device. And, other embodiments of the present invention include the ability to route non-inverting signals.

Other embodiments of the invention will be apparent to those skilled in the art after considering this specification or practicing the disclosed invention. The specification and examples above are exemplary only, with the true scope of the invention being indicated by the following claims.

PREFERRED FEATURES

<ul id="ul0002" list-style="none"><li>1. An N-NARY logic circuit that uses N-NARY signals, comprising : <ul id="ul0003" list-style="none" compact="compact"><li>a shared logic tree circuit that evaluates one or more N-NARY input signals and produces an N-NARY output signal;</li><li>a first N-NARY input signal coupled to said shared logic tree circuit;</li><li>a second N-NARY input signal coupled to said shared logic tree circuit ; and</li><li>an N-NARY output signal coupled to said shared logic tree circuit.</li></ul></li><li>2. The N-NARY logic circuit of clause 1 wherein said shared logic tree circuit evaluates the function selected from the functions comprising AND/NAND, OR/NOR, or XOR/Equivalence.</li><li>3. The N-NARY logic circuit of clause 1 that further comprises a single evaluation device coupled to said shared logic tree circuit.</li><li>4. The N-NARY logic circuit of clause 1 wherein an N-NARY signal further comprises a not valid value wherein zero wires of the bundle of N wires of said N-NARY signal is true.</li><li>5. The N-NARY logic circuit of clause 1 wherein said first input N-NARY signal, said second input N-NARY signal, or said output N-NARY signal comprises a 1 of 4 N-NARY signal.</li><li>6. The N-NARY logic circuit of clause 1 wherein said first input N-NARY signal, said second input N-NARY signal, or said output N-NARY signal comprises a 1 of 3 N-NARY signal.</li><li>7. A system that evaluates an N-NARY logic circuit that uses N-NARY signals, comprising : <ul id="ul0004" list-style="none" compact="compact"><li>a shared logic tree circuit that evaluates one or more N-NARY input signals and produces an N-NARY output signal;</li><li>a first N-NARY input signal coupled to said shared logic tree circuit;</li><li>a second N-NARY input signal coupled to said shared logic tree circuit ; and</li><li>an N-NARY output signal coupled to said shared logic tree circuit.</li></ul></li><li>8. The system of clause 7 wherein said shared logic tree circuit evaluates the function selected from the functions comprising AND/NAND, OR/NOR, or XOR/Equivalence 9. The system of claim 7 that further comprises a single evaluation device coupled to said shared logic tree circuit.</li><li>10. The system of clause 7 wherein an N-NARY signal further comprises a not valid value wherein zero wires of the bundle of N wires of said N-NARY signal is true.</li><li>11. The system of clause 7 wherein said first input N-NARY signal, said second input N-NARY signal, or said output N-NARY signal comprises a 1 of 4 N-NARY signal.</li><li>12. The system of clause 7 wherein said first input N-NARY signal, said second input N-NARY signal, or said output N-NARY signal comprises a 1 of 3 N-NARY signal.</li><li>13. A method that evaluates an N-NARY logic circuit that uses N-NARY signals, comprising : <ul id="ul0005" list-style="none" compact="compact"><li>receiving a first N-NARY input coupled to a shared logic tree circuit;</li><li>receiving a second N-NARY input signal coupled to said shared logic tree circuit ;</li><li>evaluating said first N-NARY input signal and said second N-NARY input signal with said shared logic tree circuit ; and</li><li>producing an N-NARY output signal from said shared logic tree circuit's evaluation, said output 1 of N signal couples to said shared logic tree circuit.</li></ul></li><li>14. The method of clause 13 wherein said shared logic tree circuit evaluates the function selected from the functions comprising AND/NAND, OR/NOR, or XOR/Equivalence.</li><li>15. The method of clause 13 that further comprises a single evaluation device coupled to said shared logic tree circuit.</li><li>16. The method of clause 13 wherein an N-NARY signal further comprises a not valid value wherein zero wires of the bundle of N wires of said N-NARY signal is true.</li><li>17. The method of clause 13 wherein said first input N-NARY signal, said second input N-NARY signal, or said output N-NARY signal comprises a 1 of 4 N-NARY signal.</li><li>18. The method of clause 13 wherein said first input N-NARY signal, said second input N-NARY signal, or said output N-NARY signal comprises a 1 of 3 N-NARY signal</li><li>19. A method that provides an N-NARY logic circuit with N-NARY signals, comprising :providing a shared logic tree circuit that evaluates one or more N-NARY input signals and produces an N-NARY output signal; coupling a first N-NARY input signal to said shared logic tree circuit; coupling a second N-NARY input signal to said shared logic tree circuit ; and coupling an N-NARY output signal to said shared logic tree circuit.</li><li>20. The method of clause 19 wherein said shared logic tree circuit evaluates the function selected from the functions comprising AND/NAND, OR/NOR, or XOR/Equivalence.</li><li>21. The method of clause 19 that further comprises a single evaluation device coupled to said shared logic tree circuit.</li><li>22. The method of clause 19 wherein an N-NARY signal further comprises a not valid value wherein zero wires of the bundle of N wires of said N-NARY signal is true.</li><li>23. The method of clause 19 wherein said first input N-NARY signal, said second input N-NARY signal, or said output N-NARY signal comprises a 1 of 4 N-NARY signal.</li><li>24. The method of clause 19 wherein said first input N-NARY signal, said second input N-NARY signal, or said output N-NARY signal comprises a 1 of 3 N-NARY signal.</li><li>25. An N-NARY logic circuit that uses 1 of N signals with 1 of N encoding, comprising : <ul id="ul0006" list-style="none" compact="compact"><li>a shared logic tree circuit that evaluates one or more input signals and produces an output signal;</li><li>a first input 1 of N signal coupled to said shared logic tree circuit wherein said first input 1 of N signal comprises a first bundle of N wires routed together between different cells and use a 1 of N encoding to indicate multiple values of information conveyed by said first bundle of N wires and where at most one and only one wire of said first bundle of N wires is true during an evaluation cycle;</li><li>a second input 1 of N signal coupled to said shared logic tree circuit wherein said second input 1 of N signal comprises a second bundle of N wires routed together between different cells and use a 1 of N encoding to indicate multiple values of information conveyed by said second bundle of N wires and where at most one and only one wire of said second bundle of N wires is true during said evaluation cycle;</li><li>an output 1 of N signal coupled to said shared logic tree circuit wherein said output 1 of N signal comprises a third bundle of N wires routed together between different cells and use a 1 of N encoding to indicate multiple values of information conveyed by said third bundle of N wires and where at most one and only one wire of said third bundle of N wires is true during said evaluation cycle.</li></ul></li><li>26. The logic circuit of clause 25 wherein said shared logic tree circuit evaluates the function selected from the functions comprising AND/NAND, OR/NOR, or XOR/Equivalence.</li><li>27. The logic circuit of clause 25 that further comprises a single evaluation device coupled to said shared logic tree circuit.</li><li>28. The logic circuit of clause 25 wherein said 1 of N encoding further comprises a not valid value wherein zero wires of said first bundle of N wires, said second bundle of N wires, or said third bundles of N wires are true.</li><li>29. The logic circuit of clause 25 wherein said 1 of N signal of said first input 1 of N signal, said second input 1 of N signal, or said output 1 of N signal comprises a 1 of 4 signal comprising a bundle of 4 wires routed together.</li><li>30. The logic circuit of clause 25 wherein said 1 of N signal of said first input 1 of N signal, said second input 1 of N signal, or said output 1 of N signal comprises a 1 of 3 signal comprising a bundle of 3 wires routed together.</li><li>31. A system that evaluates an N-NARY logic circuit that uses 1 of N signals with 1 of N encoding, comprising: <ul id="ul0007" list-style="none" compact="compact"><li>a shared logic tree circuit that evaluates one or more input signals and produces an output signal ;</li><li>a first input 1 of N signal coupled to said shared logic tree circuit wherein said first input 1 of N signal comprises a first bundle of N wires routed together between different cells and use a 1 of N encoding to indicate multiple values of information conveyed by said first bundle of N wires and where at most one and only one wire of said first bundle of N wires is true during an evaluation cycle;</li><li>a second input 1 of N signal coupled to said shared logic tree circuit wherein said second input 1 of N signal comprises a second bundle of N wires routed together between different cells and use a 1 of N encoding to indicate multiple values of information conveyed by said second bundle of N wires and where at most one and only one wire of said second bundle of N wires is true during said evaluation cycle; and</li><li>an output 1 of N signal coupled to said shared logic tree circuit wherein said output 1 of N signal comprises a third bundle of N wires routed together between different cells and use a 1 of N encoding to indicate multiple values of information conveyed by said third bundle of N wires and where at most one and only one wire of said third bundle of N wires is true during said evaluation cycle.</li></ul></li><li>32. The system of clause 31 wherein said logic evaluation means shared logic tree circuit evaluates the function selected from the functions comprising AND/NAND, OR/NOR, or XOR/Equivalence.</li><li>33. The system of clause 31 that further comprises a single evaluation device coupled to said shared logic tree circuit.</li><li>34. The system of clause 31 wherein said 1 of N encoding further comprises a not valid value wherein zero wires of said first bundle of N wires, said second bundle of N wires, or said third bundles of N wires are true.</li><li>35. The system of clause 31 wherein said 1 of N signal of said first input 1 of N signal, said second input 1 of N signal, or said output 1 of N signal comprises a 1 of 4 signal comprising a bundle of 4 wires routed together.</li><li>36. The system of clause 31 wherein said 1 of N signal of said first input 1 of N signal, said second input 1 of N signal, or said output 1 of N signal comprises a 1 of 3 signal comprising a bundle of 3 wires routed together.</li><li>37. A method that evaluates an N-NARY logic circuit that uses 1 of N signals with 1 of N encoding: <ul id="ul0008" list-style="none" compact="compact"><li>receiving a first input 1 of N signal coupled to a shared logic tree circuit wherein said first input 1 of N signal comprises a first bundle of N wires routed together between different cells and use a 1 of N encoding to indicate multiple values of information conveyed by said first bundle of N wires and where at most one and only one wire of said first bundle of N wires is true during an evaluation cycle;</li><li>receiving a second input 1 of N signal coupled to said shared logic tree circuit wherein said second input 1 of N signal comprises a second bundle of N wires routed together between different cells and use a 1 of N encoding to indicate multiple values of information conveyed by said second bundle of N wires and where at most one and only one wire of said second bundle of N wires is true during said evaluation cycle;</li><li>evaluating said first input 1 of N signal and said second input 1 of N signal with said shared logic tree circuit; and</li><li>producing an output 1 of N signal from said shared logic tree circuit's evaluation, said output 1 of N signal couples to said shared logic tree circuit wherein said output 1 of N signal comprises a third bundle of N wires routed together between different cells and use a 1 of N encoding to indicate multiple values of information conveyed by said third bundle of N wires and where at most one and only one wire of said third bundle of N wires is true during said evaluation cycle.</li></ul></li><li>38. The method of clause 37 wherein said shared logic tree circuit evaluates the function selected from the functions comprising AND/NAND, OR/NOR, or XOR/Equivalence.</li><li>39. The method of clause 37 that further comprises a single evaluation device coupled to said shared logic tree circuit.</li><li>40. The method of clause 37 wherein said 1 of N encoding further comprises a not valid value wherein zero wires of said first bundle of N wires, said second bundle of N wires, or said third bundles of N wires are true.</li><li>41. The method of clause 37 wherein said 1 of N signal of said first input 1 of N signal, said second input 1 of N signal, or said output 1 of N signal comprises a 1 of 4 signal comprising a bundle of 4 wires routed together.</li><li>42. The method of clause 37 wherein said 1 of N signal of said first input 1 of N signal, said second input 1 of N signal, or said output 1 of N signal comprises a 1 of 3 signal comprising a bundle of 3 wires routed together.</li><li>43. A method that provides an N-NARY logic circuit with 1 of N signals using 1 of N encoding, comprising: <ul id="ul0009" list-style="none" compact="compact"><li>providing a shared logic tree circuit that evaluates one or more input signals and produces an output signal;</li><li>coupling a first input 1 of N signal to said shared logic tree circuit wherein said first input 1 of N signal comprises a first bundle of N wires routed together between different cells and use a 1 of N encoding to indicate multiple values of information conveyed by said first bundle of N wires and where at most one and only one wire of said first bundle of N wires is true during an evaluation cycle;</li><li>coupling a second input 1 of N signal to said shared logic tree circuit wherein said second input 1 of N signal comprises a second bundle of N wires routed together between different cells and use a 1 of N encoding to indicate multiple values of information conveyed by said second bundle of N wires and where at most one and only one wire of said second bundle of N wires is true during said evaluation cycle; and</li><li>coupling an output 1 of N signal to said shared logic tree circuit wherein said output 1 of N signal comprises a third bundle of N wires routed together between different cells and use a 1 of N encoding to indicate multiple values of information conveyed by said third bundle of N wires and where at most one and only one wire of said third bundle of N wires is true during said evaluation cycle.</li></ul></li><li>44. The method of clause 43 wherein said shared logic tree circuit evaluates the function selected from the functions comprising AND/NAND, OR/NOR, or XOR/Equivalence.</li><li>45. The method of clause 43 that further comprises a single evaluation device coupled to said shared logic tree circuit.</li><li>46. The method of clause 43 wherein said 1 of 4 encoding further comprises a not valid value wherein zero wires of said first bundle of N wires, said second bundle of N wires, or said third bundles of N wires are true.</li><li>47. The method of clause 43 wherein said 1 of N signal of said first input 1 of N signal, said second input 1 of N signal, or said output 1 of N signal comprises a 1 of 4 signal comprising a bundle of 4 wires routed together.</li><li>48. The method of clause 43 wherein said 1 of N signal of said first input 1 of N signal, said second input 1 of N signal, or said output 1 of N signal comprises a 1 of 3 signal comprising a bundle of 3 wires routed together.</li><li>49. A logic circuit that uses 1 of 4 signals, comprising: <ul id="ul0010" list-style="none" compact="compact"><li>a shared logic tree circuit that evaluates one or more input signals and produces an output signal;</li><li>a first input 1 of 4 signal coupled to said shared logic tree circuit wherein said first input 1 of 4 signal comprises a first bundle of 4 wires routed together in-between different cells and use a 1 of 4 encoding to indicate multiple values of information conveyed by said first bundle of 4 wires and where at most one and only one wire of said first bundle of 4 wires is true during an evaluation cycle;</li><li>a second input 1 of 4 signal coupled to said shared logic tree circuit wherein said second input 1 of 4 signal comprises a second bundle of 4 wires routed together in-between different cells and use a 1 of 4 encoding to indicate multiple values of information conveyed by said second bundle of 4 wires and where at most one and only one wire of said second bundle of 4 wires is true during said evaluation cycle;</li><li>an output 1 of 4 signal coupled to said shared logic tree circuit wherein said output 1 of 4 signal comprises a third bundle of 4 wires routed together in-between different cells and use a 1 of 4 encoding to indicate multiple values of information conveyed by said third bundle of 4 wires and where at most one and only one wire of said third bundle of 4 wires is true during said evaluation cycle.</li></ul></li><li>50. The logic circuit of clause 49 wherein said shared logic tree circuit evaluates the function selected from the functions comprising AND/NAND, OR/NOR, or XOR/Equivalence.</li><li>51. The logic circuit of clause 49 that further comprises a single evaluation device coupled to said shared logic tree circuit.</li><li>52. The logic circuit of clause 49 wherein said 1 of 4 encoding further comprises a not valid value wherein zero wires of said first bundle of 4 wires, said second bundle of 4 wires, or said third bundle of 4 wires is true.</li><li>53. A system that evaluates a logic circuit that uses 1 of 4 signals, comprising: <ul id="ul0011" list-style="none" compact="compact"><li>a shared logic tree circuit that evaluates one or more input signals and produces an output signal;</li><li>a first input 1 of 4 signal coupled to said shared logic tree circuit wherein said first input 1 of 4 signal comprises a first bundle of 4 wires routed together in-between different cells and use a 1 of 4 encoding to indicate multiple values of information conveyed by said first bundle of 4 wires and where at most one and only one wire of said first bundle of 4 wires is true during an evaluation cycle;</li><li>a second input 1 of 4 signal coupled to said shared logic tree circuit wherein said second input 1 of 4 signal comprises a second bundle of 4 wires routed together in-between different cells and use a 1 of 4 encoding to indicate multiple values of information conveyed by said second bundle of 4 wires and where at most one and only one wire of said second bundle of 4 wires is true during said evaluation cycle; and</li><li>an output 1 of 4 signal coupled to said shared logic tree circuit wherein said output 1 of 4 signal comprises a third bundle of 4 wires routed together in-between different cells and use a 1 of 4 encoding to indicate multiple values of information conveyed by said third bundle of 4 wires and where at most one and only one wire of said third bundle of 4 wires is true during said evaluation cycle.</li></ul></li><li>54. The system of clause 53 wherein said shared logic tree circuit evaluates the function selected from the functions comprising AND/NAND, OR/NOR, or XOR/Equivalence.</li><li>55. The system of claiuse 53 that further comprises a single evaluation device coupled to said shared logic tree circuit.</li><li>56. The system of clause 53 wherein said 1 of 4 encoding further comprises a not valid value wherein zero wires of said first bundle of 4 wires, said second bundle of 4 wires, or said third bundles of 4 wires is true.</li><li>57. A method that evaluates a logic circuit that uses 1 of 4 signals, comprising: <ul id="ul0012" list-style="none" compact="compact"><li>receiving a first input 1 of 4 signal coupled to a shared logic tree circuit wherein said first input 1 of 4 signal comprises a first bundle of 4 wires routed together in-between different cells and use a 1 of 4 encoding to indicate multiple values of information conveyed by said first bundle of 4 wires and where at most one and only one wire of said first bundle of 4 wires is true during an evaluation cycle;</li><li>receiving a second input 1 of 4 signal coupled to said shared logic tree circuit wherein said second input 1 of 4 signal comprises a second bundle of 4 wires routed together in-between different cells and use a 1 of 4 encoding to indicate multiple values of information conveyed by said second bundle of 4 wires and where at most one and only one wire of said second bundle of 4 wires is true during said evaluation cycle;</li><li>evaluating said first input 1 of 4 signal and said second input 1 of 4 signal with said shared logic tree circuit; and</li><li>producing an output 1 of 4 signal from said shared logic tree circuit's evaluation, said output 1 of 4 signal couples to said shared logic tree circuit wherein said output 1 of 4 signal comprises a third bundle of 4 wires routed together in-between different cells and use a 1 of 4 encoding to indicate multiple values of information conveyed by said third bundle of 4 wires and where at most one and only one wire of said third bundle of 4 wires is true during said evaluation cycle.</li></ul></li><li>58. The method of clause 57 wherein said shared logic tree circuit evaluates the function selected from the functions comprising AND/NAND, OR/NOR, or XOR/Equivalence.</li><li>59. The method of clause 57 that further comprises a single evaluation device coupled to said shared logic tree circuit.</li><li>60. The method of clause 57 wherein said 1 of 4 encoding further comprises a not valid value wherein zero wires of said first bundle of 4 wires, said second bundle of 4 wires, or said third bundle of 4 wires are true.</li><li>61. A method that provides a logic circuit with 1 of 4 signals, comprising: <ul id="ul0013" list-style="none" compact="compact"><li>providing a shared logic tree circuit that evaluates one or more input signals and produces an output signal;</li><li>coupling a first input 1 of 4 signal to said shared logic tree circuit wherein said first input 1 of 4 signal comprises a first bundle of 4 wires routed together in-between different cells and use a 1 of 4 encoding to indicate multiple values of information conveyed by said first bundle of 4 wires and where at most one and only one wire of said first bundle of 4 wires is true during an evaluation cycle;</li><li>coupling a second input 1 of 4 signal to said shared logic tree circuit wherein said second input 1 of 4 signal comprises a second bundle of 4 wires routed together in-between different cells and use a 1 of 4 encoding to indicate multiple values of information conveyed by said second bundle of 4 wires and where at most one and only one wire of said second bundle of 4 wires is true during said evaluation cycle; and</li><li>coupling an output 1 of 4 signal to said shared logic tree circuit wherein said output 1 of 4 signal comprises a third bundle of 4 wires routed together in-between different cells and use a 1 of 4 encoding to indicate multiple values of information conveyed by said third bundle of 4 wires and where at most one and only one wire of said third bundle of 4 wires is true during said evaluation cycle.</li></ul></li><li>62. The method of clause 61 wherein said shared logic tree circuit evaluates the function selected from the functions comprising AND/NAND, OR/NOR, or XOR/Equivalence.</li><li>63. The method of clause 57 that further comprises a single evaluation device coupled to said shared logic tree circuit.</li><li>64. The method of clause 57 wherein said 1 of 4 encoding further comprises a not valid value wherein zero wires of said first bundle of 4 wires, said second bundle of 4 wires, or said third bundles of 4 wires is true.</li></ul>