{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:40:23Z","timestamp":1760190023760,"version":"build-2065373602"},"reference-count":39,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T00:00:00Z","timestamp":1568073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The information bottleneck method is a generic clustering framework from the field of machine learning which allows compressing an observed quantity while retaining as much of the mutual information it shares with the quantity of primary relevance as possible. The framework was recently used to design message-passing decoders for low-density parity-check codes in which all the arithmetic operations on log-likelihood ratios are replaced by table lookups of unsigned integers. This paper presents, in detail, the application of the information bottleneck method to polar codes, where the framework is used to compress the virtual bit channels defined in the code structure and show that the benefits are twofold. On the one hand, the compression restricts the output alphabet of the bit channels to a manageable size. This facilitates computing the capacities of the bit channels in order to identify the ones with larger capacities. On the other hand, the intermediate steps of the compression process can be used to replace the log-likelihood ratio computations in the decoder with table lookups of unsigned integers. Hence, a single procedure produces a polar encoder as well as its tailored, quantized decoder. Moreover, we also use a technique called message alignment to reduce the space complexity of the quantized decoder obtained using the information bottleneck framework.<\/jats:p>","DOI":"10.3390\/a12090192","type":"journal-article","created":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T10:52:26Z","timestamp":1568112746000},"page":"192","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Coarsely Quantized Decoding and Construction of Polar Codes Using the Information Bottleneck Method"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1409-3191","authenticated-orcid":false,"given":"Syed Aizaz Ali","family":"Shah","sequence":"first","affiliation":[{"name":"Institute of Communications, Hamburg University of Technology, 21073 Hamburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1750-5895","authenticated-orcid":false,"given":"Maximilian","family":"Stark","sequence":"additional","affiliation":[{"name":"Institute of Communications, Hamburg University of Technology, 21073 Hamburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Bauch","sequence":"additional","affiliation":[{"name":"Institute of Communications, Hamburg University of Technology, 21073 Hamburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,9,10]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Lewandowsky, J., and Bauch, G. (2015, January 14\u201316). Trellis based node operations for LDPC decoders from the Information Bottleneck method. Proceedings of the 9th International Conference on Signal Processing and Communication Systems (ICSPCS), Cairns, Australia.","key":"ref_1","DOI":"10.1109\/ICSPCS.2015.7391731"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"4054","DOI":"10.1109\/ACCESS.2018.2797694","article-title":"Information-Optimum LDPC Decoders Based on the Information Bottleneck Method","volume":"6","author":"Lewandowsky","year":"2018","journal-title":"IEEE Access"},{"unstructured":"Tishby, N., Pereira, F.C., and Bialek, W. (1999, January 22\u201324). The Information Bottleneck Method. Proceedings of the 37th Allerton Conference on Communication and Computation, Monticello, IL, USA.","key":"ref_3"},{"unstructured":"Slonim, N. (2002). The Information Bottleneck: Theory and Applications. [Ph.D. Thesis, Hebrew University of Jerusalem].","key":"ref_4"},{"doi-asserted-by":"crossref","unstructured":"Kurkoski, B.M., Yamaguchi, K., and Kobayashi, K. (December, January 30). Noise Thresholds for Discrete LDPC Decoding Mappings. Proceedings of the IEEE GLOBECOM 2008\u20132008 IEEE Global Telecommunications Conference, New Orleans, LO, USA.","key":"ref_5","DOI":"10.1109\/GLOCOM.2008.ECP.214"},{"doi-asserted-by":"crossref","unstructured":"Richardson, T., and Urbanke, R. (2008). Modern Coding Theory, Cambridge University Press.","key":"ref_6","DOI":"10.1017\/CBO9780511791338"},{"doi-asserted-by":"crossref","unstructured":"Stark, M., Lewandowsky, J., and Bauch, G. (2018). Information-Bottleneck Decoding of High-Rate Irregular LDPC Codes for Optical Communication Using Message Alignment. Appl. Sci., 8.","key":"ref_7","DOI":"10.3390\/app8101884"},{"doi-asserted-by":"crossref","unstructured":"Stark, M., Lewandowsky, J., and Bauch, G. (2018, January 9\u201313). Information-Optimum LDPC Decoders with Message Alignment for Irregular Codes. Proceedings of the 2018 IEEE Global Communications Conference (GLOBECOM), Abu Dhabi, UAE.","key":"ref_8","DOI":"10.1109\/GLOCOM.2018.8648053"},{"doi-asserted-by":"crossref","unstructured":"Balatsoukas-Stimming, A., Meidlinger, M., Ghanaatian, R., Matz, G., and Burg, A. (2015, January 14\u201316). A fully-unrolled LDPC decoder based on quantized message passing. Proceedings of the 2015 IEEE Workshop on Signal Processing Systems SiPS, Hangzhou, China.","key":"ref_9","DOI":"10.1109\/SiPS.2015.7345024"},{"doi-asserted-by":"crossref","unstructured":"Meidlinger, M., Balatsoukas-Stimming, A., Burg, A., and Matz, G. (2015, January 8\u201311). Quantized message passing for LDPC codes. Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA.","key":"ref_10","DOI":"10.1109\/ACSSC.2015.7421419"},{"doi-asserted-by":"crossref","unstructured":"Meidlinger, M., and Matz, G. (2017, January 3\u20136). On irregular LDPC codes with quantized message passing decoding. Proceedings of the 2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Sapporo, Japan.","key":"ref_11","DOI":"10.1109\/SPAWC.2017.8227780"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1109\/TVLSI.2017.2766925","article-title":"A 588-Gb\/s LDPC Decoder Based on Finite-Alphabet Message Passing","volume":"26","author":"Ghanaatian","year":"2018","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels","volume":"55","author":"Arikan","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Hussami, N., Korada, S.B., and Urbanke, R. (July, January 28). Performance of polar codes for channel and source coding. Proceedings of the 2009 IEEE International Symposium on Information Theory, Seoul, Korea.","key":"ref_14","DOI":"10.1109\/ISIT.2009.5205860"},{"doi-asserted-by":"crossref","unstructured":"Bakshi, M., Jaggi, S., and Effros, M. (2010, January 13\u201318). Concatenated Polar codes. Proceedings of the 2010 IEEE International Symposium on Information Theory, Austin, TX, USA.","key":"ref_15","DOI":"10.1109\/ISIT.2010.5513508"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2213","DOI":"10.1109\/TIT.2015.2410251","article-title":"List Decoding of Polar Codes","volume":"61","author":"Tal","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1109\/LCOMM.2012.111612.121898","article-title":"An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check","volume":"16","author":"Li","year":"2012","journal-title":"IEEE Commun. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2342","DOI":"10.1109\/LCOMM.2016.2607169","article-title":"Parity-Check-Concatenated Polar Codes","volume":"20","author":"Wang","year":"2016","journal-title":"IEEE Commun. Lett."},{"unstructured":"Nokia (2016, January 14\u201319). Chairman\u2019s notes of AI 7.1.5 on channel coding and modulation for NR. Proceedings of the Meeting 87, 3GPP TSG RAN WG1, Reno, NV, USA.","key":"ref_19"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1109\/LCOMM.2008.080017","article-title":"A performance comparison of polar codes and Reed-Muller codes","volume":"12","author":"Arikan","year":"2008","journal-title":"IEEE Commun. Lett."},{"unstructured":"ETSI (2019). 5G; NR; Multiplexing and Channel Coding (Release 15), ETSI. Version 15.6.0; Technical Specification (TS) 38.212, 3rd Generation Partnership Project (3GPP).","key":"ref_21"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1109\/LCOMM.2009.090428","article-title":"Performance of Polar Codes with the Construction using Density Evolution","volume":"13","author":"Mori","year":"2009","journal-title":"IEEE Commun. Lett."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"6562","DOI":"10.1109\/TIT.2013.2272694","article-title":"How to Construct Polar Codes","volume":"59","author":"Tal","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"3221","DOI":"10.1109\/TCOMM.2012.081512.110872","article-title":"Efficient Design and Decoding of Polar Codes","volume":"60","author":"Trifonov","year":"2012","journal-title":"IEEE Trans. Commun."},{"doi-asserted-by":"crossref","unstructured":"Stark, M., Shah, S.A.A., and Bauch, G. (2018, January 15\u201318). Polar code construction using the information bottleneck method. Proceedings of the 2018 IEEE Wireless Communications and Networking Conference Workshops, Barcelona, Spain.","key":"ref_25","DOI":"10.1109\/WCNCW.2018.8368978"},{"doi-asserted-by":"crossref","unstructured":"Shah, S.A.A., Stark, M., and Bauch, G. (2019, January 11\u201314). Design of Quantized Decoders for Polar Codes using the Information Bottleneck Method. Proceedings of the 12th International ITG Conference on Systems, Communications and Coding (SCC 2019), Rostock, Germany.","key":"ref_26","DOI":"10.3390\/a12090192"},{"doi-asserted-by":"crossref","unstructured":"Balatsoukas-Stimming, A., Parizi, M.B., and Burg, A. (2014, January 4\u20139). LLR-based successive cancellation list decoding of polar codes. Proceedings of the 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Florence, Italy.","key":"ref_27","DOI":"10.1109\/ICASSP.2014.6854333"},{"doi-asserted-by":"crossref","unstructured":"Hassani, S.H., and Urbanke, R. (2012, January 1\u20136). Polar codes: Robustness of the successive cancellation decoder with respect to quantization. Proceedings of the 2012 IEEE International Symposium on Information Theory Proceedings, Cambridge, MA, USA.","key":"ref_28","DOI":"10.1109\/ISIT.2012.6283642"},{"doi-asserted-by":"crossref","unstructured":"Shi, Z., Chen, K., and Niu, K. (2014, January 14\u201317). On Optimized Uniform Quantization for SC Decoder of Polar Codes. Proceedings of the 2014 IEEE 80th Vehicular Technology Conference (VTC2014-Fall), Vancouver, BC, Canada.","key":"ref_29","DOI":"10.1109\/VTCFall.2014.6966081"},{"doi-asserted-by":"crossref","unstructured":"Giard, P., Sarkis, G., Balatsoukas-Stimming, A., Fan, Y., Tsui, C., Burg, A., Thibeault, C., and Gross, W.J. (2016, January 22\u201325). Hardware decoders for polar codes: An overview. Proceedings of the 2016 IEEE International Symposium on Circuits and Systems (ISCAS), Montreal, QC, Canada.","key":"ref_30","DOI":"10.1109\/ISCAS.2016.7527192"},{"doi-asserted-by":"crossref","unstructured":"Neu, J. (2019). Quantized Polar Code Decoders: Analysis and Design. arXiv.","key":"ref_31","DOI":"10.1109\/IEEECONF44664.2019.9048843"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/18.485714","article-title":"Iterative decoding of binary block and convolutional codes","volume":"42","author":"Hagenauer","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Lewandowsky, J., Stark, M., and Bauch, G. (2016, January 10\u201315). Information Bottleneck Graphs for receiver design. Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain.","key":"ref_33","DOI":"10.1109\/ISIT.2016.7541827"},{"unstructured":"Stark, M., and Lewandowsky, J. (2019, August 25). Information Bottleneck Algorithms in Python. Available online: https:\/\/goo.gl\/QjBTZf.","key":"ref_34"},{"doi-asserted-by":"crossref","unstructured":"Lewandowsky, J., Stark, M., and Bauch, G. (2018, January 3\u20137). A Discrete Information Bottleneck Receiver with Iterative Decision Feedback Channel Estimation. Proceedings of the 2018 IEEE 10th International Symposium on Turbo Codes Iterative Information Processing (ISTC), Hong Kong, China.","key":"ref_35","DOI":"10.1109\/ISTC.2018.8625342"},{"unstructured":"Hassanpour, S., Wuebben, D., and Dekorsy, A. (2017, January 6\u20139). Overview and Investigation of Algorithms for the Information Bottleneck Method. Proceedings of the 11th International ITG Conference on Systems, Communications and Coding (SCC 2017), Hamburg, Germany.","key":"ref_36"},{"doi-asserted-by":"crossref","unstructured":"Lewandowsky, J., Stark, M., and Bauch, G. (2017, January 25\u201330). Message alignment for discrete LDPC decoders with quadrature amplitude modulation. Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","key":"ref_37","DOI":"10.1109\/ISIT.2017.8007065"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"4521","DOI":"10.1109\/TCOMM.2019.2908870","article-title":"Decoder-Tailored Polar Code Design Using the Genetic Algorithm","volume":"67","author":"Elkelesh","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1109\/LCOMM.2014.2325811","article-title":"Construction and Block Error Rate Analysis of Polar Codes Over AWGN Channel Based on Gaussian Approximation","volume":"18","author":"Wu","year":"2014","journal-title":"IEEE Commun. Lett."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/9\/192\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:18:34Z","timestamp":1760188714000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/9\/192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,10]]},"references-count":39,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2019,9]]}},"alternative-id":["a12090192"],"URL":"https:\/\/doi.org\/10.3390\/a12090192","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2019,9,10]]}}}