Information Bottleneck Graphs for receiver design

A generic design method for low complexity receivers is presented. The method pairs factor graphs and the Information Bottleneck method in one framework. Consequently, the method is called Information Bottleneck Graphs. The main idea of Information Bottleneck Graphs is optimizing the flow of relevant information through the signal processors. In contrast to most topical receivers with high precision signal processing units, Information Bottleneck Graphs yield receivers purely working on unsigned integers. All signal processing degenerates to lookup operations in tables of integers. Information Bottleneck Graphs are exemplarily applied to develop a complete coherent receiver including analog-to-digital conversion, channel estimation and decoding of Low Density Parity Check codes that only works on unsigned integers. This receiver uses recently introduced discrete decoders for Low Density Parity Check codes.

[1]  Naftali Tishby,et al.  Multivariate Information Bottleneck , 2001, Neural Computation.

[2]  Gerald Matz,et al.  A fully-unrolled LDPC decoder based on quantized message passing , 2015, 2015 IEEE Workshop on Signal Processing Systems (SiPS).

[3]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[4]  Brian M. Kurkoski,et al.  Decoding LDPC codes with mutual information-maximizing lookup tables , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[5]  A. Genz.  Numerical Computation of Multivariate Normal Probabilities , 1992 .

[6]  Gerald Matz,et al.  Low-complexity MIMO-BICM receivers with imperfect channel state information: Capacity-based performance comparison , 2010, 2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[7]  Brian M. Kurkoski,et al.  Noise Thresholds for Discrete LDPC Decoding Mappings , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[8]  Gerhard Bauch,et al.  Trellis based node operations for LDPC decoders from the Information Bottleneck method , 2015, 2015 9th International Conference on Signal Processing and Communication Systems (ICSPCS).

[9]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[10]  Naftali Tishby,et al.  The information bottleneck method , 2000, ArXiv.

[11]  Noam Slonim,et al.  The Information Bottleneck : Theory and Applications , 2006 .

[12]  V. V. Vityazev,et al.  Min-sum algorithm-structure based decoding algorithms for LDPC codes , 2014, 2014 3rd Mediterranean Conference on Embedded Computing (MECO).

[13]  Frank R. Kschischang.  Codes defined on graphs , 2003, IEEE Commun. Mag..

[14]  Tetsunao Matsuta,et al.  国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .