Presentation 2014-07-18
On Quantization by Greedy Combining for Outputs of Discrete Memoryless Channels
Yuta SAKAI, Ken-ichi IWATA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Some quantization techniques are used in practice system to reduce the complexity of coding problem. Kurkoski and Yagi proposed an algorithm for finding the optimal quantizer design of channel output for any binary-input discrete memoryless channel in the sense of maximizing mutual information between the channel input and the quantizer output using dynamic programming for a given input distribution. Moreover, Kurkoski, Yamaguchi, and Kobayashi considered a channel input of a finite alphabet but not necessarily binary alphabet, and proposed a suboptimal quantizer design algorithm by using greedy algorithm. In this paper, we evaluate the time complexity and the precision of the algorithm proposed by Kurkoski, Yamaguchi, and Kobayashi.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) quantization of output of discrete channel / mutual information / suboptimal algorithm / greedy method
Paper # IT2014-34
Date of Issue

Conference Information
Committee IT
Conference Date 2014/7/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Quantization by Greedy Combining for Outputs of Discrete Memoryless Channels
Sub Title (in English)
Keyword(1) quantization of output of discrete channel
Keyword(2) mutual information
Keyword(3) suboptimal algorithm
Keyword(4) greedy method
1st Author's Name Yuta SAKAI
1st Author's Affiliation Graduate School of Engineering, University of Fukui()
2nd Author's Name Ken-ichi IWATA
2nd Author's Affiliation Graduate School of Engineering, University of Fukui
Date 2014-07-18
Paper # IT2014-34
Volume (vol) vol.114
Number (no) 138
Page pp.pp.-
#Pages 6
Date of Issue