English
Related papers

Related papers: Two Quasi Orthogonal Space-Time Block Codes with B…

200 papers

In this paper, we introduce further our recently designed family of L2 orthogonal Space-Time codes for CPM. With their advantage of maintaining both the constant envelope properties of CPM, the diversity of Space-Time codes and moreover…

Information Theory · Computer Science 2009-02-18 Matthias Hesse , Jerome Lebrun , Luc Deneire

Perfect Space-Time Block Codes (PSTBCs) achieve full diversity, full rate, nonvanishing constant minimum determinant, uniform average transmitted energy per antenna, and good shaping. However, the high decoding complexity is a critical…

Information Theory · Computer Science 2012-08-17 Boyu Li , Ender Ayanoglu

Visible light communication (VLC) has been recognized as a promising technology for handling the continuously increasing quality of service and connectivity requirements in modern wireless communications, particularly in indoor scenarios.…

Information Theory · Computer Science 2021-11-09 Shimaa Naser , Lina Bariah , Sami Muhaidat , Mahmoud Al-Qutayri , Murat Uysal , Paschalis C. Sofotasios

We compare four open-loop transmit diversity schemes in a coded Orthogonal Frequency Division Multiplexing (OFDM) system with four transmit antennas, namely cyclic delay diversity (CDD), Space-Time Block Code (STBC, Alamouti code is used)…

Information Theory · Computer Science 2008-06-24 Chau Yuen , Yan Wu , Sumei Sun

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

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

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 new cooperative packet transmission scheme that allows independent sources to superimpose over-the-air their packet transmissions. Relay nodes are used and cooperative diversity is combined with distributed…

Networking and Internet Architecture · Computer Science 2013-03-18 Antonios Argyriou

As wireless communication systems look intently to compose the transition from voice communication to interactive Internet data, achieving higher bit rates becomes both increasingly desirable and challenging. Space-time coding (STC) is a…

Information Theory · Computer Science 2010-04-13 C. V. Seshaiah , S. Nagarani

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

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

In this thesis, we study differential modulation schemes which do not need channel knowledge at the transmitter nor at the receiver. First, we consider single-antenna systems and investigate the use of Differential Amplitude Phase Shift…

Information Theory · Computer Science 2019-02-12 Rania Morsi

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

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

In this paper, a combination of Space Time Block Coded Spatial Modulation with Hybrid Analog-Digital Beamforming (STBC-SM-HBF) for Millimeter-wave (mmWave) communications is proposed in order to take advantage of the merits of Spatial…

Information Theory · Computer Science 2018-07-31 Taissir Y. Elganimi , Ali A. Elghariani

In this paper, we propose two new systematic ways to construct amicable orthogonal designs (AOD), with an aim to facilitate the construction of power-balanced orthogonal spacetime block codes (O-STBC) with favorable practical attributes. We…

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

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

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

This letter introduces two fast maximum-likelihood (ML) detection methods for 4*4 quasi-orthogonal space-time block code (QOSTBC). The first algorithm with a relatively simple design exploits structure of quadrature amplitude modulation…

Information Theory · Computer Science 2017-06-14 Adel Ahmadi , Siamak Talebi