English
Related papers

Related papers: Low-delay, High-rate Non-square Complex Orthogonal…

200 papers

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

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

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

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 2012-04-03 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

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

Space-Time Block Codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zero. The zeros in the designs result in high peak-to-average power ratio (PAPR) and…

Information Theory · Computer Science 2008-07-28 Smarajit Das , 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

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

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

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

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

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

In wireless broadcast, random linear network coding (RLNC) over GF(2^L) is known to asymptotically achieve the optimal completion delay with increasing L. However, the high decoding complexity hinders the potential applicability of RLNC…

Information Theory · Computer Science 2020-05-19 Rina Su , Qifu Tyler Sun , Zhongshan Zhang

Perfect space-time codes were first introduced by Oggier et. al. to be the space-time codes that have full rate, full diversity-gain, non-vanishing determinant for increasing spectral efficiency, uniform average transmitted energy per…

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

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

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