A Class of Maximal-Rate, Low-PAPR, Non-square Complex Orthogonal Designs

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, rate-1 complex orthogonal designs (COD) does not exist for more than 2 transmit antennas. Liang (IEEE Trans. Inform. Theory, 2003) and Lu et al (IEEE Trans. Inform. Theory, 2005) have constructed a class of maximal rate non-square CODs where the rate is ${1/2}+\frac{1}{n}$ if number of transmit antennas $n$ is even and ${1/2}+\frac{1}{n+1}$ if $n$ is odd. In this paper, we present a simple construction for maximal rate non-square CODs obtained from square CODs which resembles the construction of rate-1 non-square 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.

[1]  Xiang-Gen Xia,et al.  Closed-form designs of complex orthogonal space-time block codes of rates (k+1)/(2k) for 2k-1 or 2k transmit antennas , 2005, IEEE Transactions on Information Theory.

[2]  Jinhui Chen,et al.  Orthogonal space-time block codes for analog channel feedback , 2008, 2008 IEEE International Symposium on Information Theory.

[3]  N. Pullman,et al.  A theorem of Hurwitz and Radon and orthogonal projective modules , 1974 .

[4]  Le Chung Tran Complex Orthogonal Space-Time Processing in Wireless Communications , 2006 .

[5]  Xiang-Gen Xia,et al.  Closed form designs of complex orthogonal space-time block codes of rates (k+1)/(2k) for 2k_1 or 2k transmit antennas , 2005, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[6]  Ari Hottinen,et al.  Square-matrix embeddable space-time block codes for complex signal constellations , 2002, IEEE Trans. Inf. Theory.

[7]  B. Sundar Rajan,et al.  Square Complex Orthogonal Designs with Low PAPR , 2007, 2007 IEEE International Symposium on Information Theory.

[8]  Xue-Bin Liang,et al.  Orthogonal designs with maximal rates , 2003, IEEE Trans. Inf. Theory.

[9]  B. Sundar Rajan,et al.  Single-symbol maximum likelihood decodable linear STBCs , 2006, IEEE Transactions on Information Theory.

[10]  A. Robert Calderbank,et al.  Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.

[11]  B. Sundar Rajan,et al.  Square complex orthogonal designs with low PAPR and signaling complexity , 2009, IEEE Transactions on Wireless Communications.

[12]  R. Phillips,et al.  On matrices whose real linear combinations are non-singular , 1965 .