English
Related papers

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

200 papers

Space-time block codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zeros. The zeros in the designs result in high peak-to-average power ratio and also…

Information Theory · Computer Science 2008-12-15 Smarajit Das , B. Sundar Rajan

Space-time block codes (STBCs) from non-square complex orthogonal designs are bandwidth efficient when compared with those from square real/complex orthogonal designs. Though there exists rate-1 ROD for any number of transmit antennas,…

Information Theory · Computer Science 2008-08-12 Smarajit Das , B. Sundar Rajan

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

Complex orthogonal design (COD) with parameter $[p, n, k]$ is a combinatorial design used in space-time block codes (STBCs). For STBC, $n$ is the number of antennas, $k/p$ is the rate, and $p$ is the decoding delay. A class of rate $1/2$…

Information Theory · Computer Science 2016-09-20 Xiaodong Liu , Yuan Li , Haibin Kan

It is well known that Space-Time Block Codes (STBCs) obtained from Orthogonal Designs (ODs) are single-symbol-decodable (SSD) and from Quasi-Orthogonal Designs (QODs) are double-symbol decodable. However, there are SSD codes that are not…

Information Theory · Computer Science 2007-07-13 Sanjay Karmakar , B. Sundar Rajan

Complex Orthogonal Design (COD) codes are known to have the lowest detection complexity among Space-Time Block Codes (STBCs). However, the rate of square COD codes decreases exponentially with the number of transmit antennas. The…

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

It is well known that the Space-time Block Codes (STBCs) from Complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD). The weight matrices of the square CODs are all unitary and obtainable from the…

Information Theory · Computer Science 2016-11-17 Sanjay Karmakar , K. Pavan Srinath , B. Sundar Rajan

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…

Information Theory · Computer Science 2012-04-03 Yuan Li , Haibin Kan

In this paper we propose a new construction method for rate-1 Fast-Group-Decodable (FGD) Space-Time-Block Codes (STBC)s for 2^a transmit antennas. We focus on the case of a=2 and we show that the new FGD rate-1 code has the lowest…

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

Complex orthogonal designs (CODs) play a crucial role in the construction of space-time block codes. Their real analog, real orthogonal designs (or equivalently, sum of squares composition formula) have a long history. Adams et al. (2011)…

Information Theory · Computer Science 2023-07-10 Yiwen Gao , Yuan Li , Haibin Kan

The maximal rate of a non-square complex orthogonal design for $n$ transmit antennas is $1/2+\frac{1}{n}$ if $n$ is even and $1/2+\frac{1}{n+1}$ if $n$ is odd and the codes have been constructed for all $n$ by Liang (IEEE Trans. Inform.…

Information Theory · Computer Science 2011-12-08 Smarajit Das , B. Sundar Rajan

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

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

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

It is well known that Space-Time Block Codes (STBCs) from orthogonal designs (ODs) are single-symbol decodable/symbol-by-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes…

Information Theory · Computer Science 2007-12-17 Sanjay Karmakar , B. Sundar Rajan

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

Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is…

Information Theory · Computer Science 2012-03-05 Sophie Morier-Genoud , Valentin Ovsienko

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p\times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…

Information Theory · Computer Science 2011-09-14 Yuan Li , Haibin Kan

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

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