Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Square Complex Orthogonal Designs with Low PAPR and Signaling Complexity (0807.4128v1)

Published 25 Jul 2008 in cs.IT and math.IT

Abstract: 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 also impose a severe constraint on hardware implementation of the code when turning off some of the transmitting antennas whenever a zero is transmitted. Recently, rate 1/2 SCODs with no zero entry have been reported for 8 transmit antennas. In this paper, SCODs with no zero entry for $2a$ transmit antennas whenever $a+1$ is a power of 2, are constructed which includes the 8 transmit antennas case as a special case. More generally, for arbitrary values of $a$, explicit construction of $2a\times 2a$ rate $\frac{a+1}{2a}$ SCODs with the ratio of number of zero entries to the total number of entries equal to $1-\frac{a+1}{2a}2{\lfloor log_2(\frac{2a}{a+1}) \rfloor}$ is reported, whereas for standard known constructions, the ratio is $1-\frac{a+1}{2a}$. The codes presented do not result in increased signaling complexity. Simulation results show that the codes constructed in this paper outperform the codes using the standard construction under peak power constraint while performing the same under average power constraint.

Citations (12)

Summary

We haven't generated a summary for this paper yet.