| Presentation | 2015-03-02 Algorithms to reduce the number of output symbols on condition that discrete memoryless channel satisfies admissible mutual information Takumi NAGAHARA, 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 channel coding 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, and proposed a suboptimal quantizer design algorithm by using greedy algorithm. In this paper, we consider quantizer design algorithms to reduce the number of output symbols as small as possible on condition that discrete channel satisfies admissible mutual information. We describe one optimal algorithm of quantizer design for binary-input discrete channel, and one greedy algorithm of quantizer design for discrete channel with a finite input alphabet. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | discrete channel / mutual information / quantizer design algorithm / SMAWK algorithm / greedy algorithm |
| Paper # | IT2014-86,ISEC2014-99,WBS2014-78 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2015/2/23(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 Security (ISEC) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Algorithms to reduce the number of output symbols on condition that discrete memoryless channel satisfies admissible mutual information |
| Sub Title (in English) | |
| Keyword(1) | discrete channel |
| Keyword(2) | mutual information |
| Keyword(3) | quantizer design algorithm |
| Keyword(4) | SMAWK algorithm |
| Keyword(5) | greedy algorithm |
| 1st Author's Name | Takumi NAGAHARA |
| 1st Author's Affiliation | Graduate School of Engineering, University of Fukui() |
| 2nd Author's Name | Yuta SAKAI |
| 2nd Author's Affiliation | Graduate School of Engineering, University of Fukui |
| 3rd Author's Name | Ken-ichi IWATA |
| 3rd Author's Affiliation | Graduate School of Engineering, University of Fukui |
| Date | 2015-03-02 |
| Paper # | IT2014-86,ISEC2014-99,WBS2014-78 |
| Volume (vol) | vol.114 |
| Number (no) | 471 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |