Dynamic Programming for Sequential Deterministic Quantization of Discrete Memoryless Channels

28 Oct 2019 He Xuan Cai Kui Song Wentu Mei Zhen

In this paper, under a general cost function, we present a dynamic programming (DP) method to obtain an optimal sequential deterministic quantizer (SDQ) for $q$-ary input discrete memoryless channel (DMC). The DP method has complexity $O(q (N-M)^2 M)$, where $N$ and $M$ are the alphabet sizes of the DMC output and quantizer output, respectively... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • INFORMATION THEORY
  • INFORMATION THEORY