Complex Orthogonal Designs With Forbidden 2$\,\times\,$2 Submatrices

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD O<sub>z</sub> with parameter [p, n, k] is a p × n matrix, where nonzero entries are filled ±z<sub>i</sub> by ±z<sub>i</sub>*, i = 1,2...,k, or , such that O<sub>z</sub><sup>H</sup>O<sub>z</sub> = (|z<sub>1</sub>|<sup>2</sup> + |z<sub>2</sub>|<sup>2</sup> + ...+ |z<sub>k</sub>|<sup>2</sup>)I<sub>n×n</sub>. Define O<sub>z</sub> a first type COD if and only if O<sub>z</sub> does not contain submatrix (±zj,0:0,±zj*) or (±zj*,0:0,±zj). It is already known that all CODs with maximal rate, i.e., maximal k/p, are of the first type. In this paper, we will determine all achievable parameters [p, n, k] of first type COD, as well as all their possible structures. The existence of parameters is proved by explicit-form constructions. New CODs with parameters [p, n, k] = [(n:w-1) + (n:w+1),n, (n:w)], for 0 ≤ w ≤ n, are constructed, which demonstrate the possibility of sacrificing code rate to reduce decoding delay. It is worth mentioning that all maximal rate, minimal delay CODs are contained in our constructions, and their uniqueness under equivalence operation is proved.

[1]  Jennifer Seberry,et al.  A construction technique for generalized complex orthogonal designs and applications to wireless communications , 2005 .

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

[3]  Haibin Kan,et al.  The maximal rates and minimal decoding delay of more general complex orthogonal designs , 2010, Science China Information Sciences.

[4]  A. Robert Calderbank,et al.  Correction to "Space-Time codes from orthogonal designs" , 2000, IEEE Trans. Inf. Theory.

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

[6]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[7]  Tadeusz A. Wysocki,et al.  On Transceiver Signal Linearization and the Decoding Delay of Maximum Rate Complex Orthogonal Space-Time Block Codes , 2011, IEEE Transactions on Information Theory.

[8]  Xiang-Gen Xia,et al.  On the nonexistence of rate-one generalized complex orthogonal designs , 2003, IEEE Trans. Inf. Theory.

[9]  Xiang-Gen Xia,et al.  Two generalized complex orthogonal space-time block codes of rates 7/11 and 3/5 for 5 and 6 transmit antennas , 2003, IEEE Trans. Inf. Theory.

[10]  Mathav Kishore Murugan,et al.  The Final Case of the Decoding Delay Problem for Maximum Rate Complex Orthogonal Designs , 2010, IEEE Transactions on Information Theory.

[11]  Alfred Mertins,et al.  Novel Constructions of Improved Square Complex Orthogonal Designs for Eight Transmit Antennas , 2009, IEEE Transactions on Information Theory.

[12]  Weifeng Su,et al.  On orthogonal space-time block codes and transceiver signal linearization , 2006, IEEE Communications Letters.

[13]  James A. Davis,et al.  Novel Classes of Minimal Delay and Low PAPR Rate ${1\over 2}$ Complex Orthogonal Designs , 2011, IEEE Transactions on Information Theory.

[14]  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..

[15]  Xiang-Gen Xia,et al.  Upper bounds of rates of complex orthogonal space-time block code , 2003, IEEE Trans. Inf. Theory.

[16]  Sarah Spence Adams,et al.  The Minimum Decoding Delay of Maximum Rate Complex Orthogonal Space–Time Block Codes , 2007, IEEE Transactions on Information Theory.

[17]  Hong Shen,et al.  A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates , 2005, IEEE Transactions on Information Theory.

[18]  Hong Shen,et al.  Lower bounds on the minimal delay of complex orthogonal designs with maximal rates , 2006, IEEE Transactions on Communications.

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

[20]  B. Sundar Rajan,et al.  A generalization of some existence results on orthogonal designs for STBCs , 2004, IEEE Transactions on Information Theory.

[21]  Xiang-Gen Xia,et al.  A systematic design of high-rate complex orthogonal space-time block codes , 2004, IEEE Communications Letters.

[22]  J. Shah,et al.  VECTOR FIELDS ON SPHERES , 2007 .

[23]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[24]  Jennifer Seberry,et al.  Orthogonal Designs: Quadratic Forms and Hadamard Matrices , 1979 .

[25]  Desmond P. Taylor,et al.  High-throughput error correcting space-time block codes , 2004, IEEE Communications Letters.

[26]  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.

[27]  X. Xia,et al.  Closed Form Designs of Complex Orthogonal Space-Time Block Codes of Rates for or Transmit Antennas , 2004 .

[28]  B. Sundar Rajan,et al.  On the Maximal Rate of Non-Square STBCs from Complex Orthogonal Designs , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[29]  Siavash M. Alamouti,et al.  A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..