answersLogoWhite

0

9 binary input lines ==> 512 different input 'words'

User Avatar

Wiki User

14y ago

What else can I help you with?

Related Questions

Difference between truth table and excitation table?

truth table contains inputs and excitation table takes outputs as inputs


What is lookup in hash table?

It is a table containing : various combinations of inputs and output desired for that particular combinations. It is similar to truth table. These lookup tables abbr. as LUT. are used in programming CPLDs or FPGAs.


When using a truth table 1 and 1 equal what?

As inputs to the truth table 1 and 1 signify that they are both true. The output will depend on what kind of truth table we are talking about, AND, OR, XOR, etc.


What is the truth table for 4 input majority logic gate?

A 4-input majority logic gate outputs a high signal (1) if the majority of its inputs (at least 3 out of 4) are high (1). The truth table for a 4-input majority gate includes 16 rows, reflecting all possible combinations of the four inputs (A, B, C, D). The output is 1 for the following input combinations: 1110, 1101, 1011, 0111, 1111, and any other combination that has at least three 1s. The output is 0 for combinations with fewer than three 1s.


How do you make a truth table?

A truth table is a chart of all of the possible combinations of true and false for a given set of options. The first step is to make x number of columns, where x is the number of inputs there are. Then in the first column write down x trues, followed by x false. Then in the following columns write down x/2 trues and false, alternating then x/4, then x/8 and so on.


How do you construct half adder using 2 1 multiplexer?

Use the multiplexer to choose the correct output based on the inputs (use the truth table).


What are advantages and disadvantages of truth table?

Advantages of truth tables are that they provide a clear and systematic way to represent all possible input-output combinations in a logic circuit. However, a disadvantage is that they become complex and unwieldy for circuits with a large number of inputs or outputs, making them difficult to interpret and analyze effectively.


How do you connect two 8 channel multiplexers to make a full adder?

Connect the 3 selection pins on both multiplexers in parallel to the A, B, and Carry inputs. Use the output of one multiplexer as the Sum output and connect its 8 inputs according to the truth table for the Sum function. Use the output of the other multiplexer as the Carry output and connect its 8 inputs according to the truth table for the Carry function. Connect any enables, etc. on both multiplexers so that they are always enabled and passing signal.


A B C ' A'B'C' by using truth table?

Oh, what a happy little question! To create a truth table for the expression A B C ' A' B' C', you'll need to list all possible combinations of true (T) and false (F) for the variables A, B, and C. Then, you can apply the logical operations to find the resulting values for the expression. Just take your time, enjoy the process, and soon you'll have a beautiful truth table to admire!


Define a truth table?

A truth table is usually a table in which the truth or falsehood of two variables are taken as input and these form the edges of the table. The content of the table shows the truth value of the result of some operation on the variables.


What are the uses of truth table?

A truth table has one column for each input variable (for example, P and Q), and one final column showing all of the possible results of the logical operation that the table represents (for example, P XOR Q). Each row of the truth table contains one possible configuration of the input variables (for instance, P=true Q=false), and the result of the operation for those values. Truth tables can be used to prove many other logical equivalences. Truth tables are also used to specify the function of hardware look-up tables (LUTs) in digital logic circuitry. For an n-input LUT, the truth table will have 2^nvalues (or rows in the above tabular format), completely specifying a boolean function for the LUT. By representing each boolean value as a bit in a binary number, truth table values can be efficiently encoded as integer values in electronic design automation (EDA) software. For example, a 32-bit integer can encode the truth table for a LUT with up to 5 inputs. Truth tables are a simple and straightforward way to encode boolean functions, however, given the exponential growth in size as the number of inputs increase, they are not suitable for functions with a large number of inputs. Other representations which are more memory efficient are text equations and binary decision diagrams.


Truth table for 3-inputs LUTs?

input output 000 0 001 0 010 0 011 0 100 0 101 0 110 0 111 1 Just to generalize, No high output till all inputs are high.