Combinational circuit is a circuit in which we combine the different gates in the circuit, for example encoder, decoder, multiplexer and demultiplexer. Some of the characteristics of combinational circuits are following −
The output of combinational circuit at any instant of time, depends only on the levels present at input terminals.
The combinational circuit do not use any memory. The previous state of input does not have any effect on the present state of the circuit.
A combinational circuit can have an n number of inputs and m number of outputs.
We're going to elaborate few important combinational circuits as follows:
Half adder is a combinational logic circuit with two inputs and two outputs. The half adder circuit is designed to add two single bit binary number A and B. It is the basic building block for addition of two single bit numbers. This circuit has two outputs carry and sum.
Full adder is developed to overcome the drawback of Half Adder circuit. It can add two onebit numbers A and B, and carry c. The full adder is a three input and two output combinational circuit.
The Full Adder is capable of adding only two single digit binary number along with a carry input. But in practical we need to add binary numbers which are much longer than just one bit. To add two nbit binary numbers we need to use the nbit parallel adder. It uses a number of full adders in cascade. The carry output of the previous full adder is connected to carry input of the next full adder.
4 Bit Parallel Adder
In the block diagram, A_{0} and B_{0} represent the LSB of the four bit words A and B. Hence Full Adder0 is the lowest stage. Hence its C_{in} has been permanently made 0. The rest of the connections are exactly same as those of nbit parallel adder is shown in fig. The four bit parallel adder is a very common logic circuit.
The subtraction can be carried out by taking the 1's or 2's complement of the number to be subtracted. For example we can perform the subtraction (AB) by adding either 1's or 2's complement of B to A. That means we can use a binary adder to perform the binary subtraction.
4 Bit Parallel Subtractor
The number to be subtracted (B) is first passed through inverters to obtain its 1's complement. The 4bit adder then adds A and 2's complement of B to produce the subtraction. S_{3} S_{2} S_{1} S_{0} represents the result of binary subtraction (AB) and carry output C_{out} represents the polarity of the result. If A > B then Cout = 0 and the result of binary form (AB) then C_{out} = 1 and the result is in the 2's complement form.
Half subtractor is a combination circuit with two inputs and two outputs (difference and borrow). It produces the difference between the two binary bits at the input and also produces an output (Borrow) to indicate if a 1 has been borrowed. In the subtraction (AB), A is called as Minuend bit and B is called as Subtrahend bit.
The disadvantage of a half subtractor is overcome by full subtractor. The full subtractor is a combinational circuit with three inputs A,B,C and two output D and C'. A is the 'minuend', B is 'subtrahend', C is the 'borrow' produced by the previous stage, D is the difference output and C' is the borrow output.
Multiplexer is a special type of combinational circuit. There are ndata inputs, one output and m select inputs with 2m = n. It is a digital circuit which selects one of the n data inputs and routes it to the output. The selection of one of the n inputs is done by the selected inputs. Depending on the digital code applied at the selected inputs, one out of n data sources is selected and transmitted to the single output Y. E is called the strobe or enable input which is useful for the cascading. It is generally an active low terminal that means it will perform the required operation when it is low.
Multiplexers come in multiple variations
A demultiplexer performs the reverse operation of a multiplexer i.e. it receives one input and distributes it over several outputs. It has only one input, n outputs, m select input. At a time only one output line is selected by the select lines and the input is transmitted to the selected output line. A demultiplexer is equivalent to a single pole multiple way switch as shown in fig.
Demultiplexers comes in multiple variations.
A decoder is a combinational circuit. It has n input and to a maximum m = 2n outputs. Decoder is identical to a demultiplexer without any data input. It performs operations which are exactly opposite to those of an encoder.
Examples of Decoders are following.
The block diagram of 2 to 4 line decoder is shown in the fig. A and B are the two inputs where D through D are the four outputs. Truth table explains the operations of a decoder. It shows that each output is 1 for only a specific combination of inputs.
Encoder is a combinational circuit which is designed to perform the inverse operation of the decoder. An encoder has n number of input lines and m number of output lines. An encoder produces an m bit binary code corresponding to the digital input number. The encoder accepts an n input digital word and converts it into an m bit another digital word.
Examples of Encoders are following.
This is a special type of encoder. Priority is given to the input lines. If two or more input line are 1 at the same time, then the input line with highest priority will be considered. There are four input D_{0}, D_{1}, D_{2}, D_{3} and two output Y_{0}, Y_{1}. Out of the four input D_{3} has the highest priority and D_{0} has the lowest priority. That means if D_{3} = 1 then Y_{1} Y_{1} = 11 irrespective of the other inputs. Similarly if D_{3} = 0 and D_{2} = 1 then Y_{1} Y_{0} = 10 irrespective of the other inputs.
The combinational circuit does not use any memory. Hence the previous state of input does not have any effect on the present state of the circuit. But sequential circuit has memory so output can vary based on input. This type of circuits uses previous input, output, clock and a memory element.
Flip flop is a sequential circuit which generally samples its inputs and changes its outputs only at particular instants of time and not continuously. Flip flop is said to be edge sensitive or edge triggered rather than being level triggered like latches.
It is basically SR latch using NAND gates with an additional enable input. It is also called as level triggered SRFF. For this, circuit in output will take place if and only if the enable input (E) is made active. In short this circuit will operate as an SR latch if E = 1 but there is no change in the output if E = 0.
S.N.  Condition  Operation 
1  S = R = 0 : No change  If S = R = 0 then output of NAND gates 3 and 4 are forced to become 1. Hence R' and S' both will be equal to 1. Since S' and R' are the input of the basic SR latch using NAND gates, there will be no change in the state of outputs. 
2  S = 0, R = 1, E = 1  Since S = 0, output of NAND3 i.e. R' = 1 and E = 1 the output of NAND4 i.e. S' = 0. Hence Q_{n+1} = 0 and Q_{n+1} bar = 1. This is reset condition. 
3  S = 1, R = 0, E = 1  Output of NAND3 i.e. R' = 0 and output of NAND4 i.e. S' = 1. Hence output of SR NAND latch is Q_{n+1} = 1 and Q_{n+1} bar = 0. This is the reset condition. 
4  S = 1, R = 1, E = 1  As S = 1, R = 1 and E = 1, the output of NAND gates 3 and 4 both are 0 i.e. S' = R' = 0. Hence the Race condition will occur in the basic NAND latch. 
Master slave JK FF is a cascade of two SR FF with feedback from the output of second to input of first. Master is a positive level triggered. But due to the presence of the inverter in the clock line, the slave will respond to the negative level. Hence when the clock = 1 (positive level) the master is active and the slave is inactive. Whereas when clock = 0 (low level) the slave is active and master is inactive.
Truth Table
S.N.  Condition  Operation 
1  J = K = 0 (No change)  When clock = 0, the slave becomes active and master is inactive. But since the S and R inputs have not changed, the slave outputs will also remain unchanged. Therefore outputs will not change if J = K =0. 
2  J = 0 and K = 1 (Reset)  Clock = 1 − Master active, slave inactive. Therefore outputs of the master become Q_{1} = 0 and Q_{1} bar = 1. That means S = 0 and R =1. Clock = 0 − Slave active, master inactive. Therefore outputs of the slave become Q = 0 and Q bar = 1. Again clock = 1 − Master active, slave inactive. Therefore even with the changed outputs Q = 0 and Q bar = 1 fed back to master, its output will be Q1 = 0 and Q1 bar = 1. That means S = 0 and R = 1. Hence with clock = 0 and slave becoming active the outputs of slave will remain Q = 0 and Q bar = 1. Thus we get a stable output from the Master slave. 
3  J = 1 and K = 0 (Set)  Clock = 1 − Master active, slave inactive. Therefore outputs of the master become Q_{1} = 1 and Q_{1} bar = 0. That means S = 1 and R =0. Clock = 0 − Slave active, master inactive. Therefore outputs of the slave become Q = 1 and Q bar = 0. Again clock = 1 − then it can be shown that the outputs of the slave are stabilized to Q = 1 and Q bar = 0. 
4  J = K = 1 (Toggle)  Clock = 1 − Master active, slave inactive. Outputs of master will toggle. So S and R also will be inverted. Clock = 0 − Slave active, master inactive. Outputs of slave will toggle. These changed output are returned back to the master inputs. But since clock = 0, the master is still inactive. So it does not respond to these changed outputs. This avoids the multiple toggling which leads to the race around condition. The master slave flip flop will avoid the race around condition. 
Delay Flip Flop / D Flip Flop
Delay Flip Flop or D Flip Flop is the simple gated SR latch with a NAND inverter connected between S and R inputs. It has only one input. The input data is appearing at the output after some time. Due to this data delay between i/p and o/p, it is called delay flip flop. S and R will be the complements of each other due to NAND inverter. Hence S = R = 0 or S = R = 1, these input condition will never appear. This problem is avoid by SR = 00 and SR = 1 conditions.
S.N.  Condition  Operation 
1  E = 0  Latch is disabled. Hence no change in output. 
2  E = 1 and D = 0  If E = 1 and D = 0 then S = 0 and R = 1. Hence irrespective of the present state, the next state is Q_{n+1} = 0 and Q_{n+1} bar = 1. This is the reset condition. 
3  E = 1 and D = 1  If E = 1 and D = 1, then S = 1 and R = 0. This will set the latch and Q_{n+1} = 1 and Q_{n+1} bar = 0 irrespective of the present state. 
Toggle Flip Flop / T Flip Flop
Toggle flip flop is basically a JK flip flop with J and K terminals permanently connected together. It has only input denoted by T as shown in the Symbol Diagram. The symbol for positive edge triggered T flip flop is shown in the Block Diagram.
S.N.  Condition  Operation 
1  T = 0, J = K = 0  The output Q and Q bar won't change 
2  T = 1, J = K = 1  Output will toggle corresponding to every leading edge of clock signal. 
According to Wikipedia, in digital logic and computing, a Counter is a device which stores (and sometimes displays) the number of times a particular event or process has occurred, often in relationship to a clock signal. Counters are used in digital electronics for counting purpose, they can count specific event happening in the circuit. For example, in UP counter a counter increases count for every rising edge of clock. Not only counting, a counter can follow the certain sequence based on our design like any random sequence 0,1,3,2… .They can also be designed with the help of flip flops.
Counters are broadly divided into two categories
1. Asynchronous Counter
In asynchronous counter we don’t use universal clock, only first flip flop is driven by main clock and the clock input of rest of the following counters is driven by output of previous flip flops. We can understand it by following diagram
It is evident from timing diagram that Q0 is changing as soon as the rising edge of clock pulse is encountered, Q1 is changing when rising edge of Q0 is encountered(because Q0 is like clock pulse for second flip flop) and so on. In this way ripples are generated through Q0,Q1,Q2,Q3 hence it is also called RIPPLE counter.
2. Synchronous Counter
Unlike the asynchronous counter, synchronous counter has one global clock which drives each flip flop so output changes in parallel. The one advantage of synchronous counter over asynchronous counter is, it can operate on higher frequency than asynchronous counter as it does not have cumulative delay because of same clock is given to each flip flop.
Synchronous counter circuit
Timing diagram synchronous counter
From circuit diagram we see that Q0 bit gives response to each falling edge of clock while Q1 is dependent on Q0, Q2 is dependent on Q1 and Q0 , Q3 is dependent on Q2,Q1 and Q0.
Decade Counter
A decade counter counts ten different states and then reset to its initial states. A simple decade counter will count from 0 to 9 but we can also make the decade counters which can go through any ten states between 0 to 15(for 4 bit counter).
Clock pulse  Q3  Q2  Q1  Q0 
0  0  0  0  0 
1  0  0  0  1 
2  0  0  1  0 
3  0  0  1  1 
4  0  1  0  0 
5  0  1  0  1 
6  0  1  1  0 
7  0  1  1  1 
8  1  0  0  0 
9  1  0  0  1 
10  0  0  0  0 
Truth table for simple decade counter
Decade counter circuit diagram
We see from circuit diagram that we have used nand gate for Q3 and Q1 and feeding this to clear input line because binary representation of 10 is—
1010
And we see Q3 and Q1 are 1 here, if we give NAND of these two bits to clear input then counter will be clear at 10 and again start from beginning.
Important point: Number of flip flops used in counter are always greater than equal to (log_{2} n) where n=number of states in counter.
Q.1. Consider the partial implementation of a 2bitt counter using T flipflops following the sequence 02310, as shown below
To complete the circuit, the input X should be
(A) Q2′
(B) Q2 + Q1
(C) (Q1 ⊕ Q2)’
(D) Q1 ⊕ Q2
Solution:
From the circuit we see
T1=XQ1’+X’Q1—(1)
AND
T2=(Q2 ⊕ Q1)’—(2)
AND DESIRED OUTPUT IS 00>10>11>01>00
SO X SHOULD BE Q1Q2’+Q1’Q2 SATISFYING 1 AND 2.
SO ANS IS (D) PART.
Q.2. The control signal functions of a 4bit binary counter are given below (where X is “don’t care”)
The counter is connected as follows:
Assume that the counter and gate delays are negligible. If the counter starts at 0, then it cycles through the following sequence:
(A) 0,3,4
(B) 0,3,4,5
(C) 0,1,2,3,4
(D) 0,1,2,3,4,5
Solution:
Initially A1 A2 A3 A4 =0000
Clr=A1 and A3
So when A1 and A3 both are 1 it again goes to 0000
Hence 0000(init.) > 0001(A1 and A3=0)>0010 (A1 and A3=0) > 0011(A1 and A3=0) > 0100 (A1 and A3=1)[ clear condition satisfied] >0000(init.) so it goes through 0>1>2>3>4
Ans is (C) part.
150 docs216 tests

1. What are combinational circuits? 
2. What is the classification of counters in digital logic? 
3. What is the difference between combinational and sequential circuits? 
4. How are counters used in digital logic? 
5. What types of questions can be expected in the examination related to counters in digital logic? 
150 docs216 tests


Explore Courses for Computer Science Engineering (CSE) exam
