English
Related papers

Related papers: Approximately-Universal Space-Time Codes for the P…

200 papers

In this work, spatial diversity techniques in the area of multiple-input multiple-output (MIMO) diffusion-based molecular communications (DBMC) are investigated. For transmitter-side spatial coding, Alamouti-type coding and repetition MIMO…

Emerging Technologies · Computer Science 2017-07-25 Martin Damrath , H. Birkan Yilmaz , Chan-Byoung Chae , Peter Adam Hoeher

Receiver diversity combining methods play a key role in combating the detrimental effects of fadingin wireless communication and other applications. A novel diversity combining method is proposedwhere a universal, i.e., channel independent,…

Information Theory · Computer Science 2018-05-01 Elad Domanovitz , Uri Erez

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 paper, fast-decodable lattice code constructions are designed for the nonorthogonal amplify-and-forward (NAF) multiple-input multiple-output (MIMO) channel. The constructions are based on different types of algebraic structures,…

Information Theory · Computer Science 2012-02-28 Camilla Hollanti , Nadya Markin

In this paper, we design space-time block codes (STBCs) to broadcast the common information omnidirectionally in a massive MIMO downlink. To reduce the burden of the downlink channel estimation and achieve partial spatial diversity from…

Information Theory · Computer Science 2016-10-26 Xin Meng , Xiang-Gen Xia , Xiqi Gao

The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of constructing UDMs is tightly connected to the problem of…

Information Theory · Computer Science 2007-07-13 Pascal O. Vontobel , Ashwin Ganesan

We study Low-Density Parity-Check (LDPC) codes with iterative decoding on block-fading (BF) Relay Channels. We consider two users that employ coded cooperation, a variant of decode-and-forward with a smaller outage probability than the…

Information Theory · Computer Science 2012-10-05 Dieter Duyck , Joseph J. Boutros , Marc Moeneclaey

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

A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that…

Information Theory · Computer Science 2007-07-13 Petros Elia , K. Raj Kumar , Sameer A. Pawar , P. Vijay Kumar , Hsiao-feng Lu

In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case is considered and the problem of constructing space-time block codes…

Information Theory · Computer Science 2008-11-24 G. Susinder Rajan , B. Sundar Rajan

In this paper we consider a channel model that is often used to describe the mobile wireless scenario: multiple-antenna additive white Gaussian noise channels subject to random (fading) gain with full channel state information at the…

Information Theory · Computer Science 2018-06-28 Austin Collins , Yury Polyanskiy

The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive…

Information Theory · Computer Science 2016-11-18 Joakim Jalden , Petros Elia

A novel lattice coding framework is proposed for outage-limited cooperative channels. This framework provides practical implementations for the optimal cooperation protocols proposed by Azarian et al. In particular, for the relay channel we…

Information Theory · Computer Science 2007-07-16 Arul Murugan , Kambiz Azarian , Hesham El Gamal

Repetition-based retransmission is used in Alamouti-modulation [1998] for $2\times 2$ MIMO systems. We propose to use instead of ordinary repetition so-called "scaled repetition" together with rotation. It is shown that the rotated and…

Information Theory · Computer Science 2008-02-06 Frans M. J. Willems

This paper proposes a highly efficient global coded-multiplexing scheme, conceptualized as Orthogonal Frequency Division Multiplexing over a finite field (FF-OFDM), for reliable multiuser communications. By utilizing a prime length cyclic…

Information Theory · Computer Science 2026-05-12 Juane Li , Qi-yue Yu , Khaled Abdel-Ghaffar , Shu Lin

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

The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consisting of scaled unitary…

Information Theory · Computer Science 2011-11-10 G. Susinder Rajan , B. Sundar Rajan

Currently for the nt x nr MIMO channel, any explicitly constructed space-time (ST) designs that achieve optimality with respect to the diversity multiplexing tradeoff (DMT) are known to do so only when decoded using maximum likelihood (ML)…

Information Theory · Computer Science 2009-01-28 Joakim Jalden , Petros Elia

In this work, we consider the problem of coding for the half-duplex non-orthogonal amplify-and-forward (NAF) cooperative channel where the transmitter to relay and the inter-relay links are highly reliable. We derive bounds on the diversity…

Information Theory · Computer Science 2016-11-15 Ghassan M. Kraidy , Nicolas Gresset , Joseph J. Boutros

We put forth new models for universal channel coding. Unlike standard codes which are designed for a specific type of channel, our most general universal code makes communication resilient on every channel, provided the noise level is below…

Information Theory · Computer Science 2022-12-12 Bruno Bauwens , Marius Zimand