English
Related papers

Related papers: A Novel Construction of Multi-group Decodable Spac…

200 papers

Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…

Information Theory · Computer Science 2024-11-12 Yaozong Zhang , Dabin Zheng , Xiaoqiang Wang

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

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

Distributed space-time block coding is a diversity technique to mitigate the effects of fading in multi-hop wireless networks, where multiple relay stages are used by a source to communicate with its destination. This paper proposes a new…

Information Theory · Computer Science 2008-05-06 Rahul Vaze , Robert W. Heath

We study fast lattice decodability of space-time block codes for $n$ transmit and receive antennas, written very generally as a linear combination $\sum_{i=1}^{2l} s_i A_i$, where the $s_i$ are real information symbols and the $A_i$ are…

Information Theory · Computer Science 2016-11-18 Grégory Berhuy , Nadya Markin , B. A. Sethuraman

Orthogonal geometric constructions are the basis of many many quantum error-correcting codes (QEC), but strict orthogonality constraints limit design flexibility and resource efficiency. We introduce a quasi-orthogonal geometric framework…

The computational complexity of optimum decoding for an orthogonal space-time block code G satisfying the orthogonality property that the Hermitian transpose of G multiplied by G is equal to a constant c times the sum of the squared symbols…

Information Theory · Computer Science 2009-10-13 Ender Ayanoglu , Erik G. Larsson , Eleftherios Karipidis

For a family/sequence of STBCs $\mathcal{C}_1,\mathcal{C}_2,\dots$, with increasing number of transmit antennas $N_i$, with rates $R_i$ complex symbols per channel use (cspcu), the asymptotic normalized rate is defined as $\lim_{i \to…

Information Theory · Computer Science 2015-03-13 Lakshmi Prasad Natarajan , B. Sundar Rajan

In this paper, Space-Time Block Codes (STBCs) with reduced Sphere Decoding Complexity (SDC) are constructed for two-user Multiple-Input Multiple-Output (MIMO) fading multiple access channels. In this set-up, both the users employ identical…

Information Theory · Computer Science 2009-08-11 J. Harshan , B. Sundar Rajan

In this paper, we design space-time block codes (STBCs) to broadcast the common information omnidirectionally in a massive MIMO downlink. To reduce the burden of the downlink channel estimation and achieve partial spatial diversity from…

Information Theory · Computer Science 2016-10-26 Xin Meng , Xiang-Gen Xia , Xiqi Gao

Recently, a quasi-orthogonal space-time block code (QSTBC) capable of achieving a significant fraction of the outage mutual information of a multiple-input-multiple output (MIMO) wireless communication system for the case of four transmit…

Information Theory · Computer Science 2008-07-22 A. Sezgin , T. J. Oechtering

Consider the identification (ID) via channels problem, where a receiver wants to decide whether the transmitted identifier is its identifier, rather than decoding the identifier. This model allows to transmit identifiers whose size scales…

Information Theory · Computer Science 2021-06-28 Onur Günlü , Joerg Kliewer , Rafael F. Schaefer , Vladimir Sidorenko

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 $min(n_t,n_r)$ complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for…

Information Theory · Computer Science 2010-01-13 K. Pavan Srinath , B. Sundar Rajan

This letter introduces two fast maximum-likelihood (ML) detection methods for 4*4 quasi-orthogonal space-time block code (QOSTBC). The first algorithm with a relatively simple design exploits structure of quadrature amplitude modulation…

Information Theory · Computer Science 2017-06-14 Adel Ahmadi , Siamak Talebi

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

Partial interference cancellation (PIC) group decoding proposed by Guo and Xia is an attractive low-complexity alternative to the optimal processing for multiple-input multiple-output (MIMO) wireless communications. It can well deal with…

Information Theory · Computer Science 2010-03-23 Wei Zhang , Long Shi , Xiang-Gen Xia

In this paper we consider the generalization of binary spatially coupled low-density parity-check (SC-LDPC) codes to finite fields GF$(q)$, $q\geq 2$, and develop design rules for $q$-ary SC-LDPC code ensembles based on their iterative…

Information Theory · Computer Science 2014-11-18 Lai Wei , David G. M. Mitchell , Thomas E. Fuja , Daniel J. Costello

Non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) having large dimensions are attractive because they can simultaneously achieve both high spectral efficiencies (same spectral efficiency as in V-BLAST for a…

Information Theory · Computer Science 2009-01-14 Saif K. Mohammed , A. Chockalingam , B. Sundar Rajan

Self-orthogonal codes have received great attention due to their important applications in quantum codes, LCD codes and lattices. Recently, several families of self-orthogonal codes containing the all-$1$ vector were constructed by…

Information Theory · Computer Science 2025-08-06 Yadi Wei , Jiaxin Wang , Fang-Wei Fu

The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…

Information Theory · Computer Science 2008-07-18 Yeow Meng Chee , Gennian Ge , Alan C. H. Ling