Full Rate L2-Orthogonal Space-Time CPM for Three Antennas

To combine the power efficiency of Continuous Phase Modulation (CPM) with enhanced performance in fading environments, some authors have suggested to use CPM in combination with Space-Time Codes (STC). Recently, we have proposed a CPM ST-coding scheme based on L2-orthogonality for two transmitting antennas. In this paper we extend this approach to the three antennas case. We analytically derive a family of coding schemes which we call Parallel Code (PC). This code family has full rate and we prove that the proposed coding scheme achieves full diversity as confirmed by accompanying simulations. We detail an example of the proposed ST codes that can be interpreted as a conventional CPM scheme with different alphabet sets for the different transmit antennas which results in a simplified implementation. Thanks to L2-orthogonality, the decoding complexity, usually exponentially proportional to the number of transmitting antennas, is reduced to linear complexity

L2 Orthogonal Space Time Code for Continuous Phase Modulation

To combine the high power efficiency of Continuous Phase Modulation (CPM) with either high spectral efficiency or enhanced performance in low Signal to Noise conditions, some authors have proposed to introduce CPM in a MIMO frame, by using Space Time Codes (STC). In this paper, we address the code design problem of Space Time Block Codes combined with CPM and introduce a new design criterion based on L2 orthogonality. This L2 orthogonality condition, with the help of simplifying assumption, leads, in the 2x2 case, to a new family of codes. These codes generalize the Wang and Xia code, which was based on pointwise orthogonality. Simulations indicate that the new codes achieve full diversity and a slightly better coding gain. Moreover, one of the codes can be interpreted as two antennas fed by two conventional CPMs using the same data but with different alphabet sets. Inspection of these alphabet sets lead also to a simple explanation of the (small) spectrum broadening of Space Time Coded CPM

Separable Implementation of L2-Orthogonal STC CPM with Fast Decoding

In this paper we present an alternative separable implementation of L2-orthogonal space-time codes (STC) for continuous phase modulation (CPM). In this approach, we split the STC CPM transmitter into a single conventional CPM modulator and a correction filter bank. While the CPM modulator is common to all transmit antennas, the correction filter bank applies different correction units to each antenna. Thereby desirable code properties as orthogonality and full diversity are achievable with just a slightly larger bandwidth demand. This new representation has three main advantages. First, it allows to easily generalize the orthogonality condition to any arbitrary number of transmit antennas. Second, for a quite general set of correction functions that we detail, it can be proved that full diversity is achieved. Third, by separating the modulation and correction steps inside the receiver, a simpler receiver can be designed as a bank of data independent inverse correction filters followed by a single CPM demodulator. Therefore, in this implementation, only one correlation filter bank for the detection of all transmitted signals is necessary. The decoding effort grows only linearly with the number of transmit antennas

L2 OSTC-CPM: Theory and design

The combination of space-time coding (STC) and continuous phase modulation (CPM) is an attractive field of research because both STC and CPM bring many advantages for wireless communications. Zhang and Fitz [1] were the first to apply this idea by constructing a trellis based scheme. But for these codes the decoding effort grows exponentially with the number of transmitting antennas. This was circumvented by orthogonal codes introduced by Wang and Xia [2]. Unfortunately, based on Alamouti code [3], this design is restricted to two antennas. However, by relaxing the orthogonality condition, we prove here that it is possible to design L2-orthogonal space-time codes which achieve full rate and full diversity with low decoding effort. In part one, we generalize the two-antenna code proposed by Wang and Xia [2] from pointwise to L2-orthogonality and in part two we present the first L2-orthogonal code for CPM with three antennas. In this report, we detail these results and focus on the properties of these codes. Of special interest is the optimization of the bit error rate which depends on the initial phase of the system. Our simulation results illustrate the systemic behavior of these conditions

Space time coding in MIMO systems

Multiple-input multiple-output (MIMO) antenna technology is promising for high-speed wireless communications without increasing the transmission band- width. Space time coding (STC) is a scheme that employs multiple antennas to increase transmission rate or to improve transmission quality. STC is used widely in mobile cellular networks, wireless local area networks (WLAN) and wireless metropolitan area networks (WMAN). However, there are still many unsolved or partially solved issues in STC. In this thesis, I propose a new STC design from cyclic design. I then propose a systematic method to design quasi-orthogonal space time block codes (QOSTBC) for an arbitrary number of transmit antennas, and derive the optimal constellation rotation angles to achieve full diversity. I also propose an analytical method to derive the exact error probabilities of orthogonal space time block codes (OSTBC). In order to improve the error performance, I introduce an adaptive power allocation scheme for OSTBC. Combining STC with continuous phase modulation (CPM) is an attractive solution for mobile commu- nications for which power is limited. Thus, I apply OSTBC to binary CPM with modulation index h = 0.5, and develop a simplified receiver for such scheme. Finally, I present a decoding method to reduce the complexity of QOSTBC without degrading its error performance

A low complexity distributed differential scheme based on orthogonal space time block coding for decode-and-forward wireless relay networks

