English
Related papers

Related papers: Perfect Space-Time Codes with Minimum and Non-Mini…

200 papers

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

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

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

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

Current research proposes a natural environment for the space-time codes and in this context it is obtained a new design criterion for space-time codes in multi-antenna communication channels. The objective of this criterion is to minimize…

Information Theory · Computer Science 2014-07-16 Carlos A. R. Martins , Eduardo Brandani da Silva

Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [1] to the N -relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time…

Information Theory · Computer Science 2015-04-21 Amaro Barreal , Camilla Hollanti , Nadya Markin

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

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

A recent result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, referred to as the diversity-multiplexing gain (D-MG) tradeoff, between the spatial multiplexing gain and the diversity gain that…

Information Theory · Computer Science 2007-07-13 Petros Elia , K. Raj Kumar , Sameer A. Pawar , P. Vijay Kumar , Hsiao-feng Lu

Recently a construction of optimal non-constant dimension subspace codes, also termed projective space codes, has been reported in a paper of Honold-Kiermaier-Kurz. Restricted to binary codes in a 5-dimensional ambient space with minimum…

Information Theory · Computer Science 2017-01-26 Anirban Ghatak

In this article, the first general constructions of fast-decodable, more specifically (conditionally) $g$-group decodable, space-time block codes for the Nonorthogonal Amplify and Forward (NAF) Multiple-Input Multiple-Output (MIMO) relay…

Information Theory · Computer Science 2015-12-11 Amaro Barreal , Camilla Hollanti , Nadya Markin

In Index coding there is a single sender with multiple messages and multiple receivers each wanting a different set of messages and knowing a different set of messages a priori. The Index Coding problem is to identify the minimum number of…

Information Theory · Computer Science 2015-04-21 Kavitha. R , B. Sundar Rajan

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

Explicit codes are constructed that achieve the diversity-multiplexing gain tradeoff of the cooperative-relay channel under the dynamic decode-and-forward protocol for any network size and for all numbers of transmit and receive antennas at…

Information Theory · Computer Science 2007-07-13 Petros Elia , P. Vijay Kumar

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

A new design method for high rate, fully diverse ('spherical') space frequency codes for MIMO-OFDM systems is proposed, which works for arbitrary numbers of antennas and subcarriers. The construction exploits a differential geometric…

Information Theory · Computer Science 2016-11-17 Oliver Henkel

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

To combine the high power efficiency of Continuous Phase Modulation (CPM) with either high spectral efficiency or enhanced performance in low Signal to Noise conditions, some authors have proposed to introduce CPM in a MIMO frame, by using…

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

The maximal rate for non-square Complex Orthogonal Designs (CODs) with $n$ transmit antennas is ${1/2}+\frac{1}{n}$ if $n$ is even and ${1/2}+\frac{1}{n+1}$ if $n$ is odd, which are close to 1/2 for large values of $n.$ A class of maximal…

Information Theory · Computer Science 2008-07-28 Smarajit Das , B. Sundar Rajan

Multiple antenna (MIMO) devices are widely used to increase reliability and information bit rate. Optimal error rate performance (full diversity and large coding gain), for unknown channel state information at the transmitter and for…

Information Theory · Computer Science 2012-05-14 Dieter Duyck , Sheng Yang , Fambirai Takawira , Joseph J. Boutros , Marc Moeneclaey
‹ Prev 1 2 3 10 Next ›