activity
20072017
most citedA 588 Gbps LDPC Decoder Based on Finite-Alphabet Message Passing

88 citations · 175 across the 11 of their papers we have counts for

collaborators

16 papers

math.NA2017

Sampling and Reconstruction in Distinct Subspaces Using Oblique Projections

Peter Berger, Karlheinz Gröchenig, Gerald Matz

We study reconstruction operators on a Hilbert space that are exact on a given reconstruction subspace. Among those the reconstruction operator obtained by the least squares fit ha…

cs.AR2017★ 88 cited

A 588 Gbps LDPC Decoder Based on Finite-Alphabet Message Passing

Reza Ghanaatian, Alexios Balatsoukas-Stimming, Christoph Muller +4

An ultra-high throughput low-density parity check (LDPC) decoder with an unrolled full-parallel architecture is proposed, which achieves the highest decoding throughput compared to…

cs.IT2016

Dictator Functions Maximize Mutual Information

Georg Pichler, Pablo Piantanida, Gerald Matz

Let denote independent, identically distributed copies of two arbitrarily correlated Rademacher random variables . We prove that the inequality…

cs.IT2016★ 34 cited

Distributed Information-Theoretic Clustering

Georg Pichler, Pablo Piantanida, Gerald Matz

We study a novel multi-terminal source coding setup motivated by the biclustering problem. Two separate encoders observe two i.i.d. sequences and , respectively. The goa…

cs.IT2015

Quantized Message Passing for LDPC Codes

Michael Meidlinger, Alexios Balatsoukas-Stimming, Andreas Burg +1

We propose a quantized decoding algorithm for low- density parity-check codes where the variable node update rule of the standard min-sum algorithm is replaced with a look-up table…

cs.IT2015

An Approach to Complex Bayesian-optimal Approximate Message Passing

Gabor Hannak, Martin Mayer, Gerald Matz +1

In this work we aim to solve the compressed sensing problem for the case of a complex unknown vector by utilizing the Bayesian-optimal structured signal approximate message passing…