English
Related papers

Related papers: Optimal space-time codes for the MIMO amplify-and-…

200 papers

The fundamental diversity-multiplexing tradeoff of the three-node, multi-input, multi-output (MIMO), quasi-static, Rayleigh faded, half-duplex relay channel is characterized for an arbitrary number of antennas at each node and in which…

Information Theory · Computer Science 2011-07-01 Sanjay Karmakar , Mahesh K. Varanasi

In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes. Such codes are less than full dimensional lattices in their natural ambient space. Apart from the multiple…

Information Theory · Computer Science 2021-02-22 Roope Vehkalahti , Laura Luzzi

We consider the analysis and design of space-time trellis codes (STTCs) for a cooperative relay channel operating in amplify-and-forward (AF) mode assuming the source and destination nodes are equipped with multiple antennas but the relay…

Information Theory · Computer Science 2015-03-20 Sue Keramat , Zue Xie

We establish the optimal diversity-multiplexing (DM) tradeoff for coherent selective-fading multiple-access MIMO channels and provide corresponding code design criteria. As a byproduct, on the conceptual level, we find an interesting…

Information Theory · Computer Science 2009-06-26 Pedro Coronel , Markus Gärtner , Helmut Bölcskei

Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However most of the proposed solutions require distributed space-time coding…

Information Theory · Computer Science 2016-11-18 Aggelos Bletsas , Ashish Khisti , David P. Reed , Andrew Lippman

In this work we explicitly provide the first ever optimal, with respect to the Zheng-Tse diversity multiplexing gain (D-MG) tradeoff, cooperative diversity schemes for wireless relay networks. The schemes are based on variants of perfect…

Information Theory · Computer Science 2007-07-13 Petros Elia , P. Vijay Kumar

In this paper we investigate the criteria proposed by Coronel et al. for constructing MIMO MAC-DMT optimal codes over several classes of fading channels. We first give a counterexample showing their DMT result is not correct when the…

Information Theory · Computer Science 2009-08-24 Hsiao-feng , Lu , Jyrki Lahtonen , Roope Vehkalahti , Camilla Hollanti

A multi-hop relay channel with multiple antenna terminals in a quasi-static slow fading environment is considered. For both full-duplex and half-duplex relays the fundamental diversity-multiplexing tradeoff (DMT) is analyzed. It is shown…

Information Theory · Computer Science 2016-11-18 Deniz Gunduz , Andrea Goldsmith , H. Vincent Poor

Multiple-input double-output (MIDO) codes are important in the near-future wireless communications, where the portable end-user device is physically small and will typically contain at most two receive antennas. Especially tempting is the 4…

Information Theory · Computer Science 2016-11-15 Roope Vehkalahti , Camilla Hollanti , Frédérique Oggier

In this work, we study the performance of a single relay Multiple Input Multiple Output (MIMO) cooperative communication system based on Decode and Forward (DF) relaying protocol for two strategies using transmit antenna selection at the…

Signal Processing · Electrical Eng. & Systems 2017-11-13 Mokhtar Bouteggui , Fatiha Merazka

We consider a general multiple antenna network with multiple sources, multiple destinations and multiple relays in terms of the diversity-multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into…

Information Theory · Computer Science 2007-07-22 Melda Yuksel , Elza Erkip

We analyze two-user single-antenna fading interference channels with perfect receive channel state information (CSI) and no transmit CSI. We compute the diversity-multiplexing tradeoff (DMT) region of a fixed-power-split Han and Kobayashi…

Information Theory · Computer Science 2009-05-07 Cemal Akcaba , Helmut Boelcskei

We establish the optimal diversity-multiplexing (DM) tradeoff of coherent time, frequency and time-frequency selective-fading MIMO channels and provide a code design criterion for DM-tradeoff optimality. Our results are based on the…

Information Theory · Computer Science 2007-07-13 Pedro Coronel , Helmut Bölcskei

In this two-part paper, we consider the multiantenna multihop relay channels in which the source signal arrives at the destination through N independent relaying hops in series. The main concern of this work is to design relaying strategies…

Information Theory · Computer Science 2007-07-13 Sheng Yang , Jean-Claude Belfiore

In this paper, a two-relay full-duplex asynchronous cooperative network with the amplify-and-forward (AF) protocol is considered. We propose two distributed space-time coding schemes for the cases with and without cross-talks, respectively.…

Information Theory · Computer Science 2016-11-15 Yi Liu , Xiang-Gen Xia , Hailin Zhang

In this work we propose an adaptive buffer-aided space-time coding scheme for cooperative wireless networks. A maximum likelihood receiver and adjustable code vectors are considered subject to a power constraint with an amplify-and-forward…

Information Theory · Computer Science 2015-07-07 T. Peng , R. C. de Lamare

We consider network-assisted full-duplex (NAFD) cell-free massive multiple-input multiple-output (CF-mMIMO) systems, where full-duplex (FD) transmission is virtually realized via half-duplex (HD) hardware devices. The HD access points (APs)…

Information Theory · Computer Science 2023-04-17 Mohammadali Mohammadi , Tung T. Vu , Hien Quoc Ngo , Michail Matthaiou

Perfect Space-Time Codes (STC) are optimal codes in their original construction for Multiple Input Multiple Output (MIMO) systems. Based on Cyclic Division Algebras (CDA), they are full-rate, full-diversity codes, have Non-Vanishing…

Information Theory · Computer Science 2010-11-03 Mireille Sarkiss , Ghaya Rekaya-Ben Othman , Mohamed Oussama Damen , Jean-Claude Belfiore

A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase based cooperative diversity protocols of Jing-Hassibi and the…

Information Theory · Computer Science 2007-07-13 G. Susinder Rajan , Anshoo Tandon , B. Sundar Rajan

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