6.5.16 · D1 · Hardware › Advanced & Emerging Architectures › Approximate computing techniques
Approximate computing kehta hai: ek perfect answer zyada energy, time, aur chip-area leta hai ek "good enough" answer ke comparison mein — toh jin tasks mein koi fark nahi pata (photos, sound, AI guesses), hum deliberately thoda galat compute karte hain taaki bahut zyada savings mile. Parent page par jo bhi hai woh sirf do sawaalon ka careful jawab hai: kahan hum galat afford kar sakte hain, aur kitna ?
Yeh page assume karta hai ki tumne kuch bhi nahi dekha. Parent note padhne se pehle tumhe kuch tools chahiye. Hum har ek ko ek picture se banate hain, batate hain kyun topic ko woh chahiye, aur tabhi uska symbol use karte hain.
Definition Bit aur bit-width
n
Ek bit ek single yes/no switch hai — yeh 0 ya 1 hold karta hai. Bit-width , jo n likha jaata hai, simply kitne aise switches hum ek saath jodte hain ek number store karne ke liye hai.
Ek row of light switches ki picture karo. n switches ke saath, har ek independently upar ya neeche, tum 2 n alag patterns bana sakte ho — toh ek n -bit box mein 2 n distinct numbers aa sakte hain.
n ki zaroorat kyun hai
Zyada switches = ek finer, zyada exact number, lekin har switch chip par ek real wire hai jo build, charge, aur drain hona chahiye. Kam switches matlab physically chota, sasta, lower-energy circuit. Precision scaling (FP32 → FP16 → INT8) ka poora idea hai "chhota n use karo". Toh n is pure topic ka master dial hai.
In bit-patterns ke real number formats mein kaise badlte hain iske liye dekho: Precision and Number Formats (FP32, FP16, INT8) .
Saare switches equally matter nahi karte. Number 101 mein (jo roz ki counting mein 4 + 0 + 1 = 5 hai), left wala 1 worth 4 hai, right wala 1 worth 1 hai.
Most significant bit (MSB) sabse left wala switch hai — yeh value ka sabse bada chunk control karta hai. Least significant bit (LSB) sabse right wala hai — yeh sabse chhoti , finest detail control karta hai.
Intuition Topic ko yeh distinction kyun chahiye
LSB mein galat hona ek number ko thodi si amount se badalta hai; MSB mein galat hona use double ya half kar sakta hai. Approximate computing apni saari deliberate errors LSBs mein dalta hai aur MSBs ko kabhi nahi chhedta. Exactly isliye parent warn karta hai: "exponent ko kabhi approximate mat karo" — exponent ek super-MSB ki tarah hai jo magnitude control karta hai. In bits ke physically kahan rehne ke liye dekho Ripple-Carry vs Array Multipliers .
Parent ka aggregation proof char Greek-flavoured symbols use karta hai. Aao har ek ko samjhte hain.
ε
ε (Greek letter "epsilon") simply "ek chhoti error" matlab hai — jo answer humne compute kiya aur exact answer ke beech ka gap. Agar exact = 5 hai aur humne 4.9 mila, toh ε = − 0.1 .
μ aur expectation E [ ⋅ ]
μ ("mew") bahut se numbers ka average (typical value) hai. E [ X ] padho "expected value of X " — yeh wahi "average" ka idea hai, ek operation ki tarah likha jo random quantity par apply hoti hai. Toh E [ ε ] = 0 woh sentence hai "average par, error zero hai" — kabhi zyada, kabhi kam, cancel out ho jaata hai.
Definition Standard deviation
σ
σ ("sigma") measure karta hai ki errors kitni spread out hain — average se typical distance. Chhota σ = errors average ke paas rehti hain; bada σ = errors wildly scatter hoti hain.
E aur σ kyun chahiye
Parent ka magical claim hai "errors average out ho jaati hain" . Yeh sentence tab tak sense nahi banta jab tak tum nahi keh sako average = 0 (E [ ε ] = 0 ) aur spread = σ . Yeh do knobs exactly decide karte hain ki ek million chhoti errors cancel hongi ya pile up hongi.
E [ ε ] = 0 ko "koi error nahi hai" padhna
Kyun sahi lagta hai: zero average zero error jaisa laagta hai. Fix: har individual ε i zero nahi hai — sirf bahut sari ka average zero hai. Individual errors alive aur well hain; woh bas random directions mein point karte hain.
Definition Sigma-sum symbol
∑ i = 1 N ε i = ε 1 + ε 2 + ⋯ + ε N .
Ise padho: "counter i ko 1 se shuru karo, ε i ko N tak har value ke liye add karo." Yeh bas ek compact "yeh sab add karo" instruction hai.
N kyun aur N kyun nahi (parent proof ka heart)
Jab tum N errors add karte ho jo har ek random directions mein σ se wobble karte hain, woh line up nahi hote — woh partly cancel ho jaate hain, jaise N log har ek random step lete hain. Bheed N steps door nahi jaati; woh sirf lagbhag N steps drift karti hai. Isliye total error N σ ki tarah badhti hai jabki signal (seedha sum) N ki tarah badhta hai. Unhe divide karo aur relative error shrink ho jaati hai. Yeh approximate hardware ke liye mathematical permission slip hai.
Linked idea: yahi "errors aggregate hone par shrink hoti hain" reason hai ki Neural Network Quantization INT8 mein survive karta hai.
∝ padhna
A ∝ B matlab hai "A B ke saath lockstep mein badhta hai" — B double karo, A double ho jaata hai (kisi fixed multiplier tak). Yeh exact constant chhupa deta hai taaki hum relationship ki shape par focus kar sakein.
V 2 padhna
V voltage hai (electrical "push" jo chip ko milta hai). V 2 matlab hai V × V . Squaring effect ko dramatic banata hai: V ko apni value ka 0.8 karo aur V 2 girke 0.64 ho jaata hai — 20% nudge se 36% fall.
Is equation ki full derivation: Dynamic Power P = alpha C V^2 f . Area/energy version (E ∝ n 2 V 2 ek multiplier ke liye) Ripple-Carry vs Array Multipliers par rely karta hai.
Approximation tab hi allowed hai jab hum measure kar sakein ki yeh kitna bura hua. Woh measuring stick quality metric hai.
Definition Teen metrics jo tumhe milenge
Relative error : ∣ exact ∣ ∣ approx − exact ∣ — error true value ke fraction ke roop mein. "2% off."
Accuracy : ek classifier ke liye, inputs ka fraction jo woh abhi bhi correctly label karta hai.
PSNR (peak signal-to-noise ratio, decibels/dB mein): bada number = cleaner image. ≈ 40 dB se upar aankhein usually nahi bata paatein.
number kyun chahiye, feeling nahi
"Mujhe theek lagta hai" engineering nahi hai. Ek quality metric "good enough" ko ek hard threshold ("PSNR ≥ 40 dB") mein badal deta hai jo ek machine check kar sakti hai, toh hum prove kar sakte hain ki error bounded rehti hai. Woh word bounded is field ka poora promise hai.
Definition "Arrow" kya kehta hai
x N → ∞ 0 padho "jaise N bina end ke badhta hai, x utna 0 ke close ho jaata hai jitna hum chahein." Yeh ek single value nahi, ek trend ki destination describe karta hai.
Intuition Topic ko limit kyun chahiye
Relative-error formula μ N σ kabhi exactly zero nahi hota, lekin jaise hum zyada aggregate karte hain yeh udhar head karta hai. Limit arrow hume crisp punchline batane deta hai: jitna zyada aggregate karo, utni zyada sloppiness afford kar sakte ho.
Number formats FP32 FP16 INT8
Where to place error safely
Error epsilon mean mu spread sigma
Expectation E and variance
Proportional to and V squared
Power law P = alpha C V^2 f
Quality metrics PSNR accuracy
Yeh foundations samajhne ke baad related destinations: DRAM Refresh and Memory Reliability , Error-Correcting Codes , Dark Silicon and Energy-Efficient Architectures , aur parent 6.5.16 Approximate computing techniques (Hinglish) .
Right side cover karo. Agar tum har ek ka jawab de sako, tum parent note ke liye ready ho.
n (bit-width) symbol physically kya control karta hai?Kitne switch-wires ek number banate hain — circuit ki size, energy, aur precision ka master dial.
Kaunse bits corrupt karna safe hai aur kaunse forbidden hain? LSBs (chhoti value) approximate karna safe hai; MSBs aur exponents (badi value / magnitude) forbidden hain.
E [ ε ] = 0 actually kya claim karta hai?Error bahut sari operations mein average ho kar zero ho jaati hai — yeh nahi ki koi single error zero hai.
σ kya measure karta hai?Errors ki typical spread (scatter) unke average ke around.
N random errors ka total N ki tarah kyun badhta hai, N ki tarah kyun nahi?Random-direction errors partly cancel ho jaate hain, random walk ki tarah, toh bheed sirf lagbhag
N steps drift karti hai.
A ∝ B ka matlab kya hai?A , B ke saath lockstep mein scale karta hai, fixed constant multiplier ko ignore karke.
V 2 "jackpot" kyun hai?Power voltage squared par depend karti hai, toh ek chhota voltage cut ek outsized power saving deta hai.
Quality metric kis liye hai, ek word mein? "Good enough" ko ek measurable, bounded, provable threshold banana.
x N → ∞ 0 kya describe karta hai?Ek trend ki destination jaise N endlessly badhta hai — x 0 ki taraf head karta hai.