English
Related papers

Related papers: DMT of weighted Parallel Channels: Application to …

200 papers

Diversity-multiplexing tradeoff (DMT) was characterized asymptotically (SNR-> infinity) for i.i.d. Rayleigh fading channel by Zheng and Tse [1]. The SNR-asymptotic DMT overestimates the finite-SNR one [2]. This paper outlines a number of…

Information Theory · Computer Science 2016-11-17 Sergey Loyka , Georgy Levin

In this work, we investigate the diversity-multiplexing tradeoff (DMT) of the multiple-antenna (MIMO) static half-duplex relay channel. A general expression is derived for the DMT upper bound, which can be achieved by a compress-and-forward…

Information Theory · Computer Science 2009-11-09 Olivier Leveque , Christophe Vignat , Melda Yuksel

In this paper, we address the finite Signal-to-Noise Ratio (SNR) Diversity-Multiplexing Tradeoff (DMT) of the Multiple Input Multiple Output (MIMO) wiretap channel, where a Zero-Forcing (ZF) transmit scheme, that intends to send the secret…

Cryptography and Security · Computer Science 2011-12-30 Zouheir Rezki , Mohamed-Slim Alouini

Linear precoding is a relatively simple method of MIMO signaling that can also be optimal in certain special cases. This paper is dedicated to high-SNR analysis of MIMO linear precoding. The Diversity-Multiplexing Tradeoff (DMT) of a number…

Information Theory · Computer Science 2012-02-27 Ahmed Hesham Mehana , Aria Nosratinia

We consider transmission over the ergodic fading multi-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent {\it non}-fading channel,…

Information Theory · Computer Science 2007-10-14 Amir Bennatan , David Burshtein

We study the diversity-multiplexing tradeoff (DMT) for the slow fading interference channel with a relay (ICR). We derive four inner bounds on the DMT region: the first is based on the compress-and-forward (CF) relaying scheme, the second…

Information Theory · Computer Science 2014-12-16 Daniel Zahavi , Lili Zhang , Ivana Maric , Ron Dabora , Andrea J. Goldsmith , Shuguang Cui

The fundamental diversity-multiplexing tradeoff (DMT) of the quasi-static fading, symmetric $2$-user MIMO interference channel (IC) with channel state information at the transmitters (CSIT) and a short term average power constraint is…

Information Theory · Computer Science 2010-06-08 Sanjay Karmakar , Mahesh K. Varanasi

We investigate the MIMO broadcast channel in the high SNR regime when linear filtering is applied instead of dirty paper coding. Using a user-wise rate duality where the streams of every single user are not treated as self-interference as…

Information Theory · Computer Science 2008-07-18 Raphael Hunger , Michael Joham

In this paper, we study the sum rate maximization for successive zero-forcing dirty-paper coding (SZFDPC) with per-antenna power constraint (PAPC). Although SZFDPC is a low-complexity alternative to the optimal dirty paper coding (DPC),…

Information Theory · Computer Science 2019-05-21 Thuy M. Pham , Ronan Farrell , Le-Nam Tran

We analyze two-user single-antenna fading interference channels with perfect receive channel state information (CSI) and no transmit CSI. For the case of very strong interference, we prove that decoding interference while treating the…

Information Theory · Computer Science 2009-05-04 Cemal Akçaba , Helmut Bölcskei

In this paper, the asymptotic performance of the lattice sequential decoder for LAttice Space-Time (LAST) coded MIMO channel is analyzed. We determine the rates achievable by lattice coding and sequential decoding applied to such a channel.…

Information Theory · Computer Science 2015-03-17 Walid Abediseid , Mohamed Oussama Damen

The Dynamic Decode-and-Forward (DDF) protocol and the Hybrid DDF and Amplified-and-Forward (HDAF) protocol for the multiple-access relay channel (MARC) with quasi static fading are evaluated using the Zheng-Tse diversity-multiplexing…

Information Theory · Computer Science 2011-03-22 Chung-Pi Lee , Hsuan-Jung Su

Dirty Paper Coding (DPC) is considered as the optimal precoding which achieves capacity for the Gaussian Multiple-Input Multiple-Output (MIMO) broadcast channel (BC). However, to find the optimal precoding order, it needs to repeat N! times…

Information Theory · Computer Science 2023-04-11 Zhibin Zou , Aveek Dutta

In this work, a new static relaying protocol is introduced for half duplex single-relay networks, and its performance is studied in the context of communications over slow fading wireless channels. The proposed protocol is based on a Decode…

Information Theory · Computer Science 2009-08-31 Nassar Ksairi , Philippe Ciblat , Pascal Bianchi , Walid Hachem

Fading MIMO relay channels are studied analytically, when the source and destination are equipped with multiple antennas and the relays have a single one. Compact closed-form expressions are obtained for the outage probability under i.i.d.…

Information Theory · Computer Science 2016-11-17 Sergey Loyka , Georgy Levin

Linear receivers are an attractive low-complexity alternative to optimal processing for multi-antenna MIMO communications. In this paper we characterize the information-theoretic performance of MIMO linear receivers in two different…

Information Theory · Computer Science 2016-11-18 K. Raj Kumar , G. Caire , A. L. Moustakas

This paper investigates the Diversity-Multiplexing gain Trade-off (DMT) of a training based reciprocal Single Input Multiple Output (SIMO) system, with (i) perfect Channel State Information (CSI) at the Receiver (CSIR) and noisy CSI at the…

Information Theory · Computer Science 2012-11-05 B. N. Bharath , Chandra R. Murthy

We consider online scheduling weighted packets with time constraints over a fading channel. Packets arrive at the transmitter in an online manner. Each packet has a value and a deadline by which it should be sent. The fade state of the…

Information Theory · Computer Science 2009-09-30 Fei Li , Zhi Zhang

In a wireless storage system, having to communicate over a fading channel makes repair transmissions prone to physical layer errors. The first approach to combat fading is to utilize the existing optimal space-time codes. However, it was…

Information Theory · Computer Science 2014-05-20 Amaro Barreal , Camilla Hollanti , David Karpuk , Hsiao-feng Lu

The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper, we consider two different models of asynchronous operation in cooperative-diversity networks…

Information Theory · Computer Science 2008-07-02 R. N. Krishnakumar , N. Naveen , P. Vijay Kumar