English
Related papers

Related papers: Signal Set Design for Full-Diversity Low-Decoding-…

200 papers

The design of linear STBCs offering a low-complexity ML decoding using the well known Sphere Decoder (SD) has been extensively studied in last years. The first considered approach to derive design criteria for the construction of such codes…

Information Theory · Computer Science 2016-05-11 Asma Mejri , Mohamed-Achraf Khsiba , Ghaya Rekaya-Ben Othmane

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

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

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

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

We present a novel differential space-time modulation (DSTM) scheme that is single-symbol decodable and can provide full transmit diversity. It is the first known singlesymbol- decodable DSTM scheme not based on Orthogonal STBC (O-STBC),…

Information Theory · Computer Science 2016-11-18 Chau Yuen , Yong Liang Guan , Tjeng Thiang Tjhung

The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach…

Information Theory · Computer Science 2015-03-19 Lakshmi Prasad Natarajan , 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

In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to…

Information Theory · Computer Science 2010-01-14 N. Lakshmi Prasad , B. Sundar Rajan

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

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

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

Distributed Orthogonal Space-Time Block Codes (DOSTBCs) achieving full diversity order and single-symbol ML decodability have been introduced recently by Yi and Kim for cooperative networks and an upperbound on the maximal rate of such…

Information Theory · Computer Science 2007-09-04 Harshan J. , B. Sundar Rajan

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

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

In this paper, Space-Time Block Codes (STBCs) with reduced Sphere Decoding Complexity (SDC) are constructed for two-user Multiple-Input Multiple-Output (MIMO) fading multiple access channels. In this set-up, both the users employ identical…

Information Theory · Computer Science 2009-08-11 J. Harshan , 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

High data-rate Distributed Orthogonal Space-Time Block Codes (DOSTBCs) which achieve the single-symbol decodability and full diversity order are proposed in this paper. An upper bound of the data-rate of the DOSTBC is derived and it is…

Information Theory · Computer Science 2009-08-10 Zhihang Yi , Il-Min Kim

This paper reviews the potential channel decoding techniques for ultra-reliable low-latency communications (URLLC). URLLC is renowned for its stringent requirements including ultra-reliability, low end-to-end transmission latency, and…

Information Theory · Computer Science 2022-12-26 Chentao Yue , Vera Miloslavskaya , Mahyar Shirvanimoghaddam , Branka Vucetic , Yonghui Li