Professional Documents
Culture Documents
What is the Process for Refreshing the cell after reading every cell
what is the easiest way to reduce test time by using the whole circuit
as a single system
One of the main approaches to handle the clock Balance the delays of the
skew problem is critical paths in the circuit
The time that an input to a flip flop must remain setup time
stable after the edge of the clock pulse is called
____
What happens if the input is high in FSM? Change of state
The term Signal Integrity (SI) addresses two the timing and the quality
concerns in the electrical design aspects of the signal
Which process deals with the determination of Testing
resistance & capacitance of interconnections in
VLSI design?
Variation in voltage at the VDD or VSS node with Ground Bounce
respect to an external ground is called
In floor planning, placement and routing are Front end tool
In signal integrity, which noise/s occur/s due to Power/Ground Noise
impedance mismatch,In signal integrity, which
noise/s occur/s due to impedance mismatch,
stubs, vias and other interconnecct
Why is multiple stuck-at fault model preferred for Because single stuck-at
DUT? fault model is independent
of design style &
technology
2 3 4 2
after reading every after reading all cell after reading all 1
column column
Must be refreshed Loses data when Must be refreshed 2
periodically power is removed after Writing
Restorer Refresh counter Shift register 3
Joint Text Acess Group Joint Test Action Joint Text Apply Group 3
Group
fabrication logic design debugging 1
TCLK TDI TS 4
Capture-Shift-Update- Capture-Shift-Pause- Shift-Update-Capture- 2
Pause Update Pause
Test Action Port Text Access Text Action Port 1
controller Port controller controller
checking errors and checking all outputs checking all inputs 2
performance
by reducing adders by reducing by dividing circuit into 4
multiplexers subcircuits
2 1 3 1
4
Must be refreshed Loses data when Must be refreshed
periodically power is removed after Writing 2
B tree Clock tree S tree 1
To reduce area To generate multiple To reduce speed
clock phases 1
Making the line wider. Inserting one or more Clock delay
buffers along the line.
3
Increase the time Equalize the worst- Sequential clock block
period of the clock. case delays of every
combinational block 2
Global skew is more Both global and local Inside the chip, both
important than local skews are equally global and local skews
skew. important. are equal. 1
A MMM Algorithm A clock mesh driven in A Spine tree
parallel by a regular H-
tree 3
Back end tool End to End tool Both 1 and 2
2
Global Routing Detailed Routing All 1, 2 and 3
4
Prim’s algorithm Quine-McCluskey Lee-Moore algorithm
algorithm 4
Increases Constant Changes
2
Crosstalk Noise Reflection Noise Ground Noise
3
Average Path Longest Path Medium Path 1
Joint Text Acess Group Joint Test Access Joint Test Action Group
Group 4
Fabrication Logic design Debugging 1
Test Access Text Access Text Action Port
Port controller Port controller controller 2
Flipflops Counter Register 1
TCLK TDI TS
4
Parallel Adder Multi Adder Single Adder 2
Resistor IC Component 3
SRAM ROM RAM 2
It is easier to It is faster than a It requires advance
implement logically ripple-carry adder knowledge of the final
than a full adder answer 3
Half-adder and full- Asynchronous and One and two’s-
adder synchronous complement 2
3 2 5
3
If all of the output are If all of the input are If all of the output are
independent of the dependent on the dependent on the
inputs output input 2
Color Thinness Shapes
2
Green Black Red 4
Separations Extensions Colors 4
Micron rules Layer rules Thickness rules 1
Constant voltage Costant electric and Costant current model
scaling voltage scaling 3
Decreased Must not vary Exponentially
decreased 2
Channel length Width Thickness d
2
Textual entry Graphical entry Simulation
1
Switch level logic Gate level logic Design level logic 2
Microwind Pyxis Callibre 1
Polysilicon n diffusion p diffusion 1
Timing simulator Logic level simulator Functional simulator 2
gate switching delay gate switching delay gate power dissipation A
and gate power and net gate power and absorption
absorption
NAND NOR OR C
3 to 4 4 to 5 5 to 6
A
three four five
D
cut off non saturation saturation
D
5 25 2 25 B
the output was the output was the output was
previously 1, and K = 1 previously 1, and J = 1 previously 0, J = 0 and C
K=1
hold time propagation time recovery time
B
Two capacitors One MOSFET and one One MOSFET and two
C
capacitor capacitors
8 16 2
D
2 ms 8 µs 8ms
B
bus speed read/write speed write/data speed
A
8ns 6ns 4 ns
D
EPROM ROM SRAM
D
DRAM PROM ROM
B
PROM SRAM DRAM D
4-256 MB 8-128 MB 64-128 MB B
address multiplexing data selection and the data selection and CPU
and the refresh refresh operation accessing B
operation
transistor capacitor inductor
A
IBM MIPS APPLE A
boot mode auto mode manual mode A
VDD/2 VDD+1 2VDD B
89% of time . 49% of time 39% of time
A
mild voltage ON OFF
C
D
Prim’s algorithm Quine-McCluskey Lee-Moore algorithm
algorithm D
Increases Constant Changes
B
Crosstalk Noise Reflection Noise Ground Noise
C
Average Path Longest Path Medium Path A
Inter electrode Electrolytic capacitance All
D
capacitance
Load Capacitance Junction capacitance Bulk capacitance B
Wire connecting the Parasitic capacitance parasitic and junction
gates of 2 different existing between capacitance
inverters metal and C
polysiliconconnection
1 4 3 A