Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas
Petros Elia, B. A. Sethuraman, P. Vijay Kumar
Abstract
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 antenna and good shaping of the constellation. These defining conditions jointly correspond to optimality with respect to the Zheng-Tse D-MG tradeoff, independent of channel statistics, as well as to near optimality in maximizing mutual information. All the above traits endow the code with error performance that is currently unmatched. Yet perfect space-time codes have been constructed only for 2,3,4 and 6 transmit antennas. We construct minimum and non-minimum delay perfect codes for all channel dimensions.
Create a lesson
Related papers
An Explicit Family of Log-Concave Counterexamples to the Gaussian Completely Monotone Conjecture
Jiayang Zou, Luyao Fan, Jiayang Gao et al.
Strengthening Recursive Constructions for Zero-Error Shannon Capacity
Ravi Tandon
Fluid Antenna Multiple Access for Noise Modulation
Hadi Zayyani, Felipe A. P. de Figueiredo
The generalized covering radii of Melas codes
Shuxing Li, Maosheng Xiong
Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance
Antonio Jesús Lorite-López, Daniel Camazón-Portela, Juan Antonio López-Ramos
Multi-Access Speculative Inference: Uplink or Downlink?
Chang Cai, Kaibin Huang