IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2019-06-21 11:20
Discrete Polar Decoder using Information Bottleneck
Akira Yamada, Tomoaki Ohtsuki (Keio Univ.) RCS2019-92
Abstract (in Japanese) (See Japanese page) 
(in English) Polar codes are attracting much attention and being used for control channels of the 5th generation of mobile communication system (5G). This encoding scheme is based on the operation of channel polarization. As a feature, it is easier to implement encoder and decoder than Turbo codes and LDPC (Low Density Parity Check)codes. One of the decoding methods of polar codes is BP (Belief Propagation) decoding, which can decode in parallel, so that decoding can be performed at high speed. However, due to hardware limitation, calculations on the decoder get very complicated. This issue can be solved by using the information bottleneck method, which is a clustering framework from the field of machine learning. This method compresses an observation variable to a quantized one while attempting to preserve the mutual information shared with a relevant random variable. In the conventional research, the information bottleneck method is applied to BP decoding of LDPC codes. In this report,the information bottleneck method is used for the BP decoding of polar codes. The BP decoding of polar codes is distinct from that of LDPC codes.Since it has several types of messages, and each time a message is updated,the decoding becomes more complex. By using the information bottleneck method, the decoder can compress the channel outputs and the messages of BP into unsigned integers while preventing degradation of the error correcting performance. Thus, we can reduce the complexity of calculation in the decoding process and easily implement the decoder. This report also investigates the minimum bit width for quantization and the suboptimal $E_b/N_0$ for designing the lookup tables used for updating messages. The simulation results show that the error correcting capability of the discrete polar decoders of the proposed method is negligibly degraded compared to BP decoding without compression.
Keyword (in Japanese) (See Japanese page) 
(in English) Channel Coding / Polar Codes / BP Decoding / Information Bottleneck method / / / /  
Reference Info. IEICE Tech. Rep., vol. 119, no. 90, RCS2019-92, pp. 321-326, June 2019.
Paper # RCS2019-92 
Date of Issue 2019-06-12 (RCS) 
ISSN Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF RCS2019-92

Conference Information
Committee RCS  
Conference Date 2019-06-19 - 2019-06-21 
Place (in Japanese) (See Japanese page) 
Place (in English) Miyakojima Hirara Port Terminal Building 
Topics (in Japanese) (See Japanese page) 
Topics (in English) First Presentation in IEICE Technical Committee, Resource Control, Scheduling, Wireless Communications, etc. 
Paper Information
Registration To RCS 
Conference Code 2019-06-RCS 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Discrete Polar Decoder using Information Bottleneck 
Sub Title (in English)  
Keyword(1) Channel Coding  
Keyword(2) Polar Codes  
Keyword(3) BP Decoding  
Keyword(4) Information Bottleneck method  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Akira Yamada  
1st Author's Affiliation Keio University (Keio Univ.)
2nd Author's Name Tomoaki Ohtsuki  
2nd Author's Affiliation Keio University (Keio Univ.)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2019-06-21 11:20:00 
Presentation Time 10 minutes 
Registration for RCS 
Paper # RCS2019-92 
Volume (vol) vol.119 
Number (no) no.90 
Page pp.321-326 
#Pages
Date of Issue 2019-06-12 (RCS) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan