Information Bottleneck Graphs for receiver design

Publikationstyp
Conference Paper
Date Issued
2016-08-10
Sprache
English
Author(s)
Lewandowsky, Jan  
Stark, Maximilian  orcid-logo
Bauch, Gerhard  
Institut
Nachrichtentechnik E-8  
TORE-URI
http://hdl.handle.net/11420/3244
Volume
2016
Start Page
2888
End Page
2892
Article Number
7541827
Citation
IEEE International Symposium on Information Theory - Proceedings (2016): 7541827 (2016-08-10)
Contribution to Conference
IEEE International Symposium on Information Theory (2016)  
Publisher DOI
10.1109/ISIT.2016.7541827
Scopus ID
2-s2.0-84985940178
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.