English
Related papers

Related papers: A Lattice Compress-and-Forward Scheme

200 papers

Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given…

Information Theory · Computer Science 2017-08-04 Vaneet Aggarwal , Amir Bennatan , A. Robert Calderbank

Interference Alignment is a new solution to over- come the problem of interference in multiuser wireless com- munication systems. Recently, the Compute-and-Forward (CF) transform has been proposed to approximate the capacity of K- user…

Information Theory · Computer Science 2014-10-09 Ehsan Ebrahimi Khaleghi , Jean-Claude Belfiore

We analyze the achievable rate of the superposition of block Markov encoding (decode-and-forward) and side information encoding (compress-and-forward) for the three-node Gaussian relay channel. It is generally believed that the…

Information Theory · Computer Science 2010-10-18 Neevan Ramalingam , Zhengdao Wang

We consider the transmission of spatially correlated analog information in a wireless sensor network (WSN) through fading single-input and multiple-output (SIMO) multiple access channels (MACs) with low-latency requirements. A lattice-based…

Information Theory · Computer Science 2024-01-31 Pedro Suárez-Casal , Óscar Fresnedo , Darian Pérez-Adán , Luis Castedo

Sampling from the lattice Gaussian distribution has emerged as an important problem in coding, decoding and cryptography. In this paper, lattice reduction technique is adopted to Gibbs sampler for lattice Gaussian sampling. Firstly, with…

Information Theory · Computer Science 2018-12-04 Zheng Wang , Yang Huang , Shanxiang Lyu

The Compute-and-Forward relaying strategy achieves high computation rates by decoding linear combinations of transmitted messages at intermediate relays. However, if the involved relays independently choose which combinations of the…

Information Theory · Computer Science 2015-04-21 Amaro Barreal , Joonas Pääkkönen , David Karpuk , Camilla Hollanti , Olav Tirkkonen

This work concerns minimizing the achievable distortion of a Gaussian source over a two-hop block fading channel under mean square-error criterion. It is assumed that there is not a direct link between transmission ends and the…

Information Theory · Computer Science 2016-05-31 Sayed Ali Khodam Hoseini , Soroush Akhlaghi , Mina Baghani

We consider the design of coding schemes for the wireless two-way relaying channel when there is no channel state information at the transmitter. In the spirit of the compute and forward paradigm, we present a multilevel coding scheme that…

Information Theory · Computer Science 2016-11-17 Brett Hern , Krishna Narayanan

Polar lattices, which are constructed from polar codes, have recently been proved to be able to achieve the capacity of the additive white Gaussian noise (AWGN) channel. In this work, we propose a new construction of polar lattices to solve…

Information Theory · Computer Science 2021-05-18 Ling Liu , Jinwen Shi , Cong Ling

We consider the Gaussian wiretap channel, where two legitimate players Alice and Bob communicate over an additive white Gaussian noise (AWGN) channel, while Eve is eavesdropping, also through an AWGN channel. We propose a coding strategy…

Information Theory · Computer Science 2016-11-15 Frédérique Oggier , Patrick Solé , Jean-Claude Belfiore

This work focuses on the half-duplex (HD) relaying based on the generalized quantize-and-forward (GQF) scheme in the slow fading Multiple Access Relay Channel (MARC) where the relay has no channel state information (CSI) of the…

Information Theory · Computer Science 2014-06-23 Ming Lei , Mohammad Reza Soleymani

We consider the wireless two-way relay channel, in which two-way data transfer takes place between the end nodes with the help of a relay. For the Denoise-And-Forward (DNF) protocol, it was shown by Koike-Akino et. al. that adaptively…

Information Theory · Computer Science 2015-06-04 Vijayvaradharaj T. Muralidharan , B. Sundar Rajan

This paper investigates the compress-and-forward scheme for an uplink cloud radio access network (C-RAN) model, where multi-antenna base-stations (BSs) are connected to a cloud-computing based central processor (CP) via capacity-limited…

Information Theory · Computer Science 2016-11-18 Yuhan Zhou , Yinfei Xu , Wei Yu , Jun Chen

Consider a Gaussian relay network where a number of sources communicate to a destination with the help of several layers of relays. Recent work has shown that a compress-and-forward based strategy at the relays can achieve the capacity of…

Information Theory · Computer Science 2013-04-30 Ritesh Kolte , Ayfer Özgür

In this paper we investigate the achievable rate of a system that includes a nomadic transmitter with several antennas, which is received by multiple agents, exhibiting independent channel gains and additive circular-symmetric complex…

Information Theory · Computer Science 2007-10-02 Amichai Sanderovich , Shlomo Shamai , Yossef Steinberg

A distributed lossy compression network with $L$ encoders and a decoder is considered. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean…

Information Theory · Computer Science 2022-06-06 Siyao Zhou , Sadaf Salehkalaibar , Jingjing Qian , Jun Chen , Wuxian Shi , Yiqun Ge , Wen Tong

In this paper we study the Z channel with side information non-causally available at the encoders. We use Marton encoding along with Gelfand-Pinsker random binning scheme and Chong-Motani-Garg-El Gamal (CMGE) jointly decoding to find an…

Information Theory · Computer Science 2015-06-03 Saeed Hajizadeh , Mostafa Monemizadeh

The L-user additive white Gaussian noise multiway relay channel is investigated, where L users exchange information at the same rate through a single relay. A new achievable rate region, based on the functional-decode-forward coding…

Information Theory · Computer Science 2012-09-10 Lawrence Ong , Christopher M. Kellett , Sarah J. Johnson

In this two part paper we consider a wireless network in which a source terminal communicates with a destination and a relay terminal is occasionally present in close proximity to the source without source's knowledge, suggesting oblivious…

Information Theory · Computer Science 2010-07-27 Evgeniy Braginskiy , Avi Steiner , Shlomo Shamai

Explicit constructions of polar codes and polar lattices for both lossless and lossy Gray-Wyner problems are studied. Polar codes are employed to extract Wyner's common information of doubly symmetric binary source; polar lattices are then…

Information Theory · Computer Science 2016-10-26 Jinwen Shi , Ling Liu , Cong Ling