With arithmetic circuits like an adder, there is a stronger association between the input 1’s and 0’s, and the abstraction to a logical binary number (instead of just individual signals).
As the truth table above shows, a 16-input, 8-output combinational logic circuit can be defined, with the eight output logic functions forming the eight bits of a binary number that is the sum if the two inputs.īut there is a difference in context. But really, arithmetic circuits are no different than the logic circuits we have been working with – they just have more inputs and more outputs. A truth table for an 8-bit adderĪdding binary numbers seems a different and more abstract problem than combining logic signals using simple logic gates. This is called the “bit slice” design method. Of course, the goal is to design just one circuit that operate on any pair of bits, and then to replicate that exact same circuit n times. In the case of a circuit that operates on busses, one approach is to break up the overall design into a collection of smaller circuits that each operate on a pair of bits, and then to use as many of the bit-pair circuits as are needed to address the overall n-bit circuit.
0 kommentar(er)
