Design and Anaysis of Shift Register Using Pulse Triggered Latches

Manthri Lavanya, D.Sreekanth Reddy


The most recent headway in register innovation is to keep up low region and low power utilization. Shift register is a computerized memory circuit. The Shift register is made out of flip-flop having a similar check in which the yield of each associated with information contribution of next flip-flop in the chain and have no circuit between the flip-flops. Master slave flip-flop is course of two latches. Size is more for the plan of long length and power utilization is high.  Shift register created by pulse latch comprising of a latch and a pulse clock flag. By utilizing pulse latch as a part of shift register, timing issue will happen. Keeping in mind the end goal to defeat the planning issue postpone circuits must be presented; yield flag of the latch is deferred and achieves the following hook after the clock beat. At that point all latches have consistent info signals amid the clock; the postpone circuits cause vast territory and power overheads. The arrangement is to utilize different non cover deferred pulse clock signals. Every latch utilizes a pulse clock flag which is deferred from the beat check flag utilized as a part of its next latch. Subsequently, every latch upgrades the information after its next latch overhauls the information. Every latch has a consistent contribution amid its clock beat and no planning issue happens between latches, power and zone are spared. A shift register can likewise be utilized as a counter. A shift register with the serial yield associated back to the serial info is called shift register counter. In light of such an association, uncommon determined successions are created as the yield. The most well-known shift register counter is Johnson counter. Supplanting flip-flops with pulse latches in the plan of counter will lessen territory and power. Johnson counter can be planned by utilizing pulse latch.

Full Text:


Copyright (c) 2018 Edupedia Publications Pvt Ltd

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.


All published Articles are Open Access at 

Paper submission: