English
Related papers

Related papers: Single-Symbol Maximum Likelihood Decodable Linear …

200 papers

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

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

By using joint modulation and customized constellation set, we show that Quasi-Orthogonal Space-Time Block Code (QO-STBC) can be used to form a new differential space-time modulation (DSTM) scheme to provide full transmit diversity with…

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

Space-Time Block Codes (STBCs) suffer from a prohibitively high decoding complexity unless the low-complexity decodability property is taken into consideration in the STBC design. For this purpose, several families of STBCs that involve a…

Information Theory · Computer Science 2013-01-03 Amr Ismail , Jocelyn Fiorina , Hikmet Sari

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

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

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

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

Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood…

Information Theory · Computer Science 2025-01-22 Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

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

The 3D MIMO code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO…

Information Theory · Computer Science 2014-01-16 Ming Liu , Matthieu Crussière , Maryline Hélard , Jean-François Hélard

It has been shown recently that the maximum rate of a 2-real-symbol (single-complex-symbol) maximum likelihood (ML) decodable, square space-time block codes (STBCs) with unitary weight matrices is $\frac{2a}{2^a}$ complex symbols per…

Information Theory · Computer Science 2011-05-10 Teja Damodaram Bavirisetti , B. Sundar Rajan

In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at the receiver. Although constructions of STBCs have…

Information Theory · Computer Science 2017-01-16 J. Harshan , Amin Sakzad , Emanuele Viterbo

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

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

Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs becomes prohibitive large as the number of transmit and…

Information Theory · Computer Science 2016-11-15 G. Susinder Rajan , B. Sundar Rajan

In this paper, we present a space-time-frequency joint block coding (STFBC) scheme to exploit the essential space-time-frequency degrees of freedom of multiuser MISO-MC-CDMA systems. Specifically, we use a series of orthogonal random codes…

Information Theory · Computer Science 2014-07-10 Xiaoming Chen , Xiumin Wang

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

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