Lower bounds on the minimal delay of complex orthogonal designs with maximal rates

The maximal rates and the minimal delays are basic problems of space-time block codes from complex orthogonal designs. Liang systematically solved the problem on the maximal rates of complex orthogonal designs, and posed an open problem on the minimal delays. Recently, the authors gave the negative answer for the open problem. In this letter, we give lower bounds on the minimal delays.