On the Minimum Decoding Delay of Balanced Complex Orthogonal Designs

DOI10.1109/TIT.2014.2368554zbMATH Open1359.94857arXiv1312.7650MaRDI QIDQ2978849

Author name not available (Why is that?)

Publication date: 28 April 2017

Published in: (Search for Journal in Brave)

Abstract: Complex orthogonal design (COD) with parameter $[p,n,k]$ is a combinatorial design used in space-time block codes (STBCs). For STBC, $n$ is the number of antennas, $k/p$ is the rate, and $p$ is the decoding delay. A class of rate $1/2$ COD called balanced complex orthogonal design (BCOD) has been proposed by Adams et al., and they constructed BCODs with rate $k/p=1/2$ and decoding delay $p=2^m$ for $n=2m$. Furthermore, they prove that the constructions have optimal decoding delay when $m$ is congruent to $1$, $2$, or $3$ module $4$. They conjecture that for the case $mequiv0pmod4$, $2^m$ is also a lower bound of $p$. In this paper, we prove this conjecture.

Full work available at URL: https://arxiv.org/abs/1312.7650

Mathematics Subject Classification ID

No records found.

This page was built for publication: On the Minimum Decoding Delay of Balanced Complex Orthogonal Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978849)