English
Related papers

Related papers: Compress-and-Forward Performance in Low-SNR Relay …

200 papers

We present a natural and low-complexity technique for achieving the capacity of the Gaussian relay network in the high SNR regime. Specifically, we propose the use of end-to-end structured lattice codes with the amplify-and-forward…

Information Theory · Computer Science 2013-09-17 Yun Xu , Edmund Yeh , Muriel Medard

The optimal power allocation that maximizes the secrecy capacity of block fading Gaussian (BF-Gaussian) networks with causal channel state information (CSI), M-block delay tolerance and a frame based power constraint is examined. In…

Information Theory · Computer Science 2014-01-28 Arsenia Chorti , Katerina Papadaki , H. Vincent Poor

Capacity bounds are studied for the multiple-antenna complex Gaussian relay channel with t1 transmitting antennas at the sender, r2 receiving and t2 transmitting antennas at the relay, and r3 receiving antennas at the receiver. It is shown…

Information Theory · Computer Science 2016-11-18 Xianglan Jin , Young-Han Kim

We analyze the performance of a system composed of two interfering point-to-point links where the transmitters can exploit a common relay to improve their individual transmission rate. When the relay uses the amplify-and-forward protocol we…

Information Theory · Computer Science 2009-04-20 Brice Djeumou , Elena Veronica Belmega , Samson Lasaulce

Relay networks aid in increasing the rate of communication from source to destination. However, the capacity of even a three-terminal relay channel is an open problem. In this work, we propose a new lower bound for the capacity of the…

Information Theory · Computer Science 2016-11-17 Mayur Agrawal , David Love , Venkataramanan Balakrishnan

In this paper, we study the interference relay-without-delay channel which is an interference channel with a relay helping the communication. We assume the relay's transmit symbol depends not only on its past received symbols but also on…

Information Theory · Computer Science 2011-08-16 Hyunseok Chang , Sae-Young Chung

Energy Harvesting (EH) is a novel technique to prolong the lifetime of the wireless networks such as wireless sensor networks or Ad-Hoc networks, by providing an unlimited source of energy for their nodes. In this sense, it has emerged as a…

Information Theory · Computer Science 2021-04-07 Mahmood Mohassel Feghhi , Aliazam Abbasfar , Mahtab Mirmohseni

In this paper, we investigate a fluid antenna relay (FAR)-assisted communication system with hybrid relaying scheme selection. By leveraging statistical channel state information (CSI) and distribution characteristics of fluid antenna…

Signal Processing · Electrical Eng. & Systems 2026-01-21 Ruopeng Xu , Songling Zhang , Zhaohui Yang , Mingzhe Chen , Zhaoyang Zhang , Kai-Kit Wong

We study the transmission of confidential messages across a wireless broadcast channel with K>2 receivers and K helpers. The goal is to transmit all messages reliably to their intended receivers while keeping them confidential from the…

Information Theory · Computer Science 2017-03-06 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

Secrecy capacity of a multiple-antenna wiretap channel is studied in the low signal-to-noise ratio (SNR) regime. Expressions for the first and second derivatives of the secrecy capacity with respect to SNR at SNR = 0 are derived.…

Information Theory · Computer Science 2009-01-21 Mustafa Cenk Gursoy

In this letter, a compressed relaying scheme via Huffman and physical-layer network coding (HPNC) is proposed for two-way relay networks with correlated sources (TWRN-CS). In the HPNC scheme, both sources first transmit the correlated raw…

Information Theory · Computer Science 2016-02-02 Qiang Huo , Kun Yang , Lingyang Song , Yonghui Li , Bingli Jiao

This paper considers a communication network comprised of two nodes, which have no mutual direct communication links, communicating two-way with the aid of a common relay node (RN), also known as separated two-way relay (TWR) channel. We…

Information Theory · Computer Science 2011-02-17 Erhan Yilmaz , Raymond Knopp

The capacity of a relay channel with inter-symbol interference (ISI) and additive colored Gaussian noise is examined under an input power constraint. Prior results are used to show that the capacity of this channel can be computed by…

Information Theory · Computer Science 2011-03-02 Chiranjib Choudhuri , Urbashi Mitra

The capacity of noncoherent fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the…

Information Theory · Computer Science 2012-12-06 Tobias Koch , Gerhard Kramer

We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative network of arbitrary size. The resource allocation is obtained by maximizing over the rates obtained for each possible…

Information Theory · Computer Science 2008-12-22 Elzbieta Beres , Raviraj Adve

This paper compares the partial-decode-forward and the complete-decode-forward coding strategies for the half-duplex Gaussian single-relay channel. We analytically show that the rate achievable by partial-decode-forward outperforms that of…

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

In slow fading scenarios, cooperation between nodes can increase the amount of diversity for communication. We study the performance limit in such scenarios by analyzing the outage capacity of slow fading relay channels. Our focus is on the…

Information Theory · Computer Science 2007-07-13 Salman Avestimehr , David N. C. Tse

In fading channels, power allocation over channel state may bring a rate increment compared to the fixed constant power mode. Such a rate increment is referred to power allocation gain. It is expected that the power allocation gain varies…

Information Theory · Computer Science 2014-12-25 Zhengchuan Chen , Pingyi Fan , Dapeng Wu , Liquan Shen

We address the capacity of a discrete-time memoryless Gaussian channel, where the channel state information (CSI) is neither available at the transmitter nor at the receiver. The optimal capacity-achieving input distribution at low…

Information Theory · Computer Science 2008-05-05 Z. Rezki , David Haccoun , François Gagnon

We consider a Gaussian multiple access channel with $K$ transmitters, a (intended) receiver and an external eavesdropper. The transmitters wish to reliably communicate with the receiver while concealing their messages from the eavesdropper.…

Cryptography and Security · Computer Science 2015-04-23 Parisa Babaheidarian , Somayeh Salimi