This work proposes a new differential cooperative diversity scheme with high data rate and low decoding complexity using the decode-and-forward protocol. The proposed model does not require either differential encoding or channel state information at the source node, relay nodes, or destination node where the data sequence is directly transmitted and the differential detection method is applied at the relay nodes and the destination node. The proposed technique enjoys a low encoding and decoding complexity at the source node, the relay nodes, and the destination node. Furthermore, the performance of the proposed strategy is analyzed by computer simulations in quasi-static Rayleigh fading channel and using the decode-and-forward protocol. The simulation results show that the proposed differential technique outperforms the corresponding reference strategies

Joint Detection and Decoding of High-Order Modulation Schemes for CDMA and OFDM Wireless Communications

Wireless communications call for high data rate, power and bandwidth efficient transmissions. High-order modulation schemes are suitable candidates for this purpose as the potential to reduce the symbol period is often limited by the multipath-induced intersymbol interference. In order to reduce the power consumption, and at the same time, to estimate time-variant wireless channels, we propose low-complexity, joint detection and decoding schemes for high-order modulation signals in this dissertation. We start with the iterative demodulation and decoding of high-order CPM signals for mobile communications. A low complexity, pilot symbol-assisted coherent modulation scheme is proposed that can significantly improve the bit error rate performance by efficiently exploiting the inherent memory structure of the CPM modulation. A noncoherent scheme based on multiple symbol differential detection is also proposed and the performances of the two schemes are simulated and compared. Second, two iterative demodulation and decoding schemes are proposed for quadrature amplitude modulated signals in flat fading channels. Both of them make use of the iterative channel estimation based on the data signal reconstructed from decoder output. The difference is that one of them has a threshold controller that only allows the data reconstructed with high reliability values to be used for iterative channel estimation, while the other one directly uses all reconstructed data. As the second scheme has much lower complexity with a performance similar to the best of the first one, we further apply it to the space-time coded CDMA Rake receiver in frequency-selective multipath channels. We will compare it to the pilot-aided demodulation scheme that uses a dedicated pilot signal for channel estimation. In the third part of the dissertation, we design anti-jamming multicarrier communication systems. Two types of jamming signals are considered - the partial-band tone jamming and the partial-time pulse jamming. We propose various iterative schemes to detect, estimate, and cancel the jamming signal in both AWGN and fading channels. Simulation results demonstrate that the proposed systems can provide reliable communications over a wide range of jamming-to-signal power ratios. Last, we study the problem of maximizing the throughput of a cellular multicarrier communication network with transmit or receive diversity. The total throughput of the network is maximized subject to power constraints on each mobile. We first extend the distributed water-pouring power control algorithm from single transmit and receive antenna to multiple transmit and receive antennas. Both equal power diversity and selective diversity are considered. We also propose a centralized power control algorithm based on the active set strategy and the gradient projection method. The performances of the two algorithms are assessed with simulation and compared with the equal power allocation algorithm

A Tutorial on Interference Exploitation via Symbol-Level Precoding: Overview, State-of-the-Art and Future Directions

IEEE Interference is traditionally viewed as a performance limiting factor in wireless communication systems, which is to be minimized or mitigated. Nevertheless, a recent line of work has shown that by manipulating the interfering signals such that they add up constructively at the receiver side, known interference can be made beneficial and further improve the system performance in a variety of wireless scenarios, achieved by symbol-level precoding (SLP). This paper aims to provide a tutorial on interference exploitation techniques from the perspective of precoding design in a multi-antenna wireless communication system, by beginning with the classification of constructive interference (CI) and destructive interference (DI). The definition for CI is presented and the corresponding mathematical characterization is formulated for popular modulation types, based on which optimization-based precoding techniques are discussed. In addition, the extension of CI precoding to other application scenarios as well as for hardware efficiency is also described. Proof-of-concept testbeds are demonstrated for the potential practical implementation of CI precoding, and finally a list of open problems and practical challenges are presented to inspire and motivate further research directions in this area

Space-Time Codes Technology

Space-time codes technology is a channel coding for wireless digital communications, where multiple antennas are employed. It improves the capacity of the transmission as well as reducing errors. Also, this technology does not require the expansion of bandwidth or time slots. In order to achieve the highest efficiency, we have to first investigate the maximum efficiency that can be achieved. Then, the code design criteria for obtaining the maximum efficiency have to be derived. Last, the code design approaches have to be proposed. The article discusses those procedures

Interference Exploitation via Symbol-Level Precoding: Overview, State-of-the-Art and Future Directions

Interference is traditionally viewed as a performance limiting factor in wireless communication systems, which is to be minimized or mitigated. Nevertheless, a recent line of work has shown that by manipulating the interfering signals such that they add up constructively at the receiver side, known interference can be made beneficial and further improve the system performance in a variety of wireless scenarios, achieved by symbol-level precoding (SLP). This paper aims to provide a tutorial on interference exploitation techniques from the perspective of precoding design in a multi-antenna wireless communication system, by beginning with the classification of constructive interference (CI) and destructive interference (DI). The definition for CI is presented and the corresponding mathematical characterization is formulated for popular modulation types, based on which optimization-based precoding techniques are discussed. In addition, the extension of CI precoding to other application scenarios as well as for hardware efficiency is also described. Proof-of-concept testbeds are demonstrated for the potential practical implementation of CI precoding, and finally a list of open problems and practical challenges are presented to inspire and motivate further research directions in this area