High-Rate Full-Diversity Space-Time Block Codes for Three and Four Transmit Antennas

Ertugrul Basar; Umit Aygolu

Home/Archive/arXiv

arXiv · 0907.0725

High-Rate Full-Diversity Space-Time Block Codes for Three and Four Transmit Antennas

Ertugrul Basar·Umit Aygolu

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we deal with the design of high-rate, full-diversity, low maximum likelihood (ML) decoding complexity space-time block codes (STBCs) with code rates of 2 and 1.5 complex symbols per channel use for multiple-input multiple output (MIMO) systems employing three and four transmit antennas. We fill the empty slots of the existing STBCs from CIODs in their transmission matrices by additional symbols and use the conditional ML decoding technique which significantly reduces the ML decoding complexity of non-orthogonal STBCs while ensuring full-diversity and high coding gain. First, two new schemes with code rates of 2 and 1.5 are proposed for MIMO systems with four transmit antennas. We show that our low-complexity rate-2 STBC outperforms the corresponding best STBC recently proposed by Biglieri et al. for QPSK, due to its superior coding gain while our rate-1.5 STBC outperforms the full-diversity quasi-orthogonal STBC (QOSTBC). Then, two STBCs with code rates of 2 and 1.5 are proposed for three transmit antennas which are shown to outperform the corresponding full-diversity QOSTBC for three transmit antennas. We prove by an information-theoretic analysis that the capacities of new rate-2 STBCs for three and four transmit antennas are much closer to the actual MIMO channel capacity than the capacities of classical OSTBCs and CIODs.

Explore related subjects

cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Ertugrul Basar, Umit Aygolu. 2009-07-03. High-Rate Full-Diversity Space-Time Block Codes for Three and Four Transmit Antennas. https://arxiv.org/abs/0907.0725

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT↗

arXiv2026

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT↗

arXiv2026

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT↗