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 relevan...

Full description

Saved in:
Bibliographic Details
Published in2016 IEEE International Symposium on Information Theory (ISIT) pp. 2888 - 2892
Main Authors Lewandowsky, Jan, Stark, Maximilian, Bauch, Gerhard
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 01.07.2016
Subjects
Belief propagation
Channel estimation
Decoding
Density
Graphs
Information theory
Integers
Parity
Parity check codes
Random variables
Receivers
Signal processing
Tables
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:2157-8117
DOI:10.1109/ISIT.2016.7541827