English
Related papers

Related papers: Space-time block codes from nonassociative divisio…

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

In this paper, we propose a systematic design of space-time block codes (STBC) which can achieve high rate and full diversity when the partial interference cancellation (PIC) group decoding is used at receivers. The proposed codes can be…

Information Theory · Computer Science 2010-04-19 Long Shi , Wei Zhang , Xiang-Gen Xia

Non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) having large dimensions are attractive because they can simultaneously achieve both high spectral efficiencies (same spectral efficiency as in V-BLAST for a…

Information Theory · Computer Science 2009-01-14 Saif K. Mohammed , A. Chockalingam , B. Sundar Rajan

A partial interference cancellation (PIC) group decoding based space-time block code (STBC) design criterion was recently proposed by Guo and Xia, where the decoding complexity and the code rate trade-off is dealt when the full diversity is…

Information Theory · Computer Science 2010-01-04 Wei Zhang , Tianyi Xu , Xiang-Gen Xia

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

In this work, the Multiple transmit antennas Multiple Access Channel is considered. A construction of a family of distributed space-time codes for this channel is proposed. No Channel Side Information at the transmitters is assumed and…

Information Theory · Computer Science 2008-04-10 Maya Badr , Jean-Claude Belfiore

In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them to the destination such that the signal at the destination…

Information Theory · Computer Science 2008-06-20 J. Harshan , B. Sundar Rajan

In this paper, a design criterion for space-time block codes (STBC) is proposed for two-user MIMO interference channels when a group zero-forcing (ZF) algorithm is applied at each receiver to eliminate the inter-user interference. Based on…

Information Theory · Computer Science 2012-09-27 Long Shi , Wei Zhang , Xiang-Gen Xia

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

This paper proposes a low decoding complexity, full-diversity and full-rate space-time block code (STBC) for 4 transmit and 2 receive ($4\times 2$) multiple-input multiple-output (MIMO) systems. For such systems, the best code known is the…

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

Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for the two phase transmission based cooperative diversity protocol of Jing-Hassibi and the Generalized Nonorthogonal Amplify and Forward (GNAF) protocol are reported,…

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

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 give a new framework for constructing low ML decoding complexity Space-Time Block Codes (STBCs) using codes over the finite field $\mathbb{F}_4$. Almost all known low ML decoding complexity STBCs can be obtained via this…

Information Theory · Computer Science 2010-08-17 Lakshmi Prasad Natarajan , B. Sundar Rajan

In this paper, we propose a full-rate full-diversity space-time block code (STBC) for 2x2 reconfigurable multiple-input multiple-output (MIMO) systems that require a low complexity maximum likelihood (ML) detector. We consider a transmitter…

Information Theory · Computer Science 2015-05-27 Vida Vakilian , Hani Mehrpouyan , Yingbo Hua , Hamid Jafarkhani

The use of Space-Time Block Codes (STBCs) increases significantly the optimal detection complexity at the receiver unless the low-complexity decodability property is taken into consideration in the STBC design. In this paper we propose a…

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

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 (STBC) from Orthogonal Designs (OD) and Co-ordinate Interleaved Orthogonal Designs (CIOD) have been attracting wider attention due to their amenability for fast (single-symbol) ML decoding, and full-rate with…

Information Theory · Computer Science 2007-07-13 Md. Zafar ALi Khan , B. Sundar Rajan

In this paper we propose constellations with suitable structure which allow one to construct codes with excellent diversity using geometrical symmetry and numerical methods. We also demonstrate how these structured constellations…

Optimization and Control · Mathematics 2007-05-23 Guangyue Han , Joachim Rosenthal

A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and…

Information Theory · Computer Science 2007-07-13 Oliver Henkel

Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…

Combinatorics · Mathematics 2026-05-28 Benjamin Glancy , Leanne Holder