English
Related papers

Related papers: On Fast-Decodable Space-Time Block Codes

200 papers

The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.

Information Theory · Computer Science 2009-08-08 Ender Ayanoglu

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

Common signals in public channels of cellular systems are usually transmitted omnidirectionally from the base station (BS). In recent years, both discrete and consecutive omnidirectional space-time block codings (STBC) have been proposed…

Signal Processing · Electrical Eng. & Systems 2019-05-03 Can Liu , Xiang-Gen Xia , Yongzhao Li , Xiqi Gao , Hailin Zhang

A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers. The construction exploits a differential geometric…

Information Theory · Computer Science 2016-11-17 Oliver Henkel

In this paper, a general criterion for space time block codes (STBC) to achieve full-diversity with a linear receiver is proposed for a wireless communication system having multiple transmitter and single receiver antennas (MISO).…

Information Theory · Computer Science 2016-11-18 Jing Liu , Jian-Kang Zhang , Kon Max Wong

In the landmark paper by Hassibi and Hochwald, it is claimed without proof that the upper triangular matrix R encountered during the sphere decoding of any linear dispersion code is full-ranked whenever the rate of the code is less than the…

Information Theory · Computer Science 2011-09-06 Lakshmi Prasad Natarajan , K. Pavan Srinath , B. Sundar Rajan

Associative division algebras are a rich source of fully diverse space-time block codes (STBCs). In this paper the systematic construction of fully diverse STBCs from nonassociative algebras is discussed. As examples, families of fully…

Information Theory · Computer Science 2012-02-07 Susanne Pumpluen , Thomas Unger

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

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 we present low-complexity blind multi-input multi-output (MIMO) adaptive linear multiuser receivers for direct sequence code division multiple access (DS-CDMA) systems using multiple transmit antennas and space-time block…

Information Theory · Computer Science 2014-10-22 R. C. de Lamare , R. Sampaio-Neto

Precoding for multiple-input, multiple-output (MIMO) antenna systems is considered with perfect channel knowledge available at both the transmitter and the receiver. For 2 transmit antennas and QAM constellations, an approximately optimal…

Information Theory · Computer Science 2015-03-17 K. Pavan Srinath , B. Sundar Rajan

In this paper we present a novel method for decoding multiple input - multiple output (MIMO) transmission, which combines sphere decoding (SD) and zero forcing (ZF) techniques to provide near optimal low complexity and high performance…

Information Theory · Computer Science 2008-03-03 Vadim Neder , Doron Ezri , Motti Haridim

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

The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is computed under ideal interleaving…

Information Theory · Computer Science 2016-11-15 Nicolas Gresset , Loic Brunel , Joseph Boutros

We construct a class of linear space-time block codes for any number of transmit antennas that have controllable ML decoding complexity with a maximum rate of 1 symbol per channel use. The decoding complexity for $M$ transmit antennas can…

Information Theory · Computer Science 2012-05-22 Naresh Sharma , Pavan R. Pinnamraju , Constantinos B. Papadias

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

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

Coherent Space-Time Shift Keying (CSTSK) is a recently developed generalized shift-keying framework for Multiple-Input Multiple-Output systems, which uses a set of Space-Time matrices termed as Dispersion Matrices (DM). CSTSK may be…

Information Theory · Computer Science 2012-10-10 Rakshith Rajashekar , K. V. S. Hari , L. Hanzo

An equivalent model for a multi-input multi-output (MIMO) communication system with orthogonal space-time block codes (OSTBCs) is proposed based on a newly revealed connection between OSTBCs and Euclidean codes. Examples of distance…

Information Theory · Computer Science 2016-03-03 Alex E. Geyer , Reza Nikjah , Sergiy A. Vorobyov , Norman C. Beaulieu

Classical ML decoders of MIMO systems like the sphere decoder, the Schnorr-Euchner algorithm, the Fano and the stack decoders suffer of high complexity for high number of antennas and large constellation sizes. We propose in this paper a…

Information Theory · Computer Science 2008-11-07 Rym Ouertani , Ghaya Rekaya Ben-Othman , Abdellatif Salah