English
Related papers

Related papers: Multigroup-Decodable STBCs from Clifford Algebras

200 papers

In this paper, a design criterion for space-time block codes (STBC) is proposed for two-user MIMO interference channels when a group zero-forcing (ZF) algorithm is applied at each receiver to eliminate the inter-user interference. Based on…

Information Theory · Computer Science 2012-09-27 Long Shi , Wei Zhang , Xiang-Gen Xia

In this paper, we define dual codes over arbitrary finite rings with respect to arbitrary bilinear forms and provide a generalization of Hayden's theorem (Bridges, Hall, and Hayden, 1981). Building on this foundation, we introduce the…

Combinatorics · Mathematics 2026-05-05 Futo Takabayashi

In this paper, we present a belief propagation (BP) based algorithm for decoding non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) having {\em large dimensions}. The proposed approach involves message passing…

Information Theory · Computer Science 2009-01-14 Madhekar Suneel , Pritam Som , A. Chockalingam , B. Sundar Rajan

A new class of structured codes called Quasi Group Codes (QGC) is introduced. A QGC is a subset of a group code. In contrast with group codes, QGCs are not closed under group addition. The parameters of the QGC can be chosen such that the…

Information Theory · Computer Science 2017-08-03 Mohsen Heidari , Farhad Shirani , Sandeep Pradhan

This is the second part of a two-part series of papers. In this paper, for the generalized non-orthogonal amplify and forward (GNAF) protocol presented in Part-I, a construction of a new family of distributed space-time codes based on…

Information Theory · Computer Science 2007-07-16 G. Susinder Rajan , 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

Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood…

Information Theory · Computer Science 2025-01-22 Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

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

In this paper we propose constellations with suitable structure which allow one to construct codes with excellent diversity using geometrical symmetry and numerical methods. We also demonstrate how these structured constellations…

Optimization and Control · Mathematics 2007-05-23 Guangyue Han , Joachim Rosenthal

Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination…

Information Theory · Computer Science 2008-11-29 D. Sreedhar , A. Chockalingam , B. Sundar Rajan

Full-rate space-time block codes (STBCs) achieve high spectral-efficiency by transmitting linear combinations of information symbols through every transmit antenna. However, the coefficients used for the linear combinations, if not chosen…

Information Theory · Computer Science 2013-03-18 J. Harshan , Emanuele Viterbo

High data-rate Distributed Orthogonal Space-Time Block Codes (DOSTBCs) which achieve the single-symbol decodability and full diversity order are proposed in this paper. An upper bound of the data-rate of the DOSTBC is derived and it is…

Information Theory · Computer Science 2009-08-10 Zhihang Yi , Il-Min Kim

We consider quantum two-block group algebra (2BGA) codes, a previously unstudied family of smallest lifted-product (LP) codes. These codes are related to generalized-bicycle (GB) codes, except a cyclic group is replaced with an arbitrary…

Quantum Physics · Physics 2023-06-29 Hsiang-Ku Lin , Leonid P. Pryadko

We consider a statistical problem to estimate variables (effects) that are associated with the edges of a complete bipartite graph $K_{v_1, v_2}=(V_1, V_2 \, ; E)$. Each data is obtained as a sum of selected effects, a subset of $E$. In…

Combinatorics · Mathematics 2023-09-01 Shoko Chisaki , Ryoh Fuji-Hara , Nobuko Miyamoto

A basic problem for the constant dimension subspace coding is to determine the maximal possible size A_q (n, d, k) of a set of k-dimensional subspaces in Fnq such that the subspace distance satisfies d(U, V )> or =d for any two different…

Information Theory · Computer Science 2020-01-06 Hao Chen , Xianmang He , Jian Weng , Liqing Xu

A novel distributed space-time block code (STBC) for the next generation mobile TV broadcasting is proposed. The new code provides efficient performance within a wide range of power imbalance showing strong adaptivity to the single…

Networking and Internet Architecture · Computer Science 2012-12-12 Ming Liu , Maryline Hélard , Matthieu Crussière , Jean-François Hélard

Multicasting $K$ independent messages via multiple-input multiple-output (MIMO) channels to multiple users where each user already has a subset of messages as side information is studied. A general framework of constructing layered…

Information Theory · Computer Science 2017-09-14 Yu-Chih Huang , Yi Hong , Emanuele Viterbo , Lakshmi Natarajan

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

This paper presents a computationally efficient decoder for multiple antenna systems. The proposed algorithm can be used for any constellation (QAM or PSK) and any labeling method. The decoder is based on matrix-lifting Semi-Definite…

Information Theory · Computer Science 2007-09-12 Amin Mobasher , Amir K. Khandani

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
‹ Prev 1 3 4 5 6 7 10 Next ›