Author_Institution :
Shanghai Key Lab. of Intell. Inf. Process., Fudan Univ., Shanghai, China
Abstract :
Complex orthogonal designs (CODs) are used to construct space-time block codes. COD Oz with parameter [p, n, k] is a p × n matrix, where nonzero entries are filled ±zi by ±zi*, i = 1,2...,k, or , such that OzHOz = (|z1|2 + |z2|2 + ...+ |zk|2)In×n. Define Oz a first type COD if and only if Oz 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.
Keywords :
decoding; matrix algebra; orthogonal codes; space-time block codes; complex orthogonal designs; decoding delay reduction; explicit-form constructions; forbidden 2×2 submatrices; sacrificing code rate; space-time block codes; Block codes; Delay; Maximum likelihood decoding; Transceivers; Upper bound; Vectors; Complex orthogonal design; delay; rate; space- time block codes (STBC);