For example, the Hamming weight of this basic binary codeword matrix for all is equal to 4. As a consequence, inner FEC codes defined for will not enable to increase the maximum time diversity achieved by the STECC.
In contrast, the maximum diversity gain achieved by Alamouti scheme based cooperative communications is two and with non-cooperative communications in one only.
This is a common phenomenon across all the maximum diversity gain achieving DSTBCs for multi-hop wireless networks that use AF [3, 5, 9].
Previous constructions of maximum diversity gain achieving DSTBCs with low decoding complexity (single symbol decodable) [14 21] are limited to a two-hop network with single antenna nodes.
In prior work, maximum diversity gain achieving DSTBC constructions have been proposed for the two-hop network [2 21], and for the multi-hop network [22 24].
In this article, we design maximum diversity gain achieving DSTBCs with low-decoding complexity for a multi-hop wireless network where the source, the destination, and the relay nodes are equipped with multiple antennas.
Using a similar procedure, it can be seen that when M i = M j ∀ i, j = 0, 1, …, N − 1, i ≠ j we can construct COSTBCs by using particular OSTBC for M0 antennas at the source and each relay stage, e.g., if O is an OSTBC for M0 antennas, then by using S n = O, n = 0, 1, …, N − 1 we obtain a maximum diversity gain achieving COSTBC.
Then, maximum diversity gain is achieved provided that K ≤ M - L + 1.
Maximum diversity gain,, was achieved in [11, 12] via a linear receiver using redundant precoding, or oversampling at the receiver.
For CP systems V= F M GCρ, then, in general, we cannot guarantee that the maximum diversity gain is achieved by the system.
