This paper introduces a new space-time coding scheme, namely space-time complementary coding (STCC) scheme. With the help of pair-wise complementary codes, an STCC MIMO system can achieve both spatial diversity and multiplex transmission. The scheme requires neither bandwidth expansion nor feedback information from receiver, and it offers a nearly interference-free and multipath-resist performance due to a widely open interference-free window of the pair-wise complementary codes. The analytical results reveals that it provides a uniquely high diversity-multiplex gain product for its applications in flat or frequency-selective fading channel.

This paper introduces a new S-T coding scheme, namely Space-Time Complementary Coding (STCC) scheme. With the help of pair-wise complementary codes, the proposed STCC scheme can achieve transmitter diversity and parallel transmission at the same time. It will be shown that the STCC scheme can easily be generalized to achieve arbitrary combination of diversity gain and parallel transmission order. The new scheme requires neither bandwidth expansion nor feedback information from the receiver, and it offers a nearly interference-free performance. The analytical study will be carried out in this paper to show that it provides a very high diversity-multiplexing product gain for its operation in both flat and frequency-selective fading channels.

This paper introduces an approach to generate generalized pairwise complementary (GPC) codes, which offer a uniform interference free windows (IFWs) across the entire code set. The GPC codes work in pairs and can fit extremely power efficient quadrature carrier modems. The characteristic features of the GPC codes include: the set size is 2K, the processing gain is 4NK, and the IFW's width is 8N identically for all codes in a set, where K is the times to perform Walsh-Hadamard expansions and N is element code length of seed complementary codes. Therefore, by using different N, the IFW width of a GPC code set can be adjusted with its set size unchanged. Each GPC code set consists of two code groups, with each having K codes, and they have sparsely and uniformly distributed autocorrelation side lobes and cross-correlation levels outside the IFWs.

Analytically, we have designed some optimal 2-Space-Time Trellis codes (2-STTCs) by M-psk constellation expansion, and the constellations can be asymmetric to reach their optimal coding gain. The resultant codes are geometrically non-uniform. We show that when the constellation is symmetric and the size equals to the number of states, our design reduces to Tarokh's uniform code. Simulations are done to compare our design to the known codes. It is proved that constellation expansion design outperforms state expansion design in both Frame Error Rate (FER) and decoding complexity. Our 4 states asymmetric 8-PSK 2-STTC can achieve the similar performance of Tarokh's 32 states 4-PSK 2-STTC.

We offer an analytic design of optimal 2-space-time trellis codes. The design uses function range set expansion, which achieves better performance compared to known codes. The function range set is the encoder output value range of this trellis finite state machine. The output then is used to modulate the phase (m-PSK) to transmit. The resultant code is non-uniform and can be viewed as an extension of Tarokh's (see IEEE Transactions on Information Theory, vol.44, p.744-65, March 1998) work. When the range set size equals to the number of states it reduces to Tarokh's uniform code. Simulations also show that function range set expansion design outperforms state space expansion design in both frame error rate (FER) and decoding complexity. Our 4 states16-PSK STTC can achieve the similar performance of Tarokh's 32 states 4-PSK STTC.