Publication

Integer-Forcing architectures for MIMO: Distributed implementation and SIC

Publications associées (55)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Is Non-Unique Decoding Necessary?

Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

In mutiterminal communication systems, signals carrying messages meant for different destinations are often observed together at any given destination receiver. Han and Kobayashi (1981) proposed a receiving strategy which performs a joint decoding of messa ...

EPFL Technical Report2011

Sampling of Sparse Channels with Common Support

Martin Vetterli, Ali Hormati, Yann Barbotin

The present paper proposes and studies an algorithm to estimate chan- nels with a sparse common support (SCS). It is a generalization of the classical sampling of signals with Finite Rate of Innovation (FRI) and thus called SCS-FRI. It is applicable to OFD ...

2011

A tight bound on the performance of a minimal-delay joint source-channel coding scheme

Bixio Rimoldi, Marius Kleiner

An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the source, transmit ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Integer-Forcing Linear Receivers

Michael Christoph Gastpar

complexity of multiple antenna systems. In a traditional linear receiver architecture, the receive antennas are used to separate out the codewords sent by each transmit antenna, which can then be decoded individually. Although easy to implement, this appro ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Multiuser Two-Way Amplify-and-Forward Relay Processing and Power Control Methods for Beamforming Systems

Ali H. Sayed

In this paper, multiple-input multiple-output (MIMO) relay transceiver processing is proposed for multiuser two-way relay communications. The relay processing is optimized based on both zero-forcing (ZF) and minimum mean-square-error (MMSE) criteria under ...

IEEE2010

Distributed beamforming and mode selection based on instantaneous system throughput

Ali H. Sayed

In this paper, we design cooperative beamforming weights for source, relay and destination nodes based on a minimum means-quare-error (MMSE) formulation under network power constraints. We also propose a mode selection procedure based on the instantaneous ...

IEEE2010

Distributed Karhunen-Loeve Transform With Nested Subspaces

Michael Christoph Gastpar, Naveen Goela

A network in which sensors observe a common Gaussian source is analyzed. Using a fixed linear transform, each sensor compresses its high-dimensional observation into a low-dimensional representation. The latter is provided to a central decoder that reconst ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Multiuser two-way relaying method for beamforming systems

Ali H. Sayed

Relay transceiver processing for multiuser two-way communications is optimized based on zero-forcing (ZF) and minimum mean-square-error (MMSE) formulations under relay power constraints. Cochannel interference (CCI) frommultiusers and self-interference (SI ...

IEEE2009

Asymmetric Gaussian Multiple Descriptions and Asymmetric Multilevel Diversity Coding

Suhas Diggavi

We consider multiple description source coding problem with Gaussian source and mean squared error, for

K=3

descriptions. We obtain an outer bound for the rate region of the problem. We also derive an inner bound for the problem based on successively ref ...

2007

Hierarchical wavelet modelling of environmental sensor data

Anthony Christopher Davison, Yann Ruffieux

Motivated by the need to smooth and to summarize multiple simultaneous time series arising from networks of environmental monitors, we propose a hierarchical wavelet model for which estimation of hyperparameters can be performed by marginal maximum likelih ...

2007

Asymmetric Gaussian Multiple Descriptions and Asymmetric Multilevel Diversity Coding

Suhas Diggavi

We consider multiple description source coding problem with Gaussian source and mean squared error, for

K=3

descriptions. We obtain an outer bound for the rate region of the problem. We also derive an inner bound for the problem based on successively ref ...

2007