ArticleslgStudy

computer science

Glitch removal

Glitch removal is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Glitch removal rather than just read about it. In short: Glitch removal is the elimination of glitches—unnecessary signal transitions without functionality—from electronic circuits. Power dissipation of a gate occurs in two ways: static power dissipation and dynamic power dissipation.

Glitch removal — main illustration
Glitch removal — illustration

Key takeaways

  • Glitch removal belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Glitch removal to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Glitch removal from memory before moving on to harder problems.

Reference excerpt

Glitch removal is the elimination of glitches—unnecessary signal transitions without functionality—from electronic circuits. Power dissipation of a gate occurs in two ways: static power dissipation and dynamic power dissipation. Glitch power comes under dynamic dissipation in the circuit and is directly proportional to switching activity. Glitch power dissipation is 20%–70% of total power dissipation and hence glitching should be eliminated for low power design. Switching activity occurs due to signal transitions which are of two types: functional transition and a glitch. Switching power dissipation is directly proportional to the switching activity (α), load capacitance (C), Supply voltage (V), and clock frequency (f) as:

P = α·C·V2·f Switching activity means transition to different levels. Glitches are dependent on signal transitions and more glitches results in higher power dissipation. As per above equation switching power dissipation can be controlled by controlling switching activity (α), voltage scaling etc.

Glitch reduction techniques

Reducing switching activity As discussed, more transition results in more glitches and hence more power dissipation. To minimize glitch occurrence, switching activity should be minimized. For example, Gray code could be used in counters instead of binary code, since every increment in Gray code only flips one bit.

Gate freezing Gate freezing minimizes power dissipation by eliminating glitching. It relies on the availability of modified standard library cells such as the so-called F-Gate. This method consists of transforming high glitch gates into modified devices which filter out the glitches when a control signal is applied. When the control signal is high, the F-Gate operates as normal but when the control signal is low, the gate output is disconnected from the ground. As a result, it can never be discharged to logic 0 and glitches are prevented.

Hazard filtering and balanced path delay

Hazards in digital circuits are unnecessary transitions due to varying path delays in the circuit. Balanced path delay techniques can be used for resolving differing path delays. To make path delays equal, buffer insertion is done on the faster paths. Balanced path delay will avoid glitches in the output. Hazard filtering is another way to remove glitching. In hazard filtering gate propagation delays are adjusted. This results in balancing all path delays at the output. Hazard filtering is preferred over path balancing as path balancing consumes more power due to the insertion of additional buffers.

Gate sizing Gate upsizing and gate downsizing techniques are used for path balancing. A gate is replaced by a logically equivalent but differently-sized cell so that delay of the gate is changed. Because increasing the gate size also increases power dissipation, gate-upsizing is only used when power saved by glitch removal is more than the power dissipation due to the increase in size. Gate sizing affects glitching transitions but does not affect the functional transition.

Multiple threshold transistor The delay of a gate is a function of its threshold voltage. Non-critical paths are selected and threshold voltage of the gates in these paths is increased. This results in balanced propagation delay along different paths converging at the receiving gate. Performance is maintained since it is determined by the time required by the critical path. A higher threshold voltage also reduces the leakage current of a path.

See also Filter capacitor Operand isolation CPU power dissipation Dynamic voltage scaling Clock gating Bus encoding Rechargeable battery Switching losses

References

Further reading Hyungoo, Lee; Hakgun, Shin; Juho, Kim (2004). "Glitch Elimination by Gate Freezing, Gate Sizing and Buffer Insertion for Low Power Optimization Circuit". 30th Annual Conference of IEEE Industrial Electronics Society, 2004. IECON 2004. Vol. 3. pp. 2126–2131. doi:10.1109/IECON.2004.1432125. ISBN 978-0-7803-8730-0. S2CID 21217122. Coudert, Olivier (September 1997). "Gate Sizing for Constrained Delay/Power/Area Optimization" (PDF). IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 5 (4): 465–472. CiteSeerX 10.1.1.474.766. doi:10.1109/92.645073. Archived (PDF) from the original on 2024-01-01. Retrieved 2024-01-01. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help) Sapatnekar, Sachin S.; Chuang, Weitong, Power-Delay Optimizations in Gate Sizing (PDF), archived (PDF) from the original on 2015-09-23, retrieved 2015-04-17 Shum, Warren; Anderson, Jason H. (2011), FPGA Glitch Power Analysis and Reduction, International Symposium on Low power electronics and design (ISLPED), pp. 27–32 Zhanping, Chen; Liqiong, Wei; Kaushik, Roy (March 1997), Reducing Glitching and Leakage Power in Low Voltage CMOS Circuits, Purdue University School of Electrical and Computer Engineering, archived from the original on 2016-03-04, retrieved 2016-05-29

External links Patent US6356101 B1: Glitch Removal Circuitary, 2002-03-12, http://www.google.co.in/patents/US6356101 Archived 2015-04-17 at the Wayback Machine. https://learn.digilentinc.com/Documents/277 Archived 2015-04-17 at the Wayback Machine

Illustrations

Glitch removal: A glitch (circled in red) occurring during circuit operation
A glitch (circled in red) occurring during circuit operation
Glitch removal: Balanced path delay technique
Balanced path delay technique

Worked examples

Example 1 — a first encounter with Glitch removal

Start with the simplest possible case. Write down what Glitch removal claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Glitch removal before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Glitch removal ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Glitch removal

In research
Glitch removal appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Glitch removal in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Glitch removal is common in secondary-school and first-year university syllabi. It links to neighbouring topics Computer errors, Digital electronics, Electronics optimization, so understanding it makes those chapters shorter.
In everyday life
Look for Glitch removal outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Glitch removal” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Glitch removal in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Glitch removal means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Glitch removal out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Glitch removal in simple terms?

Glitch removal is the elimination of glitches—unnecessary signal transitions without functionality—from electronic circuits. Power dissipation of a gate occurs in two ways: static power dissipation and dynamic power dissipation.

Why does Glitch removal matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Glitch removal?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Glitch removal.

Tags

  • Computer errors
  • Digital electronics
  • Electronics optimization
  • Energy conservation
  • Software bugs

Keep exploring