Fpga Interview Question
Fpga Interview Question
Fpga Interview Question
What logic is inferred when there are multiple assign statements targeting the same wire?
It is illegal to specify multiple assign statements to the same wire in a synthesizable code that will
become an output port of the module. The synthesis tools give a syntax error that a net is being
driven by more than one source.
However, it is legal to drive a three-state wire by multiple assign statements.
Conditionals in a continuous assignment are specified through the “?:” operator. Conditionals get
inferred into a multiplexor. For example, the following is the code for a simple multiplexor
When there are multiple nonblocking assignments made to the same reg variable in a sequential
always block, then the last assignment is picked up for logic synthesis. For example
In the example just shown, it is the OR logic that is the last assignment. Hence, the logic synthesized
was indeed the OR gate. Had the last assignment been the “&” operator, it would have synthesized
an AND gate.
Spartan series dcm’s have a minimum frequency of 24 MHZ and a maximum of 248
2)Tell me some of constraints you used and their purpose during your design?
There are lot of constraints and will vary for tool to tool ,I am listing some of Xilinx constraints
a) Translate on and Translate off: the Verilog code between Translate on and Translate off is ignored
for synthesis.
b) CLOCK_SIGNAL: is a synthesis constraint. In the case where a clock signal goes through
combinatorial logic before being connected to the clock input of a flip-flop, XST cannot identify what
input pin or internal net is the real clock signal. This constraint allows you to define the clock net.
c) XOR_COLLAPSE: is synthesis constraint. It controls whether cascaded XORs should be collapsed
into a single XOR.
For more constraints detailed description refer to constraint guide.
3) Suppose for a piece of code equivalent gate count is 600 and for another code equivalent gate
count is 50,000 will the size of bitmap change?in other words will size of bitmap change it gate
count change?
The size of bitmap is irrespective of resource utilization, it is always the same,for Spartan xc3s5000 it
is 1.56MB and will never change.
4) What are different types of FPGA programming modes?what are you currently using ?how to
change from one to another?
Before powering on the FPGA, configuration data is stored externally in a PROM or some other
nonvolatile medium either on or off the board. After applying power, the configuration data is
written to the FPGA using any of five different modes: Master Parallel, Slave Parallel, Master Serial,
Slave Serial, and Boundary Scan (JTAG). The Master and Slave Parallel modes
Mode selecting pins can be set to select the mode, refer data sheet for further details.
7) Can you list out some of synthesizable and non synthesizable constructs?
not synthesizable->>>>
initial
ignored for synthesis.
delays
ignored for synthesis.
events
not supported.
real
Real data type not supported.
time
Time data type not supported.
force and release
Force and release of data types not supported.
fork join
Use nonblocking assignments to get same effect.
user defined primitives
Only gate level primitives are supported.
synthesizable constructs->>
assign,for loop,Gate Level Primitives,repeat with constant value...
These stuck-at problems will appear in ASIC. Some times, the nodes will permanently tie to 1 or 0
because of some fault. To avoid that, we need to provide testability in RTL. If it is permanently 1 it is
called stuck-at-1 If it is permanently 0 it is called stuck-at-0.
FPGA:
a)SRAM based technology.
b)Segmented connection between elements.
c)Usually used for complex logic circuits.
d)Must be reprogrammed once the power is off.
e)Costly
CPLD:
a)Flash or EPROM based technology.
b)Continuous connection between elements.
c)Usually used for simpler or moderately complex logic circuits.
d)Need not be reprogrammed once the power is off.
e)Cheaper
13)what is slice,clb,lut?
The Configurable Logic Blocks (CLBs) constitute the main logic resource for implementing
synchronous as well as combinatorial circuits.
CLB are configurable logic blocks and can be configured to combo,ram or rom depending on coding
style
CLB consist of 4 slices and each slice consist of two 4-input LUT (look up table) F-LUT and G-LUT.
YES.
The memory assignment is a clocked behavioral assignment, Reads from the memory are
asynchronous, And all the address lines are shared by the read and write statements.
The UCF file is an ASCII file specifying constraints on the logical design. You create this file and enter
your constraints in the file with a text editor. You can also use the Xilinx Constraints Editor to create
constraints within a UCF(extention) file. These constraints affect how the logical design is
implemented in the target device. You can use the file to override constraints specified during design
entry.
16) What is FPGA you are currently using and some of main reasons for choosing it?
17) Draw a rough diagram of how clock is routed through out FPGA?
18) How many global buffers are there in your current fpga,what is their significance?
Timing-driven packing and placement is recommended to improve design performance, timing, and
packing for highly utilized designs.
Dynamic timing:
a. The design is simulated in full timing mode.
b. Not all possibilities tested as it is dependent on the input test vectors.
c. Simulations in full timing mode are slow and require a lot of memory.
d. Best method to check asynchronous interfaces or interfaces between different timing domains.
Static timing:
a. The delays over all paths are added up.
b. All possibilities, including false paths, verified without the need for test vectors.
c. Much faster than simulations, hours as opposed to days.
d. Not good with asynchronous interfaces or interfaces between different timing domains.
PLL:
PLLs have disadvantages that make their use in high-speed designs problematic, particularly when
both high performance and high reliability are required.
The PLL voltage-controlled oscillator (VCO) is the greatest source of problems. Variations in
temperature, supply voltage, and manufacturing process affect the stability and operating
performance of PLLs.
DLLs, however, are immune to these problems. A DLL in its simplest form inserts a variable delay line
between the external clock and the internal clock. The clock tree distributes the clock to all registers
and then back to the feedback pin of the DLL.
The control circuit of the DLL adjusts the delays so that the rising edges of the feedback clock align
with the input clock. Once the edges of the clocks are aligned, the DLL is locked, and both the input
buffer delay and the clock skew are reduced to zero.
Advantages:
· precision
· stability
· power management
· noise sensitivity
· jitter performance.
24) Given two ASICs. one has setup violation and the other has hold violation. how can they be
made to work together without modifying the design?
DRC is used to check whether the particular schematic and corresponding layout(especially the mask
sets involved) cater to a pre-defined rule set depending on the technology used to design. They are
parameters set aside by the concerned semiconductor manufacturer with respect to how the masks
should be placed , connected , routed keeping in mind that variations in the fab process does not
effect normal functionality. It usually denotes the minimum allowable configuration.
27)What is LVs and why do we do that. What is the difference between LVS and DRC?
The layout must be drawn according to certain strict design rules. DRC helps in layout of the designs
by checking if the layout is abide by those rules.
After the layout is complete we extract the netlist. LVS compares the netlist extracted from the
layout with the schematic to ensure that the layout is an identical match to the cell schematic.
28)What is DFT ?
DFT means design for testability. 'Design for Test or Testability' - a methodology that ensures a
design works properly after manufacturing, which later facilitates the failure analysis and false
product/piece detection
Other than the functional logic,you need to add some DFT logic in your design.This will help you in
testing the chip for manufacturing defects after it come from fab. Scan,MBIST,LBIST,IDDQ testing etc
are all part of this. (this is a hot field and with lots of opportunities)
29) There are two major FPGA companies: Xilinx and Altera. Xilinx tends to promote its hard
processor cores and Altera tends to promote its soft processor cores. What is the difference
between a hard processor core and a soft processor core?
A hard processor core is a pre-designed block that is embedded onto the device. In the Xilinx Virtex
II-Pro, some of the logic blocks have been removed, and the space that was used for these logic
blocks is used to implement a processor. The Altera Nios, on the other hand, is a design that can be
compiled to the normal FPGA logic.
The contamination delay of the data path in a sequential circuit is critical for the hold time at the flip
flop where it is exiting, in this case R2.
mathematically, th(R2) <= tcd(R1) + tcd(CL2)
Contamination delay is also called tmin and Propagation delay is also called tmax in many data
sheets.
DFT:
· manufacturing defects like stuck at "0" or "1".
· test for set of rules followed during the initial design stage.
Formal verification:
· Verification of the operation of the design, i.e, to see if the design follows spec.
· gate netlist == RTL ?
· using mathematics and statistical analysis to check for equivalence.
32)What is Synthesis?
Synthesis is the stage in the design flow which is concerned with translating your Verilog code into
gates - and that's putting it very simply! First of all, the Verilog must be written in a particular way
for the synthesis tool that you are using. Of course, a synthesis tool doesn't actually produce gates -
it will output a netlist of the design that you have synthesised that represents the chip which can be
fabricated through an ASIC or FPGA vendor.
33)We need to sample an input or output something at different rates, but I need to vary the rate?
What's a clean way to do this?
Many, many problems have this sort of variable rate requirement, yet we are usually constrained
with a constant clock frequency. One trick is to implement a digital NCO (Numerically Controlled
Oscillator). An NCO is actually very simple and, while it is most naturally understood as hardware, it
also can be constructed in software. The NCO, quite simply, is an accumulator where you keep
adding a fixed value on every clock (e.g. at a constant clock frequency). When the NCO "wraps", you
sample your input or do your action. By adjusting the value added to the accumulator each clock,
you finely tune the AVERAGE frequency of that wrap event. Now - you may have realized that the
wrapping event may have lots of jitter on it. True, but you may use the wrap to increment yet
another counter where each additional Divide-by-2 bit reduces this jitter. The DDS is a related
technique. I have two examples showing both an NCOs and a DDS in my File Archive. This is tricky to
grasp at first, but tremendously powerful once you have it in your bag of tricks. NCOs also relate to
digital PLLs, Timing Recovery, TDMA and other "variable rate" phenomena
Set up time is the amount of time before the clock edge that the input signal needs to be
stable to guarantee it is accepted properly on the clock edge.
Hold time is the amount of time after the clock edge that same input signal has to be held
before changing it to make sure it is sensed properly at the clock edge.
Whenever there are setup and hold time violations in any flip-flop, it enters a state where its
output is unpredictable: this state is known as metastable state (quasi stable state); at the end
of metastable state, the flip-flop settles down to either '1' or '0'. This whole process is known
as metastability
2) What is skew, what are problems associated with it and how to minimize it?
In circuit design, clock skew is a phenomenon in synchronous circuits in which the clock
signal (sent from the clock circuit) arrives at different components at different times.
This is typically due to two causes. The first is a material flaw, which causes a signal to travel
faster or slower than expected. The second is distance: if the signal has to travel the entire
length of a circuit, it will likely (depending on the circuit's size) arrive at different parts of the
circuit at different times. Clock skew can cause harm in two ways. Suppose that a logic path
travels through combinational logic from a source flip-flop to a destination flip-flop. If the
destination flip-flop receives the clock tick later than the source flip-flop, and if the logic path
delay is short enough, then the data signal might arrive at the destination flip-flop before the
clock tick, destroying there the previous data that should have been clocked through. This is
called a hold violation because the previous data is not held long enough at the destination
flip-flop to be properly clocked through. If the destination flip-flop receives the clock tick
earlier than the source flip-flop, then the data signal has that much less time to reach the
destination flip-flop before the next clock tick. If it fails to do so, a setup violation occurs, so-
called because the new data was not set up and stable before the next clock tick arrived. A
hold violation is more serious than a setup violation because it cannot be fixed by increasing
the clock period.
Clock skew, if done right, can also benefit a circuit. It can be intentionally introduced to
decrease the clock period at which the circuit will operate correctly, and/or to increase the
setup or hold safety margins. The optimal set of clock delays is determined by a linear
program, in which a setup and a hold constraint appears for each logic path. In this linear
program, zero clock skew is merely a feasible point.
Clock skew can be minimized by proper routing of clock signal (clock distribution tree) or
putting variable delay buffer so that all clock inputs arrive at the same time
3) What is slack?
'Slack' is the amount of time you have that is measured from when an event 'actually happens'
and when it 'must happen’.. The term 'actually happens' can also be taken as being a predicted
time for when the event will 'actually happen'.
When something 'must happen' can also be called a 'deadline' so another definition of slack
would be the time from when something 'actually happens' (call this Tact) until the deadline
(call this Tdead).
Slack = Tdead - Tact.
Negative slack implies that the 'actually happen' time is later than the 'deadline' time...in other
words it's too late and a timing violation....you have a timing problem that needs some
attention.
4) What is glitch? What causes it (explain with waveform)? How to overcome it?
The following figure shows a synchronous alternative to the gated clock using a data path.
The flip-flop is clocked at every clock cycle and the data path is controlled by an enable.
When the enable is Low, the multiplexer feeds the output of the register back on itself. When
the enable is High, new data is fed to the flip-flop and the register changes its state
5) Given only two xor gates one must function as buffer and another as inverter?
The main difference between latch and FF is that latches are level sensitive while FF are edge
sensitive. They both require the use of clock signal and are used in sequential logic. For a
latch, the output tracks the input when the clock signal is high, so as long as the clock is logic
1, the output can change if the input also changes. FF on the other hand, will store the input
only when there is a rising/falling edge of the clock.
The Stack is more or less responsible for keeping track of what's executing in our code (or
what's been "called"). The Heap is more or less responsible for keeping track of our objects
(our data, well... most of it - we'll get to that later.).
Think of the Stack as a series of boxes stacked one on top of the next. We keep track of
what's going on in our application by stacking another box on top every time we call a
method (called a Frame). We can only use what's in the top box on the stack. When we're
done with the top box (the method is done executing) we throw it away and proceed to use
the stuff in the previous box on the top of the stack. The Heap is similar except that its
purpose is to hold information (not keep track of execution most of the time) so anything in
our Heap can be accessed at any time. With the Heap, there are no constraints as to what can
be accessed like in the stack. The Heap is like the heap of clean laundry on our bed that we
have not taken the time to put away yet - we can grab what we need quickly. The Stack is like
the stack of shoe boxes in the closet where we have to take off the top one to get to the one
underneath it.
A) Mealy and Moore models are the basic models of state machines. A state machine which
uses only Entry Actions, so that its output depends on the state, is called a Moore model. A
state machine which uses only Input Actions, so that the output depends on the state and also
on inputs, is called a Mealy model. The models selected will influence a design but there are
no general indications as to which model is better. Choice of a model depends on the
application, execution means (for instance, hardware systems are usually best realized as
Moore models) and personal preferences of a designer or programmer
B) Mealy machine has outputs that depend on the state and input (thus, the FSM has the
output written on edges)
Moore machine has outputs that depend on state only (thus, the FSM has the output written in
the state itself.
Common classifications used to describe the state encoding of an FSM are Binary (or highly
encoded) and One hot.
A binary-encoded FSM design only requires as many flip-flops as are needed to uniquely
encode the number of states in the state machine. The actual number of flip-flops required is
equal to the ceiling of the log-base-2 of the number of states in the FSM.
A onehot FSM design requires a flip-flop for each state in the design and only one flip-flop
(the flip-flop representing the current or "hot" state) is set at a time in a one hot FSM design.
For a state machine with 9- 16 states, a binary FSM only requires 4 flip-flops while a onehot
FSM requires a flip-flop for each state in the design
FPGA vendors frequently recommend using a onehot state encoding style because flip-flops
are plentiful in an FPGA and the combinational logic required to implement a onehot FSM
design is typically smaller than most binary encoding styles. Since FPGA performance is
typically related to the combinational logic size of the FPGA design, onehot FSMs typically
run faster than a binary encoded FSM with larger combinational logic blocks
You can find answer to this in timing.ppt of presentations section on this site
14) Draw the state diagram to output a "1" for one cycle if the sequence "0110" shows
up (the leading 0s cannot be used in more than one sequence)?
15) How to achieve 180 degree exact phase shift?
This is the basic question that many interviewers ask. for and gate, give one input as select
line,incase if u r giving b as select line, connect one input to logic '0' and other input to a.
19) What will happen if contents of register are shifter left, right?
It is well known that in left shift all bits will be shifted left and LSB will be appended with 0
and in right shift all bits will be shifted right and MSB will be appended with 0 this is a
straightforward answer
What is expected is in a left shift value gets Multiplied by 2 eg:consider 0000_1110=14 a left
shift will make it 0001_110=28, it the same fashion right shift will Divide the value by 2.
20)Given the following FIFO and rules, how deep does the FIFO need to be to prevent
underflow or overflow?
RULES:
1) frequency(clk_A) = frequency(clk_B) / 4
2) period(en_B) = period(clk_A) * 100
3) duty_cycle(en_B) = 25%
A:Basically, you can tie the inputs of a NAND gate together to get an inverter, so...
22)Difference between Synchronous and Asynchronous reset.?
Synchronous reset logic will synthesize to smaller flip-flops, particularly if the reset is gated with the
logic generating the d-input. But in such a case, the combinational logic gate count grows, so the
overall gate count savings may not be that significant.
The clock works as a filter for small reset glitches; however, if these glitches occur near the active
clock edge, the Flip-flop could go metastable. In some designs, the reset must be generated by a set
of internal conditions. A synchronous reset is recommended for these types of designs because it
will filter the logic equation glitches between clock.
(a) short the 2 inputs of the nand gate and apply the single input to it.
(b) Connect the output to one of the input and the other to the input signal.
25) What are set up time & hold time constraints? What do they signify? Which one is critical for
estimating maximum clock frequency of a circuit?
set up time: - the amount of time the data should be stable before the application of the clock signal,
where as the hold time is the amount of time the data should be stable after the application of the
clock. Setup time signifies maximum delay constraints; hold time is for minimum delay constraints.
Setup time is critical for establishing the maximum clock frequency.
D-latch is level sensitive where as flip-flop is edge sensitive. Flip-flops are made up of latches.
Is a combinational circuit that selects binary information from one of many input lines and directs it
to a single output line. (2n =>n).
By giving the feed back we can convert, i.e !Q=>S and Q=>R.Hence the S and R inputs will act as J and
K respectively.
The clock pulse that remains in the 1 state while both J and K are equal to 1 will cause the output to
complement again and repeat complementing until the pulse goes back to 0, this is called the race
around problem.To avoid this undesirable operation, the clock pulse must have a time duration that
is shorter than the propagation delay time of the F-F, this is restrictive so the alternative is master-
slave or edge-triggered construction.
XOR each bits of A with B (for e.g. A[0] xor B[0] ) and so on.the o/p of 8 xor gates are then given as
i/p to an 8-i/p nor gate. if o/p is 1 then A=B.
32)7 bit ring counter's initial state is 0100010. After how many clock cycles will it return to the
initial state?
6 cycles
33) Convert D-FF into divide by 2. (not latch) What is the max clock frequency the circuit can
handle, given the following information?
Circuit: Connect Qbar to D and apply the clk at clk of DFF and take the O/P at Q. It gives freq/2. Max.
Freq of operation: 1/ (propagation delay+setup time) = 1/16ns = 62.5 MHz
34)Guys this is the basic question asked most frequently. Design all the basic
gates(NOT,AND,OR,NAND,NOR,XOR,XNOR) using 2:1 Multiplexer?
35)N number of XNOR gates are connected in series such that the N inputs (A0,A1,A2......) are
given in the following way: A0 & A1 to first XNOR gate and A2 & O/P of First XNOR to second
XNOR gate and so on..... Nth XNOR gates output is final output. How does this circuit work?
Explain in detail?
If N=Odd, the circuit acts as even parity detector, ie the output will 1 if there are even number of 1's
in the N input...This could also be called as odd parity generator since with this additional 1 as
output the total number of 1's will be ODD.
If N=Even, just the opposite, it will be Odd parity detector or Even Parity Generator.
36)An assembly line has 3 fail safe sensors and one emergency shutdown switch.The line should
keep moving unless any of the following conditions arise:
(i) If the emergency switch is pressed
(ii) If the senor1 and sensor2 are activated at the same time.
(iii) If sensor 2 and sensor3 are activated at the same time.
(iv) If all the sensors are activated at the same time
Suppose a combinational circuit for above case is to be implemented only with NAND Gates. How
many minimum number of 2 input NAND gates are required?
No of 2-input NAND Gates required = 6 You can try the whole implementation.
37)Design a circuit that calculates the square of a number? It should not use any multiplier circuits.
It should use Multiplexers and other logic?
This is interesting....
1^2=0+1=1
2^2=1+3=4
3^2=4+5=9
4^2=9+7=16
5^2=16+9=25
and so on
See a pattern yet?To get the next square, all you have to do is add the next odd number to the
previous square that you found.See how 1,3,5,7 and finally 9 are added.Wouldn't this be a possible
solution to your question since it only will use a counter,multiplexer and a couple of adders?It seems
it would take n clock cycles to calculate square of n.
38) How will you implement a Full subtractor from a Full adder?
all the bits of subtrahend should be connected to the xor gate. Other input to the xor being one.The
input carry bit to the full adder should be made 1. Then the full adder works like a full subtractor
39)A very good interview question... What is difference between setup and hold time. The
interviewer was looking for one specific reason , and its really a good answer too..The hint is hold
time doesn't depend on clock, why is it so...?
Setup violations are related to two edges of clock, i mean you can vary the clock frequency to correct
setup violation. But for hold time, you are only concerned with one edge and does not basically
depend on clock frequency.
2(power n)-2n is the one used to find the unused states in johnson counter.
So for a 3-bit counter it is 8-6=2.Unused states=2. the two unused states are 010 and 101
41)The question is to design minimal hardware system, which encrypts 8-bit parallel data. A
synchronized clock is provided to this system as well. The output encrypted data should be at the
same rate as the input data but no necessarily with the same phase?
The encryption system is centered around a memory device that perform a LUT (Look-Up Table)
conversion. This memory functionality can be achieved by using a PROM, EPROM, FLASH and etc.
The device contains an encryption code, which may be burned into the device with an external
programmer. In encryption operation, the data_in is an address pointer into a memory cell and the
combinatorial logic generates the control signals. This creates a read access from the memory. Then
the memory device goes to the appropriate address and outputs the associate data. This data
represent the data_in after encryption.
LFSR is a linear feedback shift register where the input bit is driven by a linear function of the overall
shift register value. coming to industrial applications, as far as I know, it is used for encryption and
decryption and in BIST(built-in-self-test) based applications..
42)what is false path?how it determine in ckt? what the effect of false path in ckt?
By timing all the paths in the circuit the timing analyzer can determine all the critical paths in the
circuit. However, the circuit may have false paths, which are the paths in the circuit which are never
exercised during normal circuit operation for any set of inputs.
An example of a false path is shown in figure below. The path going from the input A of the first
MUX through the combinational logic out through the B input of the second MUS is a false path. This
path can never be activated since if the A input of the first MUX is activated, then Sel line will also
select the A input of the second MUX.
STA (Static Timing Analysis) tools are able to identify simple false paths; however they are not able
to identify all the false paths and sometimes report false paths as critical paths. Removal of false
paths makes circuit testable and its timing performance predictable (sometimes faster)
43)Consider two similar processors, one with a clock skew of 100ps and other with a clock skew of
50ps. Which one is likely to have more power? Why?
Clock skew of 50ps is more likely to have clock power. This is because it is likely that low-skew
processor has better designed clock tree with more powerful and number of buffers and overheads
to make skew better.
Multi-cycle paths are paths between registers that take more than one clock cycle to become stable.
For ex. Analyzing the design shown in fig below shows that the output SIN/COS requires 4 clock-
cycles after the input ANGLE is latched in. This means that the combinatorial block (the Unrolled
Cordic) can take up to 4 clock periods (25MHz) to propagate its result. Place and Route tools are
capable of fixing multi-cycle paths problem.
45)You have two counters counting upto 16, built from negedge DFF , First circuit is synchronous
and second is "ripple" (cascading), Which circuit has a less propagation delay? Why?
The synchronous counter will have lesser delay as the input to each flop is readily available before
the clock edge. Whereas the cascade counter will take long time as the output of one flop is used as
clock to the other. So the delay will be propagating. For Eg: 16 state counter = 4 bit counter = 4 Flip
flops Let 10ns be the delay of each flop The worst case delay of ripple counter = 10 * 4 = 40ns The
delay of synchronous counter = 10ns only.(Delay of 1 flop)
47)The circle can rotate clockwise and back. Use minimum hardware to build a circuit to indicate
the direction of rotating.?
2 sensors are required to find out the direction of rotating. They are placed like at the drawing. One
of them is connected to the data input of D flip-flop,and a second one - to the clock input. If the
circle rotates the way clock sensor sees the light first while D input (second sensor) is zero - the
output of the flip-flop equals zero, and if D input sensor "fires" first - the output of the flip-flop
becomes high.
3 input NAND:
Connect :
a) A and B to the first NAND gate
b) Output of first Nand gate is given to the two inputs of the second NAND gate (this basically
realizes the inverter functionality)
c) Output of second NAND gate is given to the input of the third NAND gate, whose other input is C
((A NAND B) NAND (A NAND B)) NAND C Thus, can be implemented using '3' 2-input NAND gates. I
guess this is the minimum number of gates that need to be used.
3 input NOR:
Same as above just interchange NAND with NOR ((A NOR B) NOR (A NOR B)) NOR C
3 input XNOR:
Same as above except the inputs for the second XNOR gate, Output of the first XNOR gate is one of
the inputs and connect the second input to ground or logical '0'
((A XNOR B) XNOR 0)) XNOR C
52)Convert D-FF into divide by 2. (not latch)? What is the max clock frequency of the circuit , given
the following information?
T_setup= 6nS
T_hold = 2nS
T_propagation = 10nS
Circuit:
Connect Qbar to D and apply the clk at clk of DFF and take the O/P at Q. It gives freq/2.
Max. Freq of operation:
1/ (propagation delay+setup time) = 1/16ns = 62.5 MHz
54) For the Circuit Shown below, What is the Maximum Frequency of Operation?Are there any
hold time violations for FF2? If yes, how do you modify the circuit to avoid them?
The minumum time period = 3+2+(1+1+1) = 8ns Maximum Frequency = 1/8n= 125MHz.
And there is a hold time violation in the circuit,because of feedback, if you observe, tcq2+AND gate
delay is less than thold2,To avoid this we need to use even number of inverters(buffers). Here we
need to use 2 inverters each with a delay of 1ns. then the hold time value exactly meets.
55)Design a D-latch using (a) using 2:1 Mux (b) from S-R Latch ?
56)How to implement a Master Slave flip flop using a 2 to 1 mux?
57)how many 2 input xor's are needed to inplement 16 input parity generator ?
It is always n-1 Where n is number of inputs.So 16 input parity generator will require 15 two input
xor's .
58)Design a circuit for finding the 9's compliment of a BCD number using 4-bit binary adder and
some external logic gates?
9's compliment is nothing but subracting the given no from 9.So using a 4 bit binary adder we can
just subract the given binary no from 1001(i.e. 9).Here we can use the 2's compliment method
addition.
59) what is Difference between writeback and write through cache?
A caching method in which modifications to data in the cache aren't copied to the cache source until
absolutely necessary. Write-back caching is available on many microprocessors , including all Intel
processors since the 80486. With these microprocessors, data modifications to data stored in the L1
cache aren't copied to main memory until absolutely necessary. In contrast, a write-through cache
performs all write operations in parallel -- data is written to main memory and the L1 cache
simultaneously. Write-back caching yields somewhat better performance than write-through
caching because it reduces the number of write operations to main memory. With this performance
improvement comes a slight risk that data may be lost if the system crashes.
A write-back cache is also called a copy-back cache.
Sending data encoded into your signal requires that the sender and receiver are both using the same
enconding/decoding method, and know where to look in the signal to find data. Asynchronous
systems do not send separate information to indicate the encoding or clocking information. The
receiver must decide the clocking of the signal on it's own. This means that the receiver must decide
where to look in the signal stream to find ones and zeroes, and decide for itself where each
individual bit stops and starts. This information is not in the data in the signal sent from transmitting
unit.
Synchronous systems negotiate the connection at the data-link level before communication begins.
Basic synchronous systems will synchronize two clocks before transmission, and reset their numeric
counters for errors etc. More advanced systems may negotiate things like error correction and
compression.
Time-dependent. it refers to processes where data must be delivered within certain time
constraints. For example, Multimedia stream require an isochronous transport mechanism to ensure
that data is delivered as fast as it is displayed and to ensure that the audio is synchronized with the
video.
Home