Publications related to On the Achievable Rate of Stationary Rayleigh Flat-Fading Channels With Gaussian Inputs

Related publications (23)

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...

EPFL2024

Shannon Bounds on Lossy Gray-Wyner Networks

Michael Christoph Gastpar, Erixhen Sula

The Gray-Wyner network subject to a fidelity criterion is studied. Upper and lower bounds for the trade-offs between the private sum-rate and the common rate are obtained for arbitrary sources subject to mean-squared error distortion. The bounds meet exact ...

2022

Feedback and Common Information: Bounds and Capacity for Gaussian Networks

Erixhen Sula

Network information theory studies the communication of information in a network and considers its fundamental limits. Motivating from the extensive presence of the networks in the daily life, the thesis studies the fundamental limits of particular network ...

EPFL2021

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Emmanuel Abbé, Min Ye

We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are lower-order RM code ...

Institute of Electrical and Electronics Engineers2020

Feedback-Aware Precoding for Millimeter Wave Massive MIMO Systems

Andreas Peter Burg, Reza Ghanaatian Jahromi

Millimeter wave (mmWave) communication is a promising solution for coping with the ever-increasing mobile data traffic because of its large bandwidth. To enable a sufficient link margin, a large antenna array employing directional beamforming, which is ena ...

IEEE2019

Universal Sparse Superposition Codes With Spatial Coupling and GAMP Decoding

Nicolas Macris, Jean François Emmanuel Barbier, Mohamad Baker Dia

Sparse superposition codes, or sparse regression codes, constitute a new class of codes, which was first introduced for communication over the additive white Gaussian noise (AWGN) channel. It has been shown that such codes are capacity-achieving over the A ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Polarization and Channel Ordering: Characterizations and Topological Structures

Rajai Nasser

Information theory is the field in which we study the fundamental limitations of communication. Shannon proved in 1948 that there exists a maximum rate, called capacity, at which we can reliably communicate information through a given channel. However, Sha ...

EPFL2017

Optical Signal Processing and Pulse Shaping for Wavelength Multiplexed High Speed Communication Systems

Mohammad Amin Shoaie

The steady growth of capacity demand in telecommunication networks has sparked the development of various photonic devices for ultrafast optical signal processing functions to meet the requirements of future flexible fiber networks in general and backbone ...

EPFL2016

On the MIMO Capacity for Distributed System under Composite Rayleigh/Rician Fading and Shadowing

José Luis Padilla de la Torre

Wireless channels are commonly affected by short-term fading and long-term fading (shadowing). The shadowing effects must be taken into account also when mobility is present in the wireless scenario. Using a composite fading model, the total channel capaci ...

Hindawi Publishing Corporation2015

Digital Synchronization for Symbol-spaced IEEE802.11ad Gigabit mmWave Systems

Andreas Peter Burg, Nicholas Alexander Preyss

A complete digital synchronization architecture for an IEEE 802.11ad compliant 60 GHz receiver is presented. The characteristics of mmWave systems require a holistic view on the problem of parameter estimation, such that not each parameter is dealt with on ...

2015

Polarization Improves E-0

Emre Telatar, Mine Alsan

We prove that channel combining and splitting via Arikan's polarization transformation improves Gallager's reliability function E-0 for binary input channels. In this sense, polarization creates E-0. This observation gives yet another justification as to w ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Secure Communication in Erasure Networks with State-feedback

László Czap

The security and efficiency of communication are two of the main concerns for networks of today and the future. Our understanding of how to efficiently send information over various channels and networks has significantly increased in the past decade (see ...

EPFL2014

Integer-forcing Linear Receivers

Michael Christoph Gastpar

Linear receivers are often used to reduce the implementation 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 ...

Institute of Electrical and Electronics Engineers2014

Cooperative Relaying at Finite SNR-Role of Quantize-Map-and-Forward

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

This paper contributes to the design and analysis of Quantize-Map-and-Forward (QMF) relaying by optimizing its performance for small relay networks. QMF was proved to achieve the capacity of arbitrary networks within a bounded gap, as well as the optimal d ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Estimation of Sparse MIMO Channels with Common Support

Martin Vetterli, Ali Hormati, Yann Barbotin

We consider the problem of estimating sparse communication channels in the MIMO context. In small to medium bandwidth communications, as in the current standards for OFDM and CDMA communication systems (with bandwidth up to 20 MHz), such channels are indiv ...

2012

Approximate Ergodic Capacity of a Class of Fading 2-user 2-hop Networks

Michael Christoph Gastpar, Chien-Yi Wang

We consider a fading AWGN 2-user 2-hop network in which the channel coefficients are independently and identically distributed (i.i.d.) drawn from a continuous distribution and vary over time. For a broad class of channel distributions, we characterize the ...

Ieee2012

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Christina Fragouli, I-Hsiang Wang, Ayan Sengupta

We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset uppe ...

Ieee2012

Performance analysis of dual-hop fixed-gain AF relaying systems with OSTBC over Nakagami-m fading channels

In this paper, we present outage probability and symbol error rate (SER) performance analyses of a dual-hop transmission using fixed-gain amplify-and-forward relaying in flat Nakagami-m fading channels. The system under consideration is equipped with multi ...

Elsevier Gmbh, Urban & Fischer Verlag2012

MIMO transmission using a single RF source: theory and antenna design

Julien Perruisseau-Carrier

An approach for transmitting multiple signals using a single switched parasitic antenna (SPA) has been recently reported. The idea there is to map the signals to be transmitted onto a set of basis functions that serve as “virtual antennas” in the beamspace ...

Institute of Electrical and Electronics Engineers2012

Dual Channel Optimization of Tracking Schemes for E1 CBOC Signal

Pierre-André Farine, Cyril Botteron, Aleksandar Jovanovic, Youssef Tawk

New generation of satellite navigation signals, such as AltBOC (Alternative Binary Offset Keying), CBOC (Composite Binary Offset Keying) and TMBOC (Time Multiplex Binary Offset Keying) bring enhancements in the tracking process, such as more signal power, ...

IEEE2011