English
Related papers

Related papers: On the Minimum Decoding Delay of Balanced Complex …

200 papers

High-rate space-time block codes (STBC with code rate > 1) in multi-input multi-output (MIMO) systems are able to provide both spatial multiplexing gain and diversity gain, but have high maximum likelihood (ML) decoding complexity. Since…

Information Theory · Computer Science 2016-11-18 Tian Peng Ren , Yong Liang Guan , Chau Yuen , Erry Gunawan , Er Yang Zhang

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

In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4x2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code…

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

In this paper, we deal with the design of high-rate, full-diversity, low maximum likelihood (ML) decoding complexity space-time block codes (STBCs) with code rates of 2 and 1.5 complex symbols per channel use for multiple-input multiple…

Information Theory · Computer Science 2009-07-07 Ertugrul Basar , Umit Aygolu

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

Linear space-time block codes (STBCs) of unitary rate and full diversity, systematically constructed over arbitrary constellations for any number of transmit antennas are introduced. The codes are obtained by generalizing the existing ABBA…

Information Theory · Computer Science 2007-07-13 Giuseppe Thadeu Freitas de Abreu

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 coding techniques have become common-place in wireless communication standards as they provide an effective way to mitigate the fading phenomena inherent in wireless channels. However, the use of Space-Time Block Codes (STBCs)…

Information Theory · Computer Science 2016-11-17 Amr Ismail , Jocelyn Fiorina , Hikmet Sari

The combination of space-time coding (STC) and continuous phase modulation (CPM) is an attractive field of research because both STC and CPM bring many advantages for wireless communications. Zhang and Fitz [1] were the first to apply this…

Information Theory · Computer Science 2008-12-18 Matthias Hesse , Jerome Lebrun , Luc Deneire

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

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

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

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

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

A partial interference cancellation (PIC) group decoding based space-time block code (STBC) design criterion was recently proposed by Guo and Xia, where the decoding complexity and the code rate trade-off is dealt when the full diversity is…

Information Theory · Computer Science 2010-01-04 Wei Zhang , Tianyi Xu , Xiang-Gen Xia

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

Slow fading broadcast channels can model a wide range of applications in wireless networks. Due to delay requirements and the unavailability of the channel state information at the transmitter (CSIT), these channels for many applications…

Information Theory · Computer Science 2019-07-23 Hossein Khoshnevis , Ian Marsland , Hamid Jafarkhani , Halim Yanikomeroglu

We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the…

Information Theory · Computer Science 2013-03-01 Venkatesan Guruswami , Adam Smith

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