CalcPath
Subjects
Dashboard
Diagnostic
Feedback
Search...
Quantization
Turning the theory into a codebook: scalar quantizers, the Lloyd–Max conditions, and why quantizing vectors beats quantizing one sample at a time.
0/11 mastered
1 / 11
The optimal 1-bit quantizer for
X
∼
N
(
0
,
1
)
X \sim N(0,1)
X
∼
N
(
0
,
1
)
has levels
±
a
\pm a
±
a
.
Compute
a
a
a
.
Review the explanation for this topic →
Your answer
Draw
Hint
Type your answer — press Enter to check
Enter your answer
( )
x
n
√
⌫
AC
7
8
9
+
4
5
6
−
1
2
3
×
0
.
a
b
Check
↵
÷
#11728
All topics
All Information Theory topics