English
Related papers

Related papers: Single-Symbol Maximum Likelihood Decodable Linear …

200 papers

It is well known that Space-Time Block Codes (STBCs) from orthogonal designs (ODs) are single-symbol decodable/symbol-by-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes…

Information Theory · Computer Science 2007-12-17 Sanjay Karmakar , B. Sundar Rajan

Recently, a special class of complex designs called Training-Embedded Complex Orthogonal Designs (TE-CODs) has been introduced to construct single-symbol Maximum Likelihood (ML) decodable (SSD) distributed space-time block codes (DSTBCs)…

Information Theory · Computer Science 2009-09-15 J. Harshan , B. Sundar Rajan , Are Hjørungnes

Distributed Orthogonal Space-Time Block Codes (DOSTBCs) achieving full diversity order and single-symbol ML decodability have been introduced recently by Yi and Kim for cooperative networks and an upperbound on the maximal rate of such…

Information Theory · Computer Science 2007-09-04 Harshan J. , B. Sundar Rajan

It is well known that Space-Time Block Codes (STBCs) obtained from Orthogonal Designs (ODs) are single-symbol-decodable (SSD) and from Quasi-Orthogonal Designs (QODs) are double-symbol decodable. However, there are SSD codes that are not…

Information Theory · Computer Science 2007-07-13 Sanjay Karmakar , B. Sundar Rajan

It is well known that the Space-time Block Codes (STBCs) from Complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD). The weight matrices of the square CODs are all unitary and obtainable from the…

Information Theory · Computer Science 2016-11-17 Sanjay Karmakar , K. Pavan Srinath , B. Sundar Rajan

Distributed Orthogonal Space-Time Block Codes (DOSTBCs) achieving full diversity order and single-symbol ML decodability have been introduced recently for cooperative networks and an upper-bound on the maximal rate of such codes along with…

Information Theory · Computer Science 2007-08-31 J. Harshan , B. Sundar Rajan

High-rate space-time block codes (STBC with code rate > 1) in multi-input multi-output (MIMO) systems are able to provide both spatial multiplexing gain and diversity gain, but have high maximum likelihood (ML) decoding complexity. Since…

Information Theory · Computer Science 2016-11-18 Tian Peng Ren , Yong Liang Guan , Chau Yuen , Erry Gunawan , Er Yang Zhang

In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4x2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code…

Information Theory · Computer Science 2014-01-08 Ming Liu , Maryline Hélard , Jean-François Hélard , Matthieu Crussière

In this paper, we consider a quasi-orthogonal (QO) space-time block code (STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a…

Information Theory · Computer Science 2007-07-13 Chau Yuen , Yong Liang Guan , Tjeng Thiang Tjhung

In this paper, we deal with the design of high-rate, full-diversity, low maximum likelihood (ML) decoding complexity space-time block codes (STBCs) with code rates of 2 and 1.5 complex symbols per channel use for multiple-input multiple…

Information Theory · Computer Science 2009-07-07 Ertugrul Basar , Umit Aygolu

We present a novel differential space-time modulation (DSTM) scheme that is single-symbol decodable and can provide full transmit diversity. It is the first known singlesymbol- decodable DSTM scheme not based on Orthogonal STBC (O-STBC),…

Information Theory · Computer Science 2016-11-18 Chau Yuen , Yong Liang Guan , Tjeng Thiang Tjhung

Two new rate-one full-diversity space-time block codes (STBC) are proposed. They are characterized by the \emph{lowest decoding complexity} among the known rate-one STBC, arising due to the complete separability of the transmitted symbols…

Information Theory · Computer Science 2016-11-17 Dung Ngoc Dao , Chau Yuen , Chintha Tellambura , Yong Liang Guan , Tjeng Thiang Tjhung

Complex Orthogonal Design (COD) codes are known to have the lowest detection complexity among Space-Time Block Codes (STBCs). However, the rate of square COD codes decreases exponentially with the number of transmit antennas. The…

Information Theory · Computer Science 2016-11-17 Amr Ismail , Jocelyn Fiorina , Hikmet Sari

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

A Space-Time Block Code (STBC) in $K$ symbols (variables) is called $g$-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of $g$ terms such that each term is a function of a subset of the $K$ variables…

Information Theory · Computer Science 2007-07-16 Sanjay Karmakar , B. Sundar Rajan

In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of 2 complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input, double output (MIDO) systems. Using this method,…

Information Theory · Computer Science 2013-04-25 K. Pavan Srinath , B. Sundar Rajan

Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination…

Information Theory · Computer Science 2008-11-29 D. Sreedhar , A. Chockalingam , B. Sundar Rajan

The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of $g$-group encodable and $g$-group decodable linear STBCs is…

Information Theory · Computer Science 2016-11-17 G. Susinder Rajan , B. Sundar Rajan

Linear space-time block codes (STBCs) of unitary rate and full diversity, systematically constructed over arbitrary constellations for any number of transmit antennas are introduced. The codes are obtained by generalizing the existing ABBA…

Information Theory · Computer Science 2007-07-13 Giuseppe Thadeu Freitas de Abreu

The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach…

Information Theory · Computer Science 2015-03-19 Lakshmi Prasad Natarajan , B. Sundar Rajan
‹ Prev 1 2 3 10 Next ›