Complex Orthogonal Designs with Forbidden $2 \times 2$ Submatrices

Details Complex Orthogonal Designs with Forbidden $2 \times 2$ Submatrices Complex Orthogonal Designs with Forbidden $2 \times 2$ Submatrices

2011-07-17

arxiv.org/abs/1107.3268v2

Computer Science

Information Theory

Scientific paper

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such that $\mathcal{O}^H_z \mathcal{O}_z = (|z_1|^2+|z_2|^2+...+|z_k|^2)I_{n \times n}$. Define $\mathcal{O}_z$ a first type COD if and only if $\mathcal{O}_z$ does not contain submatrix {\pm z_j & 0; \ 0 & \pm z^*_j}$ or ${\pm z^*_j & 0; \ 0 & \pm z_j}$. It is already known that, all CODs with maximal rate, i.e., maximal $k/p$, are of the first type. In this paper, we 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]=[\binom{n}{w-1}+\binom{n}{w+1}, n, \binom{n}{w}], $ for $0 \le w \le n$, are constructed, which demonstrate the possibility of sacrificing code rate to reduce decoding delay. It's worth mentioning that all maximal rate, minimal delay CODs are contained in our constructions, and their uniqueness under equivalence operation is proved.

Affiliated with

Also associated with

No associations

Rating

Complex Orthogonal Designs with Forbidden $2 \times 2$ Submatrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complex Orthogonal Designs with Forbidden $2 \times 2$ Submatrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complex Orthogonal Designs with Forbidden $2 \times 2$ Submatrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-478562