English
Related papers

Related papers: Multigroup-Decodable STBCs from Clifford Algebras

200 papers

Full-rate STBC (space-time block codes) with non-vanishing determinants achieve the optimal diversity-multiplexing tradeoff but incur high decoding complexity. To permit fast decoding, Sezginer, Sari and Biglieri proposed an STBC structure…

Information Theory · Computer Science 2016-11-17 Tian Peng Ren , Yong Liang Guan , Chau Yuen , Yue Zhou , Er Yang Zhang

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multiple-output (MIMO) system, with coding gain equal to that of the best…

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

In this paper, we first derive the generic algebraic structure of a Quasi-Orthogonal STBC (QO-STBC). Next we propose Group-Constrained Linear Transformation (GCLT) as a means to optimize the diversity and coding gains of a QO-STBC with…

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

This paper generalizes results in noncoherent space-time block code (STBC) design based on quantum error correction (QEC) to new antenna configurations. Previous work proposed QEC-inspired STBCs for antenna geometries where the number of…

Signal Processing · Electrical Eng. & Systems 2026-01-27 S. Andrew Lanham , Eli Bradley , Brian R. La Cour

This paper (Part of the content of this manuscript has been accepted for presentation in IEEE Globecom 2008, to be held in New Orleans) deals with low maximum likelihood (ML) decoding complexity, full-rate and full-diversity space-time…

Information Theory · Computer Science 2008-09-04 K. Pavan Srinath , B. Sundar Rajan

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

The perfect space-time block codes (STBCs) are based on four design criteria - full-rateness, non-vanishing determinant, cubic shaping and uniform average transmitted energy per antenna per time slot. Cubic shaping and transmission at…

Information Theory · Computer Science 2012-12-12 K. Pavan Srinath , B. Sundar Rajan

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

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

For a family/sequence of STBCs $\mathcal{C}_1,\mathcal{C}_2,\dots$, with increasing number of transmit antennas $N_i$, with rates $R_i$ complex symbols per channel use (cspcu), the asymptotic normalized rate is defined as $\lim_{i \to…

Information Theory · Computer Science 2015-03-13 Lakshmi Prasad Natarajan , B. Sundar Rajan

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

In this paper, we introduce the notion of perfect space-time block codes (STBC). These codes have full rate, full diversity, non-vanishing constant minimum determinant for increasing spectral efficiency, uniform average transmitted energy…

Information Theory · Computer Science 2007-07-16 F. Oggier , G. Rekaya-Ben Othman , J. -C. Belfiore , E. Viterbo

In the context of space-time block codes (STBCs), the theory of generalized quaternion and biquaternion algebras (i.e., tensor products of two quaternion algebras) over arbitrary base fields is presented, as well as quadratic form theoretic…

Information Theory · Computer Science 2012-02-07 Thomas Unger , 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

Distributed Space-Time Block Codes (DSTBCs) from Complex Orthogonal Designs (CODs) (both square and non-square CODs other than the Alamouti design) are known to lose their single-symbol ML decodable (SSD) property when used in two-hop…

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

Space-time coding techniques have become common-place in wireless communication standards as they provide an effective way to mitigate the fading phenomena inherent in wireless channels. However, the use of Space-Time Block Codes (STBCs)…

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

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) has been recently studied by Biglieri, Hong and Viterbo. Viewing a linear STBC as a…

Information Theory · Computer Science 2015-03-14 G. R. Jithamithra , B. Sundar Rajan

In this paper, we propose a partial interference cancellation (PIC) group decoding for linear dispersive space-time block codes (STBC) and a design criterion for the codes to achieve full diversity when the PIC group decoding is used at the…

Information Theory · Computer Science 2008-05-20 Xiaoyong Guo , Xiang-Gen Xia

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

The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…

Information Theory · Computer Science 2008-07-18 Yeow Meng Chee , Gennian Ge , Alan C. H. Ling