FIND ME ON

GitHub

LinkedIn

Bit Allocation Problem

🌱

Definition
InfoTheory

Introduction

Say we have a block of RVs X1,,XkX_{1},\dots,X_{k} and they’re scalar quantized. (Note that the XiX_{i} may have different distributions). The main goal we have here is that we want to minimize the overall MSE E[i=1k(XiQi(Xi))2]E\left[ \sum^{k}_{i=1}(X_{i}-Q_{i}(X_{i}))^{2} \right]where QiQ_{i} has NiN_{i} levels, under the condition that overall no more than BB bits are used: i=1klogNiB\sum_{i=1}^{k}\log N_{i}\le Bwhere Ni=2biN_{i}=2^{b_{i}} and logNi=bi\log N_{i}=b_{i}. Another way to interpret this is that for each RV in our random vector we assign it a NiN_{i}-level quantizer such that we meet our constraint and we wish to optimize it (i.e. minimize collective distortion, mini=1kD(Qi)\min \sum_{i=1}^{k}D(Q_{i})) under this constraint (i.e. keeping collective rate under a specified limit, BB).

We define WiW_{i} as the MSE of our constrained and optimal bib_{i}-bit quantizer: Wi(bi)=minQ:r(Q)biE[(XiQ(Xi))2]W_{i}(b_{i})=\min_{Q:r(Q)\le b_{i}}E[(X_{i}-Q(X_{i}))^{2}]We see if bib_{i} bits are used to quantize XiX_{i} optimally then the overall optimal distortion is D(b)=i=1kWi(bi)D(\mathbf{b})=\sum_{i=1}^{k}W_{i}(b_{i})where b=(b1,,bk)T\mathbf{b}=(b_{1},\dots,b_{k})^{T}. # Problem Definition Given the constraint i=1kbiB\sum_{i=1}^{k}b_{i}\le B find b=(b1,,bk)T\mathbf{b}=(b_{1},\dots,b_{k})^{T} minimizing D(b)D(\mathbf{b}).

Linked from