activity
20082018
most citedBayesian Optimal Approximate Message Passing to Recover Structured Sparse Signals

7 citations · 17 across the 8 of their papers we have counts for

collaborators
Showing cs.ITShow all

5 papers · 1 filter

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…

cs.IT2015★ 7 cited

Bayesian Optimal Approximate Message Passing to Recover Structured Sparse Signals

Martin Mayer, Norbert Goertz

We present a novel compressed sensing recovery algorithm - termed Bayesian Optimal Structured Signal Approximate Message Passing (BOSSAMP) - that jointly exploits the prior distrib…

cs.IT2012

Maximum Eigenmode Relaying with statistical Channel State Information at the Relay

Mehdi Molu, Norbert Goertz

Optimal precoding in the relay is investigated to maximize ergodic capacity of a multiple antenna relay channel. The source and the relay nodes are equipped with multiple antennas…

cs.IT2012★ 2 cited

A Comparison of Soft and Hard Coded Relaying

Mehdi M. Molu, Norbert Goertz

"Amplify and Forward" and "Decode and Forward" are the two main relaying functions that have been proposed since the advent of cooperative communication. "\textit{Soft} Decode and…

cs.IT2008★ 4 cited

Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes

David G. M. Mitchell, Ali E. Pusane, Norbert Goertz +1

In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protograph-base…