English
Related papers

Related papers: A Novel Construction of Multi-group Decodable Spac…

200 papers

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

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 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

Space-Time Block Codes (STBCs) suffer from a prohibitively high decoding complexity unless the low-complexity decodability property is taken into consideration in the STBC design. For this purpose, several families of STBCs that involve a…

Information Theory · Computer Science 2013-01-03 Amr Ismail , Jocelyn Fiorina , Hikmet Sari

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 we propose a new construction method for rate-1 Fast-Group-Decodable (FGD) Space-Time-Block Codes (STBC)s for 2^a transmit antennas. We focus on the case of a=2 and we show that the new FGD rate-1 code has the lowest…

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

Complex orthogonal design (COD) with parameter $[p, n, k]$ is a combinatorial design used in space-time block codes (STBCs). For STBC, $n$ is the number of antennas, $k/p$ is the rate, and $p$ is the decoding delay. A class of rate $1/2$…

Information Theory · Computer Science 2016-09-20 Xiaodong Liu , Yuan Li , Haibin Kan

A Quasi-Orthogonal Space-Time Block Code (QO-STBC) is attractive because it achieves higher code rate than Orthogonal STBC and lower decoding complexity than nonorthogonal STBC. In this paper, we first derive the algebraic structure of…

Information Theory · Computer Science 2008-06-23 Chau Yuen , Yong Liang Guan , Tjeng Thiang Tjhung

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

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

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

Construction of high rate Space Time Block Codes (STBCs) with low decoding complexity has been studied widely using techniques such as sphere decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M…

Information Theory · Computer Science 2013-01-24 G. R. Jithamithra , B. Sundar Rajan

Space-time block codes (STBCs) from non-square complex orthogonal designs are bandwidth efficient when compared with those from square real/complex orthogonal designs. Though there exists rate-1 ROD for any number of transmit antennas,…

Information Theory · Computer Science 2008-08-12 Smarajit Das , 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

A set of sufficient conditions to construct $\lambda$-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight…

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

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

Full-rate space time codes (STC) with rate = number of transmit antennas have high multiplexing gain, but high decoding complexity even when decoded using reduced-complexity decoders such as sphere or QRDM decoders. In this paper, we…

Information Theory · Computer Science 2015-05-30 Tian Peng Ren , Yong Liang Guan , Chau Yuen , Er Yang Zhang

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…

Information Theory · Computer Science 2012-04-03 Yuan Li , Haibin Kan

This paper presents two new space time block codes (STBCs) with quasi orthogonal structure for an open loop multi-input single-output (MISO) systems. These two codes have been designed to transmit from three or four antennas at the…

Information Theory · Computer Science 2016-05-20 Ali Lotfi-Rezaabad , Siamak Talebi , Ata Chizari
‹ Prev 1 2 3 10 Next ›