English
Related papers

Related papers: Square Complex Orthogonal Designs with Low PAPR an…

200 papers

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

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

Using the spatial modulation approach, where only one transmit antenna is active at a time, we propose two transmission schemes for two-way relay channel using physical layer network coding with space time coding using Coordinate…

Information Theory · Computer Science 2014-01-07 K. G. Unnikrishnan , B. Sundar Rajan

It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position…

Information Theory · Computer Science 2007-07-13 Anant Sahai

For an $n_t$ transmit, $n_r$ receive antenna system ($n_t \times n_r$ system), a {\it{full-rate}} space time block code (STBC) transmits $n_{min} = min(n_t,n_r)$ complex symbols per channel use and in general, has an ML-decoding complexity…

Information Theory · Computer Science 2010-03-16 K. Pavan Srinath , B. Sundar Rajan

The upcoming 5G networks demand high-speed and high spectral-efficiency communications to keep up with the proliferating traffic demands. To this end, Massive multiple-input multiple-output (MIMO) techniques have gained significant traction…

Information Theory · Computer Science 2019-08-06 Anu Jagannath , Jithin Jagannath , Andrew Drozd

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

A Quasi-Orthogonal Space-Time Block Code (QO-STBC) is attractive because it achieves higher code rate than Orthogonal STBC and lower decoding complexity than nonorthogonal STBC. In this paper, we first derive the algebraic structure of…

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

In this paper, we consider a quasi-orthogonal (QO) space-time block code (STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a…

Information Theory · Computer Science 2007-07-13 Chau Yuen , Yong Liang Guan , Tjeng Thiang Tjhung

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

Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initially been designed with a focus on open-loop systems, recent technological…

Information Theory · Computer Science 2016-11-17 Che Lin , Vasanthan Raghavan , Venu Veeravalli

In this paper, we introduce the notion of perfect space-time block codes (STBC). These codes have full rate, full diversity, non-vanishing constant minimum determinant for increasing spectral efficiency, uniform average transmitted energy…

Information Theory · Computer Science 2007-07-16 F. Oggier , G. Rekaya-Ben Othman , J. -C. Belfiore , E. Viterbo

Space Time Block Codes (STBCs) from orthogonal designs have attracted significant interest in recent years. However, with the growing demand for higher capacity schemes, the multiantenna transmission techniques must support and achieve…

Networking and Internet Architecture · Computer Science 2020-09-04 Anu Jagannath , Jithin Jagannath , Andrew Drozd

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

Two new rate-one full-diversity space-time block codes (STBC) are proposed. They are characterized by the \emph{lowest decoding complexity} among the known rate-one STBC, arising due to the complete separability of the transmitted symbols…

Information Theory · Computer Science 2016-11-17 Dung Ngoc Dao , Chau Yuen , Chintha Tellambura , Yong Liang Guan , Tjeng Thiang Tjhung

To combine the power efficiency of Continuous Phase Modulation (CPM) with enhanced performance in fading environments, some authors have suggested to use CPM in combination with Space-Time Codes (STC). Recently, we have proposed a CPM…

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

Complementary set sequences (CSSs) are useful for dealing with the high peak-to-average power ratio (PAPR) problem in orthogonal frequency division multiplexing (OFDM) systems. In practical OFDM transmission, however, certain sub-carriers…

Information Theory · Computer Science 2020-03-17 Yajing Zhou , Yang Yang , Zhengchun Zhou , Kushal Anand , Su Hu , Yong Liang Guan

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

Full-rate space-time block codes (STBCs) achieve high spectral-efficiency by transmitting linear combinations of information symbols through every transmit antenna. However, the coefficients used for the linear combinations, if not chosen…

Information Theory · Computer Science 2013-03-18 J. Harshan , Emanuele Viterbo

Consider a problem of forward error-correction for the additive white Gaussian noise (AWGN) channel. For finite blocklength codes the backoff from the channel capacity is inversely proportional to the square root of the blocklength. In this…

Information Theory · Computer Science 2014-08-12 Yury Polyanskiy , Yihong Wu