Complex Orthogonal Space-Time Processing in Wireless Communications
Complex Orthogonal Space-Time Processing in Wireless Communications
Square complex orthogonal designs with low PAPR and signaling complexity
IEEE Transactions on Wireless Communications
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
Square-matrix embeddable space-time block codes for complex signal constellations
IEEE Transactions on Information Theory
Orthogonal designs with maximal rates
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Single-symbol maximum likelihood decodable linear STBCs
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Space-time block codes based on orthogonal designs are used for wireless communications with multiple transmit antennas which can achieve full transmit diversity and have low decoding complexity. However, the rate of the square real/complex orthogonal designs tends to zero with increase in number of antennas, while it is possible to have a rate-1 real orthogonal design (ROD) for any number of antennas. In case of complex orthogonal designs (CODs), rate-1 codes exist only for 1 and 2 antennas. In general, For n transmit antennas, the maximal rate of a COD is 1/2 + 1/n or 1/2 + 1/n+1 for n even or odd respectively. In this paper, we present a simple construction for maximal-rate CODs for any number of antennas from square CODs which resembles the construction of rate-1 RODs from square RODs. These designs are shown to be amenable for construction of a class of generalized CODs (called Coordinate-Interleaved Scaled CODs) with low peak-to-average power ratio (PAPR) having the same parameters as the maximal-rate codes. Simulation results indicate that these codes perform better than the existing maximal rate codes under peak power constraint while performing the same under average power constraint.