English
Related papers

Related papers: Reduced ML-Decoding Complexity, Full-Rate STBCs fo…

200 papers

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

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. The well known Golden code is an example of a…

Information Theory · Computer Science 2015-03-17 K. Pavan Srinath , B. Sundar Rajan

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

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 propose a full-rate full-diversity space-time block code (STBC) for 2x2 reconfigurable multiple-input multiple-output (MIMO) systems that require a low complexity maximum likelihood (ML) detector. We consider a transmitter…

Information Theory · Computer Science 2015-05-27 Vida Vakilian , Hani Mehrpouyan , Yingbo Hua , Hamid Jafarkhani

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

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, a new method is proposed to obtain full-diversity, rate-2 (rate of 2 complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input, double output (MIDO) systems. Using this method,…

Information Theory · Computer Science 2013-04-25 K. Pavan Srinath , B. Sundar Rajan

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

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

In this paper, we propose a systematic design of space-time block codes (STBC) which can achieve high rate and full diversity when the partial interference cancellation (PIC) group decoding is used at receivers. The proposed codes can be…

Information Theory · Computer Science 2010-04-19 Long Shi , Wei Zhang , Xiang-Gen Xia

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

This paper proposes a low decoding complexity, full-diversity and full-rate space-time block code (STBC) for 4 transmit and 2 receive ($4\times 2$) multiple-input multiple-output (MIMO) systems. For such systems, the best code known is the…

Information Theory · Computer Science 2008-06-12 K. Pavan Srinath , B. Sundar Rajan

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

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

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

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

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

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
‹ Prev 1 2 3 10 Next ›