SPACE-TIME CONTINUOUS PHASE MODULATION by ANNA-MARIE SILVESTER M.Sc., The University of British Columbia, 2004 B.Sc., The University of Victoria, 2000 A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY in THE FACULTY OF GRADUATE STUDIES (Electrical and Computer Engineering) THE UNIVERSITY OF BRITISH COLUMBIA (Vancouver) February 2009 © Anna-Marie Silvester, 2009 Abstract The combination of Space-Time (ST) coding and Continuous-Phase Modulation (CPM) produces a low power, energy efficient communication scheme suitable for wireless transmission. Space-time coding increases the reliability of transmission, and continuous-phase modulation (CPM) has the potential to provide considerable energy savings. CPM is a modulation technique that involves the transmission of a signal with continuous-phase and a constant envelope, where the continuous-phase property produces a very bandwidth efficient signal, and the constant-envelope property enables non linear (and thus energy efficient) signal amplification. The ST-CPM code is of special interest for wireless sensors because in the wireless sensor network environment energy consumption is highly constrained. The combination of ST codes and CPM is non-trivial and thus ST-CPM codes based upon block-based orthogonal and diagonal signal matrices are presented. These codes are forms the basis of a distributed ST-CPM code. The distributed ST codes are designed to operate in wireless networks containing a large set of nodes, of which only a small a priori unknown subset will be active at any time. The devised distributed ST-CPM scheme combines the ST-CPM code with a diagonal signaling matrix, (commonly assigned to all relay nodes) with signature vectors (uniquely assigned to nodes). The energy consumption of the proposed distributed ST-CPM scheme is compared with that of a distributed ST linear modulation (LM) scheme. The distributed ST-CPM scheme is shown to outperform the distributed ST-LM scheme for all but short-range transmission. Finally, a serially concatenated code for ST-CPM is proposed. The concatenated code consists of the diagonal signalling matrix as the inner code, and a class of double parity check (DPC) codes as the outer code. The resulting concatenated codes that are formed from the ST-CPM code and a DPC code are shown to provide performance close to capacity, and to provide performance superior to that provided by the more common combination of CPM, or ST-CPM schemes with convolutional codes. Table of Contents Table of Contents List of Tables vii List of Figures viii List of Abbreviations Notation Acknowledgments 1 Introduction 1 1.1 History and Motivation 3 1.2 CPM Foundation 5 1.2.1 CPM Representations 7 1.2.2 CPM & RF Power Amplifiers 1.3 2 Contributions and Organization 11 17 Space-Time Coding for CPM 20 2.1 Transmission Model 23 2.2 Burst—Based OSTBC for CPM 25 2.2.1 25 Complex Orthogonal Designs (ODs) il I Table of Contents 2.3 2.4 2.2.2 Continuous—Phase Modulation (CPM) Specifics 26 2.2.3 Proposed OSTBC Scheme 27 2.2.4 Maximum Likelihood (ML) Detection 29 2.2.5 Performance Analysis 31 2.2.6 Performance Results 34 Diagonal Block Space-Time (DBST) Coding for CPM 37 2.3.1 Continuous-Phase Modulation (CPM) Specifics 38 2.3.2 Modulation 39 2.3.3 Detection 40 2.3.4 Optimization of DBST-CPM 45 2.3.5 Performance Results 52 Conclusions 62 3 Distributed ST-CPM 68 3.1 Relay Network Setup 3.2 Distributed ST-CPM for Relay Transmission 3.3 3.4 3.2.1 Detection of the Distributed ST-CPM Signals 3.2.2 Optimization of Distributed ST-CPM 3.2.3 Simulation Results 70 Energy Consumption of Distributed ST Coding Methods 3.3.1 Distributed ST Coding Overview 3.3.2 Power Amplifier Modeling 3.3.3 Energy Consumption Analysis 3.3.4 Simulations Conclusions iV Table of Contents 4 Concatenated Coding for Space—Time Coding with Continuous Phase 101 Modulation 4.1 4.2 Concatenated Coded Transmission System 103 4.1.1 Double Parity-Check (DPC) Codes 107 4.1.2 ST—CPM 111 4.1.3 Soft Decoding of ST—CPM 112 Analysis and Design of Concatenated ST—CPM Using EXIT Charts 4.4 4.5 5 . . . 117 4.2.1 Generation of the Mutual Information Transfer Characteristics 118 4.2.2 Generation of the EXIT Chart for the AWGN channel 123 4.2.3 Generation of the EXIT chart for the Quasi-Static Fading Channel (QSFC) 4.3 . 125 Capacity 127 4.3.1 AWGN Channel 127 4.3.2 Quasi-Static Fading Channel 129 Results and Discussion 131 4.4.1 The AWGN Channel 131 4.4.2 Block Fading Channel 138 4.4.3 Comparison with Previous Work 141 Conclusions 147 Conclusions and Future Work 148 5.1 Research Contributions 148 5.2 General Conclusions 151 5.3 Suggestions for Future Work 151 Bibliography 152 V Table of Contents Appendices A Related Publications 159 List of Tables 2.1 Pseudo-code for distance spectrum calculation for DBST-CPM 2.2 Optimized DBST-CPM for NT = 2 and M = 4 Gain with respect to repetition code considering an FER of 10—2 2.3 Optimized DBST-CPM for NT = 65 2 and M = 8 Gain with respect to repetition code considering an FER of 102 2.4 Optimized DBST-CPM for NT = 66 3 and M repetition code considering an FER of 102 64 4 Gain with respect to 67 . 4.1 Symbol labeling for M = 4 111 4.2 Symbol labeling for M = 8 112 4.3 SNR to achieve capacity vs. threshold SNR from EXIT chart analysis for MSK. Note that Q* denotes schemes whose EXIT chart tunnel opens after 133 the ‘threshold’ SNR given in this Table 4.4 SNR to achieve capacity vs. threshold SNR from EXIT chart analysis for binary 1REC with h = 1/3 and h 1/4. Note that Q* denotes schemes whose EXIT chart tunnel opens after the ‘threshold’ SNR given in this Table 134 List of Figures 1.1 Decomposition of CPM into a trellis-encoder and a memoryless modulator 9 using phase-increment mapping 1.2 Decomposition of CPM using phase-state mapping 10 1.3 A general circuit digram of a power amplifier 12 1.4 The transistor current of Class A, Class AB, and Class C power amplifiers 14 1.5 The conduction angle of Class B and Class C amplifiers 15 2.1 Transmitter and receiver model for CPM with burst—based OSTBC 23 2.2 Transmitter and receiver model for CPM with burst—based OSTBC 30 2.3 (Eb/Jfo) of GMSK with phase—state mapping. 10 BER and FER vs. 10log 1), OSTBC (NT Single—antenna transmission (NT ST coding scheme of [1] (NT 2.4 = 2, NT 4), and the = 34 2) are compared (Eb/Jfo) of binary 2REC with phase—state map 10 BER and FER vs. 10 log ping. Single—antenna transmission (NT and the ST coding scheme of [1] (NT 2.5 = = 1), OSTBC (NT = 2, NT = 4), 2) are compared 35 (E/A’j) of 4—ary 1RC with phase-state mapping. 10 BER and FER vs. 10 log Single—antenna transmission (NT ST coding scheme of [1] (NT = = 1), OSTBC (NT 2) are compared = 2, NT = 4), and the 36 vi I List of Figures 2.6 Trellis of DBST-CPM for NT and h = = 2 and CPM with 1REC pulse, M = 4, 1/2. Left: Repetition ST code. Right: Optimal ST code (see 42 Section 2.3.4 for details about ST code optimization) 2.7 FER vs. 101og (Eb/MJ) for 1REC pulse, h 10 CPM (NT = 2 and NT CPM with NT = = 1/2, and M = 4. DBST 3) with repetition code and optimal code and 1. Simulation results and the analytical upper bound are compared for the QSFC 2.8 53 FER vs. 101og ) for 1REC pulse, h 3 (Eb/A/ 10 CPM (NT = = 1/2, and M = 4. DBST 2) with repetition code and optimal code. MLSD and RSSD 55 with CSI for the QSFC 2.9 (E/.MJ) for 1REC impulse, h 10 FER vs. 10log = 1/2, and M = 4. DBST 2) with repetition code and optimal code. Coherent detection CPM (NT with CSI and non-coherent detection without CSI for the QSFC. 2-state trellis for repetition code, 4-state trellis for optimal code 2.10 FER vs. 101og Q(Eb/) for 1REC pulse, h 1 CPM (NT = 1/2, and M 57 = 4. DBST 2) with repetition code and optimal code. Coherent detection with CSI and non-coherent detection without CSI for the QSFC with phase noise with variance u = 0.01. 2-state trellis for repetition code, 4-state trellis for optimal code 58 2.11 FER vs. 1Olog (Eb/) for 1REC pulse, h 10 CPM (NT = = 1/2, and M = 4. DBST 2) with repetition code and optimal code. Coherent detection with CSI and non-coherent detection without CSI for the continuous fading channel with normalized bandwidth BfT code, 4-state trellis for optimal code = 0.03. 2-state trellis for repetition 59 List of Figures 2.12 BER vs. 10log (Eb/JV) for DBST-CPM and the PV scheme [2], both with 10 NT = 2. DBST-CPM: 1REC pulse, h 1REC pulse, h = 1/2, and M = 1/2, and M 4. PV ST-CPM: 4 (“sub-optimal”) and M = 8 (“optimal”). Data rate is 1 bit per symbol duration T in all cases. Non-coherent detection without CSI for the continuous fading channel with normalized bandwidth BfT = 0.001. As reference: DBST-CPM and coherent detection with CSI 60 2.13 BER vs. 10log (Eb/M) for DBST-CPM and the PHK scheme [3], both 10 with NT = 2. DBST-CPM: 1REC pulse, h CPM: 1REC pulse, h = 1/2, and M = = 1/4, and M = 4. PHK ST 2. Data rate is 1 bit per symbol duration T in all cases. Non-coherent detection without CSI for the con tinuous fading channel with normalized bandwidth BfT BfT = fdT = = fdT = 0.01 and 0.03 according to Clarke’s model for DBST-CPM and a third order Butterworth spectrum for PHK scheme. Nd corresponds to N = = 10 for DBST-CPM 5 for the PHK scheme 61 3.1 Two phase transmission in the relay network 71 3.2 Annealing algorithm for signature set generation 79 3.3 Average distribution losses as a function of the total number of nodes N, and the number of active nodes N 8 sets optimized for Na = N = = 2, 3, 5. Deterministic signature vector 2 active nodes and random signature vector sets are considered. ‘CE’ indicates constant envelope sets 80 x List of Figures 3.4 (Eb/.NJ) for a 10 Average BER of a distributed ST-CPM code versus 10 log network with N . 3 30 nodes and different numbers of active nodes N = Deterministic signature vector sets optimized for Na = N = 2 active nodes and random signature vector sets are considered. ‘CE’ indicates constant envelope sets. The ST-CPM code is optimized for N CPM parameters M = 4, h = = d = 2 with the 1/4, and a 1REC phase pulse as given in [4, 81 Table I] 3.5 o(Eb/.No) for a 1 Average BER of a distributed ST-CPM code versus 10 log network with N = 3 depends 30 nodes where the number of active nodes N on the probability p that any given node is listening for the source’s transmis sion. Deterministic signature vector sets optimized for Na = N = 2 active nodes and random signature vector sets are considered. ‘CE’ indicates con stant envelope sets. The ST-CPM code is optimized for N the CPM parameters M = 4, h = = d = 2 with 1/4, and a 1REC phase pulse as given in 83 [4, Table I] 3.6 Drain efficiency, , (%), power added efficiency, PAE, (%), output power, ,,t, (dBm), dc power supplying the power amplifier, Pdc, (dBm), and power 0 P gain - output power minus input power (dB) vs. input power for the Class AB power amplifier designed by Carls et al. [5] 3.7 Drain efficiency, j, (%), power added efficiency, PAE, 89 (%), output power, ,,t, (dBm), dc power supplying the power amplifier, Pdc, (dBm), and power 0 P gain - output power minus input power (dB) vs. input power for the Class C power amplifier designed by Cao et al. [6] 3.8 90 , (dBm) of the distributed ST-LM code 1 BER performance vs. input power P for different values of total loss (NL). Class C amplifier [6] 94 List of Figures 3.9 Total energy (nJ) per active node, per symbol vs. maximum transmission distance (m) to achieve a BER of i.o for a distributed ST-LM scheme (‘UN’) and a distributed ST-CPM scheme (‘CPM’). The number of active nodes includes N 3 = 2, 3, and 5. A Class AB amplifier [5] is employed. . . . 96 3.10 Total energy (nJ) per active node, per symbol vs. maximum transmission distance (m) to achieve a BER of iO for a distributed ST-LM scheme (‘UN’) and a distributed ST-CPM scheme (‘CPM’). The number of active nodes includes N 3 = 2, 3, and 5. A Class C amplifier [6] is employed 97 3.11 Total energy (nJ) per active node, per symbol vs. maximum transmission 3 distance (m) for N 5 active nodes and for a distributed ST-LM scheme (‘UN’) and a distributed ST-CPM scheme (‘CPM’). Results are shown for BERs of 10_2, iO, and i0. A Class C amplifier [6] is employed 98 4.1 Block diagram of a serially concatenated transmission system 104 4.2 Block diagram of a serially concatenated transmission system 105 4.3 The structure of the DPC I rate k/(2k 107 4.4 The structure of the DPC II rate k/(2k + 1) code 4.5 Generation of the forward and backward recursion metrics (f[i} and b[i]) for — 1) code 108 DPC I and DPC II 110 4.6 Plot of the J(u) function 121 4.7 Mutual information transfer chart for the DPC codes 123 4.8 EXIT chart depicting the mutual information transfer for the DPC II rate 10/21 code and for the ST—CPM code employing NT and M = 4, h = = 1 transmit antenna, 1/4, a 1REC pulse with Ungerboeck mapping, and with an (E/JVJ) 10 SNR (AWGN channel) of ranging from 10 log dB in increments of 0.2 dB = +0.2 dB to +5.2 124 xE List of Figures 4.9 Two EXIT charts illustrating the effect of interleaver length on the decoding trajectory. On the left a short interleaver is used, and on the right a long 126 interleaver is used 4.10 Estimated Capacity for M with h = 4 CPM employing a 1REC phase pulse, and = 130 1/4 4.11 The mutual information transfer characteristics of a select group of DPC I and DPC II codes, and MSK (CPM: M = 2, 1REC phase pulse and h = 1/2) 132 with Eb/J\fo in steps of 0.5 dB 4.12 Estimated capacity (bold curves) and simulated BER (non-bold curves) vs. ) for MSK (CPM: M 0 (Eb/.N 10 101og = 2, 1REC phase pulse and h = 1/2) concatenated with DPC I class codes (in the figure to the left) and DPC II 135 class codes (in the figure to the right) 4.13 EXIT chart showing the threshold SNR for three labelings of CPM (M h = = 4, 1/4, a 1REC phase pulse) and the rate 10/21 DPC II code. SNR is 136 Eb/J\fo 4.14 Estimated capacity (bold curve) and simulated BER (non-bold curves) vs. 10 1og (Eb/.MJ) for CPM: M 10 = 4, 1REC phase pulse and h = 1/4) concate nated with the rate 10/21 rate DPC II code 138 4.15 Mutual information transfer chart for the ST—CPM code employing NT transmit antenna, and M (Eb/.N) 10 10log = = 8, h = = 1 1/4, a 2RC pulse, and with a SNR of —2.0 dB and the symbol mappings given in Table 4.2. 139 4.16 Estimated capacity (bold curve) and simulated BER (non-bold curves) vs. (Eb/.MJ) for CPM: M 10 101og = 8, 2RC phase pulse and h nated with the rate 10/2 1 rate DPC II code = 1/4) concate 140 xl List of Figures 4.17 EXIT chart for NT = 2 (M = 4, 1REC, h = 1/4) and the 10/21 rate DPC II 141 code. The UL, GL1 and GL2 are shown at their threshold SNRs 4.18 EXIT chart for NT = 3 (M = 8, 2RC, h = 1/4) and the 10/2 1 rate DPC II code. The UL and SSPL are shown for SNRs of 1.4, 5.0, and 10.0 dB. . . . 142 4.19 Estimated outage probability (bold curve) and simulated FER (non-bold curves) vs. 10 log ) for concatenated ST—CPM. Results for NT 3 (Eb/M 10 (M= 4, 1REC, h= 1/4), and NT = 3 (M = 8, 2RC, h= 1/4) and the 10/21 rate DPC II code. UL, GL1, and GL2 shown for NT and SSPL shown for NT = 2 = = 2, and UL, 143 3 4.20 BER vs. 10 1og (Eo/.Afo) for the concatenated CPM scheme proposed by 10 Moqvist and Aulin in [7], and for the proposed scheme employing MSK concatenated with the rate 10/21 DPC II code over an AWGN channel. . . 144 (Eb/A/) for the concatenated CPM scheme employing a 10 4.21 FER vs. 10 log (7,5) convolutional code as proposed by Zhang and Fitz in [8], [9], and the performance of CPM concatenated with the rate 10/21 DPC II code. The channel is a continuous fading channel with fading bandwidth BfT and NT = is 1RC, h are used 2, NR = = 1/4, M = 0.008, 2 antenna are employed. The underlying CPM scheme = 4. The interleaver length is 256 bits, and 5 iterations 145 xiY List of Figures 4.22 BER vs. (Eb/JV) for the concatenated CPM scheme denoted as 10 10 1og ‘system B’ by Bokomulla and Aulin [9], and the proposed scheme. Both schemes employ NT = 2, NR = 2, and a 600 bit interleaver. ‘System B’: (7,5) convolutional outer code, MSK and a fT = 1/6 normalized carrier offset. ST—CPM and DPC code: rate 10/21 DPC II code, 2RC phase pulse, M = 4, and h = 1/4. The channel is a QSFC constant for symbol intervals. 10 iterations are permitted f = 1, 10, 30 146 List of Abbreviations APP A Posteriori Probability AWGN Additive White Gaussian Noise BER Bit Error Rate BCJR Bahi, Cocke, Jelinek and Raviv BICM Bit—Interleaved Coded Modulation BPSK Binary Phase Shift Keying CC Convolutional Code cdf Cumulative Density Function CPM Continuous-Phase Modulation CRC Cyclic Redundancy Check DF Decode and Forward DFDD Decision Feedback Differential Detection DPC Double Parity Check DPSK Differential Phase Shift Keying DSTM Differential Space—Time Modulation CSI Channel State Information EXIT EXtrinsic Information Transfer FB Forward—Backward FEC Forward Error Correction GMSK Gaussian Minimum Shift Keying List of Abbreviations GSM Global System for Mobile Communication IEEE Institute of Electrical and Electronic Engineers ii.d. Independent, Identically Distributed LLR Log—Likelihood Ratio M—FSK M—ary Frequency Shift Keying ML Maximum—Likelihood M—PAM M—ary Pulse Amplitude Modulation M—PSK M—ary Phase Shift Keying M—QAM M—ary Quadrature Amplitude Modulation MIMO Multiple-Input Multiple-Output MMSE Minimum Mean Square Error MRC Maximum-Ratio Combining NB Narrowband OD Orthogonal Design PAM Pulse Amplitude Modulation PAPR Peak to Average Power Ratio pdf Probability Density Function PEP Pair-wise Error Probability QAM Quadrature Amplitude Modulation QPSK Quaternary Phase Shift Keying QSFC Quasi—Static Fading Channel REC Rectangular RC Raised—Cosine SISO Single—Input Single—Output SNR Signal—to—Noise Ratio List of Abbreviations SRN Square—Root Nyquist ST Space—Time STBC Space—Time Block Code STTC Space—Time Trellis Code WLAN Wireless Local Area Network WSN Wireless Sensor Network WPAN Wireless Personal Area Network xvii Notation Throughout this thesis, bold upper case and lower case letters denote matrices and vectors, respectively. The remaining notation and operators used in this thesis are listed as follows: (.)* Complex conjugation Transposition [.]H Hermitian transposition det(.) Matrix determinant HI I Absolute value of a complex number 112 Re{.} Im{ } —norm of a vector 2 L Real part of a complex number Imaginary part of a complex number Statistical expectation with respect to x Pr{.} Probability of an event Jo (•) Zeroth order modified Bessel function of the first kind diag(x) A matrix with the elements of vector x on the main diagonal 0 Convolution operator X x X identity matrix ox All—zero column vector of length X j’I( 2 ) Gaussian RV with mean p and variance a 2 j /Ei card{.} Imaginary unit Cardinality of a set Notation vec{.} Vectorization of a matrix r(.) Rank of a matrix Modulo-2 addition Acknowledgments First and foremost, I would like to thank Professor Lutz Lampe for the advice, technical insight, and encouragement he provided throughout my work on this thesis. Professor Lampe willingly gave his of time and energies to assist me in my work, and for this I will always be very grateful. I would also like to thank Professor Robert Schober for many stimulating and helpful discussions. I would also like to thank my friends and colleagues at the Department of Electrical and Computer Engineering at the University of British Colombia for many lively, educational, and entertaining discussions. This work was supported by the Natural Sciences and Engineering Research Council (NSERC) of Canada, Bell Canada, and the University of British Columbia Graduate Fel lowship. 1 xc Chapter 1 Introduction Wireless technologies have become a permanent fixture in many aspects of our day-to-day lives. We use cell phones, personal digital assistants, wireless networks (for example wireless local area networks (WLANs)), wireless cable replacement (for example wireless personal area networks (WPANs)), and wireless sensors on a daily basis. This proliferation of wireless devices, accompanied by a desire to transmit increasing large amounts of data, has placed an intense pressure on a limited frequency spectrum. Compounding the problem, the wireless channel itself presents a considerable obstacle to communication. Attenuation due to the destructive addition of multipaths can cause deep fades, occasionally making detection of transmitted signals impossible. One of the techniques with great potential to combat fading and/or to increase the data rate of the wireless system is space-time (ST) coding, pioneered by Tarokh et al. [10], Alamouti [11], Foschini and Gans [12], Teletar [13], and Wittneben [14] amongst others. The ST code delivers duplicate copies of the transmitted signal to the receiver using multiple antennas at the transmitter and possibly also at the receiver, and transmitting over multiple time intervals. This diversity in space provides a form of protection for the signal against a fade occurring on the channel between one transmit/receive antenna pair in any given time interval. The ST code can be used either to increase the quantity of information transmitted without increasing system bandwidth, or to improve the reliability of the transmitted information, or to provide some combination of increased data rate and increased reliability. If increased data rate is the goal, then it has been shown that when 1 Chapter 1. Introduction the ST code is properly constructed capacity grows linearly with every transmit and receive antenna pair added to the multiple antenna system. If increased reliability is the goal, then it has been shown that when the error rate of the multiple antenna system is plotted versus signal-to-noise ratio (SNR) on a log-log scale the slope of the curve is determined by the product of the number of transmit and receive antennas. Note that both cases require that the channel provides spatial selectivity. Another concern for wireless communication is that as the number of wireless devices in daily use grows the wireless device itself is shrinking. Reduced device size often comes at the cost of reduced battery capacity. For a cell phone reduced battery capacity means that the user must charge his or her phone more often, however for a remote wireless sensor reduced battery capacity means reduced lifetime. Thus, the ever decreasing size of the wireless device is imposing an ever increasing need for energy efficiency on the underlying communication scheme. In this area, continuous-phase modulation (CPM) has the potential to provide consid erable energy savings. CPM is a modulation technique that involves the transmission of a signal with continuous-phase and a constant envelope. The continuous-phase property produces a very bandwidth efficient signal, and the constant-envelope property enables non-linear (and thus energy efficient) signal amplification. In fact, CPM has been adopted for use with Bluetooth and the Global System for Mobile Communication (GSM) because of these very properties. This thesis will focus on the combination of ST coding and CPM with application to all wireless networks, but with a specific focus on wireless sensor networks. The ST-CPM code is of special interest in this environment because in this environment energy consumption is highly constrained. The remainder of this chapter will provide a background for the introduction of the proposed ST-CPM codes and coding schemes. In Section 1.1, we 2 Chapter 1. Introduction review previously proposed ST-CPM schemes and motivate the need for further study in this area. Section 1.2, provides a background on CPM and introduces the representation of CPM used in this thesis. Further, this section overviews the power amplifier, and explains why CPM is more energy efficient than linear modulations. Finally, Section 1.3 concludes this chapter with a summary of the contributions made by this thesis. 1.1 History and Motivation Space-time (ST) coding schemes that employ linear and thus, in general, non-constant envelope modulation formats have been widely studied. Although these schemes are highly effective at alleviating the effects of multipath fading over the wireless channel, a ST-CPM scheme has the potential to offer performance gains in the fading channel and increased bandwidth and energy efficiency. Increased bandwidth efficiency is due to the continuousphase property of CPM, which reduces the spectral side lobes of this scheme with respect to linear modulation schemes. Increased energy efficiency is result of both the ST component and the CPM component. Space-time coding improves the system error rate in direct relation to the number of transmit and receive antennas employed. Thus, increasing the number of antennas in the system allows the signal to be transmitted with less energy while still maintaining a target BER. CPM contributes to a reduction in the amount of energy expended by the hardware of the wireless device. The constant envelope property of CPM means that lower power, more energy efficient power amplifiers can be used than are used for linear modulations. Although the combination of ST coding and CPM has a great deal of promise, the design of a ST-CPM coding scheme is not straightforward due to the memory inherent to CPM. Previous efforts to extend the concept of ST coding to CPM have yielded high decoding complexity [1], or reduced error-rate performance [15]. Both of these schemes 3 Chapter 1. Introduction require modified CPM receivers. Other efforts have produced ST codes that are designed for specific CPM formats, e.g. [16], [17], [18], [19], and [20]. Non-coherent detection of ST-CPM codes, which removes the assumption of perfect channel state information at the receiver, has been the subject of very little investigation. In practical systems, perfect channel state information as assumed by coherent detection schemes is not available at the receiver, and estimates of the channel state are obtained using methods that substantially increase the overhead of the transmission scheme. The previous work on non-coherent detection of ST-CPM that has been conducted was performed by [2] and [3], and in both cases it was limited to specific CPM formats. Thus, in Chapter 2 we propose two ST CPM coding schemes that can use any CPM format, any number of transmit and receive antennas, and existing CPM receivers. The second scheme is a general design method suited for non-coherent detection. As mentioned earlier, the device with perhaps the most stringent constraints on energy consumption is the remote wireless sensor. Networks of these wireless sensors have the potential to take the place of wired sensor networks. In addition, many new applications are evolving in which only wireless sensors are appropriate, for example object tracking and battlefield surveillance. One of the technologies that may enable the widespread use of wireless sensors is distributed ST coding, a scheme in which spatially separated cooperating devices can produce a diversity gain in a fading channel. Again, distributed ST coding schemes employing linear modulation have been the subject of much investigation, e.g. [21], and [22]. The design of the majority of these distributed ST codes calls for the multiplexing of two or more data streams, which has the potential to greatly increase the peak-to-average power ratio (PAPR) of the resulting signal and thereby increase the energy consumed in the device hardware. In general, minimizing the energy consumption of a wireless device is important, however, minimizing the energy consumption of a device employing distributed 4 Chapter 1. Introduction ST coding will be even more important. Employing relaying implies that several devices are involved in the transmission of most messages meaning that each wireless device will be active more often. Also, the performance of distributed ST schemes is often dependent upon the number of available relays, therefore, minimizing energy consumption will maintain the connectivity of the network over a longer period of time thereby extending the length of time that cooperative diversity gains are available. Thus, in Chapter 3, we propose a distributed ST-CPM code. Improved error-rates can be obtained by employing a ST-CPM code as the inner code in a serially concatenated code. The resulting code can have both the capacity approaching performance and the energy efficiency offered by ST-CPM. CPM is an excellent candidate for the inner code in the concatenated system as it is recursive in nature. To date, serially concatenated codes designed for CPM, and ST-CPM have primarily employed convolu tional codes [8], [9], and [23]. Recently a class of codes called double parity check (DPC) codes were introduced for use with differential phase shift keying (DPSK) [24]. These codes yielded capacity approaching performance with very low complexity. In Chapter 4, we in vestigate the performance of a serially concatenated system employing the low complexity DPC codes as an outer code, and ST-CPM as the inner code. 1.2 CPM Foundation Before launching into a discussion of CPM in the context of ST coding, we begin with a brief description of the properties of CPM. The passband CPM signal is given by XpB(t) = cos((t, a)) = cos(2ft + (t, a) + o) (1.1) 5 Chapter 1. Introduction where E 3 is the energy per symbol (transmitted in the interval T), quency, and a is the sequence of M-ary input data symbols a[i], a[i] f is the carrier fre e ±1, +3,•• , ±(M — 1). qo is a constant that denotes the initial phase of the CPM signal, which we set to zero without loss of generality. The equivalent baseband signal, which we employ in this work, is given by x(t) = (1.2) The information carrying phase in (1.1) and (1.2) is given by (t,a) = 21rha[i]f g(r — iT)dr where h denotes the modulation index, and h = = 2ha[i]q(t — iT), (1.3) k/p is assumed to be rational and irre ducible. The frequency pulse g(t) is any function that is positively defined over the interval o t < LT, and that is normalized such that f°° g(t)dt = 1/2. The corresponding phase pulse q(t) is given by o q(t)= fg(r)dr Ot<LT 1/2 If L = t<o tLT 1, then the CPM scheme is called full response, and if L > 1 the CPM scheme is called partial response. In this thesis, we consider both full and partial response CPM. Also, we consider three popular pulse shapes, i.e. rectangular, (REC), raised cosine (RC), 6 Chapter 1. Introduction and Gaussian minimum shift keying (GMSK) given below LREC: g(t) g(t) LRC: 2LT 1.2.1 g(t) (1.4) otherwise, (1-cos(2irt)/LT) 2LT o <t < LT 0, otherwise, (1.5) = 1 GMSK: 1, 1o = {Q — Q [2irB(t±)] }, Q(t) = /2dt. 2 fe_x (1.6) CPM Representations The phase transitions of CPM can be represented by a trellis structure. However, the 1 construction of CPM outlined to this point has a time-variant trellis with 2pM’ of which only half are occupied at any given time. states, In this thesis, we will adopt the representation of CPM developed independently by Rimoldi in [25] and Huber and Liu in [26] that has a time-invariant trellis. To achieve the time invariant trellis a slope function c(t) is introduced [26] t<0 0, c(t) 0 t < (1.7) LT tLT and a zero term is added to the phase term 1 (t, a) given in Eq. (1.1) resulting in the following expression of the phase function (t, a) = 2ft — 2hc(t — iT) + (t, a) + 2hc(t — iT). (1.8) 7 Chapter 1. Introduction The first two terms in Eq. (1.8) can be combined by defining a new reference frequency fr, given by rc 2T and the third and fourth terms can be re-expressed using a unipolar information symbol b[il, given by = b[i] a[i] +M — 1 e {0, 1,. M — 1}. (1.10) Using Eqs. (1.9) and (1.10), the phase term given in Eq. (1.8), within the interval nT t < (n + 1)T, becomes (t, b) = 2frt + r + — L] + 2Kh p(t — iT, b[ij) (1.11) i=n—L+1 where q is the modified initial phase, ‘I [n — L] is the modified normalized phase state given by [n—L] and p(t — = [kb[i1] e 0,1, mod (p) ,p 1 (1.12) iT, b[i]) is the phase state transition function given by p(t — iT, b[i]) = (2b[i] — (lvi — 1))q(t) + c(t). (1.13) The modified information carrying phase, which can be substituted into (1.1) and (1.2) in place of (t, a) is given by (t, b) = — p L] + 2ith p(t — iT, b[i]). (1.14) i=n—L+1 Finally, using this representation the resulting CPM modulator can be split into two com ponents: a trellis encoder with pML_l states, and a signal mapper containing pML possible 8 Chapter 1. Introduction Figure 1.1: Decomposition of CPM into a trellis-encoder and a memoryless modulator using phase-increment mapping. signals. These signals can be uniquely referenced by an address vector d[nj, given by d[rij=[’I’[n—L),b[n-—L+l],... ,b[n—1j,b{n]]. (1.15) The construction of the CPM signal as it is outlined above has been called phaseincrement mapping by [27). A block diagram of the phase-increment CPM modulator is shown in Figure 1.1. This name has been applied because input data is mapped to a phase change, and the resulting signal is rotationally phase invariant. However, due to the recursive structure of the phase-increment mapper, one error event will affect at least two symbols. An alternative structure for the CPM modulator was suggested in [27] and employs phase-state mapping, which alleviates the double error problem, but results in a rotationally phase variant signal. A block diagram of the phase-state CPM modulator is shown in Figure 1.2. The symbols b are generated using (kb[nj)mod(p) = (W[nj — W[n — 1])mod(p) (1.16) The representation of CPM discussed above showed that CPM can be split into a trellis encoder and a signal mapper that transmits one of pM’-’ possible signals. Further, there 9 Chapter 1. Introduction b[n] I W [n] T I’ [n — T 1] b[n ‘I’ [n —2] I’ [n — L + 1] L + 1] —i 1’ [n x(t) signal elements rii — Table with — L] Figure 1.2: Decomposition of CPM using phase-state mapping. are M’- transmitted signals differentiated by only by the initial phase state ‘I’ [n — L]. Thus, optimally the CPM receiver requires a bank of ML baseband matched filters [26]. In the wireless sensing applications that we consider device complexity is always a concern. Therefore, we adopt the reduced matched filter set described in [26]. In [26], it was shown that the number of filters required to provide a sufficient statistic can be upper bounded by Dmax, which is given by Dm,jc F1.llh(M1)+2.221. (1.17) For most practical combinations of modulation index, h, and modulation order, M, D = 2, or 3 matched filters are sufficient. The corresponding baseband receiver filters proposed by [26] are given by h(t) = 2fdt 0 t <T, d e {1, 2,... , D}, (1.18) where fd=(2d—1—D), de{1,2,...,D}. (1.19) In these equations that specify the basis functions for the receiver filters only one pa 10 Chapter 1. Introduction rameter, the frequency spacing parameter f, needs to be optimized with respect to the transmitted CPM scheme. The optimal value of /f can be found by maximizing the min imum Euclidean distance for the CPM scheme. In [26] and [27], it is shown that minimal losses are incurred for 0.25 < fore, rather than optimize /.f /f < 0.75 when D = 2, or 3 received filters are used. There for each CPM scheme that we study, we will set /f 0.5 for all schemes. The matched filter bank required for demodulation can be denoted by the matrix hD(t) = [hb(t),h(t),•.• ,h(t)]. (1.20) The basis functions of the reduced matched filter bank, h (t), are not orthogonal. There fore, a matrix C is introduced to account for the cross-correlations of the basis functions. This matrix is given by C 1 J 0 T — 1.2.2 ,T h(t)h(t)dt, (1.21) CPM & RF Power Amplifiers The use or study of CPM is often justified by the energy efficiency of this modulation technique. The energy savings made possible by CPM are due to its constant envelope property that enables the use of non-linear power amplifiers. Here, we briefly overview the properties of the RF power amplifier and explain how CPM and the Class C power amplifier save energy. In Chapter 3, we will analyze in more detail the energy savings resulting from the use of CPM in a distributed network. Note that in this section an uppercase symbol denotes a direct current (dc) value, and a lowercase value denotes an alternating current (ac) value. A generalized RF power amplifier is shown in Fig 1.3. The energy consumption and linearity of the power amplifier are determined by the quantity of time that the transistor 11 Chapter 1. Introduction VDD yin Vb Figure 1.3: A general circuit digram of a power amplifier. conducts the current D, and the magnitude of the bias voltage and secondly upon the voltage input to the power amplifier v . The 1 D• This in turn is first dependent upon value of capacitor C 1 is set to be very large to ensure that there is no dc component seen at the output of the device, and the elements L 2 and C 2 form a tank circuit that determines the frequency (‘irf ‘rf sin w t, w 0 0 = 1//Y) of the output signal. The transistor operates in one of three possible states depending upon the bias voltage, and the power amplifier input signal, yin. When the sum of the bias and input voltages is less than the threshold voltage of the transistor, no current flows through the transistor (iD = 0) and the transistor is in its ‘cut-off’ state. When the sum of the bias and input voltages is greater than the threshold voltage, the transistor is said to become ‘active’ and current flows through the transistor (iD > 0). In the ‘active’ state, the current D is linearly dependent upon the voltage v. Finally, in the ‘saturation’ state, the transistor conducts current but does not match a linear increase in input voltage, vi,-,, with a linear increase in current D• In summary these states are: 12 Chapter 1. Introduction cut-off Vbias+Vin <VT active Vb + Vin VT = gm(Vbias + Vin saturation Vbjas + VT = VDD/RL Vjn D =0 — VT) The output of the power amplifier is determined by the magnitude and portion of time that the transistor conducts the current The tank circuit shown in Figure 1.3 (elements 2 and C L ) filters any harmonics generated when current 2 D flows and ceases to flow so that the output power amplifier voltage is given by 0 V where ‘fund = IfundRLSifl(Wot), (1.22) fiDsin(wot)dt (1.23) is given by ‘fund = Amplifier Classes The class to which the power amplifier belongs is dependent upon the value of the voltage A Class A amplifier is characterized by Vbjas VT + IvI, (i.e. transistor is always conducting). A Class AB amplifier is produced when Vb > VT, (i.e. the transistor conducts more than half of every period). A Class B amplifier is produced when Vb = VT. In this case the input signal voltage must be greater than zero (v > 0) for the transistor to conduct, (i.e. the transistor conducts current for half of every period). A Class C amplifier is characterized by Vbjas < VT. In this case the transistor conducts current when Vjn > VT — Vb (i.e. the transistor conducts less than half of every period). Figure 1.4 shows the current through the transistor for Class A, AB, and C power amplifiers. The portion of the period for which the transistor conducts can also be used to characterize a power amplifier, and is denoted as the conduction angle, 2. The conduction 13 Chapter 1. Introduction Class A C ir 2ir 3ir wt ir 2ir 3Tr wt 2ir 3ir wt Class AB Class C Figure 1.4: The transistor current of Class A, Class AB, and Class C power amplifiers. angles for Class A, and B power amplifiers are q ii-, and qS ir/2, respectively. The conduction angles for Class AB and C power amplifier are dependent upon the input voltage vh , and 1 D and vary in the ranges r > q> ir/2, and 4 <ir/2, respectively. Amplifier Linearity The conduction angle can be used to re-express the current at the output of the power amplifier, ‘fund, as 2 ‘fund = = pT J D sin(wot)dt [2-sin2] (1.24) Thus, when operating as a Class A ( current is linearly dependent upon in the ‘active’ range of the transistor. However, when operating as a Class AB ( > ‘rf = ir/2) or C ir) or Class B ( < ( = r/2) amplifier, the output ir/2) amplifier, the output is no longer a linear function of the input, v, because the conduction angle changes with the amplitude 14 Chapter 1. Introduction Class B it 2ir 3ir wt it 2ir 3ir wt Class C Figure 1.5: The conduction angle of Class B and Class C amplifiers. of ‘rf, see Figure 1.5. In fact, a true Class B power amplifier is also not realizable because the abrupt on/off characteristic is not possible with a practical transistor. Therefore the conduction angle of a practical Class B power amplifier is not exactly q = ir/2 and a practical Class B amplifier is not truly linear. Additionally, all classes of power amplifier are non-linear when the input voltage is large and the transistor operates near or at saturation. In fact, operation in this region causes significant distortion, and performance degradation for non-constant envelope modulations. For this reason, non-constant envelope modulation schemes often employ a ‘back-off’ region, i.e. these schemes never transmit at the maximum output power of the power amplifier. Amplifier Efficiency Often power amplifiers are characterized in the literature by a performance criterion called drain efficiency. Drain efficiency is the ratio of transmitted power to dc input power, where transmitted power is given by P , 0 IfUfldRL/2, and dc input power is given by 15 Chapter 1. Introduction Pdc = VDDD. The dc component of is D 1 4 f I (IDC+IrfC0SO)dO 2ir j — (sin-cos). (1.25) Thus the drain efficiency can be written as [28, Chap 15.] Pout — — 2] 8VDD(sin—cos IrfRL[2 — Sfl The drain efficiency of an amplifier is a function of input voltage yin. ‘rf, (1 26) which is dependent upon the Therefore, it is common to characterize and compare different classes of amplifiers by their peak drain efficiency (i.e. when the maximum amount of power is being transmitted). In this case ‘fund = VDD/RL determines that I,. = 5 2IrVDD/(RL[2q — sin 2]), which yields — [2—sin2] 4(sin cos) 1.27 — Using the above expression, the values for peak drain efficiency that are usually quoted in the literature are 1/2, ir/4, and a function of for Class A, B, and C amplifiers, respec tively. Theoretically the maximum drain efficiency of a Class C amplifier can approach one (7)max — 1), however for this to happen the peak value of the transistor current must approach infinity (IDIm — oc). Although, these values are often used in the literature they do not give a full picture of the performance of an amplifier. Average drain efficiency values are often very different from the maximum efficiency values, which assume opera tion in the ‘saturation’ region of the power amplifier. For example [29] finds the average drain efficiency for multi-carrier signals with a 10 dB peak-to-average power ratio to be 16 Chapter 1. Introduction 5 and 28 percent for ideal Class A and Class B power amplifiers. In addition, the drain efficiency metric does not account for the input signal power (at the v source). Several other efficiency measures have been proposed. Here, we will list two of the alternatives to drain efficiency. The first is power added efficiency, which is given by PAE= POUt 10 P (1.28) Pdc where P 1 is the signal power supplied to the power amplifier (i.e at v ). The second 1 efficiency measure is total efficiency, which is given by 7T 7 1.3 Pout Pdc+Pn (1.29) Contributions and Organization The main goal of this thesis is to combine ST coding with CPM to produce a flexible, low complexity, energy efficient transmission format. This thesis proposes: • A block—based orthogonal ST code for CPM (Chapter 2). • A block—based diagonal ST code for CPM with a low-complexity non-coherent re ceiver (Chapter 2). • A distributed ST code for CPM for use in uncoordinated cooperative networks (Chap ter 3). • A serially concatenated ST-CPM code (Chapter 4). More specifically, in Chapter 2, we present two ST-CPM coding schemes. The first ST-CPM code employs a simple burst—based approach that allows for the straightforward 17 Chapter 1. Introduction combination of any CPM format with orthogonal designs (ODs) [11], [30]. The resulting orthogonal ST block code (OSTBC) can use the same detection techniques at the receiver as are used for single—antenna transmission after an appropriate combining at the receiver. The proposed OSTBC scheme entails a lower complexity than all previously proposed ST coding schemes for CPM and yields a better performance for the important case of NT = 2 transmit antennas. The second ST-CPM code is inspired by differential space-time mod ulation (DSTM) using diagonal signal matrices, which was devised for linear modulations by Hughes in [31] and by Hochwald and Sweldens in [32]. The resulting diagonal block ST-CPM (DBST-CPM) code enables non-coherent detection without channel state infor mation (CSI). Further, a low-complexity receiver design is proposed that includes branch metrics for reduced-state non-coherent sequence detection and for different fading channels. We derive an upper bound for the frame error rate (FER) of DBST-CPM, and employ the bound in an efficient algorithm to find optimal DBST-CPM codes. The proposed DBST-CPM code is employed in both Chapter 3 and Chapter 4. In Chapter 3 the DBST-CPM forms the basis of a distributed ST-CPM code. The distributed ST codes are designed to operate in wireless networks containing a large set of nodes, of which only a small a priori unknown subset will be active at any time. The devised distributed ST-CPM scheme combines the DBST-CPM code, (commonly assigned to all relay nodes) with signature vectors (uniquely assigned to nodes). We propose a numerical method for the optimization of signature vectors sets and show that the performance of the proposed distributed ST-CPM scheme is close to that achievable with co-located antennas. The decoding complexity of the proposed scheme is shown to be independent of the number of active relay nodes, and non-coherent receiver implementations, which do not require channel estimation, are applicable. In the second portion of this chapter, the energy consumption of the proposed distributed ST-CPM scheme is compared with 18 Chapter 1. Introduction that of a distributed ST linear modulation (LM) scheme. The distributed ST schemes are compared using the total energy (radiated and used in hardware) required to supply a target bit error rate (BER) at a maximum transmission distance. The distributed ST CPM scheme is shown to outperform the distributed ST-LM scheme for all but short-range transmission and performance gains are shown to increase with the number of active relay nodes. Finally, in Chapter 4, a serially concatenated code for ST-CPM is proposed. The concatenated code consists of the diagonal signalling matrix from Chapter 2 as the inner code, and a class of double parity check (DPC) codes as the outer code. We employ extrinsic information transfer (EXIT) charts to select the best CPM symbol labelings for the diagonally-structured ST-CPM code. We outline a method for estimating the capacity of the underlying ST-CPM scheme in additive white Gaussian noise (AWGN) and derive an expression for the outage probability over a quasi-static fading channel (QSFC) in order to evaluate the merit of the proposed code. The resulting concatenated codes that are formed from the ST-CPM code and a DPC code are shown to provide performance close to capacity, and to provide performance superior to that provided by the more common combination of CPM, or ST-CPM schemes with convolutional codes. 19 Chapter 2 Space-Time Coding for CPM Space-time coding is widely recognized as an effective means to combat the effects of multipath fading in wireless communications. Numerous space-time codes (STCs), which can broadly be classified into space-time block codes (STBCs) and space-time trellis codes (STTCs), have been proposed in the literature, cf. e.g. [33]. Almost all existing STC designs consider linear and thus, in general, non-constant envelope modulation formats. However, as previously discussed, constant envelope modulation formats such as continuous-phase modulation (CPM) are particularly appealing for implementation in wireless devices due to their high power and bandwidth efficiency. In fact, CPM is used in many wireless com munication systems such as Bluetooth and the Global System for Mobile Communication (GSM) because of these very properties. In the past few years there has been an effort to extend the concept of space—time (ST) coding originally developed for linear modulations to CPM. Fairly general ST code design rules for CPM have been given by Zhang and Fitz [1]. However, the decoding complexity of the resulting ST—CPM scheme is exponential in the number of transmit antennas. Orthogonal ST coded CPM schemes with reduced decoding complexity have been proposed by Wang and Xia [15]. In this case, orthogonality is achieved by requiring that the CPM waveforms transmitted over different antennas fulfill certain constraints in neighboring symbol intervals. However, due to the inherent memory of CPM, the design of the orthogonal schemes in [15] is quite involved and, in general, their error performance is not as good as that of the schemes in [1]. 20 Chapter 2. Space-Time Coding for CPM The ST coding schemes in [1, 15] have the disadvantage that the phase trellis inherent to CPM has to be modified. Therefore, existing CPM receivers cannot directly be applied and new receivers specifically tailored for the adopted ST coding scheme have to be developed. Both [1] and [15] emphasize that, because of the phase continuity and the associated inherent memory of CPM signals, a straightforward combination of CPM and orthogonal designs (ODs) [11, 30] is not possible. More recently, ST codes for simple CPM schemes have been proposed. Cavers [16] and Xian et al. [17] have introduced ST codes for minimum—shift keying (MSK). ST codes for the special cases of binary CPM were proposed by Ahmadi and Rao [18] and Zhao and Giannakis [19j, and for CPFSK by Maw and Taylor [20]. It is worth pointing out that all previously proposed ST coding schemes for CPM can be classified as ST trellis codes. The ST-CPM schemes listed above have been designed for quasi-static fading channels (QSFCs) with coherent detection assuming perfect channel state information (CSI) at the receiver. More recently, Pande et al. [3] proposed a non-coherent’ receiver for the orthogonal STTC design with full response CPM in [15, 34], and Pancaldi and Vitetta [2] considered ST CPFSK and non-coherent detection. In this chapter, we propose two ST coding schemes for CPM. The first scheme shows that CPM can be easily combined with ODs by using a burst—based approach. This is similar in spirit to time—reversal ST block coding [35] proposed for inter-symbol interference channels. However, in the considered case the time—reversal is not necessary since the memory is introduced by the modulation itself and not by the channel. The proposed burst— based orthogonal space—time block coding (OSTBC) scheme has the same advantages as symbol—by—symbol OSTBC for linear modulations. In particular, the proposed scheme can be applied to any existing CPM format and, after an appropriate ST combining at ‘For the sake of brevity, we will often omit the terms ‘with CSI’ and ‘without CSI’ and refer to respective receivers as ‘coherent’ and ‘non-coherent’ receivers, respectively. 21 Chapter 2. Space-Time Coding for CPM the receiver, the same detection techniques as in case of single—antenna transmission can be used. The second scheme is a general design method suited for non-coherent detection. The scheme is inspired by differential space-time modulation (DSTM) using diagonal signal matrices, which was devised for linear modulations by Hughes in [31] and by Hochwald and Sweldens in [32]. The diagonal structure of the signal matrices (only one antenna transmits at any given time) results in relatively simple decision rules that provide high performance at low complexity for non-coherent transmission [31, 32]. In addition, the diagonal structure of the signal matrices results in a highly versatile ST scheme that can support any number of transmit and receive antennas, and any data rate. This flexibility and the efficient receiver implementations possible for DSTM have made this DSTM scheme successful despite the rate loss implicit in the diagonal structure. ST schemes employing diagonally structured signalling matrices are especially attractive for transmission of low data rates in non-coherent environments. This chapter is organized as follows. In Section 2.1, the transmission model employed for both of the proposed ST-CPM schemes is introduced. In Section 2.2, the OSTBC for CPM based upon burst-based transmission is introduced. The section begins with an overview of ODs and the specifics of CPM for the OSTBC scheme. Then, the burst— based OSTBC for CPM is introduced. Its performance is analyzed in Section 2.2.5 and simulation results for the scheme are presented in Section 2.2.6. In Section 2.3 the ST CPM scheme employing diagonal signal matrices is introduced. First, the specifics of CPM for this scheme are overviewed, and then the new DBST-CPM scheme and corresponding non-coherent receiver designs are presented. The performance bound and an optimization algorithm are given in Section 2.3.4. Numerical and simulation results are shown and discussed in Section 2.3.5. Finally, Section 2.4 concludes the chapter. 22 Chapter 2. Space-Time Coding for CPM -<Si (t) ri(t) ST-CPM >— Tj ST-CPM Rx —<SNT (t) rNR (t) >— Figure 2.1: Transmitter and receiver model for CPM with burst—based OSTBC. 2.1 Transmission Model The general ST-CPM system considered is assumed to be a multiple—input multiple—output (MIMO) transmission system with NT transmit and NR receive antennas as shown in Figure 2.1. All signals are represented by their complex baseband equivalents. Let s, (t) denote the signal consisting of Nf symbols that is transmitted over antenna t, 1 NT, during the time interval 0 details on the structure of t < NTNfT (see Section 2.2.3 for further (t) and its relation to x, (t) for the proposed OSTBC scheme, and Section and 2.3.2 for the DBST-CPM scheme). The transmitted ST-CPM signal can be written as S(t, a) The received signal, r(t) r(t) where n(t) [ni(t) n (t) 2 = . . = [si(t) s (t) 2 [ri(t) r (t) 2 .. . . T nNR(t)] SNT(t)]T. (2.1) r(t)] for NR receive antennas, is given by G(t) S(t, a) + m(t) . ... , 0 t < NTNfT, is the noise vector whose elements, njt), 1 (2.2) T NR, denote independent additive white Gaussian noise (AWGN) processes with power spectral density 1V , and where G(t) is an NR x NT matrix that contains the elements 0 gnrnt (t), 1 antennas t nt NT, 1 r and receive antennas NR, which denote the channel gains between transmit r at time t. We will assume that the channel is constant 23 Chapter 2. Space-Time Coding for CPM for at least one symbol period T, thus G(t) is equal to G[n] G(nT) for nT t (n+1)T, On<NTNf. In this thesis, we will consider three popular and practically relevant channel models: quasi-static fading, quasi-static fading with phase noise, and continuous fading. Quasi-Static Fading Channel (QSFC): The QSFC model is often used for the design and analysis of space-time coded systems, cf. e.g. [36, 37, 38]. The QSFC model dictates that the channel is constant for one frame and changes independently from frame to frame. Accordingly, the channel coefficients (elements of G[n]) for the QSFC can be written as gntn[n] — , 0 < Nf (2.3) . We assume that the f are independently and identically distributed zero-mean complex Gaussian random variables with unit-variance, i.e., we consider a Rayleigh QSFC, cf. e.g. [36, 37, 38]. QSFC with Phase Noise: An extension of the above model takes into account phase noise due to carrier frequency instabilities caused by low-cost local oscillators. A common model for the phase noise process 8ntnr[fl] where [•] [n] is the random-walk (Wiener) model [39] = 6ntnr[fl — 1] + tr[] (2.4) , is a white Gaussian process with variance o3. The resulting channel coeffi cients are the product of phase noise and quasi-static fading and are given by gnn[n] eiOntnrfn,nr , 0 n < Nf . (2.5) We note that, whIle phase noise is irrelevant or, by definition, not present for (idealized) coherent detection, the QSFC-with-phase-noise model is practically relevant and an im portant benchmark model for non-coherent detection. 24 Chapter 2. Space-Time Coding for CPM Continuous Fading Channel: Another generalization of the QSFC model is the case of continuous fading, where the channel coefficients are samples of a discrete-time random process gnn[n] We assume that the = fntnr[fll , n <Nf. 0 (2.6) [n] are spatially uncorrelated zero-mean complex Gaussian (Rayleigh fading) random processes with autocorrelation function, Soil [it], according to Clarke’s model [40] ‘{fntn []fntnr[ + ‘]} = 0 (2rBT,) J , (2.7) where Jo (.) and Bf are the the zeroth order Bessel function of the first kind and the onesided bandwidth of the continuous-time fading process, respectively. As already implicit in (2.7), all NTNR fading processes are assumed to have identical temporal correlations. 2.2 Burst—Based OSTBC for CPM In this section, we introduce the proposed burst—based OSTBC scheme for CPM. We begin with a brief review complex ODs and overview the specifics of the CPM used for this ST scheme. Next, we present the considered transmission model and discuss the ST formating at the transmitter. Then, we show that an appropriate ST combining at the receiver enables single—input single—output (SISO) maximum—likelihood (ML) detection. 2.2.1 Complex Orthogonal Designs (ODs) The complex ODs 0(x) [30], x 1 n, < , x 1 [x , 2 ..., xNc]T, Nc NT, for Nc data symbols xn,, Nc, considered in this chapter are Ns x NT matrices with entries ±x,, ±x, and 0. ODs with entries that are the sum or difference of different x, or x are not allowed, because of the constant envelope requirement of the transmit signal. The elements of 0(x) are transmitted over the NT transmit antennas in Ns symbol intervals and the code rate is 25 Chapter 2. Space-Time Coding for CPM Rc Nc/Ns. All ODs have the property 0H(x)0(x) examples are Alamouti’s code [11] (NT = xj)Ijv. [30]. Popular = 2) and the OD in [41, Eq. (22)] (NT = 4), which are given by [ and X X:] 2 —x 1 x X2 3 x X X 0 3 —X 0 1 X X2 0 x —x xi 1 X 0(x) respectively. Alamouti’s code has rate Rc Rc (2.8) = 0 3 X (2.9) 1, whereas the OD in [41, Eq. (22)] has rate 3/4. Note that all entries in the same column of 0(x) are transmitted over the same antenna, whereas all entries in the same row are transmitted at the same time. 2.2.2 Continuous—Phase Modulation (CPM) Specifics For the proposed OSTBC scheme Nc CPM waveforms x(t), 1 n Nc, are required iT)) (2.10) [42] NB+NE -1 x(t) = exp (J2h a[i]q(t — where E , T, NB, and NE denote the energy per symbol, the symbol duration, the number 3 of data symbols, and the number of termination symbols, respectively, and Nf The symbols an[i] e A, 0 i NB — [i] e A, NB i NB + NE. 1, are independent, identically distributed (i.i.d.) M—ary data symbols taken from the alphabet A the symbols = NB + NE — = {—M+1, —M+3, .. , M—1}, whereas 1, are known to the receiver and necessary for termination of the CPM trellis for decoding. Note that we assume in Eq. (2.10) that the same CPM format is used for all n, 1 n < Nc. This restriction is not necessary 26 Chapter 2. Space-Time Coding for CPM and only made to simplify the exposition. 2.2.3 Proposed OSTBC Scheme As pointed out in [1, 15], the straightforward application of ODs on a symbol—by—symbol level is not possible because of the continuous—phase requirement and the associated mem ory of CPM. In order to avoid this problem, we propose a simple burst—based OSTBC scheme, i.e., we replace the symbols 1 , of duration TB 0 N n in the OD 0(x) by the CPM waveforms x(t), (NB + NE)T. The transmitted signals s(t) are then simply the concatenation of the (appropriately normalized) entries of the nth column of 0(x) separated by a small guard interval of duration T . The guard interval is used to 0 minimize the impact of the transition from one entry of 0(x) to the next on the power spectrum of the transmit signal. For this purpose the amplitude of s 7 (t) may be first slowly decreased to zero, before the amplitude and phase of s (t) are slowly changed to the values prescribed by the next entry of 0(x). This procedure is similar to what is done in the GSM system where a guard interval of 8.25 symbols is inserted after every data 0 should be chosen long enough to make the effects of the transition burst. In general, T from one entry of 0(x) to the next on the transmit power spectrum negligible. Although the optimum value for T 0 will depend on the particular CPM scheme employed, in practice, NET T 2NET should give satisfactory results. Taking the guard interval into account, the duration of s 7 (t) is NsT 0 with T 0 TB + TG. The data rate in bits per channel use of the proposed OSTBC scheme is NCNBT m (M). 2 log (2.11) I VSI tot Throughout this section we will assume NE <<NB and 0 T <<TB, in which case the data rate simplifies to R 2 (M). 0 log R 27 Chapter 2. Space-Time Coding for CPM To further illustrate the proposed OSTBC scheme, we consider the special case of NT = 2 transmit antennas more in detail. We adopt the OD given by Eq. (2.8) and apply the technique described above to obtain the transmit signals s (t), t = { 1, 2}. Thus, taking into account the normalization of the transmit power, the transmitted signals are given by si(t) (t) 2 s I ( I = = Si(t) and T 0 <t O<t<TB X;(t — ) 0 T 0 <t T (t) 2 —-x x(t (2.12) — — — + TB O<t<TB — ( Obviously, (t) 1 x — ) T 0 T 0 (2.13) — t + TB and s (t) have constant envelopes and continuous phases for 0 2 t TB 0 + TB. T For ODs with zero entries, cf. Eq. (2.9), the transmit signals t 8 (t) are zero in certain in tervals. During these intervals the corresponding transmit antenna can be simply switched off. For example, for the OD with NT the interval (NT — 0 m)T t (NT — 4 in Eq. (2.9) antenna = t + 1)T , 1 0 t t does not transmit in NT. Again the guard interval can be used to achieve a smooth transition of the transmit signal between the zero and non—zero entries of 0(x) making the effect on the transmit power spectrum negligible. Although necessary in practice, for simplicity of exposition we will neglect the guard interval in the following and assume TG = 0. 28 Chapter 2. Space-Time Coding for CPM 2.2.4 Maximum Likelihood (ML) Detection Assuming perfect channel state information at the receiver, for ML detection of the data [a[O], sequences , 1 {a ..., a[NB n Nc, we have to evaluate (2.14) ( ..., NR aNc n,=1 where 1 = QJ%J} , 1 argmina ]]T, 1 — denotes the estimate for NSTB f r, (t) 9nn s,(t) — dt n=1 o 1 2 NT n, < Nc. The ML decision rule in Eq. (2.14) can be significantly simplified by exploiting the properties of ODs [30]. To illustrate this, we consider the NT 2 case and the OD in Eq. (2.8). Using Eqs. (2.12) and (2.13) the integral in Eq. (2.14) can be rewritten as f r,(t) — — = f rnr(t) (t)j dt + x 2 [ginxi(t) + g [—ginrx(t — — xi(t) 1 [g + Hflr(t+TB) — TB) + nx(t 2 g — TB)]dt rt)] +g ( 2 X [—ginx(t) +g x(t)jdt. 2 (2.15) Applying Eq. (2.15) in Eq. (2.14) and omitting all irrelevant terms, the ML decision rule in Eq. (2.14) for a 1 and a 2 can be simplified to = argminan {7Id(t) — Xfl(t)Idt} (2.16) 29 Chapter 2. Space-Time Coding for CPM <si(t) CPM with osThc Figure 2.2: Transmitter and receiver model for CPM with burst—based OSTBC. where d(t) is given by NR di(t) (gr(t) + g nr(t + TB)) 2 (2.17) (gnrn(t) (2.18) nr=l NR (t) 2 d — ginrr(t + TB)). n,=1 Note that irrelevant terms include terms such as I x(t) 121 gi . 12 and r, (t) 121 gi,,. 12 which 7 Also, note that terms such as do not affect the decision on (t)grn (t + TB) 1 < n < Nc, can are zero terms. For ODs with NT > 2, the ML decision rule for also be simplified to Eq. (2.16) where d(t) has the general form NT d(t) Here, f{.} operator 1 nt, n NR wntnr(nc)fncnt{rnr(t + is either the identity operator (f{x} {x} NT, 1 = x*). The coefficients n NR. Both f{•} = (flt x) — or the complex conjugation (ne) can take on values and (2.19) 1)TB)}. ±9nnr and depend on the particular OD used and are identical to the respective operators and coefficients appearing in the decision variables for detection of phase—shift keying modulation with OSTBC, cf. e.g. [30]. Interestingly, the ML decision rule in Eq. (2.16) is identical to that for SISO CPM 30 Chapter 2. Space-Time Coding for CPM transmission over an AWGN channel with equivalent received signal (t), cf. Figure 2.2. Therefore, Eq. (2.16) can be implemented using any known optimum or sub-optimum method based on e.g. Laurent’s representation [43] or Rimoldi’s decomposition approach [25, 26] (see also Section 1.2). In contrast to the schemes in [1, 15, 16], there is no need to tailor new detectors for the proposed OSTBC method. Eq. (2.14) shows that the fading channel has to be approximately constant for NS(NB + NE) symbol intervals. In contrast, for symbol—based OSTBC [11, 30] and the orthogonal ST coded CPM scheme in [15] the fading channel has to be approximately constant only for N symbol intervals. Since NB >> 1 is recommended to make the overhead due to the termination symbols and the guard interval negligible, the admissible fading variations for the proposed burst—based OSTBC scheme are considerably smaller than those for the non—CPM and the CPM schemes in [11, 30] and [1, 15, 16], respectively. 2.2.5 Performance Analysis Bit Error Rate (BER) Assuming SISO transmission over an AWGN channel, for high signal—to—noise ratios (SNRs) the BER of CPM can be approximated by [42] BER(b) KQ(dmini./), (2.20) where dmin denotes the normalized minimum Euclidean distance between two possible bit sequences and K is a positive constant that accounts for the number of bit errors per error event and the dependence of the error event on the transmitted data. Q(x) 1 = 0O f /2 2 e —t dt is the Gaussian Q—function and . . . — = Eb/JV, where Eb denotes the received energy per bit. 31 Chapter 2. Space-Time Coding for CPM On the other hand, for CPM with OSTBC with NT = 2 transmit antennas, Eqs. (2.17) and (2.18) show that the equivalent received signal can be rewritten as d(t) = (IginrI2 + nrl 2 +z(t), 9 1 ) 2 Xnc(t) (2.21) nr=l )MJ/2. 2 Z i(I9inrI2 + 192nr1 )Eb/(2JVo). 2 = Zi(Iginr 2 + g2 where z(t) is an AWGN process with power spectral density Therefore, the instantaneous SNR per bit is For the general case of NT transmit antennas and ODs with rate Rc, the instantaneous SNR per bit is NT NR R £ 7b = ntl flrl IntnrI 2Gb NTJVO (2.22) Therefore, using Eq. (2.20) and the alternative representation of the Q—function Q(x) 2 O)]dO, J” exp[—x/(2 sin = 0 [44], the approximate BER of the proposed OSTBC x scheme can be calculated to (> NT BER fBER NR IgntnrI2 (g) dg 9 p ir/2 = 2mm Eb \NTNR d K “ d8 I ii + 2N’.Afosmn Oj Tr J \ — (2.23) 0 where g [911 912 ... 9NTNRJT and p (g) is the joint probability density function of the el 9 ements of g. Eq. (2.23) is easy to evaluate as only a one—dimensional numerical integration over a finite interval has to be performed. Using the bound Q(x) 2), x 0.5exp(—x / 2 0, in Eq. (2.23), it is easy to show that the Chernoff bound on the approximate BER is given by BER K (1+ 2 d Eb) —NTNR . (2.24) -- 32 Chapter 2. Space-Time Coding for CPM Eq. (2.24) shows that the proposed burst—based OSTBC scheme for CPM achieves the maximum diversity order NTNR. Frame Error Rate (FER) To arrive at a meaningful expression for the FER, we have to assume that the bit errors are approximately statistically independent. However, whether the bit errors are independent or not depends on the particular CPM format used. For example, CPM with conventional phase—increment mapping [26] results in double errors due to the resulting differential encoding of the absolute phase. Fortunately, these double errors can be avoided if phase— state mapping is employed, (see Section 1.2 for details), which we adopt for the simulations in Section 2.2.6. Assuming M—ary CPM transmission over an AWGN channel and approximately inde pendent bit errors, the corresponding FER is given by FER(yb) 1 — (1 — ))b02(M), 7 BER( (2.25) where BERQ57b) is defined in Eq. (2.20). Combining Eqs. (2.22) and (2.25), the FER of CPM with OSTBC can be obtained from NT NR fFER In the integrand in Eq. (2.26), the fading gains ;) pg(g)dg. only appear in the form (2.26) gtrI2 Therefore, the evaluation of Eq. (2.26) involves an NTNR—dimensional numerical integra tion. 33 Chapter 2. Space-Time Coding for CPM : ,00 Nr=2-\ I N 4 . io NT=2— \ :\ I NT =4 iO .:::::::::::::::::::::::::::::::::::. i0 . : : :: :: : : ::: •. :::::: :. ::::::::::::::::::::::::::::::::: 5 10 15 :: :: :: :: : ::: ::: ::. Numerical Results Simulation Results Zhang & Fitz 10_6 0 :: 20 10 log Q(Eb/No) 1 i0 0 [dB] 5 10 15 20 —* (Eb/MJ) of GMSK with phase—state mapping. 10 Figure 2.3: BER and FER vs. 101og 1), OSTBC (NT = 2, NT = 4), and the ST cod Single—antenna transmission (NT ing scheme of [1] (NT = 2) are compared. 2.2.6 Performance Results In this section, performance results are presented for NT = 2 and NT = 4 transmit antennas employing the ODs in Eq. (2.8). One receive antenna and a frame length of NB = 130 is assumed in all cases. For comparison we also consider single-antenna transmission and the delay diversity (DD) scheme proposed in [1] for NT = 2 transmit antennas. To facilitate the comparison, we adopt the same CPM schemes as [1]: GMSK with time-bandwidth product BT = 0.3, binary 2REC with h = 1/2, and 4—ary 1RC with h = 1/4. The derivative of q(t) is a rectangular pulse of duration 2T and a raised—cosine pulse of duration T for 2REC and 1RC, respectively. Phase—state mapping [26] (see Section 1.2) is applied for all CPM 34 Chapter 2. Space-Time Coding for CPM 10_I 100 ::::::!:::::::::W::::::::: ..::::::::::N..:i::::::: :::: :::::::.. . 1 02 :::::::::::::::::::::::::::::::::::::: NT I . O :::N 4...:::::::::::::..:::::::::. 1 I EE:.HE*: ::::“:::::::::::::: . 0 I I 1 : ::::: : : : :::::::: : : : : : ::::: : :: :: ::.:: Numerical Results Simulation Results Zhang&Fitz * 108 0 5 10 15 4 1o 20 10 loglO(Eb/No) 0 5 [dB] 10 15 20 —* Figure 2.4: BER and FER vs. 10 log (Eb/.N) of binary 2REC with phase—state mapping. 10 Single—antenna transmission (NT = 1), OSTBC (NT = 2, NT = 4), and the ST coding scheme of [1] (NT = 2) are compared. schemes, and as a result K = 1 was valid in all cases. Note that [1] employed CPM with phase—increment mapping. The resulting double errors affect the BER but not the FER. Therefore, the FER comparison between the scheme in [1] and the proposed approach in Figs. 2.3—2.5 is fair. The normalized squared minimum Euclidean distances of GMSK, binary 2REC, and 4—ary 1RC are = 1.77, = For GMSK and binary 2REC the data rate is R NT = 2, and R = use) results for NT 3/4 bit/(channel use) for NT = 1 and NT = 2, and R = 1.73, and = 1.64, respectively. 1 bit/(channel use) for NT 4. For 4—ary 1RC R = 3/2 bit/(channel use) for NT = 1 and 2 bit/(channel = 4. Figs. 2.3, 2.4, and 2.5 depict the BERs and FERs for GMSK, binary 2REC, and 4—ary 35 Chapter 2. Space-Time Coding for CPM 1RC, respectively. Simulation results (circles) and numerical results (solid lines) obtained by evaluating Eqs. (2.23) and (2.26) are in excellent agreement for both single—antenna CPM and CPM with OSTBC. Obviously, the proposed OSTBC scheme achieves a signif icant performance improvement compared to single—antenna transmission. For all consid ered CPM schemes with NT = 2 the FERs of the DD scheme of [1] are slightly higher than the FERs of CPM with OSTBC. 10_I 100 ,..2 10_I NT=2—& 10 I 10 T -2 10 io :: : :::: : : o * 0 5 10 15 20 10 1og (Eb/No) 10 10_’• [dB] 0 Numerical Results Simulation Results Zhang & Fitz 5 10 15 : 20 —f Figure 2.5: BER and FER vs. 10 loglQ(Eb/AIo) of 4—ary 1RC with phase—state mapping. Single—antenna transmission (NT = 1), OSTBC (NT = 2, NT = 4), and the ST coding scheme of [1] (NT 2) are compared. For the simulation of single—antenna CPM and CPM with OSTBC we adopted the reduced complexity detection technique proposed in [26]. For all considered examples, two receive filters and two (GMSK, binary 2REC) and four (4—ary 1RC) states for decoding 36 Chapter 2. Space-Time Coding for CPM were sufficient to achieve close—to—optimum performance. Assuming optimum implemen tation, the complexity of the DD scheme of [1] is exponential in the number of transmit antennas and much higher than that of the proposed burst—based OSTBC approach. Un fortunately, it is not straightforward to design low—complexity receivers that preserve the diversity gain of optimum detection for DD and this problem was not discussed in [1]. For NT for NT > = 4, a fair comparison with [1] is difficult because of the rate loss of complex ODs 2 and the large differences in the required detection complexity. Furthermore, we note that the performance of the scheme proposed in [15] is not shown, since it is slightly worse than that of the scheme in [1], cf. [15, Figure 3]. 2.3 Diagonal Block Space-Time (DBST) Coding for CPM In this section, we introduce the second ST-CPM scheme that we proposed in this thesis. In order to preserve the constant envelope, continuous-phase properties of CPM for our ST-CPM scheme we once again elect to transmit blocks or frames of data rather than data symbols (each element in the signal matrix is now a CPM frame rather than a symbol as is used in DSTM for linear modulation formats). Careful design of the data mappings for each transmit frame produces a coding gain in addition to the expected diversity gain. The resulting diagonal block-based ST-CPM (DBST-CPM) scheme can (a) be used with any CPM format, (b) enable non-coherent detection, and (c) accommodate any number of transmit and receive antennas. (The flexibility of the proposed scheme is in notable contrast to other non-coherent ST-CPM schemes presented in the literature). In addition, this section presents receiver designs for non-coherent detection of DBST-CPM in three different fading environments, employing elements from per-survivor processing [45], linear 37 Chapter 2. Space-Time Coding for CPM prediction-based decision-feedback differential detection (DFDD) for DSTM [46], and state reduction for CPM [26] to minimize detection complexity. Also in this section an efficient search algorithm is designed to find the optimal data mappings for our ST-CPM scheme. The applied data mappings are referred to as the ST code. (Optimization of the ST code is similar to optimization of the DSTM diagonal constellation parameters [31, 32], however due to the memory inherent to CPM ST code optimization requires a sequence-based approach.) Finally, a tight bound for the frame-error rate (FER) of DBST-CPM under is derived (under the assumption of coherent detection and a quasi-static fading channel (QSFC)) that is used as the basis for the optimization of DBST-CPM. We begin with an introduction to the ST-code structure of our proposed DBST-CPM scheme, and then develop the receiver structure including decision rules for coherent and non-coherent detection for the fading channels considered before. 2.3.1 Continuous-Phase Modulation (CPM) Specifics The proposed ST-CPM scheme employs NT CPM waveforms [42] x(t) = exp (i2haflt[i](t — iT)) 0 t < NfT, 1 t NT, (2.27) where E , T, and Nf denote the energy per symbol, the symbol duration, and the frame 8 length, which is the number of data-carrying symbols a[i] are taken from the alphabet A [i], respectively. The symbols {—M + 1, —M + 3, ... , M — 1} of size M. For 38 Chapter 2. Space-Time Coding for CPM later reference, we also introduce the vectors [a[Oj a[11 a[i] a [ai[i] a [i] 2 [a[O] a[1] . . ... ... . afl[Nf — 11] ar,[i]] a[Nf — , (2.28) t, data symbols assigned to the 1]] of, respectively, data symbols transmitted over antenna NT antennas during modulation interval i, and all data symbols in one frame. Note that we assume in Eq. (2.27) that the same CPM format is used for all antennas nt, 1 < t < NT. This restriction is not necessary, but it is made for the purpose of simplicity in this paper. 2.3.2 Modulation Only one antenna transmits at any time when diagonal matrices are employed. If each antenna is used for transmission in Nf consecutive modulation intervals, phase continuity can be preserved for CPM without any additional signal processing or complicated design restrictions. Hence, the proposed ST-CPM scheme employs transmit signals [see Eq. (2.27) for x(t)] s(t) = I xfl(t—(nt—1)NfT), (nt—1)NfT 0, t < nNT, (2.29) otherwise, 39 Chapter 2. Space-Time Coding for CPM i.e., the NT antennas t = 1,... ,NT are used sequentially. Thus, we can write the ST-CPM signal matrix as xi(t) S(t, a) = 0 0 x(t — 0 NfT) •.. 0 . 0 0 (2.30) xNT(t—(NT—1)NfT) It is interesting to note that the proposed ST-CPM scheme is similar in structure to “block DSTM” for linear modulation considered in [47, 48]. Therefore, we refer to the proposed scheme as DBST-CPM. Also similar to linear DSTM with diagonal matrices, the data vectors a[i] are chosen from an M-ary constellation and thus the data rate of DBST-CPM is log (M)/NT bits per symbol duration T. The actual design of the M-ary 2 set of data vectors a[i], i.e., the optimization of DBST-CPM, will be discussed in detail in Section 2.3.4. As previously mentioned we have opted to transmit blocks of data to preserve the continuous-phase property of CPM, however, we would like to point out that, as for the OSTBC code proposed in the previous section, the transitions between blocks of data need not be considered a violation of the continuous-phase property, but rather they are similar to the transitions observed in any packet based transmission scheme, as for example the Global System for Mobile Communication (GSM), wireless local area network (WLAN) systems, Bluetooth, etc. 2.3.3 Detection The receiver for DBST-CPM, similar to a single-antenna CPM receiver, is comprised of a bank of matched filters and a sequence detector [42], [25], [26]. 40 Chapter 2. Space-Time Coding for CPM Filtering and Sampling If the reduced matched filter bank proposed in Section is 1.2.1 is employed, the samples of the filtered received signal are D-dimensional vectors r[nj = r(t) ® , [n] 0 = [re? [n],.. . , r []]T with m < NTNf, (2.31) t=nT where ® denotes convolution. Sequence Detection Let us introduce the ‘address’ vector for ST-CPM as d[i] [Ti[i — L], . . . , — L], a[i — L + 1],..., a[i]j of L M-ary data symbols a[ij and NT p-ary phase states [i — (2.32) L], which account for the accumulated phase due to past data symbols of the CPM signal transmitted over antenna t• Corresponding to the vector d[i] there are NT signal elements p(t, d[i]), each of which is transmitted over one antenna (i + 1)T + (nt — 1)NfT, 1 t NT, 0 flt in the interval iT + (flt — 1)NfT < t < i < Nf. Then, corresponding to the D receiver input filters, the sequence detector stores D-dimensional vectors p 7 (d[i]), which represent the decorrelated coordinates of p(t, d[i]) with respect to the ‘basis’ functions given in Eq. 1.20). More specifically, we have pT p(d[i]) = CJ h*(t)p(t,d[i])dt, (2.33) 0 where C was given in Eq. (1.21). Depending on the ST code of DBST-CPM (see Section 2.3.4 for the details about the ST 41 Chapter 2. Space-Time Coding for CPM [Ti [i+ 1], T 2 till [i+ 1]] [Ti [i] T 2 [T, [ij, T 2 [ij] [Ti [i+ 1] T 2 [i+ 1]] Figure 2.6: Trellis of DBST-CPM for NT = 2 and CPM with 1REC pulse, M 4, and h = 1/2. Left: Repetition ST code. Right: Optimal ST code (see Section 2.3.4 for details about ST code optimization). code) the number of possible CPM phase state vectors [T 1 [ii,. . . , Tjy. [i]] varies between p and NT, and hence the number of states of the trellis representing the DBST-CPM signal varies between pML_l and An illustration of this effect is given in Figure 2.6, pNTM_1. which shows two trellises for DBST-CPM with NT frequency pulse g(t) with L = 2, 1REC pulse, i.e., a rectangular 1, M = 4, h seen, the number of states is pML_l = 2 for one ST code and = = 1/2, and two different ST codes. As can be pNTML_1 = 4 for the other. For sequence detection we adopt the classical Viterbi algorithm [49] operating on the DBST-CPM trellis with path metrics [i] 1 i, for each state at data-symbol interval i, and ‘P,[i] + [i] (2.34) the path-metric update [i + 1] 1 ‘h1 = where [i] denotes the metric for the branch leaving from state and ending in state v during the ith data-symbol interval. Next, we will discuss the design of [i] for coherent and non-coherent sequence detection. A) Coherent Detection: Although our ultimate goal is the application of detection without CSI, it is useful for later optimization of DBST-CPM and performance comparison 42 Chapter 2. Space-Time Coding for CPM to first consider the coherent detector. The maximum likelihood sequence detector (MLSD) for coherent detection of DBST-CPM cross-correlates the filtered received samples with the vectors p (d[i]) multiplied by the respective channel gains, and sums over all NR receive antennas and all NT transmit antennas. The branch metric reads NT NR Re {r[i + (nt = — 1)Nf]p(dv[i])gntn[i + (flt — 1)Nf]} , j <Nf, 0 flti flri (2.35) where d, [i] is the address vector corresponding to the transition from state to v and Re{.} denotes the real part of a complex number. B) Non-coherent Detection: Because the DBST-CPM data symbols herently differentially encoded (see Eq. (2.27) and note that q(t) = [i] are in 1/2 for t LT), the ST-CPM signal is invariant to phase rotations and non-coherent sequence detection is directly applicable, cf. e.g. [50, 51]. In order to avoid an increase in the number of trellis states compared to coherent detection, we make use of ideas from per-survivor processing (PSP) [45] and decision-feedback differential detection (DFDD) for DSTM [46]. In par ticular, we propose to implicitly estimate the channel using per-state reference symbols [i] constructed as Nd—i = where [d[i — Nd + 1],.. . , d[i — 1kr[i — k+ 1]] are the Nd the path ending in state 1 u (cf. [45]) and 1 — = (flt — 1)Nf]p(d,j[i — k]) (2.36) , 1 tentative (PSP) decisions corresponding to [l 12 lNd_i] are the coefficients of a linear minimum mean-square error (MMSE) predictor for the fading-plus-noise process, cf. e.g. [46, 52] for linear modulation. Note that only Nd — 1 previous symbols d[i — k] are used to form the reference in order to limit the complexity of the receiver. The branch metric 43 Chapter 2. Space-Time Coding for CPM for non-coherent detection of DBST-CPM reads NT NR Re {r[i + (‘nt — 1)Nf]pnt(d[i])r,flr,flt[i]} (2.37) . nt=1 nr=l If the statistics of the fading process k 1 fltr 9 [n] are known a priori, the predictor coefficients can be calculated from the Yule-Walker equation [53] = where R is a Toeplitz matrix, whose first row is given by p = [pgg[1]cc’gg[2] cpgg[N — T, 111 and (2.38) p, 1 R [gg [0] + o, (pgg [1], JV/T, gg[ii] the three channel models introduced in Section 2.1 we have (a) QSFC: with phase noise: gg[K] = . . (pgg [Nd + çogg[1] e_II/2, and (c) continuous fading channel: — ic]}. 2]], For 1, (b) QSFC çogg[/c] = sof[Ii], as it was given in Eq. (2.7). Alternatively, I can be obtained using adaptive algorithms, cf. e.g. [54]. C) Reduced State Sequence Detection (RSSD): As mentioned before, the number of phase state vectors of DBST-CPM is variable depending on the applied ST code (see Section 2.3.4). In particular, we found that for most of the power-efficient ST codes this number attains its maximal value fNT. 0 In these cases, the DBST-CPM trellis and thus the sequence detector, whether coherent or non-coherent, will require pNTML_1 states (using the modified CPM phase trellis given in [25, 26]). Hence, complexity of the receiver increases considerably with the number of transmit antennas NT and the application of RSSD [26, 55] becomes desirable. In particular, we concentrate on reducing the phase states from pm, 1 m NT, where the value of m depends on the ST code, to p, which is the same as for the single-antenna case. Accordingly, at each stage of the sequence detector only the largest out of p tm path metrics corresponding to the set of trellis states which differ 44 Chapter 2. Space-Time Coding for CPM in the phase state only is selected, and thus, the number of possible branch metrics that need to be calculated in any given interval is reduced from pmML to pML. 2.3.4 Optimization of DBST-CPM The diagonal structure of the DBST-CPM signalling matrix given in Eq. (2.30) guarantees full diversity. In addition, a significant coding gain can be realized if the the data mappings of successive frames are correctly chosen. Thus, the proper design of DBST-CPM requires an optimization of the structure of the vectors a [i]. Let C be the set of M vectors c[i] {c[1], c[2], [ci [ij c2 [i] ... ..., CNT c[M]} C (2.39) ANT, [i]] from which the a [i] are selected through the mapping of log (M) data bits. We refer to C as the ST code of DBST-CPM. For 2 example, one possibility is to choose c[i] = ci[il, 2 nt NT, i.e., C is a repetition code. The optimization of C is similar to the optimization of the constellation parameters .. 1 [u . UNT] in [32, Section VII]. However, due to the inherent memory of CPM, the opti mization cannot be performed for individual modulation intervals as in [32], instead the entire ST signal S(t, a) has to be considered. We consider the frame-error rate (FER) of DBST-CPM as the optimization criterion. For this purpose, in Section 2.3.4 we derive a tight upper bound for the FER, and an algorithm for its numerical evaluation is presented in Section 2.3.4. Derivation of Frame Error Rate (FER) Bound In this section, we will first derive the Chernoff bound on the pair-wise error probability (PEP) of our DBST-CPM scheme to demonstrate that it achieves full diversity. Then, we will derive a tighter bound on the FER, and finally truncate the bound to arrive at a useful 45 Chapter 2. Space-Time Coding for CPM approximation of the upper bound that can be efficiently evaluated. For mathematical tractability we assume coherent MLSD and the QSFC in the derivation of the upper FER bound. As justification for these assumptions we note that the diagonal structure of the ST CPM signal matrix was chosen for express purpose of facilitating non-coherent detection. Thus DBST-CPM yields non-coherent performance that approaches that of MLSD with CSI. In fact, simulation results in Section 2.3.5 will show that the non-coherent and reduced state performance of the ST-codes approaches coherent performance. Furthermore, the assumption of a QSFC is, in terms of code optimization, also a good approximation for the continuous fading channel since the memory of DBST-CPM is limited. Pair-Wise Error Probability (PEP) The PEP P(aa — a’s) is the probability that the receiver erroneously decides in favour of the sequence a 13 when the transmitted sequence is aa. Under the assumption that the data sequence aa was transmitted the corresponding received signal and the QSFC coefficients are r(t, aa) and gn., respectively. The MLSD metric, m(r(t, aa), a’ ), for a trial sequence a 3 13 is then given by NT m(r(t, aa), a’3) NR = ntlnr=l The PEP P(aa —* NfT f Irn(t + (flt 1)T, aa) — — gnnxnj(t, a’3)I dt. 2 o 13 conditioned on the channel G follows as (Pr{.} denotes probability) a ), / P(aa a’3IG) (2.40) = Pr{m(r(t,aa),a’3) <m(r(t,aa),aa)} = I ‘2 (a a ,a j3 ,G) 2Aj (2.41) where Q(x) /2dt, and 2 1//f0e_t NT NR fltl flrl 2 IgI (a’,a’3,G) 2 d (2.42) 46 Chapter 2. Space-Time Coding for CPM is the sum of the scaled squared Euclidean distances NfT f x(t, znt a) — x(t, dt, 2 a)I (2.43) between the transmitted and the erroneous CPM signal for antenna nt. Considering the CPM signal description in Eq. (2.27), the squared Euclidean distances can be written as NfT = 8 2NE / — N—i cos (2h (a[i] which only depends on the difference sequence 7nt [i] — a[ij)q(t [i] — iT)) dt, (2.44) [i]. The Chernoff bound — for the average PEP has the familiar form P(aa .‘ a) (, 1+ If the code words in C are different in each position, then ) NR flt (2.45) > 0 for 1 nt NT and DBST-CPM achieves full diversity. Bound on FER In principle, we could directly use the Chernoff bound on the PEP as a design criterion and only consider the dominant error event maximizing Eq. (2.45). However, when the fading channel is static, there are no dominant error events, since for any given frame the received signal-to-noise ratio (SNR) may be low, which results in a high probability for all error events. Alternatively, we could combine the PEP bound Eq. (2.45) with the union bound, which sums over all possible error events. But, again when the channel is static or only slowly varying, the union bound is typically not tight and may diverge even at high SNR [36]. Hence, in order to produce a useful design criterion we adopt another approach that 47 Chapter 2. Space-Time Coding for CPM was applied in [36] to estimate the performance of space-time trellis codes for the QSFC. In order to prevent the union bound from diverging at low SNR, we define a region R. that contains values of the channel matrix G that result in low SNR. While there are many possibilities for defining a suitable spherical and cubical regions provide simple and tight bounds. Of these two possibilities the spherical region provides a tighter and simpler bound, but a closed-form expression cannot be found for more than one receive antenna [36]. In this section, for simplicity we will present the FER bound assuming one receive antenna and the spherical bound, but we note that the bound can be extended to any number of receive antennas using the cubical bound. We define region R. as an NT dimensional hypersphere of radius R centered around the origin ( 1?. NT G 2 2 R (2.46) , ) n=i and upper bound the FER by P = Pr{eIG E ‘R.} Pr{G E Pr{G } + Pr{eIG R.} Pr{G e .} + Pr{G 0 R.} > Pr(aa) P(a° ‘ —* R.} a’IG). (2.47) (2.48) a’ Making use of the derivation in [36, Appendix] and the PEP from Eq. (2.41), we can find a closed-form expression for the bound on the FER. The bound is dependent on the relationship between the squared Euclidean distances As an illustration we will explicitly show expressions for the bound for two different special cases. A) Distinct Euclidean Distances: When all squared Euclidean distance terms are 48 Chapter 2. Space-Time Coding for CPM unique, i.e., for L for flt ( )] NT e Pe [1_ where = i, the bound can be written as nt nt 2 R 1 NT Pr(a)[ + (n ) 1 2 —(1+ y)R + (2.49) 1/(4.N). B) Identical Euclidean Distances: When all squared Euclidean distance terms are identical, i.e., L L for 1 = NT e [1 — 2 e_R ( __)] NT, t nt 2 R + 1 the bound can be written as NT —1 Pr(aa) t 2 R [e(172 + 1 __] (2.50) During numerical evaluation of Pe the radius, R, of the hypersphere is optimized to produce the tightest upper bound using a Golden Section search [56, Section 10.1]. Truncated Bound on FER The number of distance terms that need to be considered for the FER bound, e.g. in Eqs. (2.49) and (2.50) for the two special cases, can be reduced by using the concept of simple error events, cf. e.g. [36, 37, 38]. An error event is considered a simple error event if the erroneous sequence diverges from the transmitted sequence and re-merges only once, i.e., there is only one erroneous segment in the received stream. Fur thermore, because calculation of the entire distance spectrum is computationally expensive we truncate the sum such that terms whose product distance NT p(s) fJ Lk (2.51) nt=1 for 1 [z ... NT] ple the case that all exceed a threshold Pmax are discarded. Hence, considering for exam are unique [Eq. (2.49)], the truncated bound can be numerically 49 Chapter 2. Space-Time Coding for CPM evaluated as NT e — 2 e_R NT ( )] [ (n vt 2 R p()<pmax 1 ) 2 —(1+ -y)R + (2.52) where A(A) accounts for the multiplicity and the probability of the pair-wise error events with distance vector . The contribution of exponentially with increasing flj ‘flt therefore, when to the bound in Eq. (2.49) decreases Pm is large the truncated bound is a good approximation of the upper bound. Similar expressions for the truncated bound can be found for any number of unique and repeated squared Euclidean distance terms, e.g. for the case of all repeated Euclidean distances considered in Eq. (2.50). The weight A(s) can be evaluated by assuming that the frame length Nf is very large. Using this assumption edge effects caused by termination of trellis can be neglected and all error events can be assumed to start in the middle of a long block. Analysis of this kind is referred to as first error event analysis [57]. Following this assumption, an error event of length Le symbols may be repeated Nf/Le times. Therefore, the weight of an error event with distance vector is written as A() = Ne(b,Le,p(A))flP( i[1) 7 (2.53) where Ne(b, Le, p(s)) denotes the multiplicity of error events with number of bit errors length Le, and product distance p(A), and P( 71 [i]) denotes the probability of difference sequence ‘y[i] and is given by P( [i]) = (M 71 — Note that the difference sequences for all antennas by the difference sequence of antenna error event with distance vector antenna t t t > 1 are uniquely determined = 1. Therefore, the probability of the pair-wise is dependent only on the data stream transmitted from = 1. 50 Chapter 2. Space-Time Coding for CPM Algorithm for Numerical Evaluation of the Truncated FER Bound To find the optimal DBST-CPM ST code for any given CPM format we require an efficient search algorithm. Our proposed algorithm finds the optimum code C by evaluating the truncated upper bound [e.g. Eq. (2.52)] for all possibilities for C and selecting the code that produces the lowest bound. In particular, exploiting the symmetry of the problem, (M!/NT!)VT_l combinations of code vectors need to be examined. To find all pairs (, A()) required for the truncated bound, i.e., the distance spec trum, we extend the algorithm presented in [58] for CPM with a single antenna. Initially, the possible difference sequence sets {‘y, } for the ST code and their probabilities must be determined. For example, for a two antenna system, M 1 — —1 = 4, and ST code —1 +1 +3 +3 —3 +1 the possible difference sequences are given by f f 7 f 1 0 —2 —4 —6 —2 o —4 +2 —2 +6 — +2 +4 +6 +2 +4 —2 +2 —6 Additionally, the bound Pmax on the product distance and a bound on the length of error sequences must be set. Table 2.1 shows the pseudo-code for the algorithm that calculates the distance spec trum. e denotes an error sequence, i.e., a vector of difference sequences, and the algorithm begins by evaluating the distance of all possible error sequences of length L = 1. The algo rithm maintains a list £ of error sequences that satisfy all of the criteria of the algorithm. 51 Chapter 2. Space-Time Coding for CPM Once the length one error sequences have been evaluated each error sequence is treated individually and extended by one difference symbol, and the corresponding Euclidean dis tance, the error sequence weight, and the length of the error sequence are recorded, and the algorithm proceeds with Le = 2 and so forth. As the algorithm proceeds error events that exceed the bound Pmax are discarded, and error events with the same product Euclidean the same number of bit errors b, the same length Le, and the same distance phase state > -y[i] are merged by adding their weighting factors. If the error event path re-merges with the transmitted stream, i.e., = 0 for all t = 1,. . . ,NT, then the path is saved and is no longer updated. The algorithm is terminated when there are no remaining error events to update with p(s) <Pmax, or the error event path length reaches a pre-defined upper bound. 2.3.5 Performance Results In this section, we present extensive performance results for the proposed DBST-CPM scheme. The ST codes considered for simulation have been optimized by setting NT 30 Pm = in the search algorithm in Table 2.1. The same threshold is applied for all numerical FER results shown in this section. One receive antenna and a frame length of Nf = 130 are assumed in all cases. The number of filters in the receive filter bank is chosen to be D = 3. Phase-increment mapping [26] is applied for all CPM schemes. Unless stated otherwise, DBST-CPM with M = 4, h = 1/2, and 1REC pulse is assumed. Numerical and simulation results are presented as function of the SNR Eb/No, where Eb = ()/NT 2 1og denotes the average received energy per bit. 52 Chapter 2. Space-Time Coding for CPM 100 NT.= 4.” 10 :::::::::;:::::::::;::::::::::::::::::::: I • . • . . .. . . .4. 102 FER Bound — ---Simulation 0 Repetition Code o OptimalCode : :::: : :: : ::: :;: :: :::::::::::::::::: , NT:z S. *RSSD 2 I I I I I I I 4 6 8 10 12 14 16 (Eb/.MJ) [dB] 10 101og 18 20 —* Figure 2.7: FER VS. 10 1og (Eb/J\fo) for 1REC pulse, h = 1/2, and M = 4. DBST-CPM 10 (NT = 2 and NT = 3) with repetition code and optimal code and CPM with NT = 1. Simulation results and the analytical upper bound are compared for the QSFC. Coherent Detection In order to separate the effects of code optimization, state reduction, and non-coherent detection, we first present results for coherent detection and the QSFC. The subsequent section will show that the gains obtained under these conditions also apply to non-coherent detection and non-quasi-static fading environments. A) MLSD: Figure 2.7 depicts the FERs of coherent MLSD for the optimal ST code C found with the algorithm from Section 2.3.4 and for the repetition code for NT NT = 3, respectively. As a reference, the FER for the same CPM scheme and NT = = 2 and 1 is also shown. It can be seen that the results obtained from simulation (dashed lines) and from numerical evaluation of the truncated bound (solid lines) are in good agreement. We note 53 Chapter 2. Space-Time Coding for CPM that the tightness of the bound is a function of the truncation parameter Pm, which should be set with some care. Large Pm are computationally expensive, and small Pmaic may not provide an upper bound. Importantly, however, when we set Pm = NT 30 we found that the bound accurately predicts the performance ordering of different codes for numerous system parameters and gives a quantitatively precise approximation of the performance gained by using the optimal code C in comparison to e.g. the simple repetition code. For the chosen example, this gain amounts to 2 dB in power efficiency for both NT = 2 and NT =3. Comparing the performances for DBST-CPM with NT = 2, NT = 3 and single-antenna CPM, we observe that DBST-CPM with multiple antennas results in considerable improve ments in power efficiency. In particular, the slopes of the FER curves confirm the diversity advantage of DBST-CPM. Since the same CPM scheme is used for both NT and NT NT = = 1, NT = 2, 3, the data rate for single-antenna CPM is double of that for DBST-CPM with 2 for example. However, a truly fair comparison is difficult as increasing the size M of the signal constellation also affects the bandwidth of the CPM signal. B) RSSD: When the repetition code is employed the CPM signals transmitted over NT antennas are all identical, which means that the number of states for MLSD is pML_l (independent of NT) and less than that for the optimal code with in general pNTML_1 states. Figure 2.8 provides a comparison of DBST-CPM with MLSD and RSSD. For the optimal code, MLSD is performed in a four-state trellis while a trellis with only two states is used for RSSD, (the number of states required for MLSD of the repetition code, cf. Figure 2.6). We observe that state reduction causes only a small performance degradation. In particular, the gains from code optimization are also well preserved for RSSD. C) Overview of Results for QSFC: Tables 2.2-2.4 provide an overview of the nu merically evaluated performance gains obtained with optimized DBST-CPM for NT 2 54 Chapter 2. Space-Time Coding for CPM 10o 10 : -l : : I ‘& .::,:::::::::::::::::::::::::::::::: , NT = 1 ‘:::%:::::::::::::. ._s. %. 1 NT— N\ NT=3 10 1 )<.....\ -2 — FER Bound — — — Simulation 0 2 4 .. I I I I 6 8 10 12 14 (Eb/.N3) [dB] 10 101og I I I 16 18 20 22 —* Figure 2.8: FER vs. 10 1og (Eb/.MJ) for IREC pulse, h = 1/2, and M = 4. DBST-CPM 10 (NT = 2) with repetition code and optimal code. MLSD and RSSD with CSI for the QSFC. and NT = 3 antennas and a variety of CPM formats. In particular, the popular 1REC, 2RC, and 3RC CPM pulse shapes (for 2RC and 3RC CPM, the frequency pulse g(t) is a raised cosine pulse of length L M = 4 and M = = 2 and L = 3, respectively, cf. [42]), constellation sizes 8, and modulation indices of h tables present the optimum codes C for NT = 1/2, 1/3, and 1/4 are considered. The 2 and NT = 3 and the associated perfor mance gains compared to repetition codes, with respect to the required 10 log (Eb/.N) to 10 obtain an FER of 10—2. These tables show that depending on the number of transmit antennas and the modu lation format gains between 0.7 dB and 5 dB are possible by using an optimally selected code. A direct comparison of the performance of single antenna transmission and the 55 Chapter 2. Space-Time Coding for CPM performance of the ST coding scheme is difficult due to the non-linear relationship of the normalized CPM bandwidth (B %T) and parameters M and h. However, we will make 99 one comparison here to illustrate the benefits of the proposed ST coding scheme. The quaternary 2RC DBST-CPM scheme with NT malized bandwidth of %T 99 B = = 2 and h = 1/4 (see Table 2.2) has a nor 1.24. A binary 2RC single-antenna scheme with h has the same data rate and the normalized bandwidth is %T 99 B = = 1/2 1.05, i.e., quite compa rable to that of DBST-CPM. DBST-CPM achieves a FER of 10—2 at 19.2 dB, whereas the single-antenna scheme requires 28.0 dB. This is a significant performance improvement of more than 8 dB. Non-coherent Detection In this section, we will present performance results for the different fading channel models introduced in Section 2.1 and non-coherent detection employing the branch metrics de scribed in Section 2.3.3. In all cases, the first two symbols of each frame are assumed to be known at the receiver to allow for an initialization of the reference symbol defined in Eq. (2.36). The filter length used for the reference symbol is gradually increased from 2 to Nd at the beginning of each frame until the Nh symbol is received. Figure 2.9 shows the performance results for the QSFC and non-coherent detection with different values of Nd. DBST-CPM with the optimal ST code and with the repetition code are compared for NT 2. The respective curves for coherent detection are included as a reference. We would like to emphasize that the number of states for non-coherent detection is the same as that for coherent detection (see Section 2.3.3). As can be seen, the FER curves for non-coherent detection closely approach those for coherent detection with increasing Nd. Hence, code optimization based on the MLSD bound for coherent detection also yields results relevant for the case of non-coherent detection. The repetition code yields a somewhat faster convergence with increasing Nd, since in this case DBST-CPM 56 Chapter 2. Space-Time Coding for CPM l0°i . .1. . . 10_i : : :: : : ::: : : : : : ::: : : .4.... : : :::::: ::.: I S :::::::::. :: NT=2 optimal code: w L1 . 102 repetition iode b — . e — —. — Non—coherent Nd =4 Non—coherent, Nd 8 Coherent 3 1o I 0 2 4 6 8 10 12 14 16 18 20 10 1og (E/.Mj) [dBl 10 Figure 2.9: FER vs. 10 log (Eb/j) for 1REC impulse, h = 1/2, and M = 4. DBST-CPM 10 (NT = 2) with repetition code and optimal code. Coherent detection with CSI and noncoherent detection without CSI for the QSFC. 2-state trellis for repetition code, 4-state trellis for optimal code. has a trellis with only p 2 phase states, whereas p’T = 4 phase states are present for the optimal code design (cf. Figure 2.6). For the same DBST-CPM scheme, Figure 2.10 shows the performances for the optimal and the repetition ST codes for the QSFC channel with phase noise of variance o Nd = 2 and Nd = 0.01. 5 are chosen for non-coherent detection. We observe that although both codes suffer from a performance degradation compared to ideal coherent detection, the optimal code still outperforms the repetition code by approximately the same margin as for coherent detection. Finally, the performance of DBST-CPM with the same codes as above is shown for a 57 Chapter 2. Space-Time Coding for CPM 0 lOi I . .. . •% ••% s :%, %.:w’%.. %..%., s’ % 10_i . . : L1.i . % . % 44. LL 10_2 Coherent, Repetition Code :::: : :: : Coherent,OptimalCode Non—coherent, N d = 2, Repetition Code 0 — — — 3 1o — — e — Non—coherent Nd 2 Optimal Code Non—coherent, Nd = 5, Repetition Code 2 44 Non—coherent, Nd= 5, Optimal Code I I 0 . 4 6 8 10 12 14 16 18 20 (Eb/) [dB] 10 1O1og ) for 1REC pulse, h 1/2, and M = 4. DBST-CPM 3 (Eb/A/ 10 Figure 2.10: FER vs. 101og (NT = 2) with repetition code and optimal code. Coherent detection with CSI and noncoherent detection without CSI for the QSFC with phase noise with variance u = 0.01. 2-state trellis for repetition code, 4-state trellis for optimal code. continuous fading channel in Figure 2.11. The fading bandwidth is adjusted to BfT and Nd = 2 and Nd = = 0.03 14 are chosen for non-coherent detection. We observe that, different from the QSFC, the performance gain offered by the optimal DBST-CPM code over the repetition code continues to increase for SNRs up to 30 dB. For this fading scenario,gain becomes fixed, i.e., the curves run parallel, only at very high SNR. It can further be seen that the improvement due to the optimal ST code predicted from considering coherent detection is closely realized also for non-coherent detection with appropriately chosen Nd, which confirms the relevance of the conducted code optimization. Of course, a gap in absolute power efficiency between coherent and non-coherent remains for this relatively 58 Chapter 2. Space-Time Coding for CPM 100 .s...:,% %. ,..4, / W.\ : :%. : ‘ ..\\ s: , 4. \\s ‘ \. l0 : ‘ \\ \“ . . ‘.‘ 4. \ . I \ 10 \4 : -2 . 4 . \s:’ 4 W : 4. 4’ \: 4 ‘ 4 :4.. ... .\4. • — Coherent, Repetition Code 4 —e-— Coherent, Optimal Code Non—coherent, Nd = 2, Repetition Code Non—coherent, Nd= 0 , Optimal Code 2 — — — Non—coherent, Nd = 14, Repetition Code — Non—coherent, Nd= 14, Optimal Code — — 0 . ‘...4. 4. — \ I I I I 5 10 15 20 ‘ 25 30 (Eb/.Mj) [dB] 10 101og Figure 2.11: FER vs. 10 log (Eb/) for 1REC pulse, h = 1/2, and M = 4. DBST 10 CPM (NT = 2) with repetition code and optimal code. Coherent detection with CSI and non-coherent detection without CSI for the continuous fading channel with normalized bandwidth BfT = 0.03. 2-state trellis for repetition code, 4-state trellis for optimal code. fast fading environment. We note however that coherent detection with perfect CSI is only an idealized model, which cannot be realized in practice. Comparison with ST-CPM Schemes from the Literature Although the main advantage of the proposed DBST-CPM is its flexibility with respect to the CPM parameters and the number of antennas, it is insightful to compare the power ef ficiency of DBST-CPM with those of less flexible but also non-coherent detectable schemes from the literature for the same/similar bandwidth efficiency. In particular, we consider the ST-CPM schemes devised by Pande, Huh, and Krogmeier [3] (PHK scheme) and Pan 59 Chapter 2. Space-Time Coding for CPM 10 io . 10 -2 * 4 i‘4%’o% *% 4 4 ‘O% %% s % 5 io —e — * * _Non_coherent,Nd=14,OptimalCocle PV, Optimar — PV, Sub-Optimal 10_8 5 :‘ : :::::::::::.:::::::::::::::::::::::..::::::.‘ : :: : : :: ::: :: : : : :: ::::. :: . :: : : . . I I I I 10 15 20 25 (E/.Afo) [dB] 10 101og 4 ‘ Coherent, Optimal Code Non—coherent, Nd= 2, Optimal Code I : : 30 — Figure 2.12: BER vs. 10log (E/.Ni) for DBST-CPM and the PV scheme [2], both with 10 2. DBST-CPM: 1REC pulse, h 1/2, and M 4. PV ST-CPM: 1REC pulse, NT h 1/2, and M 4 (“sub-optimal”) and M 8 (“optimal”). Data rate is 1 bit per symbol duration T in all cases. Non-coherent detection without CSI for the continuous fading channel with normalized bandwidth BfT 0.001. As reference: DBST-CPM and coherent detection with CSI. = = = = = = caldi and Vitetta [2] (PV scheme), which are designed for NT = 2 and full response CPM and its special case CPFSK, respectively. First, we consider the PV scheme for which bit-error rate (BER) results were presented in [2, Figure 1] for a continuous fading channel with BfT NT = 2, NR with M = = 1, 1REC pulse, h 4 and M = = 1/2, and both M = = 0.001 and the parameters 4 and M = 8. The PV schemes 8 were referred to as “optimal” and “suboptimal” in [2], and the data rate is 1 bit per symbol duration T in both cases. In Figure 2.12, we show the BER for the PV scheme and for DBST-CPM with the same parameters but M i.e., DBST-CPM has the same bandwidth efficiency as the PV scheme with M = = 4 only, 4, and 60 Chapter 2. Space-Time Coding for CPM :1::::::: :1::::: : :1::::::: : : .....Non—coherent, 1 d_ BT=0.03(Clarke) 4 F O _.,__ — 10 e — — — Non—coherent, Nd=lO, B,T=O.Ol (Clarke) PHK, N=5, tdT_O 03 (Butterworth) PHK N—S tdT 001 (Butterworth) 10 :1: ::::::.... :,::::. V V :: VVVVV•VV:VVVV•V• V — S 1 I i— Lii V 10 . ‘V V V 106 0 V V V 20 25 V 5 I I 10 15 30 (Eb/.MI) [dB] 10 101og Figure 2.13: BER vs. 10 log o(Eb/.A4) for DBST-CPM and the P11K scheme [3], both 1 with NT = 2. DBST-CPM: 1REC pulse, h = 1/4, and M = 4. P11K ST-CPM: 1REC pulse, h = 1/2, and M = 2. Data rate is 1 bit per symbol duration T in all cases. Non-coherent detection without CSI for the continuous fading channel with normalized bandwidth BfT = fdT 0.01 and BfT = fdT = 0.03 according to Clarke’s model for DBST-CPM and a third order Butterworth spectrum for PHK scheme. Nd = 10 for DBST-CPM corresponds to N = 5 for the PHK scheme. a higher bandwidth efficiency than the PV scheme with M expansion of CPM with M schemes with M = 4 and M = = = 8, due to the bandwidth 8. It can be seen that DBST-CPM outperforms the PV 8 in terms of BER, i.e., it is advantageous both in power and in bandwidth efficiency. It is difficult to compare the detection complexities for DBST CPM and the PV scheme, since the latter employs a “codeword-by-codeword” detection, where a codeword corresponds to an M-ary ST-CPM symbol. As a coarse indicator of complexity, we mention that the number of (branch) metric calculations needed per data symbol is 16 for DBST-CPM, and 4 and 8 for the PV scheme with M = 4 and M = 8, respectively. 61 Chapter 2. Space-Time Coding for CPM Next, we consider the PHK scheme and MSK, i.e., 1REC pulse, M for which results were presented in [3, Figure 5] for NT = 2, NR = = 2 and h = 1/2, 1 and continuous fading. The data rate of this PHK scheme is 1 bit per symbol duration T. In order to achieve the same data rate we use quaternary DBST-CPM. We further choose a 1REC pulse and h = 1/4, whose normalized CPM bandwidth is %T 99 B to the %T 99 B = 1.44, which is reasonably close 1.18 of MSK used in [3]. The spectrum of the fading process in [3] has a third order Butterworth characteristic with 3 dB bandwidth fdT, which is different from the fading spectrum according to Clarke considered in this paper. Still, we compare BER curves from [3, Figure 5] with those for DBST-CPM and the Clarke fading model with BfT = fdT = 0.01 and 0.03, respectively, in Figure 2.13. The curves from [3, Figure 5] with detection parameter N coherent detection with Nd = = 5 are plotted in Figure 2.13, which corresponds to non10 for DBST-CPM. It is interesting to observe that the P11K scheme suffers from a significantly higher error floor as compared to DBST-CPM. This difference in error floor can be attributed to (a) the orthogonal ST-code structure of the PHK scheme, which is more sensitive to channel variations than the diagonal code structure adopted for DBST-CPM, and (b) the superior non-coherent detector developed for DBST-CPM. We note that the error floor is a function of the fading bandwidths BfT and fdT, which are adjusted to the same values in Figure 2.13. The performance difference for lower SNR values could be due to the different fading processes considered. 2.4 Conclusions In this chapter, we have presented and analyzed two ST-CPM coding schemes. In Section 2.2, we proposed a simple OSTBC scheme for CPM. The advocated burst—based approach allows the straightforward combination of any CPM format with ODs. After an appropriate combining at the receiver, the same detection techniques as in case of single—antenna 62 Chapter 2. Space-Time Coding for CPM transmission can be applied. The proposed scheme entails a lower complexity than all previously proposed ST coding schemes for CPM and yields a better performance for the important case of NT = 2 transmit antennas. For NT > 2 transmit antennas OSTBC for CPM suffers from the same rate loss as all ST coding schemes based on ODs. In Section 2.3, we proposed the DBST-CPM scheme for power-efficient transmission over fading channels. The design was inspired by DSTM for linear modulation employing diagonal signal matrices and, similar to DSTM, enables non-coherent detection without CSI. We devised a low-complexity receiver design including branch metrics for reducedstate non-coherent sequence detection of DBST-CPM and different fading channels. To facilitate code selection we derived an upper bound for the FER of DBST-CPM and pro posed an efficient algorithm for finding the optimal DBST-CPM code. Numerical and simulation results showed that the upper bound accurately predicts the performance of DBST-CPM for coherent detection in a QSFC. Similarly, the numerical and simulation re sults showed that the proposed code optimization yields significant improvements in power efficiency for all channel models, and for both coherent and non-coherent detection. 63 Chapter 2. Space-Time Coding for CPM Table 2.1: Pseudo-code for distance spectrum calculation for DBST-CPM. Input: [NT, Nf, Pm, CPM parameters] Generate list of difference sequences y J is the number of difference sequences List of error events (length n) £ = 0 List of error events (length n + 1) £‘ = 0 for(n=1,...,Nf) = 1 (Number of error sequences of length n) . £ . . = = 0 for (i=1,...,I) Select next error sequence e from £ for(j=1,...,J) Extend e by y Calculate , A() if (e is simple and p(s) pmax) if (e can be merged with another entry in £‘) Update A() for the matching entry in £‘ else Add e to £‘ end if end if end for end for end for 64 Chapter 2. Space-Time Coding for CPM Table 2.2: Optimized DBST-CPM for NT code considering an FER of 10—2. [ M h h = = = 4 Gain 2.3 1.6 1REC Optimal Code —3, —1 —1, +3 +1, —3 +3,+1 —3, —3 —1, —1 +1,+3 = Gain 2.0 1.5 +3,+1 h = 1.6 —3, —1 —1, +3 +1, —3 +3,+1 1.7 2 and M = 4. Gain with respect to repetition 2RC Optimal Code —3, —1 —1, +3 +1, —3 +3,+1 —3, —1 —1, +3 +1,—3 Gain 1.2 1.9 3RC Optimal Code —3, —1 —1, +3 +1, —3 +3,+1 —3, —1 —1, +3 +1,—3 +3,+1 +3,+1 —3, —1 —1, +3 —3, —1 —1, +3 +1, —3 +1, —3 2.0 +3,+1 65 Chapter 2. Space-Time Coding for CPM Table 2.3: Optimized DBST-CPM for NT code considering an FER of 10—2. = 1REC M h = = Gain_[ Optimal Code 2 0.7 3 2.1 = h h 8 2.2 —7, —5, —3, —1, Gain —7 —5 —i —3 +i,+5 +3,+1 +5, +3 +7,+7 —7, —7 —5, —5 —3, —i 1, +i,+i +3,+3 +5, +7 +7,+5 —7, —5 —5, —i —3, +5 —1, +1,+3 +3, +7 +5,—3 +7,+1 1.1 2.2 2.2 2 and M = 8. Gain with respect to repetition 2RC Optimal Code —7, —7 —5, —i —3, —5 —1, +7 +i,+i +3,+5 +5, —3 +7,+3 —7, —7 —5, +5 —3,—i —1, +3 +i,—3 +3,+i +5, —5 +7,+7 —7, —7 —5, —5 —3, +7 —i +i,+5 +3, —3 +5,+3 +7,+i Gain 4.0 1.4 3.8 3RC Optimal Code —7, —5 —5, +3 —3,—i —1, +1,+7 +3,+i +5, —3 +7,+5 —7, —7 —5, —i —3,—S 1, +1 +i,+7 +5, —3 +7,+5 —7, —7 —5, —3 —3, +3 —1, —i +3, —5 +7,+7 66 Chapter 2. Space-Time Coding for CPM Table 2.4: Optimized DBST-CPM for NT code considering an FER of 10_2. M h h h 4 = 1 2 Gain 5.0 3 1 3 and M 1REC Optimal Code +1,—3,+1 +3, —1, —3 —3,+1,+3 —1,+3,—1 —3, —3, +3 —1, +3, —1 +i,-i,+i = = = 3.1 +3,+1,—3 —1, —3, +1 +3, —1, 3 +1,+1,+3 —3, +3, —1 = Gain 2.4 4.2 3.0 4. Gain with respect to repetition 2RC Optimal Code —1,—3,+1 +3, —1, —3 +1,+1,+3 —3,+3,—1 —3, —3, —3 —1, —1, —1 +3,+3,+3 —1, —3, +1 +3, —1, —3 —3, +3, —1 67 Chapter 3 Distributed ST-CPM When a network consists of a large number of wireless devices with the ability to relay transmissions, cooperation among these devices has been shown to improve the error per formance and capacity of the wireless system [22]- [60]. In fact, it is possible for cooperative networks to achieve gains in the fading channel equal to those for devices with co-located antennas when nodes are positioned favorably, and the correct relay protocols are used [61]. In distributed relay applications (for example sensor networks) wireless devices are often battery-powered with stringent cost and energy constraints. In this environment, distributed ST codes employing linear modulation can produce a prohibitively large power drain at the linear power amplifier due to their high peak-to-average power ratios (PA PRs) [62]. Therefore, in this chapter we extend the concept of distributed space-time (ST) codes to transmission with continuous phase modulation (CPM) [421. As always, CPM is a natural fit under energy constrained conditions due to its constant-envelope property that enables the use of energy-efficient and inexpensive nonlinear power amplifiers. Node cooperation can take one of two forms: coordinated cooperation, or uncoordinated cooperation [21, 60, 63]. If coordinated cooperation is employed, cooperating nodes know which nodes are participating as source, destination and relay nodes, and standard ST codes optimized for co-located antennas can be used for relaying among the known devices. On the other hand, if uncoordinated transmission is employed the cooperating nodes (source, destination, and relays) are unaware of which nodes are active and participate in the transmission, and ST codes need to be designed correspondingly. 68 Chapter 3. Distributed ST-CPM In this chapter the distributed ST-CPM codes we design are intended for use in a network employing uncoordinated node cooperation. The proposed codes are the product of two components: a ST code matrix (each relay node encodes the same information with the same ST code), and a unique signature vector. We adopt the diagonal blockbased ST-CPM codes proposed in Chapter 2 for the underlying ST code, and we provide appropriate design rules for signature vector construction and efficient numerical methods for generation of signature vector sets. Employing the decode-and-forward (DF) protocol, assuming statistically identical relay-destination fading channels, and time synchronous transmission, the proposed distributed ST-CPM codes are found to provide a diversity order d = min{Ns, NJ when N 3 relay nodes are active and the ST-CPM codes are designed for N co-located antennas. Furthermore, the proposed distributed codes are also shown to incur only small losses in coding gain with respect to co-located antenna systems. To the best of our knowledge, the proposed scheme is the first to present a distributed ST code for general CPM transmission, and thus to demonstrate that and how distributed ST processing for constant envelope signaling can be accomplished. While the proposed distributed ST-CPM scheme has a constant PAPR of one, the PAPR problem of linear modulations is only compounded when ST coding is applied. Thus, in the later portion of the chapter we analyze the energy savings made possible by switching to a CPM based distributed ST code using both the Class AB power amplifier used for linear modulation, and the more energy efficient Class C amplifier. This analysis shows definitively that the distributed ST-CPM scheme offers energy savings. The chapter begins with an introduction to the relay network setup in Section 3.1. Then, in Section 3.2 the proposed distributed ST-CPM scheme is presented, and detection at the destination node is discussed. In Section 3.3, the energy consumption of the pro posed distributed ST-CPM is analyzed and compared with the energy consumption of a 69 Chapter 3. Distributed ST-CPM distributed ST scheme built upon linear modulation. Section 3.4 concludes the chapter. 3.1 Relay Network Setup We consider a network consisting of a (possibly large) number (N + 2) of nodes. During communication between two nodes, i.e. the source and destination node, the other N nodes act as potential relays for the signal transmitted from the source. We label each of the relay nodes n e .N, 1v {1, 2,. . . , N}. We assume that the network employs DF relaying and an error detecting code, for example a cyclic redundancy check (CRC) code [21, 22, 60]. Under these assumptions the active subset of relay nodes, i.e. those that were able to correctly decode the received message, is a priori unknown. More explicitly, we apply an uncoordinated approach in the sense that the source-destination pair has no knowledge of which nodes act as relays, and the relay nodes have no knowledge of the source-destination pair or of which other nodes are participating relay nodes. We assume, however, that the clocks of the nodes are sufficiently synchronized and that the maximal distance between relay nodes satisfies dma,, <<cT, where c is the speed of light and T is the symbol duration, so that all relay signals are received synchronously at the destination node. The sourcerelay and relay-destination channels are modeled as quasi-static frequency-nonselective fading channels, which is an appropriate model for many distributed relay networks such as wireless sensor networks (WSNs) for monitoring, detection, and automation (cf. e.g. [22]- [60] where the same assumptions have been made). Let us now consider the relay step. Due to coding with an N x N ST-CPM code as explained below, signals are organized in vectors of length N. Denoting the transmit signal of relay ii by the vector function s(t) [s,i (t), Sn,2 (t), . . . , Sfl,Arc (t)]T and the channel gain 70 Chapter 3. Distributed ST-CPM Phs 1 Figure 3.1: Two phase transmission in the relay network. to the destination node by h, the received signal at the destination node is given by r(t) = gs(t) (3.1) + n(t), nES where S = ,n 1 {n ,.. npj 2 } 5 . ç V is the a priori unknown subset of active relay nodes of size N 5 4 card{S}. Note that S can change with the active source-destination pair, and between frames of data transmitted between the same source-destination pair. The channel gains g are modelled as for the QSFC (i.e. independently and identically distributed (i.i.d.) zero-mean complex Gaussian random variables with unit variance), and the noise term n(t) 4 [ni(t), n (t),. 2 . . nNC(t)]T is modelled as an independent additive white Gaussian noise (AWGN) vector process with power spectral density 3.2 4. Distributed ST-CPM for Relay Transmission The distributed ST-CPM scheme that we propose consists of two components: an ST CPM code that is common to all network nodes and signature vectors that are assigned 71 Chapter 3. Distributed ST-CPM uniquely to each network node. This structure is inspired by [21], where distributed ST codes for linear modulation were devised. More specifically, if the signature vectors are N x 1 unit-norm vectors ii = [ic[1j,. . . , ,[Nj] e K, n e f, where C denotes the set of all signature vectors, the relay signals are generated as s(t) where p /S(t, a)k, = n e 8, (3.2) N/Ns ensures that, for purposes of a fair comparison, the total transmitted energy in any given symbol period is independent of the number of active nodes, and where S(t, a) is given in (2.30). Because of the block-diagonal properties of S(t, a), signal s(t) maintains the continuous-phase, constant envelope properties after i’, is applied. The resulting signal is given by s(t) = (t)i[1], x 1 J[x (t 2 ,XN(t — (N — — NfT)Ic[2],... . T 1)NfT)kfl[N]] Hence, by design, s(t) is a CPM signal for blocks of Nf consecutive symbols. As for the ST-CPM schemes given in Chapter 2 transitions between blocks should not be regarded as a violation of the CPM property since these are analogous to transitions between frames in CPM-type systems like GSM and Bluetooth. Hence, signature vectors can take the general form = [i[1], ,c[21,. . . , kn[Nc]IT, IIKnI = 1, 1 N. ri (3.4) If, however, the constant-envelope property is desired throughout the entire transmission cycle, “constant-envelope” (ce) signature vectors = ],. 2 [e”[’],e”[ 1 n N, (3.5) 72 Chapter 3. Distributed ST-CPM are preferable. Of course, the unit-norm constraint is satisfied, i.e., = 1. Optimiza tion of the signature vectors is discussed in Section 3.2.2. 3.2.1 Detection of the Distributed ST-CPM Signals T Defining Ks ,. 2 k . . , knS] and g 3 ,. 2 [gni, gn ’s 9 ‘ we can re-write the received signal (3.1) as r(t) where g = 8 + n(t) /,3X(t)Ksg X(t)g + n(t), (3.6) 3 is an N x 1 column vector. We observe that, from the destination /Ksg node’s perspective, distributed ST-CPM is seen as ST-CPM with co-located antennas and an effective channel g. Hence, coherent detection schemes (with estimation of g) and non-coherent detection schemes (without estimation of g) as devised in Chapter 2 are immediately applicable. In particular, complexity for detection (and channel estimation) remains the same as for ST-CPM with co-located antennas. 3.2.2 Optimization of Distributed ST-CPM In this section, we consider the optimization of distributed ST-CPM. To this end, we first derive a suitable performance criterion. Based on this criterion, it is shown that optimization of the ST-CPM code and the signature vectors can be separated. Hence, next a numerical method for the optimization of the signature vector set K is presented. Performance Criteria for Optimization of Distributed ST-CPM As is common for ST transmission with co-located antennas [10] we choose the pairwise error probability (PEP) as the optimization criterion for distributed ST-CPM. Following the method de scribed in [4], the Chernoff bound for the average PEP between two signals x(t) and (t) 73 Chapter 3. Distributed ST-CPM can be derived as ( r(A) P(x(t) where A (t)) ()r(A) (37) (A)) psKVKs, and A(A) and r(A) are the non-zero eigenvalues, and the number of non-zero eigenvalues of matrix A, respectively. The N x N matrix V is given by V = diag{[Li, L ,.. 2 . , Ni} NfT 0 J where L x(t) (t)I dt. 2 — For use as design tools, and in a manner similar to [10], we define 1/r(A) r(A) d r(A) and G (II (A)) (3.8) , as the diversity order and coding gain of the distributed ST-CPM code, respectively. Diversity Order: The maximum diversity order d is achieved when both V and K 3 have full rank. When the number of active users is greater than the signature vector length, N 3 N, the diversity order is given by d = ) 3 r(KVK = N [64], and is guaranteed by proper independent design of the ST-CPM code and the signature vector 3 < N code design is more complicated because the ST-CPM code and set K. When N the signature vectors must be jointly optimized [21]. In this case, the achievable diversity order is d 3 N — (N — ) [64]. However, as for the linear-modulation case studied in 3 N [21], we found that signature vector sets 1C designed assuming N 3 any N , achieving d 3 = = N perform well for 3 for N N 3 <Ne. An important parameter in the optimization of signature vector sets is the number of users that we assume to be active, which we will denote as Na. Once Na has been selected the maximum diversity is unaffected by the true number of active users and is limited to d min{Na, NJ. We shall assume Na = N for the design of all signature set vector sets 74 Chapter 3. Distributed ST-CPM c. Coding Gain: If we assume that the maximum diversity design criterion has been satisfied, i.e. both V and K 5 have full rank, and N 8 N, the coding gain can be re-written as [64] 1/Ne N G = PS (llA(KvKs)) = PS ’ 1 (det{V}det{KsKfl)” (3.9) Equation (3.9) shows that optimizing the distributed ST-CPM code (by minimizing the bound on the maximum PEP in (3.7)), can be achieved by separately optimizing each of the component codes, i.e. the ST-CPM code and the signature vector set K. The design of the ST-CPM code in [4] guarantees that V is of full rank and maximizes det{V}, and therefore, we need only concentrate on the design of the signature vector set 1C. In particular, the pertinent performance parameter given a subset S of active nodes is the signature set coding gain (see (3.9)) 3 K Kfl. 3 det{K (3.10) Before we move on to the actual optimization, it is useful to define the average distri bution loss [21] as (psK.VIv), ) 8 Lave(N (3.11) S,card{S}=Ns where (psK’)’ quantifies the loss in coding gain for distributed ST-CPM with a par ticular subset S of N 3 active nodes compared to ST-CPM with co-located antennas and K () is the number of subsets S e iV. 75 Chapter 3. Distributed ST-CPM Based upon the previous discussion, it follows Signature Vector Set Optimization that we can define the optimum signature set ICt as = argmax{ mm S card{S}=Na }}, 3 {K (3.12) where the optimization is constrained subject to IinI subject to , = 1, 1 n N ],... 2 [ein[hl,e (3.13) ejN]T (3.14) l<n<N for the general set and the constant envelope set, respectively. Note that the cost function 5 is not convex in K K , and thus the above optimization problem may have local minima. 5 We propose simulated annealing in tandem with a gradient search for numerical solu tion of the optimization problem. In particular, similar to a proposed simulated annealing algorithm for continuous spaces in [56, Ch. 10.9] we add a positive, logarithmically dis tributed random variable, proportional to the annealing temperature TA, to the value of our optimization metric K 5 and then use this value to determine which subset K 5 should be adapted. Once this subset is chosen, we employ a simple gradient algorithm for the update. This process is repeated in a number of iterations. While the adaptation in each iteration is not optimal, through simulated annealing the overall system is allowed to slowly converge to the global maximum. We select the simulated annealing algorithm for optimazation of the signature vector sets, and show that the resulting sets provide performance approaching that of co-located antenna, however, any algorithm appropriate for the non-convex, continuous space optimization could be used to generate the signature sets. 76 Chapter 3. Distributed ST-CPM For the general set, the vectors are directly updated and the constraint (3.13) is enforced after the update, as in [21]. The corresponding gradient is given by (assuming 8 is an N x N full-rank matrix) K ‘8= 8 K K* 1 rz I i,-H\ IISVkS) where K is a matrix that contains the complex conjugate of the elements of K . 8 For constant envelope sets we found that intrinsic incorporation of the constraint (3.14) into the search yields best results. Hence, the update is performed on the set s [‘ . . , c/i] of phase vectors q [[1], . , q5,[N]]. The gradient of K 8 with respect to ‘Tg is defined as = where i? vec{Ks}, I 8K 8 81$ = 8 s 8K 81 + K! 8 8’s 8K 8K 84 (3.16) vec{Kfl, and = Ksvec{(Kj’}, = }, 8 (j)diag{k = }, 1 Ksvec{(K) = (—j)diag{I?}. The pseudo-code for the proposed simulated annealing algorithm for solving the opti mization problem in (3.12)-(3.14) is given in Figure 3.2. Initial and final values for the algorithm variables were found by experimentation [56]. The initial constant envelope set is chosen as an harmonic frame with optimized coefficients, cf. [65]. Finally, we note that an alternative to the deterministic generation of signature vector sets is the random selection of signature vectors at each node [21, 66]. This may be desirable in situations where the number of nodes is highly dynamic. We therefore also consider 77 Chapter 3. Distributed ST-CPM the use of random sets whose constraints are equivalent to those for the deterministic general and constant envelope sets, i.e., the random vectors are uniformly distributed on a complex hypersphere [constraint (3.13)] and their elements have a uniform phase distribution [constraint (3.14)], respectively. 3.2.3 Simulation Results In this section, we present simulation results for the proposed distributed ST-CPM codes employing signature sets designed with the algorithm in Figure 3.2 and the random gen eration method, respectively. In the following, we will refer to these sets as deterministic and random sets, respectively. First, we will consider the average distribution loss, Lave [Eq. (3.11)1, and the role that this expression can play as an indicator of the performance of the different signature vector sets. Then, we will evaluate the average bit error rate (BER) for relay communication with distributed ST-CPM. Finally, we compare distributed ST CPM with the linear-modulation scheme from [21]. For space limitations, we restrict ourselves to ST-CPM with N = 2 and signature sets optimized for Na = N = 2. In Figure 3.3, the average distribution losses of deterministic and random sets are shown for N 8 = 2, 3 and 5 active nodes (the acronym “CE” indicates constant envelope sets). The distribution loss for random sets is independent of the number of total nodes because each node randomly generates its own signature vector when it becomes active. The determin istic general sets consistently yield the lowest average distribution loss. Furthermore, Fig ure 3.3 shows that as the number of active nodes, N , is increased the performance losses 8 incurred by enforcing the constant envelope criterion becomes less significant. Random sets appear an efficient alternative for relatively large numbers of nodes. However, we note that results for the average distribution loss may not completely characterize the perfor mance of randomly generated signature sets. More specifically, although the performance 78 Chapter 3. Distributed ST-CPM 1. Initialization: Set i = O,TA = T .t =o 1 , 0 Generate an initial set of N x 1 vectors Gen: ,i are random vectors with IIKnhj2 = 1 CE: i are from an optimized harmonic frame [65] 2. Find worst set Smjfl: Smin = argmin {Gs — TAlog(rand(1))} S card{S}=Na 1’I Smin = min 5 3. Adaptation: Gen: CE: K KSmjn + /LTSmjn min = 4’Smin . 8 T +1 4. Update Signature Set: Gen: ii = CE: kze = I ‘SI 2 , n e Smjn ‘ [et1h1,. . . , ei]] min 8 5. Check Update: Recalculate K . 5 then := ) and goto 2. 6. Update Annealing: If TA > Tf, set TA := (1 ()TA and goto 2, otherwise goto 7. 7. End: i or ice, 1 n N, is the desired set .Cannea1. jf > mm — Gen: general signature set CE: constant envelope signature set = 102, A = 1 10, = 10, T 0 = 102, Tf = 10_6, = 0.7 rand( 1) returns one sample of a [0, 1) uniformly distributed random variable — Figure 3.2: Annealing algorithm for signature set generation. 79 Chapter 3. Distributed ST-CPM o + k 5 1 Annealing Set CE Annealing Set RandomSetCE Random Set Lve(2) 4 rj t)D 0 I 3 ....E.. 2 :_._.La,e(3) >La(5) Z C 0 5 10 15 20 25 30 ‘. 35 40 45 50 N- Figure 3.3: Average distribution losses as a function of the total number of nodes N, and the number of active nodes N 8 = 2, 3, 5. Deterministic signature vector sets optimized for Na = N 2 active nodes and random signature vector sets are considered. ‘CE’ indicates constant envelope sets. of the randomly generated signature sets may be comparable to the performance of the deterministically generated signature sets on average, when transmissions are considered on individual basis random signature sets have a high probability of producing a higher distribution loss than the worst-case distribution loss of a deterministic set. Therefore, randomly generated sets may only be desirable for highly dynamic networks. We now turn to BER results. We assume that all relay nodes have an equal probability of being active and the BER is averaged with respect to the fading gain distribution. As an illustration we adopt the CPM scheme with the parameters M = 4, h = 1/4 and a 1REC phase pulse. The underlying ST-CPM code is given in [4, Table I] for N antennas, resulting in a diversity order d = = 2 co-located 2. Unless stated otherwise, optimal coherent 80 Chapter 3. Distributed ST-CPM detection of ST-CPM is assumed. 101 . . 10_2 ::: io : : : : . H: H HH: H H:H: :: : . H. H. HHH —0— Annealing Set CE nnealing Set —.———. Ra,,doiii Set CE 4— Random Set Colocated Antennas : ———— : : : : :: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : — 5 10 15 (E/.No) [dB] 10 101og 20 25 —, Figure 3.4: Average BER of a distributed ST-CPM code versus 10 1og (Eb/.Afo) for a 10 network with N = 30 nodes and different numbers of active nodes N . Deterministic 8 signature vector sets optimized for Na = N = 2 active nodes and random signature vector sets are considered. ‘CE’ indicates constant envelope sets. The ST-CPM code is optimized for N d 2 with the CPM parameters M = 4, h = 1/4, and a 1REC phase pulse as given in [4, Table I]. First, we only consider the relay phases, i.e., transmission from relay nodes to the destination node. Figure 3.4 shows the average BER vs. Eb/J\fo (Eb = N 8 E ( 2 M) /log denotes the received energy per bit) for the distributed ST-CPM scheme with N = 30. Results for deterministic and random sets are shown. For comparison purposes the results for co-located antennas are also included. This figure illustrates that both signature set designs yield a network BER performance that approaches that of one node with N co-located antennas when N 8 = 2 N. The simulation results also confirm the performance ordering of the different signature set designs given by the distribution loss results shown 81 Chapter 3. Distributed ST-CPM in Figure 3.3. More specifically, the results in Figure 3.3 predict losses for the constant envelope set, the general random set, and the constant envelope random set of 0.6, 1.3, and 3.1 dB with respect to the designed general set for N 8 = 2, and similarly the BER results in Figure 3.4 indicate losses of 0.6, 1.3, and 2.3 dB when Eb/J\Io 25 dB. The single discrepancy may be attributed to the fact that the distribution loss was derived under the assumption of high SNR. Furthermore, while the distributed ST-CPM scheme always maintains a diversity order of d = 8 N when N N, we have found from simulations for various values of N > 2, which cannot be shown due to space constraints, that a diversity order equal to the number of active user d = N 8 is achieved when N 8 <Ne. Next, we consider two phase transmission in a distributed network. In the first phase, a relay node conserves energy by listening for transmission from the source node with probability pj. In the second phase, nodes that were listening in the first phase and able to correctly decode the source’s transmission retransmit to the destination node (i.e. the number of active nodes (N ) in the second phase is random). The average received energy 8 per bit at each listening relay node is assumed to equal E. Figure 3.5 shows the results for a two phase network composed of N probability P1 = = 30 nodes. Nodes in this network listen with 1/3, 1/5, and 1/7. We observe that the signature sets provide very similar performances, which closely approach that for the co-located antenna system. For example, for pj = 1/3 and P1 1/5 the respective BER curves run parallel, i.e. full diversity is achieved by the distributed system, and the losses are only 0.5, and 1.1 dB with respect to a co-located antenna system. The above example considered transmission with a spectral efficiency of 2/3 bit/s/Hz, which is likely sufficient for many network applications with low-power transceivers. If higher spectral efficiencies are desired, the proper choice of the parameters M, h, and pulse shape q(t) is critical for ST-CPM, since, different from linear modulation, the signal 82 Chapter 3. Distributed ST-CPM 10_i — 0 — — Deterministic Set CE Set Co—located Antennas 1 02 1’ 1 1 5 10 15 20 (Eb/.N) [dB] 10 1Olog Figure 3.5: Average BER of a distributed ST-CPM code versus 10 1og ) for a net 3 (Eb/.N 10 work with N 30 nodes where the number of active nodes N 8 depends on the probability p that any given node is listening for the source’s transmission. Deterministic signature vector sets optimized for Na = N = 2 active nodes and random signature vector sets are considered. ‘CE’ indicates constant envelope sets. The ST-CPM code is optimized for N = d = 2 with the CPM parameters M 4, h = 1/4, and a 1REC phase pulse as given in [4, Table I]. bandwidth increases with M. Favorable parameter combinations are given in [67, Tables 5.2-5.4]. At the same time, the PAPR advantage of ST-CPM over linear ST modulation increases with larger spectral efficiency, which renders distributed ST-CPM an interesting solution also for this scenario. 83 Chapter 3. Distributed ST-CPM 3.3 Energy Consumption of Distributed ST Coding Methods In this section, we analyze the energy savings made possible if the modulation technique underlying a distributed ST coding scheme is switched from linear modulation to CPM. The energy savings that are offered by CPM are savings of energy in the hardware of the device; the constant-envelope property of CPM guarantees a PAPR of one and allows for the use of non-linear, energy-efficient components. Typically, the performance of similar communication schemes is compared with respect to the received radiant energy. If, how ever, we wish to perform a fair comparison of linear modulation (LM) schemes with CPM schemes, we must perform this comparison with respect to both the energy that is radi ated and the energy that is consumed by device hardware. Indeed, recently, some effort has been made to evaluate and compare schemes based upon both transmitted and circuit energy usage [68]- [71]. These efforts have taken two different approaches: analysis of the power consumption of the entire transceiver [68], and analysis of the power consumption of a specific element of the transceiver [69]-[71]. Cui et al. [68] adopted the first approach and analyzed the total energy consumption of a transmitter and receiver for coded and uncoded M-ary Quadrature Amplitude Modulation (MQAM) and M-ary Frequency-Shift Keying (MFSK) systems in order to minimize overall energy consumption by optimizing constellation size and transmission time. In this case, synthesizing the entire transceiver becomes a concern; state-of-the art components can be selected from the literature, how ever their inter-operability cannot be guaranteed. Therefore, Li-Chung and Krogmeier [69], Liang et al. [70], and Rapp [71] chose to study the energy consumption of a single element of the transceiver - the power amplifier, which is one of the largest consumers of energy in the transmitter. Practical power amplifiers have non-linear characteristics (resulting in 84 Chapter 3. Distributed ST-CPM signal distortion) and, depending on classification, can consume varying amounts of en ergy in relation to the required transmitted power. The authors of these works compared the energy consumption of LM and CPM schemes in a traditional communication context (single transmitter, single receiver, adjacent channel interference, and an additive white Gaussian noise (AWGN) channel). In addition, since the publication of these works power amplifiers with a higher degree of linearity and a lower energy consumption have become available. In this section, we study the energy consumption of the power amplifier for the dis tributed ST coding scheme proposed earlier in the chapter, and a distributed ST coding scheme built upon linear modulation (distributed ST-LM) [21]. We perform a detailed study of the performance of the distributed schemes in the context of an ad-hoc sensor network, using state-of-the-art power amplifier models, and a channel model appropriate for a wireless sensor network. These performance comparisons quantitatively show that distributed ST-CPM offers significant performance gains over distributed ST-LM based schemes for a variety of power amplifier implementations. 3.3.1 Distributed ST Coding Overview In this section, we briefly overview the distributed ST-LM coding scheme [21] that we use for comparison. Then we introduce the power amplifier characteristics relevant to the distributed ST-LM, and distributed ST-CPM coding schemes. We assume the same relay network as outlined in Section 3.1. Distributed ST-LM Code The distributed ST-LM [21] and ST-CPM [72] codes con sidered here have very similar constructions. The distributed ST-LM code also consists of a ST matrix containing the information from the source node, and a signature vector unique to the individual relay node, n e 1V. Active relay nodes employing the distributed 85 Chapter 3. Distributed ST-CPM N symbol intervals ST-LM code transmit the following signal in successive NB s[k] where s[kj [k] 2 [s,i[k]s, n é 1 II are unit-norm (3.17) n é S, = s,N[kfiT, k normalization constant and B[k] 2 e Z is a discrete time index, PS N is a e B is an NB x N matrix. The signature vectors, i E , denotes the set of signature 1 vectors of length N where vectors. The code B is normalized such that 6{BH[kjB[k]} = (NB/N)IN. Thus, the average energy transmitted per node and symbol interval is E{s[k]s[k]}/NB = 1. After the signal s[k] is generated it is fed into a root raised cosine filter with roll-off factor ci (we assume c = 0.5) to limit the signal bandwidth. This filtered signal is input into a gain unit and multiplied by a factor, ‘y, to give the signal an average power of Pm and then fed into the power amplifier. After amplification the signal is perturbed by fading and AWGN. The filtered, the amplified, and the received signals are given by 00 NB s[kf(t s(t) — (kNB + i — 1)T), (3.18) k=—oo i=1 s(t) , ; 1 7s(t)D = r(t) (gnSnA(t)) (3.19) (3.20) + n(t), nES respectively. Here, T is the symbol duration, F(.) is an amplification function that is dependent upon the power amplifier (described in Section 3.3.2), f(t) denotes the impulse response of the root raised cosine filter, the channel gains 9n are modelled as independently and identically distributed (i.i.d.) zero-mean complex Gaussian random variables with unit variance, and the noise term n(t) is modelled as a zero mean AWGN process with Note that the normalization constant has been modified from [21, see Eq. 2 comparison of power consumption in the power amplifier. (1)] to allow for fair 86 Chapter 3. Distributed ST-CPM power spectral density .N. The received signal is filtered by another root raised cosine filter (matched to the transmit filter) and sampled. Maximum-likelihood decoding for the underlying ST code is used to decide on the transmit symbols (see [21] for details). Distributed ST-CPM Code The details of the distributed ST-CPM scheme are given 8 in Section 3.2. The ‘constant envelope’ signature set is employed. When E = 1, (i.e the energy per symbol is set to one) the average transmitted energy per node and symbol interval is f{fNfT s(t)sfl(t)dt}/Nf 1. The CPM signal s(t) given in (3.2) is input into a gain unit to give the signal an average power of s(t) before amplification. Thus, the amplified signal, given by the vector (t), s, 1 [s, (t),... s,z(t)]” and the received signal are given by 2 s,(t) = F(I7s,(t)I)s,(t), r(t) (gn(t)) + n(t), 1 < i < N, (3.21) (3.22) nE.S respectively, and n(t) 3.3.2 [ni(t), n (t),... 2 , flN(t)]. Power Amplifier Modeling The study of CPM for low power applications is usually motivated by the ability to use high efficiency, non-linear Class C amplifiers instead of the lower efficiency, highly linear Class A, or AB amplifiers that are typically used for linear modulations. However, the performance of a power amplifier can not be characterized by one parameter. The efficiency of the power amplifier is completely dependant upon its operating point (see Section 1.2.2 for more details). Therefore, to get a true measure of the energy consumption savings that a switch to a CPM based scheme will yield from an efficiency perspective we need to analyze the power amplifier over its entire operating range. For this purpose, in this work 87 Chapter 3. Distributed ST-CPM we consider a low power Class AB power amplifier designed for mobile wireless terminals using the IEEE 802.lla and 802.lln standards and utilizing a low supply voltage [5], and a low power Class C amplifier [6]. The transfer characteristics of these amplifiers are shown in Figure 3.6 (a), [51 and Figure 3.7 [6]. These characteristics include drain efficiency power added efficiency (PAE), output power (P ), dc power supplied to the power 0 amplifier (Pdc), and power gain (P 0 — Pm (dB)) all plotted with respect to input power. For both power amplifiers shown in these figures drain efficiency and power added efficiency are functions of input power. In fact, drain efficiency values vary from 0 Class AB power amplifier and from 5 — — 24% for the 56% for the Class C amplifer. Amplifier linearity also motivates the study of the power amplifier over its entire op erating range. Obviously, the Class C amplifier operates primarily as a non-linear device (although it may have a region of linear operation at low power, see Figure 3.7), however, the Class AB amplifier also has a region of non-linear operation (see Figure 3.6). Non linear amplification causes signal distortion and bandwith expansion for linear modulations. Although these effects do not render operation in these regions impossible, performance losses due to non-linear amplification of a linear signal often mean that power amplifiers employ a back-off region in which they do not operate. These problems are compounded for distributed ST codes employing linear modulations because signal multiplexing leads to large values of PAPR. Distributed ST-LM schemes can compensate for large PAPR values by using a more linear power amplifier (increased energy cost) or by employing a larger back-off region (reducing the maximum output power of the power amplifer resulting in a smaller region of coverage). Employing CPM avoids the energy consumption/coverage range tradeoff. Thus, due to the dependence of the efficiency and linearity of the power amplifier upon the operating point of the power amplifier we study of the performance of the amplifier 88 Chapter 3. Distributed ST-CPM —5 0 Pr, (dBm) -4 Figure 3.6: Drain efficiency, i, (%), power added efficiency, PAE, (%), output power, P ,,t, 0 (dBm), dc power supplying the power amplifier, Pdc, (dBm), and power gain output power minus input power (dB) vs. input power for the Class AB power amplifier designed by Cans et al. [5]. - over its entire transfer characteristic. In general form, the input signal (that determines the voltage/power of the power amplifier output) is given by v(t) 4(t) cos(2irft + Oi,(t)), where Vrn(t) is the non-negative envelope of the input signal, (3.23) f is the carrier frequency, and Orn (t) is the phase of the input signal. The resulting RF output of the power amplifier is given by (t) 0 v .F(V(t)) cos(2irft + O (t)), 1 (3.24) where the transformation F(.) is dependent upon the structure and properties of the par- 89 Chapter 3. Distributed ST-CPM ticular power amplifier, and P(t) = , and P 2 (V(t)) (t) 0 = .F(14(t)) (P 0 as a function of P k, independent of time, is shown for the Class AB and Class C power amplifiers in 1 Figs. 3.6 and 3.7, respectively). We note that the power amplifiers used in this chapter, from the recent references [5, 6], cause only amplitude distortion in contrast to the power amplifiers used in [69] and [71] which cause both phase and amplitude distortion. -e -e 0 C G) 0 —14 —12 (dBm) —* Figure 3.7: Drain efficiency, i, (%), power added efficiency, PAE, (%), output power, P t, 0 (dBm), dc power supplying the power amplifier, Pdc, (dBm), and power gain output power minus input power (dB) vs. input power for the Class C power amplifier designed by Cao et at. [6]. - 3.3.3 Energy Consumption Analysis When comparing different communication schemes it is conventional to use Eb/J\fo as a performance metric, where Eb is the received energy per bit. However, in applications where device lifetime is an important consideration (e.g. wireless sensor networks) we seek 90 Chapter 3. Distributed ST-CPM a performance metric that includes both the energy that is radiated by a device, and the energy that is consumed by the device’s hardware. In this section, we will investigate one previously proposed metric (total power amplifier energy) and use it as a springboard to propose a new, more generic performance metric (transmission distance). Total Energy To provide a performance indicator that encompassed both transmitted energy and energy consumed by hardware Liang et al. [70] proposed total energy per transmitted bit (where total energy refers to the total energy used by the power amplifier), which is given by — — P(Pcic+Pin) (1 + (1 0 P E+E where Eb’ — PAE)Pd/P t 0 ) Rb (3.25) nfl/Rb is the transmitted energy per bit, E denotes the energy that is consumed in the amplifier in order to transmit a bit with energy Eb’, and Rb denotes the bit rate. The authors of [69]- [71] evaluate the performance of their communication schemes using the ratio of total energy E to total losses NL, where NL includes path loss, and the noise power spectral density .M. Thus, the ratio Eb’ /NL is equivalent to the received signalto-noise ratio Eb/JV. The ratio Et/NL is generated using a two step process. First, bit error rate (BER) curves are generated for a range of values of total loss NL and over the operating range of the amplifier (P). Then, using these curves values of maximum allowable total loss NL are found for given input powers P and a target BER. Unlike g. Thus, inherent in each 1 Eb/No, the resulting values of E/N. are dependent upon P value of Et/NL is information pertaining to the input/output characteristic of the power 91 Chapter 3. Distributed ST-CPM amplifier and a strict limitation on transmission loss. A comparison of different power amplifiers is hampered because information regarding the efficiency of the amplifier (i.e., radiated energy Eb’ vs. circuit energy E) and the total loss NL is obscured because of the ratio form of this metric. Therefore, in the next section, we introduce a new performance metric based upon transmission distance. Transmission Distance In order to determine the maximum possible transmission distance of the communication scheme, we first look to the minimum permissible received power allowable for a targeted BER, which is characterized by the receiver sensitivity. The required receiver sensitivity is given by Preq(BER, P) = .IV + NF + 101og (B) + Eb’(Pjfl) 10 — NL(BER, Pm) + Rb (dB), (3.26) where A’, NF, and B are the thermal noise power for a 1 Hz noise equivalent bandwidth (-174 dBm), the receiver noise figure, and the noise equivalent bandwidth, respectively. As previously mentioned Eb’ is the energy at the output of the power amplifier, and NL is the total system loss (path loss, and noise power spectral density). If the power ampli fier transmits with energy Eb’ and the receiver has a sensitivity Preq(BER, P) then the maximum loss the system can tolerate while maintaining a given BER is Lmax(BER) n) + Rb 1 Eb’(P = — Preq(BER, P) + C (dB), NF + C (dB), NL(max)(BER, Pin) — — (3.27) where G includes any gains and losses generated by the transmitter or receiver, and NL(max) is the signal loss allowable in order to achieve a given BER at a set input power to the power amplifier. Attenuation during transmission is given by the general path loss model 92 Chapter 3. Distributed ST-CPM [73] where PL(do) = 20 log () PL iOn log )+X 0 + PL(d (dB), (3.28) (i) is the path loss at a reference distance d 0 that is in the far field of the transmitting antenna (we assume a small antenna and a value of d 0 = 1 m [73]), and )., n, and X are the wavelength of the transmitted signal, the path loss exponent, and a log-normal fading shadowing term given by a zero mean Gaussian random variable. Therefore, the maximum allowable path loss is a function of BER and power amplifier input power, and is given by PLmax(BER) = Lmax(BER) (3.29) (dB). Thus, we can upper bound the transmission distance for a target BER at a given input power by dmax(BER, Pin) 3.3.4 10 (B)—PL(do)—X O log 1 (‘NL(max) (EER,Pifl)+G—NT —NF— b0’ i0 0 d ‘ 1 (dB). (3.30) Simulations In this section, we compare the performance of the distributed ST-LM and distributed ST CPM schemes outlined in Sections 3.3.1. These distributed ST schemes employ different classes of state-of-the art power amplifiers as described in Section 3.3.2. The performance comparisons are performed using BER and the maximum transmission distance metric detailed in Section 3.3.3. We assume that the network we employ is populated by N = 30 potential relay nodes, that all relay nodes have an equal probability of being active, and that BER is averaged with respect to fading gain distribution. The ST codes are designed for a signature vector 93 Chapter 3. Distributed ST-CPM length of N = 2. The distributed ST-LM scheme uses BPSK modulation, Alamouti’s ST block-code (STBC), and a signature set generated using a gradient search [211. The normalized bandwidth of the BPSK signal after it has passed through the root raised cosine filter is BT = 1.5. To obtain the same data rate for the distributed ST-CPM scheme, the CPM parameters are chosen as M = 4, h 9 %T 9 has a normalized bandwidth of B = = 1/4, and a 1REC phase pulse was used, which 1.54. The underlying ST-CPM code is given in Table 2.1. 100 .,........, ............, ‘Nz3d.Bm I lOl .::::::::.: iO . . : . . H NL =—13 108 Ps,., (dBm) —* Figure 3.8: BER performance vs. input power Pm (dBm) of the distributed ST-LM code for different values of total loss (NL). Class C amplifier [6]. BER Figure 3.8 shows the average BER performance vs. -, ,P amplifier input power 1 (dBm) of the distributed ST-LM coding scheme for different values of total loss (NL) when 3 the Class C amplifier is employed [6]. For this example, N = 5 of the 30 potential relay nodes are active in any given transmission. The curves shown in Figure 3.8 are convex in 94 Chapter 3. Distributed ST-CPM shape. Initially, increasing the input power has the expected effect of reducing the incidence of bit errors, however, continuing to increase the input power towards the maximum operating point of the amplifier sees the number of bit errors increase once again. The increase in bit errors occurs because the amplifier operates as a non-linear device at high values of input power, and non-linear amplification causes signal distortion and bandwidth expansion for schemes based upon linear modulation. Increasing the size of the distributed ST-LM block code, B, and the length of the signature vector, k, has the effect of increasing the PAPR of the resulting signal, 8(t), and thereby lowering the point at which the BER performance begins to degrade. In contrast, while the performance of the ST-CPM scheme at low input power resembles that of the ST-LM scheme, at high input power and for BERs greater than i0 the BER of the ST-CPM remains constant rather than increasing as the ST-LM scheme does. Finally, we note that the results for the distributed ST-LM employing a Class AB amplifier are similar in shape to those shown in Figure 3.8, with a less pronounced BER degradation near the amplifier’s maximum operating point. Transmission Distance m which gives PL(d ) 0 = We assume operation in the ISM band at 2.4 GHz and d 0 40.05 dB. We set G = 20.4 dB and NF = = 1 19.0 dB as specified by [74], which details a receiver front-end design for wireless sensor networks. Values of the path loss exponent, n, are dependent upon the environment in which the network operates. In an office environment the value of ri can vary from ri value of X 47 can vary from X = 3.0 to X = = 1.9 to n 14.1 dB [73]. We select n = 6.3 [75], and the = 2.5 and X 3.0 dB for the results shown here. Following the IEEE 802.11 standard, we assume a symbol duration of 4 its. We note that any change in the parameters selected here will change the margin of performance improvement from one scheme to another but not the relative performance ordering. 95 Chapter 3. Distributed ST-CPM O 10 20 30 40 50 60 70 80 90 100 Distance (m) Figure 3.9: Total energy (nJ) per active node, per symbol vs. maximum transmission distance (m) to achieve a BER of i0 for a distributed ST-LM scheme (WIN’) and a 3 = 2, 3, and distributed ST-CPM scheme (‘CPM’). The number of active nodes includes N 5. A Class AB amplifier [5] is employed. First, we consider the upper bound on transmission distance (m) vs. total energy consumption (nJ) per symbol in order to achieve a BER of i0. Results for the Class AB power amplifier are shown in Figure 3.9, and for the Class C power amplifier in Figure 3.10. Results for the distributed ST-LM scheme are denoted ‘UN’ and results for the distributed 8 ST-CPM coding scheme are denoted ‘CPM’. Curves for N = 2, N 3 = 3 3, and N = 5 active nodes are shown. Note that for the purpose of comparing the results of a differing number of active nodes the total energy consumption shown in the following figures is per active node, however, the corresponding transmission distances reflect the total energy transmitted by all active nodes (i.e. the results for N 3 energy consumption than those for N 3 = = 5 have a factor 5/2 higher total 2). Figures 3.9 and 3.10 clearly illustrate the negative effects of operating the distributed ST-LM scheme in the non-linear region of the 96 Chapter 3. Distributed ST-CPM 5 10 15 20 25 30 35 40 Distance (m) Figure 3.10: Total energy (nJ) per active node, per symbol vs. maximum transmission distance (m) to achieve a BER of 1O for a distributed ST-LM scheme (‘UN’) and a 3 = 2, 3, and distributed ST-CPM scheme (‘CPM’). The number of active nodes includes N employed. is Class amplifier A [6] C 5. amplifier. After an initial expansion in the range of coverage of the distributed ST-LM scheme, the coverage range begins to shrink with increasing transmit energy. It should be noted that although the performance loss is worse for the less linear Class C amplifier the highly linear Class AB amplifier also suffers a performance loss. In Figure 3.10, we see that the performance of the distributed ST-LM scheme in the saturation range of the amplifier actually worsens as the number of active nodes increases. This performance loss occurs because each of the active nodes is transmitting and amplifying a unique signal (due to the use of the signature vector). Therefore, as the number of active nodes increases so too does the likelihood that one or more of the active nodes will transmit a signal with a high 3 unevenly PAPR. At the receiver the resulting signal, which is the summation of the N amplified signals, suffers the effects of both magnitude and phase distortion for which the 97 Chapter 3. Distributed ST-CPM 90 80 70 60 50 40 30 20 10 0 10 20 30 40 50 60 Distance (m) Figure 3.11: Total energy (nJ) per active node, per symbol vs. maximum transmission distance (m) for N 3 = 5 active nodes and for a distributed ST-LM scheme (‘UN’) and a distributed ST-CPM scheme (‘CPM’). Results are shown for BERs of 102, i0, and iO. A Class C amplifier [6] is employed. coherent detection scheme (using only information about the channel and the signature vectors) is unable to correct. In contrast, the performance of the distributed ST-CPM scheme does not deteriorate in the saturation region of either of the power amplifiers. More specifically, the results for the Class AB power amplifier shown in Figure 3.9 indicate that the CPM based scheme outperforms the distributed ST-LM scheme when the power amplifier is operated at mid to high power levels. In fact, the CPM based scheme increases the range of the distributed ST coding scheme by 1.3 m (2.6% of total range), 10.8 m (15.4%), and 18.5 m (19.7%) for N 8 = 2,3, and 5, respectively. When the power amplifier is operated at low power the linear based scheme offers a slight performance 98 Chapter 3. Distributed ST-CPM improvement over the CPM based scheme. However, in this power range the CPM based scheme requires minimal additional energy to provide comparable performance, i.e. at most 6.4 nJ, 2.0 nJ, and 0.4 nJ per symbol for N 3 = 2, 3, and 5 active nodes, respectively. Next, we consider the performance of the Class C power amplifier shown in Figure 3.10. Using the Class C power amplifier, the CPM based scheme extends the range of the dis tributed ST coding scheme by 0.9 m (4.8% of total range), 4.9 m (18.5%), and 8.4 m (23.7%) for N 3 2, 3, and 5, respectively. In this case, the distributed ST-LM scheme out 3 performs the CPM based scheme at low power only for N 2 and not at all for N 3 3 and 5. This single performance gap can be closed by and addition of 10.0 nJ per symbol to the CPM based scheme. As a final note on Figs. 3.9 and 3.10, we observe that while recognizing that the Class AB and Class C amplifiers used in this work have been designed for different purposes, the larger transmission distances made possible by selecting the Class AB power amplifier come at the cost of a large increase in energy consumption. Finally, we consider the performance of the ST-LM and ST-CPM schemes for different 3 BERs employing the Class C amplifier and N 5 active nodes. Figure 3.11 shows the performance of both schemes for average BERs of 102, 1O, and iO. The CPM scheme offers energy savings of 18.8 nJ, 10.0 nJ, and 23.2 nJ per symbol at the maximum operating range of the linear based scheme for BERs of 10_2, i0, and iO, respectively. In addition, the CPM based scheme increases the range of the distributed ST coding scheme by 6.0 m (10.7% of total range), 8.4 m (23.7%), and 9.6 m (43.8%) for BERS of 102, iO, and io—, respectively. 3.4 Conclusions In this chapter, we have proposed a distributed ST-CPM code that enables uncoordinated node cooperation in wireless networks together with energy-efficient CPM transmission. 99 Chapter 3. Distributed ST-CPM The devised distributed ST-CPM scheme is a combination of the diagonal ST-CPM code proposed in Chapter 2, which is shared by all nodes and signature vectors that are uniquely assigned to nodes. A numerical method for the optimization of signature vectors sets has been developed. Applying optimized signature vectors, the performance of the proposed distributed ST-CPM scheme is close to that achievable with co-located antennas. Reduced energy consumption is the primary motivation for selecting a CPM based scheme. Therefore, in the second portion of this chapter, we investigated the energy con sumption of a distributed ST-LM scheme and the proposed distributed ST-CPM schemes when these schemes employ practical non-linear Class AB and Class C amplifiers. The distributed ST schemes were compared using the total energy (radiated and used in hard ware) required to supply a target BER at a maximum transmission distance. For a relay network composed of N = 30 possible relay nodes, the comparisons showed that the linear based scheme outperforms the CPM based scheme when the power amplifiers are operated at low power, but that at low power the performance gap can be closed by the addition of a very small amount of energy (0 to 10.0 nJ per symbol for the relay configurations con sidered here). At high power the CPM based scheme offers significant energy savings, and extended coverage for both types of power amplifiers (from 2.6% to 43.8%). Performance . 3 gains were shown to increase with the number of active relay nodes N The considerable energy savings and extended coverage range provided by the proposed distributed ST-CPM coding make this scheme an excellent candidate for application in ad hoc networks, such as sensor networks. 100 Chapter 4 Concatenated Coding for Space—Time Coding with Continuous Phase Modulation Since Shannon published his landmark paper [76] placing an upper limit on channel ca pacity information and coding theorists have sought to find codes that will approach the Shannon limit. In 1966, Forney proposed concatenating codes together, an idea that pro duced codes which reduced the bit error rate (BER) exponentially, whilst only increasing the decoding complexity algebraically. The next innovation in the field of concatenated codes was the Turbo code, which used parallel concatenation and an interleaver. The interleaver further reduced error rate by negating the effects of fading over consecutive sequences of data. These systems could employ iterative decoding, which involved the ex change of soft information about the transmitted bits, so that each decoder could improve on the soft bit estimates with each exchange of information. As a result Turbo codes pro duced practical systems that perform close to the Shannon limit. In [77], Benedetto et al. showed that serially concatenated systems could provide performance results equal, and in some cases superior to those achievable with Turbo codes. Serially concatenated codes can sequentially combine coding (as an outer element) and modulation (as an inner element). If the inner encoder is recursive in nature then increasing the length of the interleaver improves the performance of the concatenated code (yielding an interleaver gain). 101 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation In this chapter, we investigate a serially concatenated system employing space—time (ST) continuous phase modulation (CPM) as the inner code, and a class of simple block codes called double parity check (DPC) codes [24] as the outer code. We are motivated in this investigation by the recursive nature of CPM that makes it an excellent fit for a serially concatenated decoding scheme, and by the energy efficiency offered by ST—CPM. We have opted to pair ST-CPM with the DPC class of codes because the DPC codes have a low decoding complexity, and have been shown to enable performance approaching capacity when combined with differential phase-shift keying (DPSK). We study the performance of the serially concatenated ST-CPM system using two different channel models. First, we look at the additive white Gaussian noise (AWGN) channel model traditionally used to study the performance of concatenated codes. Then, in order to further motivate of the selection of ST—CPM as the inner encoding element we study the performance of the concatenated scheme over the quasi-static fading channel (QSFC). Serially concatenated systems that are built upon single antenna CPM have been in vestigated by a number of research groups, for example [7], [78] and [79]. In most instances these systems employ a convolutional code as the inner code together with a fairly simple CPM scheme for the outer code. Additionally, serially concatenated ST—CPM systems have received some study. Zhang and Fitz [8] proposed an adaptive soft-output demod ulator for ST coded CPM that performed joint channel estimation and data detection. They examined the performance of this demodulator in an interleaved ST—CPM system to evaluate the impact of iterative decoding on channel estimation. Their iterative system consisted of a convolutional outer code and a CPM delay diversity scheme for the inner code. Subsequently, Bokolamulla and Aulin [9] designed an optimum symbol-by-symbol iterative detector for serially concatenated ST—CPM. Their system employs previously de signed full rank ST—CPM codes and uses a frequency offset to ensure orthogonality. The 102 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation frequency offsets introduce bandwidth expansion and are the result of an exhaustive search possible only for fast fading channels. Furthermore, Gabrowska et al. [23] have proposed a serially concatenated ST—CPM code for which the outer code is once again a convolutional code. The code has rate 1, and is designed such that the NT encoded sequences at the output of the convolutional encoder are the sequences that are modulated and transmit ted over each of the NT transmit antenna. Orthogonality is ensured by designing the NT encoded and interleaved signals to be independent by employing a Gram—Schmidt linear decomposition of the CPM waveforms. Using this technique the complexity of the receiver is increased because the CPM waveform is approximated by L(M —1) +1 linear waveforms. In this chapter, we investigate serially concatenated ST—CPM codes that maintain the constant-envelope properties that are at the heart of the energy savings offered by CPM. We will employ EXIT charts to pair CPM with a class of parity check block codes called Double Parity Check (DPC) codes, which were originally designed for use with differential-phase shift keying (DPSK) [24]. The DPC class of codes are an excellent companion code for ST—CPM as they have a low computational cost (minimizing overall energy consumption) and yet provide performance that is close to capacity. 4.1 Concatenated Coded Transmission System In this section, we briefly overview the structure and operation of a concatenated code. A block diagram of the serial concatenated encoder employed in this chapter is shown in Figure 4.1. The outer DPC encoder receives at its input the binary bits u. These bits are processed by the outer DPC encoder into the bit sequence c. The encoded bits c are input to an interleaver and are output as the bit sequence The interleaver bits are input to the ST—CPM inner encoder, which converts the bit sequence to the symbol sequence a and outputs the CPM waveform S(t,a) [see Section 2.30 for details]. As in Section 2.30, 103 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation u DPC Encoder c Interleaver ST-CPM t 1 c S(t, a) Encoder Figure 4.1: Block diagram of a serially concatenated transmission system. we assume that the ST-CPM system has NT transmit antennas and NR receive antennas. A block diagram of the iterative decoder is shown in Figure 4.2. The ST—CPM inner decoder has two inputs: the received signal r(t), and the a priori information generated by the outer DPC decoder. The received signal is given by Eq. ( 2.2), which is repeated here for clarity, r(t) = G(t)S(t, a) + n(t), 0 (4.1) t <NTNfT assuming the QSFC outlined in Section 2.1. The noise term n(t) is a vector consisting of NR independent zero mean AWGN processes with power spectral density The filtered received signal for D receive filters is given by R[nj = (D) (2) (1) r [nj 2(l)r[flj1 r r [n] r 2(2)1[ThJ1 r 1 1 (D) 2 r (1) rN1nJ (2)i rNRImJ ... [n] (4.2) (D) rNR ‘n where the elements r[n] of R[nj are given in (2.31). During the first iteration the inner decoder only uses the received signal because no a priori priori information is available from the outer decoder. For every other iteration the a bit information received from the outer encoder is converted into a priori information and used in conjunction with the received signal to generate the a probability (APP) of the bit sequence symbol posteriori Before the APPs are passed to the de-interleaver and then to the outer decoder, any a priori information used to generate these probabilities must be removed. If the a priori information generated by the outer encoder is included 104 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation Figure 4.2: Block diagram of a serially concatenated transmission system. in the bit probability information supplied to the outer encoder incorrect bit decisions may be reinforced causing a complete failure of the iterative decoder. Once the a priori information has been removed from the APP, the resulting extrinsic information, ACPMe S passed to the de-interleaver. The de-interleaved extrinsic information becomes the a priori input to the outer decoder, XDPCa• The outer encoder processes the a priori sequence The extrinsic information sequence ADPCa and outputs the extrinsic bit sequence ADPCa can either be re-interleaved and used in another iteration cycle, or combined with the a priori information sequence ACPMC ADPCe to produce hard decisions on the transmitted bit sequence. Having outlined the structure and operation of the serially concatenated ST—CPM system, we now overview how the information is exchanged and some mathematical tools for generating this information. A compact means of communicating both the decisions and the reliability of the decisions is the log likelihood ratio (LLR) given by L(u) log ((u p(u = = OI(inPuts))) 1I(inputs)) (4.3) where inputs refers to all inputs to the inner or outer decoder. Following the methods used in [24] we treat the LLR generated by one decoder as a priori information at the input 105 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation of the subsequent decoder. In the case of the ST—CPM decoder the LLR information is treated as a priori information about the encoded symbol and is used in conjunction with the information received over the channel (see Section 4.1.3 for more details). In the case of the DPC decoder the LLR information is the only input (see 4.1.1 for more details). Processing the LLR values requires the decoding units to generate the LLR of the modulo-2 addition of two information bits. This operation is called the boxplus and is de noted by the W notation. Using the u[i] to denote a generic information bit, the probability of the modulo-2 addition of two information bits is given by 1) + (1 p(u[i] = 1)p(u[k] where we can calculate p(u[iJ = 1) from (4.3) as p(u[i] p(u[ij u[k] 0) = = — p(u[i] = = 1) 1))(1 — p(u[k] = (lfJ). = 1)) (4.4) Using the above the boxplus operation is defined by L(u[i]) L(u[i] L(u[kj) = log ( n[k]) 1+ eL(u[i])+JtI]) eL(utul) + eLk}))’ (4.5) where the following boxplus operations yield L(u[i]) W oo L(u[il) L(u[i]) — 0 = L(’u[i]), (4.6) = —L(u[ij), (4.7) = 0. (4.8) To minimize the complexity of the decoding algorithm and to preserve the integrity of the 106 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation —2] ... Figure 4.3: The structure of the DPC I rate k/(2k — 1) code. LLR information we define [77] et4u1)) log + 6(L(u[l]),. . . , L(u[K])) (4.9) = for the addition of LLR information, where 6(L(u[1]), .. . , L(u[K])) is a correction term added to the max operation that is recursively calculated, i.e., 4.1.1 6(a, b) = log(1 + e_la_), (4.10) 6(a, b, c) = ). log(1 + 6 e ’ (4.11) Double Parity-Check (DPC) Codes DPC codes were introduced by Mitra and Lampe [24] for use in a serially concatenated system with multi-level DPSK. The capacity approaching performance of DPC codes with DPSK, combined with their low decoding complexity make these codes an excellent can didate for concatenated with CPM and ST—CPM. In this section, for ease of reference we briefly overview the structure of these DPC codes. The outer encoder shown in Fig ure 4.2 accepts Nb bits at its input, which are denoted as [u[0],... , u[Nb — 1]], and outputs 107 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation Figure 4.4: The structure of the DPC II rate k/(2k + 1) code. NDPC bits at its output, which are denoted as [c[O],... , c[Nrpc — 1]]. The DPC code is a block code that processes the frame of input bits in blocks, with a code rate of k/n (i.e. NDPC = (n/k)Nb). The DPC codes proposed in [24] can be separated into two classes, denoted as DPC I and DPC II. The DPC I class of codes has rate r = k/n = k/(2k — 1). As the length k of the block of input bits is increased the rate of the DPC I class of codes approaches 1/2. Mathematically, the code bits are given by c[2ij = c[2i + 1] = u[2i] u[2i + 2]. (4.12) The Tanner graph for the DPC I code is shown in Figure 4.3, where the even-indexed code bits (c[O], c[2j,. . . c[2k — 2]) represent the data bits input to the encoder, and the odd-indexed code bits (c[1j, c[3],... , c[2k — 3]) represent the parity bits generated by the modulo-2 addition of the adjacent two input data bits. The minimum Hamming distance of the DPC I class of codes is dmjn = 2 because the data bits that begin and terminate the block of data that is input to the DPC encoder only affect the value of one parity bit each (in contrast to all of the other input data bits that affect the value of two parity bits). The low weight errors that result from a small minimum Hamming distance cause the onset of an error floor at low signal-to-noise ratio (SNR). Therefore, the authors of [24] proposed 108 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation a second class of DPC codes (DPC II) with a lower data rate r minimum Hamming distance, = = k/(2k + 1) but a larger 3. The minimum Hamming distance of the DPC II code is increased over that of the DPC I code by adding two extra parity bits that have only one input. The Tanner graph for the DPC II group of codes is shown in Figure 4.4, and mathematically the DPC II code is generated by c[2i] = u[i], c[2i + 1] = u[2i] c[2k—1J = u[O]=c[O], c[2k] = u[k] u[2i + 2] = c[2k — 2]. (4.13) Once again, as the length k of the block of input bits is increased the rate of the DPC II class of codes approaches 1/2. Soft Decoding of DPC Codes The Tanner graphs shown in Figures 4.3 and 4.4 confirm that both codes are cycle free. Therefore, message passing decoding is optimum for both codes. Message passing decoding for the DPC codes is accomplished using a conventional forward/backward (FB) algorithm with the following forward and backward recursion metrics f[i] b[i] = (f[i 2])) )DPCa(C[2’j (b[i + 11 + Aopca(c[2i + 2])) ADPCa(C[2 — 1] + ADpca(c[2i — 11), (4.14) + 1]), (4.15) — where ).Dpca(c[i]) is the a priori information about bit c[i] that is passed to the FB al gorithm from the ST—CPM BCJR decoder (described in 4.1.3) in form of a log-likelihood ratio (LLR). A Tanner graph showing the generation of the forward and backward re 109 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation ADpc(c[2k — 1]) ADPC(C[2k —5]) Aopc(c[3]) ADpC(c[1]) )DPC(CF2k —3]) Figure 4.5: Generation of the forward and backward recursion metrics DPC I and DPC II. ADpC(c[2k]) (f [i] and b [ij) for cursion metrics is given in Figure 4.5. The initial and final values of the forward and 0, and b[k backward recursion metrics are f[0j f[0] = ADpc(c[2k — 1]), and b[k — 1] = — 1] = 0, respectively, for DPC I, and ADpc(c[2k]), respectively, for DPC II. The FB algorithm outputs the extrinsic a posteriori probabilities of the data bits ‘DpCe(C[2Z1) = (4.16) f[i] + b[i], and of the parity bits )Dpce(c[2j + The a posteriori 1]) = (f[iJ + )DpCa(C[2 — lfl) W (b[iJ + )DpCa(C[2Z — 2])), (4.17) probabilities for the two additional parity bits required for the DPC II code are generated by 11) = DpCa(C[01) ‘DpCe(C[21’]) = DPCa(C[21C ADPCe([21C — + ADpC (c[0]) 6 — — )Dpcjc[2k 31) + ADPCe(C[2k — 3]) — — 1]) ADPCa(C[2k1) (4.18) (4.19) After the bit LLRs have been generated they are passed through the interleaver and input to the ST—CPM decoder, and used to generate symbol LLRS that can be used in the 110 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation I loololIloIllI Ungerboeck (UL) Grayl (GL1) Gray2 (GL2) —3 —3 —3 —1 —1 +1 +1 +3 +3 Table 4.1: Symbol labeling for M +3 +1 —1 = 4. ST—CPM decoder. 4.1.2 ST-CPM For the inner encoder, we adopt the diagonal block-based ST—CPM scheme detailed in Chapter 2. As shown in Figure 4.2 the ST—CPM encoder receives the bits [ct [0],... , c [NDPC a, [Nf 1]] and outputs the symbols [a [0],... , 7 — 1]] on 1 nt NT antenna. However, the bit-to-symbol mappings that were optimal for the non-iterative system used in Chap ter 2 are not optimal for the iterative decoding system that we consider here. In fact, even in the case of one transmit antenna the bit-to-symbol mapping has significant influence on the performance of the iterative system, (we will examine in detail the role of symbol labeling in Section 4.2). For M = 4, we can generate the mutual information transfer characteristics for all 24 possible labelings and determine those that are unique. For the CPM schemes used as examples in this work, three distinct labelings were identifiable: traditional Ungerboeck (or natural) labeling (UL), and two types of Gray labeling ((GL1) and (GL2)). These mappings are given in Table 4.1. For M = 8, rather than re-examine the 8! different mapping possibilities, we will study the performance of several mappings that have been shown to have superior performance in iterative coding schemes employing PSK modulation. In particular, six different labelings are considered. These labelings include Ungerboeck labeling (UL), Gray labeling (GL), Antigray labeling (AGL), Semi-set partitioning labeling (SSPL) [80], Howard and Schlegel 111 — Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation öi OiOöiT Ungerboeck (UL) Gray (GL) Antigray (AGL) Semi-Set Partitioning (SSPL) Howard and Schiegel (HSL) Nuriyev and Anastosopoulos (NAL) —7 —7 —7 —7 —7 —7 —5 —5 +7 +3 +7 +7 —1 +7 +5 +7 +1 +1 —3 —1 —5 —3 —5 —1 Table 4.2: Symbol labeling for M = lOT TiO[i +1 +3 +3 +1 —3 +3 +3 +1 —3 —5 —1 —3 +5 +5 +1 +5 +5 +5 +7 —3 —1 —1 +3 —5 8. labeling (HSL) [811, and Nuriyev and Anastosopoulos labeling (NAL) [82]. These mappings are given in Table 4.2. In addition, when we consider transmission over multiple transmit antenna we will consider only the repetition code, i.e. the same symbol labeling applied to antennas t = 1,. .. , NT. Selecting the repetition code allows a simple EXIT chart analysis of the different symbol labelings, and allows for a simple lower bounding of the outage probability of the scheme when the QSFC is considered. In addition, we will show that when the repetition code is used with optimal symbol labeling over the QSFC the resulting scheme yields performance near the lower bound on outage probability. 4.1.3 Soft Decoding of ST—CPM The object of the soft decoding algorithm employed by the ST—CPM decoder is to use both the received signal and the a priori information provided by the DPC decoder to generate the a posteriori probability Pr{ai[i] = mIR}, where R = [R[O],. . . , R[Nf]]. Note that, the DBST-CPM scheme given in Chapter 2 fixes the symbols transmitted over antennas = 2• NT with respect to the symbols transmitted over antenna nt = 1 and the ST-CPM code C, therefore it sufficient to refer to the symbols transmitted over antenna = 1. As shown in Figure 4.2, these APP symbol probabilities can then be converted into APP bit probabilities, de-interleaved and then recycled as the input to the outer (DPC) decoder. The BCJR algorithm [83] is the optimal trellis based soft-output algorithm for 112 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation estimating the probabilities Pr{aj[i] = mlr}. In this case the BCJR algorithm operates on the ST—CPM trellis discussed in Section 2.3.3. The iterative decoder employs LLRs, therefore it suffices to calculate the joint proba bility of the transmitted symbol a 1 [ii and the received signal frame R, given by p(ai[i] = m,R) (4.20) oi_i(Si_i)7m(Si,Si_i)/3i(Si) = Si Si_i where a_i(si) is denoted as the forward metric, ,8(sj) is denoted as the backward met ric, and 7m(Si, ) 1 s_ = p(R[i], s, ai[i] = mIs_i), m E {—M + 1, —M + 3, , M — 1} is denoted as the branch transition metric. The branch transition metric is the probability of transitioning from state 1 [i] to state s when the symbol transmitted is a = m can also be expressed as 7m(Si, where p(R[i] Ia[il = = p(R[i] Ia[i] = rn, s, 1 )P(sIs_ s_ ) (4.21) m, 5j, s_) is the conditional probability of the received signal R[i] given that the symbol a[ij ) 1 si—i, and P(sjIs_ si_i) = = m was transmitted starting in state s, and finishing in state .XcPMa(al[i] m) is the a priori probability of the transition from = state s to state .s, or equivalently the a priori probability of the symbol a[i] m. The forward metric, c, which is the probability of transitioning from the beginning of the frame to the state s,, is given by p(s,R), = ym(sisi_i)ai-i(si_i), Si—i where R’ denotes the vector [R[0] (4.22) m R[i — 1]]. Similarly, the backward metric, / (s), 3 113 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation which is the probability of transitioning from the end of the frame to the state 8j, is given by = =p(R’Is), = ym(si+isi)/3i+i(8i+i). (4.23) m Sj+1 The initialization of c and 3 is dependent on the initial and final states of the ST—CPM (s) trellis. The termination state of the trellis is unknown and therefore the values of 3 corresponding to the final state of the trellis Nf 3 (/ 1 (sNf —1)) are uniformly initialized. In contrast, the initial state of the trellis is assumed to be known and the probability of this state is set to one, while the probability of the other states (co(so)) is set to zero. In Section 2.3.3, we defined the branch metric for the Viterbi decoder as the crosscorrelation of the received signal and the filtered signal element p (d[i]), where d[i] is an ‘address vector’ composed of the L most recent M-ary data symbols a[i], and the NT p-ary phase states that contain the phase information for each of the nt antenna that has been accumulated over symbols transmitted from the beginning of the frame to the L — 1 most recent symbol. For clarity we will restate the address vector d[i] here d[ij [Ti[i — L], In order to derive the probability . TNT[i — p(R{ijIa[i] Lj, a[i = — L + 1],... , a[i]j. (4.24) m, s, si_i) we must slightly redefine the expression for the signal element i- (t, d[i]) filtered by the matched filter bank specified by the vector hD(t) (see Eq. (1.20)). The filtered signal elements used by the BCJR algorithm are given by p(d[i]) = where J p(t,d[i])h(t)dt, (4.25) 0 (t, d[i]) is the signal element transmitted over antenna nt in the period iT + (‘nt — 114 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 1)NfT t < (i + 1)T + (flt — 1)NfT, 0 <i < N corresponding to the address vector d[i]. If we assume coherent detection the probability p(Rjai[i] = rn, s,, s_) m, s, si_i) can be written as = Nft NT (-j2)NT p(rIai[il JJ {J exp ((rnr[i + (flt 1)Nfjg[i + — (flt 1)Nf] — — p(d[i]))HC_l nt=i n,=l (rnr[i + (fl’t 1)Nf]gfl[i + — (flt — 1)Nf] — p(d[ifl)) (4.26) . where rn[ij denotes the filtered signal received on antenna nj,. [see Section 2.3.3]. The BCJR algorithm as it has been presented is computationally complex and can become unstable when small probability values are generated. In logarithmic form the BCJR algorithm is computationally less complex and numerically stable. The branch transition metric in logarithmic form can be written as logQym(sj,si_i)), Fm(si,si_i) NT NR = nt=i n,=i ((r,[i + (Vnr[j + (Tht (flt — — 1)Nfjg,[i + 1)Nf]g,[i + +,\cpMa(al[u] = (flt (flt — — 1)Nf I 1)Nf] — — (4.27) m) + K, (ai [‘i]) are the a priori symbol LLRs that are generated from the bit LLRs where ACPMa ADPCe that are produced by the DPC decoder. Thus, if mapping for input symbol m on antenna Tit [ml, 1 m M is the data 1 [il then the a priori information on symbol a is given by >CPMa@1[Zl =m) = rn*ax 2 +j]]) 1[c (ilog 0 (Dpc [ t M 0 i <Nf, (4.28) 1 [i]1 j:a’ 115 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation Note that we need only to generate extrinsic information for nt of [i] = 1lt [cit [i = 1 because the probability 2 M + jjj is independent of the antenna and of the data mapping. log Similarly, we can write the forward and backward metrics in logarithmic form A(s) = log(a(s)) log( = exp(logQym(sj, s_ ))) + log(a_i(s_i))), 1 s_ m = mx ,m (Fm(Si, ) + A_i(s_i)), 1 s_ (4.29) and B(s) = , si))) + log(/9+i(s+ 1 1og(exp(logQym(sj ))), 1 log(3(s)) m = mx 1 ,m sj (Pm(Si+i, s) + 1 (s+ B+ ) ). (4.30) Using the above equations we can write the APP probability of a symbol as APP(ai[i] = m) = m*ax 1 (s_ + [A_ ) Sj,Sj_1 Fm(Si, Sj—i + B(s))j. If we denote the bits that comprise the symbol a 1 {i] as [a [i], a [i]••• , (4.31) M[j] then we can write the LLR of bit a [i] as L(a[i]) APP(a[i] = ai[i]:a[i]=O = m) APP(a{ij — = m), 0< j M. (4.32) 2 log al [i]:a[i]_1 Before the LLR given above is passed through the de-interleaver and then to the DPC decoder the a priori information supplied to the ST—CPM decoder must be removed to leave only extrinsic information. The extrinsic information about the DPC coded, interleaved 116 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation j] bit a [i] = [i log 2M+ generated by the BCJR algorithm for ST—CPM is [i log t AcpM(c” 2 M+j]) 0 i <N,0 M. 2 <j <log (4.33) 4.2 Analysis and Design of Concatenated ST—CPM Using EXIT Charts In general, the performance of an iterative decoding scheme can be characterized by a BER curve with three distinct regions. At low SNR the BER shows minimal improvement with increasing SNR. At some threshold SNR the BER drops distinctly, in what is often called the waterfall region. Finally, as SNR is increased beyond the threshold SNR the iterative decoding scheme will at some point encounter an error floor. The threshold SNR at which the scheme enters the waterfall region, and the SNR at which the scheme encounters the error floor are both parameters that are dependent upon the design of the inner and outer codes. Several methods have been proposed to predict the performance of an iterative de coding scheme, and in particular the SNR at the onset of the waterfall region. One of the proposed methods is density evolution [84]. Density evolution involves calculation of the probability density functions (pdfs) of the information that is exchanged between the decoding units. By tracking the evolution of these pdfs and using a thresholding mech anism density evolution is able to predict the SNR at which the waterfall region begins. Several simpler methods have been proposed that are also very accurate in predicting the onset of the waterfall region. One of these methods is the EXIT chart [85] which focuses on the exchange of mutual information (i.e. a single parameter of the pdf instead of the 117 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation entire pdf) between the inner and outer decoding units. Using the EXIT chart approach allows for analysis of the individual component decoders, rather than requiring a study of the entire iterative decoder. Once the relationship between the mutual information at the input and output of the component decoders has been established, the performance of the overall operation of the iterative decoder can be examined; the mutual information at the output of the ST—CPM decoder is the mutual information at the input of the DPC decoder and, similarly, the mutual information at the output of the DPC decoder is the mutual information at the input of the ST—CPM decoder. Note that an ideal interleaver (which ensures that consecutive bits are independent) has no impact on the exchange of mutual information. In the following, we overview the method used to generate the mutual information transfer characteristics of the inner and outer codes. Next, we create a sample EXIT chart for the AWGN channel and explain how the EXIT chart can be used to predict the performance of the concatenated code. We conclude the section, by detailing how an EXIT chart can be generated for ST—CPM when a QSFC is considered. 4.2.1 Generation of the Mutual Information Transfer Characteristics The first step in the generation of the EXIT chart is to establish the relationship between the mutual information at the input and output of the component decoders. Here, we will briefly overview the mathematical background of the EXIT chart [85]. We will assume a generic decoder that receives a signal r, that is generated by an input symbol u plus a Gaussian random variable n with zero mean and variance u (i.e. r = u+n). This systems corresponds to transmitting the concatenated coded signal over an AWGN channel. The 118 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation LLR generated by this signal is given by L[r] = log (= (4.34) = -(u + n). In [85], ten Brink noted that simulation results indicate that the probability density func tions of the extrinsic information generated by the decoding units that make up the iterative decoder tend towards Gaussian-like distributions as the number of iteration is increased. This means that the a priori input to a decoding unit has a Gaussian-like distribution. In addition, when the interleaver length is large the a priori LLR information is uncorrelated with information received over the channel. Therefore, the a priori LLR information at the input of the inner decoder is modelled as a Gaussian variable (4.35) AapaU+fla, where a is a Gaussian random variable with zero mean, and variance o, and a = The conditional probability density of this a priori LLR information is given by exp (__2122) V2iraa The mutual information between the a priori LLR )‘a (4.36) and the transmitted bits U is given by Ia(a) = I(U; Aa) u=+1 00 f 2 log [PAa(tj =—1)+p:(IU = +1)] PAa(IU = (4.37) 119 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation and substituting (4.36) this can be written as / exp Ia(a) = 1 ( 2 2 (e—) 2o 2 [1 + exp(—)] d. log “,-_ — 7fUa 2 V J- (4.38) To simplify future calculations we define Ia(0a = 0’), (4.39) 0, lim J(a) = 1, o > 0. (4.40) J(u) urn J(u) p—*o The expression for mutual information as a function of input noise variance given in (4.39) cannot be expressed in closed form. Therefore, for the purposes of computer simulation we use an approximation furnished by the non-linear least squares Marquardt-Levenberg algorithm [86, 87j. Employing this approximation, evaluation of J(u) is split into two intervals: 0 0’ tp, 7 and crtp <0 < 10, where 0 tp = 1.6363. The approximation for J(a) is given by 2 + cj,1o 3 + bj,ioaj,1a J(o) 1 — 3 exp[aJ,2J u 0 + bJ,2u 2 + cJ,2c7 tp 0’ + dJ,2] 0 tp < < 10 1 (4.41) o•10 where aj, = —0.0421061, 1 b, = 0.209252, cj, = —0.00640081, aJ,2 = —0.00181491, bJ,2 = —0.142675, cJ,2 = —0.0822054, dJ,2 = 0.0549608. (4.42) 120 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 8 = 10 9 J’(I) Figure 4.6: Plot of the J(cr) function. Similarly, the inverse of the function J(u) I, and ‘tp <I < 1, where J’(I) f ‘tp = = I J’ (I) is evaluated in two intervals: 0 0.3646. The approximation of J’(I) is given by I + b, 1 a, I+ 1 I log[—b, ( —a 2 0 — 1)j ‘tp — I <I ‘tp < (4.43) 1 where 1 a, = 1.09542, 1 b, = 0.214217, c, 1 = 2.33727, = 2 0.706692, b, = 0.386013, c, 2 = —1.75017. ( ) The J(u) function is shown in Figure 4.6. Having analyzed the relationship between the variance term u and the a priori mutual information, ‘a at the input of a decoder we now consider the relation between the mutual information of the extrinsic information at 121 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation the output of the decoder, I, and the variance term o. The mutual information of the extrinsic information at the output of the decoder can be written as I(AcpMe;Cjnt) = 1— C) = 1 I(ADPce; — f f +00 1 +exp(—)1d, 1)log [ 2 PxCpM(ICiflt PADPCe(IC = As described in [85j, the probability distributions (4.45) 1 + exp(—)]d. 1) 2 log [ P)’Me (ICint = 1) and PADFCe (IC = 1) given in (4.45) are generated by simulation. Mutual information is measured for different values of o, by applying the Gaussian random variable given in (4.35) as the a priori input to the decoder. Using the time averages (an arbitrarily close approximation of (4.45)) mutual information is given by = ‘CPMe I(AcPMe; 1 10 C ) — NDPC 1 NDPC 1+ log ( 2 enttMmnt), n=1 NDPC = ‘DPCe ‘2’Dpce; lo(1 + ee])), 1 C) (4.46) — where the approximations are valid when pdfs for the LLR are both symmetric, i.e., PACPM€(1X = 1) P)CpMe(P = 0), PADpCe(P = PADpCe(IX 1) = 0), (4.47) and consistent, i.e., 6 PACpM (CIX = 1) = P)•CPMe (—CIX = 1) exp(), PADPCe (I’ = 1) = PADpCe(P 1) exp(). (4.48) Having evaluated 1e(a) (1e(Ja, Eb/J’.fo) for the outer decoder), and Ia(a) we can determine the extrinsic information transfer function Ie T(Ia) (or le = T(Ia, Eb/J’4) in the case of the outer decoder. 122 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation C.) DPCa 1 Figure 4.7: Mutual information transfer chart for the DPC codes. The mutual information transfer chart (IDPCe VS. IDPc) for the DPC I and DPC II classes of codes are shown in Figure 4.7. The figure shows that as the rate of the DPC code is decreased the DPC decoder is able to make better use of the a priori mutual information provided to it. 4.2.2 Generation of the EXIT Chart for the AWGN channel The EXIT chart is generated when the mutual information transfer characteristics of the inner and outer decoders are plotted on the same figure, noting that when the iterative decoder is operating ‘DPCe = 1 CPMa and for the ST—CPM code employing NT ‘CPM = 1 DPCe = Figure 4.8, shows an EXIT chart 1 transmit antenna, and M = 4, h = 1/4, a 123 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 0.3 0.4 0.5 0.6 IcpM, Iupc. Figure 4.8: EXIT chart depicting the mutual information transfer for the DPC II rate 10/21 code and for the ST—CPM code employing NT = 1 transmit antenna, and M = 4, h 1/4, a 1REC pulse with Ungerboeck mapping, and with an SNR (AWGN channel) of (Eb/Al) = +0.2 dB to +5.2 dB in increments of 0.2 dB. 10 ranging from 10 log 1REC pulse, and for the DPC II rate 10/21 code. The extrinsic mutual information at the output of the ST—CPM decoder is dependant not oniy on the a priori mutual information available, but also upon the SNR of the received signal. Figure 4.8 shows results for a (E/No) 10 SNR, assuming an AWGN channel, ranging from 10 log = +0.2 dB to +5.2 dB in increments of 0.2 dB. The SNR at which the mutual information transfer characteristic of the inner decoder no longer intersects the transfer characteristic of the outer decoder is often called the threshold SNR of the scheme. The opening between the inner and outer decoder characteristics is commonly referred to as a ‘tunnel’. The threshold SNR at which the tunnel opens is of interest because it is at this SNR the BER exhibits a sudden and steep decline characteristic to concatenated codes, which is commonly referred to as the 124 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation BER ‘waterfall’. Ideally, the EXIT chart can be used to visualize the exchange of mutual information between the constituent decoders. Figure 4.9 illustrates the decoding trajectory of a typical concatenated system for two different interleaver lengths. The example shown on the right of Figure 4.9 employs a long interleaver (on the order of iO bits [85]). In this example the mutual information exchange proceeds almost exactly as predicted by the EXIT chart. However, due to the shorter interleaver used in the example on the left of Figure 4.9 correlations in the mutual information mean that the gains predicted by the EXIT chart are not realized [85]. In the worst case, a short interleaver will cause the decoding trajectory to terminate before the (1,1) mutual information point is reached and cause an error floor for the scheme. In the best case, the decoding trajectory does reach the (1,1) point, but requires many more iterations than a decoder using a long interleaver. 4.2.3 Generation of the EXIT chart for the Quasi-Static Fading Channel (QSFC) In this section, we derive an expression for the extrinsic mutual information at the output of the ST—CPM decoder, CPMe 1 assuming a QSFC. Note that the extrinsic information at the output of the DPC decoder is not a function of the channel. As previously discussed, we will generate extrinsic mutual information for the ST—CPM under the condition that repetition coding is used on all NT antenna. Under this condition symbol labeling must still be optimized, however the same labeling is used on all antennas. Employing maximal ratio combining (MRC) at the reciever (in order to obtain maxi mum diversity) the instantaneous SNR per bit, 7b, is given by NR 7b NT (4.49) = 7b n,.=1 nt=1 125 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation ‘CPM, ‘DPC ‘CPM, ‘DPC Figure 4.9: Two EXIT charts illustrating the effect of interleaver length on the decoding trajectory. On the left a short interleaver is used, and on the right a long interleaver is used. where the average SNR is given by ‘b = Eb/J’fo. Using this expression for instantaneous SNR we can write an expression for the extrinsic mutual information of a repetition coded ST—CPM signal transmitted over the QSFC as NR I(7b) = NT E(IcPMQ’b 1 flt1 r = (4.50) f1DpCe(b)P(7b)d7b Under the assumption that the fading on the NRNT different channels is statistically in dependent, the probability density function (pdf) for the sum of ‘y = Z’I Z’ is a chi-squared pdf with 2 NRNT degrees of freedom. Therefore, the expected capacity of 126 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation a repetition coded ST—CPM signal is given by IQp (7b) = f ‘CPMe (7b) NRNT (NRNT 1)! — (4.51) b)NRNT_le_7 dyb. 7 ( Capacity 4.3 The merit of a transmission scheme, such as concatenated coding, is usually proven by comparing the performance of the scheme against some benchmark, such as capacity. Cal culating the capacity of a CPM based scheme is not a simple task because of the memory element inherent to CPM. In this section, we first analyze the capacity of ST—CPM trans mitted over the AWGN channel, and then look at at the capacity of repetition coded ST—CPM transmitted over a QSFC. AWGN Channel 4.3.1 In order to calculate the capacity of the ST—CPM scheme transmitted over an AWGN channel we adopt the simulation-based information rate computation method proposed in [88] for systems with channel memory. The techniques proposed in [88] are immediately applicable to ST—CPM for which modulation memory takes the place of channel memory. In this section, we assume a single antenna system (NT received signal can be written as r[n] [r(’)[O],. . . , r(D)[Nf and the transmitted signal sequence can be written as a [a[i],.. . , a[j]]. = = 1). In this case the 1, NR — 1]], and r [r[i],.. [a[O],.. a[Nf . — . , r[jj], 1]], and a = The objective of this algorithm is to calculate the mutual information between the transmitted symbols a C = I(a; r’) = [a[Oj,. lim ±I(a[Oj, Nf Nf—*oo . . a[Nf a[Nf — — 1]] and the received signal, given by 1]; r[O],. r[Nf — 1]) (4.52) 127 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation Under the assumption that these processes and the state process of the CPM trellis, S 0 [S , 1 , 2 S .. .], = satisfy p(aofl, r, s) = ) llp(a[i], r[i], s+iIs), 0 p(s (4.53) and S(1ogp(r[1jIso,si,a[O])) the sequence — 2 p(r log _1) <00 (4.54) converges with probability 1 to the entropy rate h(r). There fore, the estimated mutual information is given by p(r_1) 2 _j—1og ’) 0 1(a;r — h(r’Ia) (4.55) h(r’Ia) is known analytically to be h(N), the entropy of a complex Gaussian where random variable, given by h(N) = 2 (det(eirNoC)), NT log (4.56) where C is the D x D array of cross-correlations of the basis functions that form the D complex filters used to obtain sufficient statistics at the front-end of the receiver (see Section 1.2.1). The entropy h(r) can be calculated by generating long sequences a 1 Nf—1 and r 0 (Nf 10 6 symbols [83]) and using the forward metric generated by the BCJR Nf—1 algorithm. The probability p(r 0 log ) can be found to be [see (4.22), (4.29)] (p(r’)) = aSNl(sNf4). SNf (4.57) 1 128 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation where ct is given in Section 4.1.3. Commonly, the forward metric is normalized at each step (i.e. each calculation of t(s)) because ct(s) normalization factor the probability Aorm p(r) is introduced such that —oo for long sequences. If the —* )norm = — max lim* (Z cx (sn)), then is given by _1 log (p(r’)) )$1O (4.58) and finally the estimated capacity can be written as Nf 1 )orm = — log(2) Nf 2 (det(eirNoC)). NT log The estimated capacity vs. SNR for CPM with M h = (4.59) 4, a 1REC phase pulse, and with 1/4 is shown in Figure 4.10. If we correct for the overall rate of the concatenated coding system we can generate the ‘rate distortion’ BER [89], given by BER = H’ (i — ), BER 0.5, (4.60) where R is the target rate of the code, and H’ (x) denotes the inverse of the binary entropy function H(x) 4.3.2 = (x) 2 —xlog — (1 — (1 2 x)log — x) [90], which is unique for BER 0.5. Quasi-Static Fading Channel Due to the fading nature of the QSFC outage probability, P ,t, is a more useful measure of 0 performance in this environment than capacity. Outage probability is the probability that the instantaneous capacity of the channel is less than the outage capacity of the channel. For example, if the concatenated ST—CPM scheme under study transmits G 01 bits/channel use then with probability P . 0 t the instantaneous capacity of the channel is less than G 0 129 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 2 1.8 1.6 1) 1.4 . . 1.2 : 08 0.6 0.4 0.2 C —20 I —10 —15 7b Figure 4.10: Estimated Capacity for M with h 1/4. = I 5 0 —5 10 15 (dB) 4 CPM employing a 1REC phase pulse, and Thus, the outage probability will provide a lower bound for the frame error rate (FER) of the scheme under study. First, we must find an expression for instantaneous capacity. In a manner similar that used in Section 4.2.3, we can write an expression for the instantaneous capacity of the ST—CPM scheme in the QSFC when repetition coding is employed as NR CQsFcQyb)) NT = . IgI ) 2 (4.61) . O } 0 (4.62) nr=l fltl Then, the outage probability can be written as t 0 P Pr{(OQsFcQyb)) < 130 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation For a given CPM scheme the estimated capacity can be generated over a range of b as shown in Figure 4.10. Using these results the SNR required to support desired CPM scheme at capacity, ‘yout, can be determined. Then, the expression for outage probability can be re-written as NR NT IgflI < 2 Pr{ ,t 0 P (4.63) 73r—l fltl The random variable produced by the sum of the squared magnitudes of channel gains has a chi-squared distribution. Thus, finally, using the cumulative density function (cdf) of a chi-squared distribution, we can write the outage probability as NRNT—1 Pout 4.4 = 1 — 7 e 1 (ut) fl . (4.64) Results and Discussion In this section we employ the EXIT chart to select the best symbol labelings for a select group of ST—CPM concatenated codes. The BER performances of these symbol label ings are compared to appropriate capacity limits derived in Section 4.3.1 in the case of the AWGN noise channel, and similarly the appropriate outage probabilities derived in Section 4.3.2 in the case of the block fading channel. We conclude the section with a com parison of the performance of the proposed scheme and pre-existing concatenated CPM, and ST—CPM schemes. 4.4.1 The AWGN Channel In this section, we consider the performance of single antenna ST—CPM concatenated with the DPC codes, for M = 2,4 and 8-ary CPM schemes. We attempt to minimize the 131 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 09 — 08 -—:——.---- — — — V — — 1/,., i, — 0.6-— : Ml /1/, 1,/i 7’: V - - V - - : - 0.3 I DPC — 0.2 Rate 2/3 —e— DPC I—Rate 10/19 — —w—DPCII-Rate2/5 ——DPCII-Rate3/7 0.1 DPCII C - —I—DPCI-Rate3/5 ‘0.1 0.2 0.3 0.4 0.5 0.6 - Rat: 10/21 01 1 ‘CPM, ‘DPC, Figure 4.11: The mutual information transfer characteristics of a select group of DPC I and DPC II codes, and MSK (CPM: M = 2, 1REC phase pulse and h = 1/2) with Eb/J\fo in steps of 0.5 dB. complexity of the ST—CPM for each value of M, using the 1RC, 1REC, and 2RC waveforms. We employ a pseudo-random (S-random) spread interleaver, which has been shown to yield performance superior to many random interleavers [91]. Using the performance analysis presented in this section we will show that the DPC class of codes are a good fit for concatenation with CPM. Analysis of multiple transmit and receive antenna is reserved for the block fading channel, and is given in Section 4.4.2. First, we consider binary CPM. The EXIT chart displaying the mutual information transfer characteristics for MSK (M = 2, a 1REC phase pulse, and h 1/2) and for DPC I, and DPC II class codes are shown in Figure 4.11. The MSK transfer characteristics are shown for a range of values of received SNR. From the characteristics shown in the figure 132 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 1/2 Threshold SNR (dB) 339* 2.27* 1.39 1.23 1.31 1.44 = DPC Code Code Code Code Code Code Code I 2/3 I 3/5 I 10/19 II 2/5 II 3/7 II 10/21 - - - - - - Capacity (dB) 1.21 0.86 0.44 —0.02 0.034 0.22 [ j Table 4.3: SNR to achieve capacity vs. threshold SNR from EXIT chart analysis for MSK. Note that Q* denotes schemes whose EXIT chart tunnel opens after the ‘threshold’ SNR given in this Table. it is evident that SNR required to open a tunnel between the DPC II class of codes and MSK is less than is required for the DPC I codes. In fact, due to the shape of the MSK mutual information transfer characteristic the SNR required to completely open a tunnel between the MSK and DPC I transfer characteristics is much higher than is needed for the DPC II codes. However, increasing SNR gradually opens the EXIT chart tunnel for MSK and the DPC I codes. Thus, although the BER performance of MSK concatenated with the DPC I codes does not exhibit the waterfall characteristic until a higher SNR is reached than its DPC II counterpart, the BER performance improves significantly with increasing SNR. The EXIT chart predicts the onset of the BER waterfall at 1.23, 1.38, and 1.42 dB for MSK and the DPC II rate 2/5, 3/7, and 10/21 codes respectively. The EXIT chart tunnel does not completely open until SNRs of 6.26, 3.21, and 1.79 dB for MSK and the DPC I rate 2/3, 3/5, and 10/19 rate codes, respectively. However, the tunnels for the MSK and DPC I rate codes (most notably the 2/3 and 3/5 rate codes) are mostly open at significantly lower SNRs. If we define the threshold SNRS to be the SNR at which a BER of iO is reached then the threshold SNRs and the SNR for transmission at capacity for MSK are given in Table 4.3. 133 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation DPC Code Code Code Code Code Code Code I 2/3 I 3/5 I 10/19 II 2/5 II 3/7 II 10/21 - - - - - - Capacity (dB) 1.61 1.17 0.84 —0.02 0.08 0.32 h=1/3 Threshold SNR (dB) 3.81* 2.30* 1.74 1.23 1.13 1.42 Capacity (dB) 2.96 2.27 1.69 0.78 0.93 1.27 h=1/4 Threshold SNR (dB) 2.39* 397* 3.09 2.38 2.48 2.52 Table 4.4: SNR to achieve capacity vs. threshold SNR from EXIT chart analysis for binary 1REC with h = 1/3 and h = 1/4. Note that Q* denotes schemes whose EXIT chart tunnel opens after the ‘threshold’ SNR given in this Table. The simulated BER performance of MSK concatenated with the DPC codes is shown in Figure 4.12 (non-bold curves). An interleaver of 8000 bits is employed. Rate distortion capacity curves (bold curves) are also shown for reference in Figure 4.12. The performance of the DPC II codes (shown on the right of the figure) is well predicted by the EXIT chart. The 2/3, and 3/5 rate DPC I codes (shown on the left of the figure) do not exhibit the very sharp BER waterfall characteristic, but do demonstrate a substantial BER drop with increasing SNR as the EXIT chart opens. All of the DPC I codes have error floors. We note, even at high SNR the tunnel between the MSK transfer characteristic and the characteristics of the DPC I codes is not very large. Table 4.4 contains the SNR needed to achieve capacity and the threshold SNRs for binary, 1REC, with h = 1/3, and h 1/4. Note again, a BER of iO determines the threshold SNR. In general, the performance of the ST-CPM code with the DPC II class of codes is superior to that of the DPC I class of codes (particularly the rate 2/3, and rate 3/5 codes. Therefore, in the remainder of this chapter we will employ the DPC II class of codes. Next, we consider 4-ary CPM. The EXIT chart for CPM with M = 4, h = 1/4, a 1REC phase pulse and the rate 10/21 DPC II code is shown in Figure 4.13. The threshold 134 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation —e—DPCII—215 101 .: ——DPClI-3I7 —-—DPCI-1OI21 10 1O 5 : :. 2 3 (Eb/J’fo) 10 101og 4 [dB] : S : ::::::::: :: 5 — (Eb/.MJ) [dB] 10 101og —* Figure 4.12: Estimated capacity (bold curves) and simulated BER (non-bold curves) vs. (Eb/JJ) for MSK (CPM: M = 2, 1REC phase pulse and h = 1/2) concatenated 10 101og with DPC I class codes (in the figure to the left) and DPC II class codes (in the figure to the right). SNRs for the three labelings that produce distinct transfer characteristics are shown. The Gray labeling yields the lowest threshold SNR (1.3 dB), but the threshold SNR of the three labelings are separated by only 0.2 dB. Although, the transfer characteristics of the three labelings are not strikingly different, we note that the size of the EXIT channel tunnel opening is different for the different schemes before the threshold SNR is reached (i.e. before the tunnel completely opens). Before the threshold SNR is reached the GL2 scheme has the smallest unopened tunnel size, followed by the UL scheme, and then the GL1 scheme. We also note that at the upper right hand of the EXIT chart, when large quantities of mutual information are being exchanged, the 0L2 provides the largest tunnel opening, followed by the UL labeling, and finally the OL1 labeling. 135 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 0 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 ‘CPM, ‘DPC Figure 4.13: EXIT chart showing the threshold SNR for three labelings of CPM (M h = 1/4, a 1REC phase pulse) and the rate 10/21 DPC II code. SNR is Eb/JIo. Figure 4.14 shows the simulated BER results for the M = = 4, 4 scheme just described. Again, the rate distortion capacity curve is provided for reference. BER results are shown for an interleaver length of 4200, and 8400 bits. First, we consider the performance of the three labelings when the interleaver length is 4200 bits. Given the fact that the three labelings have comparable threshold SNRs, the size of the tunnel opening prior to the threshold SNR has a significant affect on the shape and ordering of the BER curves in the 10_i to 10—2 BER region. In fact, the BER can be determined directly from the a priori at the input of the DPC decoder, and the extrinsic information at the output of the DPC decoder for any point on the decoding trajectory [85]. Thus, when schemes have similar threshold SNR, the shape of the mutual information transfer characteristic takes on an added importance. From Figure 4.14, we see that as SNR is increased the GL2 labeling 136 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation provides superior performance, and the GL1 labeling encounters and error floor. This ordering can be attributed to the relatively short interleaver length, and the size of the tunnel opening at high values of mutual information (i.e. at the upper right hand corner of the EXIT chart). As discussed earlier when a short interleaver is employed correlation amongst the extrinsic information generated by the decoders reduces the actual amount of mutual information exchanged from the values predicted by the EXIT chart. If the EXIT chart is already narrow the iterative decoding process may terminate prematurely causing an error floor. Therefore, when a short interleaver is employed the size of the opening of the EXIT chart tunnel is an important consideration. To see the effect of a longer interleaver, we now look at the results of the 8400 bit interleaver. In this case none of the mappings encounters an error floor before a BER of 1O. We note that the M = 4, GL labeling scheme that we have considered provides BER performance within 1.2 dB of capacity. Finally, we consider 8-ary CPM. The mutual information transfer characteristics of five of the six 8-ary labelings given in Table 4.2 are shown in Figure 4.15 for CPM with h = 1/4 and a 2RC phase pulse. The mutual transfer characteristic of the HL is not shown as it is almost identical to the characteristic of the SSPL. Of the six labelings only two reach the (1,1) point of mutual information when the ‘tunnel’ opens at a relatively low SNR. The other four labelings are expected to demonstrate the BER waterfall characteristic but to produce BER error floors. The two labelings that reach the point of (1,1) of mutual information are the AGL and NAL labelings. The NAL labeling scheme has a threshold SNR of 1.0 dB, and the AGL labeling has a threshold of 0.9 dB and wider opening between the inner and outer mutual information transfer characteristics at low SNR. Figure 4.16 shows the simulated BER results for the M = 8 scheme just described. The rate distortion capacity is provided for reference. An interleaver of 4200 bits is used. For reference the performance of the UL scheme is shown in Figure 4.16. As expected the 137 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 100 l0 . : : : cc;:::l cv:: :::::::l: ccc:::::: vi::::: ::h.. cc:.: ci::: . cc: : ccl:::: cc:::::: 1: —0—UL —GL1 H! !!W! H:!H !!WU!________ 8400 bits 4200 bits / capacity 10 rn rn rn : 108 —0.5 0 0.5 H 1 rn rn:H 1.5 2 2.5 3 (Eb/.N) [dBj 10 1O1og Figure 4.14: Estimated capacity (bold curve) and simulated HER (non-bold curves) vs. 10 1og (Eb/MJ) for CPM: M = 4, 1REC phase pulse and h = 1/4) concatenated with the 10 rate 10/21 rate DPC II code. UL labeling scheme has an error floor at a relatively high BER (at 10). The AGL code provides BER performance within approximately 1 dB of capacity. 4.4.2 Block Fading Channel In this section, we consider the QSFC and the performance of proposed concatenated coding scheme employing ST—CPM. In this section will set NR = 1, and assume the outer code is the DPC II, rate 10/2 1 code. The transmitted energy per bit Eb is always normalized with respect to the number of transmit antenna. The ST—CPM coding scheme employs repetition coding with the symbol labelings listed in Tables 4.1 and 4.2. It is worth noting that repetition codings reduces the complexity of the DBST coding scheme from p’1T M’’ states to pML states. 138 ation Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modul 0 0.4 0.3 0.5 0.6 PCe ‘CPM, D 1 1 Figure 4.15: Mutual information transfer chart for the ST—CPM code employing NT (Eb/)) = 10 transmit antenna, and M = 8, h = 1/4, a 2RC pulse, and with a SNR of 10 log —2.0 dB and the symbol mappings given in Table 4.2. We begin with the performance of scheme employing M scheme considered is 1REC with h = 4, and NT = 2. The CPM 1/4. The EXIT chart for this scheme is shown in Figure 4.17. The spread of threshold SNRs in this case is 2.4, 3.8, and 3.0 dB for UL, GL1, and GL2, respectively. Once again, we note that prior to the threshold SNR the EXIT chart tunnel is most open for GL1, followed by GL2, and then UL. The second scheme we consider employs M 2RC phase pulse, with h = = 8, and NT = 3. The CPM scheme uses the 1/4. The EXIT chart for this scheme is shown in Figure 4.18. The mutual information transfer characteristics for the UL and the AGL are shown in the EXIT chart. The AGL labeling has a threshold SNR of 1.4 dB, whilst the UL does not open a tunnel unti1 an SNR of 10 dB is reached. The FER performance of these schemes 139 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 100 I I ......... .:;:.•::•.:• —*—UL —Q—AGL —— Capacity ::::::::::. 10 .1 .: .:: i0 . 10 : ::::::: : :: ::: :. . —0.5 0 : .: : : : :::: :: . S :5 . I I 0.5 1 . . ..;::.. : :..::::, : : : : :::: ::: : :: I 1.5 2 2.5 3 4 3.5 (Eb/M)) [dB] 10 101og Figure 4.16: Estimated capacity (bold curve) and simulated BER (non-bold curves) vs. (E/A/) for CPM: M = 8, 2RC phase pulse and h = 1/4) concatenated with the 10 10 log rate 10/21 rate DPC II code. is shown in Figure 4.19. The FER performance of the concatenated ST—CPM scheme with NT 2 antenna provides performance within 0.7 dB of the outage probability at capacity up to a FER of almost i0. The different symbol mappings for NT similar performance. The 1.4 dB spread of threshold SNRs for NT = = 2 provide very 2 is a relatively small margin in the QSFC, and the shape of the mutual information transfer characteristics is such that, for example, although the GL1 labeling has the highest threshold its tunnel is also open to the furthest right (of the three labelings considered) of the EXIT chart before the threshold SNR is reached. As expected the AGL labeling provides performance superior to the UL for NT = 3 at low to moderate SNR. At high SNR the tunnel opens for the UL and the scheme provides 140 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 0.3 0,4 0.5 0.6 ‘CPM, ‘DPC, Figure 4.17: EXIT chart for NT = 2 (M = 4, 1REC, h = 1/4) and the 10/21 rate DPC II code. The UL, GL1 and GL2 are shown at their threshold SNRs. performance comparable to the AGL. However, by selecting the AGL, a FER performance within 0.5 dB of the outage probability at capacity is provided. Finally, we note that the concatenated coding schemes presented in Figure 4.19 have the same rate, and consume the same amount of energy. Thus, increasing the number of transmit antenna provides an excellent means to improve system performance. 4.4.3 Comparison with Previous Work In this section, we compare the performance of the proposed scheme with that of existing concatenated ST—CPM, and concatenated CPM coding schemes. We first make a com parison of the performance of the proposed concatenated CPM code without considering the ST aspect. Using this comparison we can properly evaluate the merit of the proposed 141 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 0.3 0.4 0.5 0.6 ‘CPM, 1 DPCe Figure 4.18: EXIT chart for NT = 3 (M = 8, 2RC, h = 1/4) and the 10/21 rate DPC II code. The UL and SSPL are shown for SNRs of 1.4, 5.0, and 10.0 dB. pairing of the DPC class of codes with CPM. To date, all of the proposed schemes for concatenated codes ST—CPM employ convolutional codes, e.g. Zhang and Fitz [8], Boko lamulla and Aulin [9], and Gabrowska et at. [23]. In fact, most of the work on concatenated CPM employs convolutional codes. Therefore, the first comparison that we make is with the concatenated CPM code proposed by Moqvist and Aulin in [7]. Figure 4.20 shows the performance of MSK paired with a (7,5) convolutional code when transmitting over an AWGN channel. The performance of this scheme is shown for interleaver lengths of 128, 512, 2048, and 8192 bits. Also shown in the figure is the performance of MSK concatenated with the DPC 10/21 code (in this case the interleaver lengths are closely approximated by 126, 525, 2058, and 8190 bits). The performance of the concatenated CPM-DPC code clearly outperforms the performance of the concatenated CPM-CC code. Therefore, the 142 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 100 ::..:: _NT=2,GL1 NT=2GL2 — 2 Lower Bound NT= UL .NT=3,AGL ._..._, 0 2 , Lower Bound 3 NT= 4 6 8 10 12 14 16 18 20 (Eb/.MJ) [dB] 10 101og Figure 4.19: Estimated outage probability (bold curve) and simulated FER (non-bold curves) vs. 10 1og (Eb/J\fo) for concatenated ST—CPM. Results for NT = 2 (M = 4, 10 1/4), and NT 1REC, h 3 (M = 8, 2RC, h = 1/4) and the 10/21 rate DPC II code. UL, GL1, and GL2 shown for NT = 2, and UL, and SSPL shown for NT = 3. DPC class of codes are good fit for use with CPM, and promise competitive performance in a space-time system. The second comparison we make with delay diversity concatenated ST—CPM scheme proposed by Zhang and Fitz [8]. The scheme employs a (7,5) convolutional code, and 1RC, h = 1/4, M = 4 delay diversity CPM, and NT = 2 transmit antennas and NR 2 receive antennas. We use the same underlying ST—CPM scheme and replace the (7,5) convolutional code with the rate 10/2 1 DPC II code. An interleaver of 256 bits is employed and a maximum of 5 iterations are permitted. The FER performance of these schemes over a continuous fading channel with a fading bandwidth BfT = 0.008 is shown in Figure 4.21. Note that the FER results shown in the figure are taken from [9], where the scheme proposed 143 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 100 I CPM + CC (MA) —CPM+DPC - — - 10 : 1 : . C N=512 N=2048 10 10 1.5 Eb/J\fo [dB] —‘ Figure 4.20: BER vs. 10 1og (Eb/Mj) for the concatenated CPM scheme proposed by 10 Moqvist and Aulin in [7], and for the proposed scheme employing MSK concatenated with the rate 10/21 DPC II code over an AWGN channel. in [8] was employed with an improved detector. Once again the FER performance results show that the pairing of the DPC code with CPM is an improvement over a pairing with a convolutional code. Few results exist for the performance of concatenated ST—CPM coding schemes in QSFC. Bokomulla and Aulin [9] studied the performance of their proposed scheme when fading remained constant over a number of symbols rather than over an entire frame. We compare the performance of the proposed with that of ‘System B’in [9]. This scheme employs NT 2, and NR a 600 bit interleaver. = 2 antenna, a (7,5) convolutional outer code, MSK, and Full diversity is achieved by offsetting the carrier frequencies of the different transmit antenna by the normalized value /.fT = 1/6. The overall rate of 144 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 100 I I :::::::::::::::::::::::::::::::::::: ::: :: 10 . . : —CPFvI&CC(7,5)fromZhangetal. —cPM&DpcII(lo/21) . . . : . 10_2 0 2 1 4 3 5 6 (Eb/.N3) [dB] 10 101og Figure 4.21: FER vs. 10 log (Eb/J) for the concatenated CPM scheme employing a (7,5) 10 convolutional code as proposed by Zhang and Fitz in [8], [9], and the performance of CPM concatenated with the rate 10/21 DPC II code. The channel is a continuous fading channel with fading bandwidth BfT = 0.008, and NT = 2, NR = 2 antenna are employed. The underlying CPM scheme is 1RC, h = 1/4, M = 4. The interleaver length is 256 bits, and 5 iterations are used. the code is 0.5 bits per symbol duration T, and excluding the frequency offset it has a normalized bandwidth of T 99 B = 1.18. Due to the diagonal structure of our proposed code we employ CPM with the 2RC phase pulse, M = 4, and h = 1/4. We use the DPC II code with rate 10/21. The overall rate of the code is 0.4762 bits per symbol duration, and it has a normalized bandwidth of T 99 B = 1.24. In Figure 4.22 the performance of the Bokomullla and Aulin scheme is compared with that of the proposed scheme when fading is constant for f = 1, 10 and 30 symbol intervals, and 10 iterations are permitted. The proposed scheme provides comparable or superior performance regardless of the duration of the fading interval. Significant improvement is observable as the fading duration is 145 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation 100 I I ::::::::::::::::::::::::::::::::::::::;::::: —Bokomullaetal. . ::: ::::: :::::: : : :::::: :::: ::: ST—CPM + DPC II (rate 10/21) — — — .:::::::::::::::::.:::.:.“:::::. 10 ::::.::.::::::::::::::::::::::,::::..:::::::::::::::: f10 10 .,. .\ : 10 .:: ::::::::::::::::::::: : :::\:::::‘: :::: ::::::.::::::N ‘:::::::::::: ..‘ 4 io —3 f1 I —2.5 —2 —1.5 I —1 I I —0.5 0 0.5 I • 1 1.5 2 (Eb/.IVj) [dB] 10 10log (E’/A4) for the concatenated CPM scheme denoted as 10 Figure 4.22: BER vs. 10 log ‘system B’ by Bokomulla and Aulin [9], and the proposed scheme. Both schemes employ 2, NR 2, and a 600 bit interleaver. ‘System B’: (7,5) convolutional outer code, NT MSK and a /.fT 1/6 normalized carrier offset. ST—CPM and DPC code: rate 10/21 DPC II code, 2RC phase pulse, M 4, and h 1/4. The channel is a QSFC constant for f 1, 10, 30 symbol intervals. 10 iterations are permitted. = = = = = increased. We include no comparisons with the performance of the scheme proposed by Gabrowska et al. [23] due to the rate difference of the codes. The set of concatenated ST—CPM codes proposed in this chapter are by design highly flexible, low-rate, low complexity codes that are capable of non-coherent detection. The set of codes proposed by Gabrowska et al. have a high rate (the overall code rate is 1), but also a much higher degree of complexity at the receiver. The Gram—Schmidt decomposition employed by Gabrowska et al. replaces the CPM waveform with L(M — 1.) + 1 linear waveforms. In addition, this decomposition was previously designed specifically for CPFSK signals and all other CPM formats considered 146 Chapter 4. Concatenated Coding for Space—Time Coding with Continuous Phase Modulation by Gabrowska et al. are approximated as LREC signals, which may result in a performance degradation for CPM formats other than CPFSK. Lastly, no mechanism for non-coherent detection of the codes proposed by Gabrowska et al. is discussed in [23]. Thus, the set of codes proposed in this chapter may be a better fit for many strictly cost and energy constrained, ad-hoc wireless applications. 4.5 Conclusions A serially concatenated code for ST—CPM has been proposed. The concatenated code employs the diagonal block-based ST code proposed in Chapter 2 as an inner code, and a class of double parity check codes as the outer code. In order to evaluate the merit of the proposed scheme a method for estimating the capacity of underlying ST—CPM scheme in AWGN and over a QSFC was proposed. EXIT charts were employed to select the best CPM symbol labelings for the ST—CPM code. The concatenated code formed from the ST—CPM code and the DPC codes was shown to provide performance close to capacity, and to provide performance superior to that provided by CPM, and ST—CPM schemes that are concatenated with the commonly used convolutional code. 147 Chapter 5 Conclusions and Future Work In this chapter, we conclude the thesis by summarizing our results and highlighting the contributions of this dissertation. We also suggest several topics for further research. 5.1 Research Contributions In this thesis, we have proposed space—time (ST) codes for use with continuous phase modulation (CPM). In Chapter 2, we began by proposing a code that supports the combi nation of CPM with orthogonal designs (ODs). Then, we proposed a ST-CPM code using a diagonal signalling matrix. In Chapter 3, we used the ST-CPM code with the diagonal signalling matrix as the basis for a distributed ST-CPM code. Finally, in Chapter 4, we proposed combining a ST-CPM with a diagonal signalling matrix with a double parity check (DPC) code to form a serially concatenated code. Specifically, in Chapter 2 we begin with the proposal of a simple orthogonal space—time block coding (OSTBC) technique for CPM. Although the straightforward combination of orthogonal designs (ODs) and CPM was deemed impossible in [1] and [15], the burst— based approach accomplishes the task in very simple manner. The resulting ST-CPM code can be combined with any CPM format. After an appropriate ST combining at the receiver, the OSTBC scheme can utilize the same detection techniques as for a single— antenna transmission scheme. Thus, the proposed scheme entails a lower complexity than all previously proposed ST coding schemes for CPM. Additionally, simulation results along 148 Chapter 5. Conclusions and Future Work with accurate approximations that were derived for the bit error rate (BER) and the frame error rate (FER) of CPM with OSTBC show that this scheme yields a better performance for the important case of NT = 2 transmit antennas. For NT > 2 transmit antennas OSTBC for CPM suffers from the same rate loss as all ST coding schemes based on ODs. In the second part of Chapter 2 an alternate ST—CPM coding scheme was presented. This scheme also employs a block—based approach to preserve the properties of CPM, but in this case makes use of a diagonal signalling matrix rather than an OD. The resulting diag onal block-based ST—CPM (DBST—CPM) scheme facilitates non-coherent detection at the receiver in addition to providing increased energy efficiency. It was noted that DBST-CPM can be regarded as a non-trivial extension of the well-known differential ST modulation (DSTM) scheme with diagonal signal matrices for linear modulation formats. An upper bound on the frame-error rate of DBST—CPM in the quasi-static fading channel (QSFC) was derived for use in optimizing the DBST-CPM code. Also, an efficient code optimiza tion algorithm was presented. Additionally, decision rules were derived for low-complexity non-coherent detection of DBST-CPM in various fading environments. Numerical and simulation results showed that (a) the derived upper bound accurately predicts the per formance of DBST-CPM in the QSFC, (b) the proposed code optimization yields highly power-efficient designs, and (c) the non-coherent detectors approach the performances of their coherent counterparts for various fading channel models. In Chapter 3 we presented and analyzed the energy consumption of a distributed ST code for CPM. The distributed ST codes were designed to operate in wireless networks containing a large set of nodes V, of which only a small a priori unknown subset $ c .A/ were active at any time. Under the proposed scheme, a relay node transmits a signal which is the product of DBST—CPM code presented in Chapter 2 (optimized specifically for ST CPM transmission) and a signature vector of length N uniquely assigned to each node in 149 Chapter 5. Conclusions and Future Work the network. An efficient method was presented for the design and optimization of appro priate signature vector sets, assuming a quasi-static, frequency non-selective fading channel model. It was shown that when a properly designed signature vector set is employed a diversity order of d = , NJ can be achieved, where N 3 min{N 8 is the number of active relay nodes. The decoding complexity of the proposed scheme was shown to be independent of the number of active relay nodes. In the same manner as for the underlying DBST—CPM code, non-coherent receiver implementations, which do not require channel estimation, are applicable. Simulation results showed that the performance of the proposed distributed ST-CPM scheme is close to that achievable with co-located antennas. The chapter con cluded with a comparison of the total energy (radiated and used in hardware) required to supply a target BER at a maximum transmission distance for the distributed ST-CPM scheme and a distributed ST scheme based upon linear modulation. At high power the CPM based scheme offers significant energy savings, and extended coverage range (from 2.6% to 43.8%). Performance gains were shown to increase with the number of active relay nodes N . 3 Finally, in Chapter 4, we presented a serially concatenated code that used the diagonal ST-CPM code in combination with a double parity check code. EXIT charts were used to select the best performing symbol labelings in the AWGN channel and for the QSFC. A method was proposed to obtain an estimate on the capacity of the diagonal ST-CPM code over the AWGN channel. A lower bound on outage probability for the diagonal ST CPM code over the QSFC was derived in order to better evaluate the system. Simulation results showed that the concatenated code provided performance close to capacity over the AWGN channel, and achieved performance approaching the lower bound on outage probability over the QSFC. Finally, the concatenated code formed from the ST-CPM code and the DPC codes was shown to provide performance superior to that provided by CPM, 150 Chapter 5. Conclusions and Future Work and ST-CPM schemes that are concatenated with the commonly used convolutional code. 5.2 General Conclusions The ST—CPM codes presented in this thesis are highly flexible codes that can be used with any CPM format, any number of transmit and receive antenna, and can be used with existing CPM receivers. In addition, the DBST-CPM code enables non-coherent de tection. CPM allows for the use of energy efficient low power amplifiers. In the case of distributed coding we have shown that ST-CPM can provide considerable energy savings and an extended coverage range in comparison to distributed ST linear coding schemes. Serial concatenation of the ST-CPM code with DPC codes provides low error-rate perfor mance. In summary, the energy efficiency, flexibility, non-coherent detection capability, and performance provided by the proposed ST-CPM coding make this code an excellent candidate for application in wireless networks, especially highly energy constrained net works, such as sensor networks. 5.3 Suggestions for Future Work 1. The energy consumption analysis presented in Chapter 3 could be generalized from the case of distributed ST-CPM coding to ST-CPM code to provide a more holistic picture of the energy savings offered by employing a ST-CPM instead of a linear based code. 2. The serially concatenated ST-CPM coding scheme presented in Chapter 4 uses rep etition coding. The scheme could be extended to use different symbol labelings on each of the transmit antenna. Optimal symbol labelings could be selected with the aid of a multi-dimensional EXIT chart. 151 Bibliography [1] X. Zhang and M.P. Fitz. Space-Time Code Design with Continuous Phase Modulation. IEEE J. Select. Areas Commun., 21:783—792, June 2003. [2] F. Pancaldi and G.M. Vitetta. Space-Time Block Codes for Noncoherent CPFSK. In Proc. IEEE Global Telecom. Conf, pages 3043 3047, St. Louis, Oct./Nov. 2005. — [3] T. Pande, H. Huh, and J.V. Krogmeier. Non-Coherent Receiver Performance for Orthogonal Space-Time Coded CPM in Fading Channels. In Proc. 39th Asilomar Conf. on Signals, Systems and Computers, pages 853 856, Oct./Nov. 2005. — [4] A.-M. Silvester, L. Lampe, and R. Schober. “Diagonal Space-Time Code Design for Continuous-Phase Modulation”. In Proc. IEEE Global Telecom. Conf., San Francisco, November 2006. [5] J. Carls, F. Ellinger, R. Eickhoff, P. Sakalas, S. von der Mark, and S. Wehrli. Design of a C-Band CMOS Class AB Power Amplifier for an Ultra Low Supply Voltage of 1.9 V. In International Microwave and Optoelectronics Conference, pages 786—789, Aurangabad, India, November 2007. [6] S. Cao, W. Lu, S. Cheng, K. Zhang, W. Li, and X. Zhou. A 2.4 GHz Highly Linear Class C Power Amplifier in 0.18 m CMOS Technology. In International Conference on ASIC, pages 427—430, Guilin, China, October 2007. [7] P. Moqvist and T.M. Aulin. Serially Concatenated Continuous Phase Modulation with Iterative Decoding. IEEE Trans. Commun., 49:11:1901—1915, November 2001. [8] X. Zhang and M.P. Fitz. Soft-Output Demodulator in Space-Time-Coded Contin uous Phase Modulation. IEEE Trans. on Acoustics, Speech, and Signal Processing, 50:10:2589—2597, October 2007. [9] D. Bokolumulla and T. Aulin. Serially Concatenated Space-Time Coded Continuous Phase Modulated Signals. IEEE Trans. Commun., 6:10:3487—3492, October 2007. [10] V. Tarokh, N. Seshadri, and A.R. Calderbank. “Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction”. IEEE Trans. Inform. Theory, 44:3:744—765, March 1998. [11] S.M. Alamouti. A Simple Transmitter Diversity Scheme for Wireless Communications. IEEE J. Select. Areas Commun., 16:1451—1458, October 1998. 152 Bibliography [12] G.J. Foschini and M. Gans. On the Limits of Wireless Communicationsin a Fading Environment When Using Multiple Antennas. Wireless Pers. Commun., 6:311—335, March 1998. [13] E. Teletar. Capacity of Multi-Antenna Gaussian Channels. European Transactions on Telecommunications, 10:585—595, November 1999. [14] A. Wittneben. Base Station Modulation Diversity for Digital SIMULCAST. In Proc. of Veh. Technol. Conf., pages 848—853, May 1991. [15] G. Wang and X.-G. Xia. An Orthogonal Space-Time Coded CPM System with Fast Decoding for Two Transmit Antennas. IEEE Trans. Inform. Theory, IT-50:486—493, March 2004. [16] J.K. Cavers. Space—Time Coding Using MSK. IEEE Trans. Wireless Commun., TW 05:185—191, January 2005. [17] L. Xian, R. Punnoose, and H. Liu. Space-Time Block Coded GMSK With LowComplexity Linear Receiver. In Proc. IEEE mt. Conf. Commun., pages 2374 2378, June 2006. — [18] A.R. Ahmadi and R.K. Rao. Space-Time Trellis Code Design With Binary CPM. Electronics Letters, 42(3):168—170, February 2006. [19] W. Zhao and G.B. Giannakis. Reduced Complexity Receivers for Layered Space-Time CPM. IEEE Trans. Wireless Commun., 4(2):574—582, March 2005. [20] R.L. Maw and D.P. Taylor. Space-Time Coded Systems with Continuous Phase Fre quency Shift Keying. In Proc. IEEE Global Telecom. Conf., pages 1581 1586, Novem ber 2005. — [21] 5. Yiu, R. Schober, and L. Lampe. Distributed Space-Time Block Coding. IEEE Trans. Commun., 54:7:1195—1206, July 2006. [22] J.N. Laneman and G.W. Wornell. “Distributed Space—Time Block Coded Protocols for Exploiting Cooperative Diversity in Wireless Networks”. IEEE Trans. Inform. Theory, 49:2415—2425, October 2003. [23] M. Gabrowska, M. Bossert, S. Shavgulidze, and S. Schober. Serially Concatenated Space Time Convolutional Codes and Continuous Phase Modulation. IEEE Trans. Commun., 56:9:1442—1450, September 2008. [24] J. Mitra and L. Lampe. Serial Concatenation of Simple Linear Block Codes and Differential Modulations. IEEE Trans. Wireless Commun., 7:1477—1482, May 2008. [25] B.E. Rimoldi. A Decomposition Approach to CPM. IEEE Trans. Inform. Theory, IT-34:260—270, March 1988. 153 Bibliography [26] J. Huber and W.L. Liu. An Alternative Approach to Reduced—Complexity CPM— Receivers. IEEE J. Select. Areas Commun., SAC-7:1437—1449, December 1989. [27] Weilin Liu. Complexity Reduction for Coherent Recievers for Digital Continuous Phase Modulation. Doktor-Ingenieur, Universität der Bundeswehr München, Institut für Nachrichtentechnik, Werner-Heisenberg-Weg 39, D-85577 Neubiberg, 1990. [28] T.H. Lee. The Design of CMOS Radio-Frequency Integrated Circuits. Cambridge University Press, Cambridge, UK, 2004. [29] F.H. Raab, P. Asbeck, S. Cripps, P.B. Kenington, Z.B. Popovic, N. Pothecary, J.F. Sevic, and N.O. Sokal. Power Amplifiers and Transmitters for RF and Microwave. IEEE Trans. on Microwave Theory and Tech., 50:3:814—826, March 2002. [30] V. Tarokh, H. Jafarkhani, and A.R. Calderbank. Space—Time Block Codes from Orthogonal Designs. IEEE Trans. Inform. Theory, IT-45:1456—1467, July 1999. [31] B.L. Hughes. Differential Space-Time Modulation. 46(7):2567—2578, November 2000. IEEE Trans. Inform. Theory, [32] B.M. Hochwald and W. Sweldens. Differential Unitary Space-Time Modulation. IEEE Trans. Commun., 48(12) :2041—2052, December 2000. [33] H. Jafarkhani. Space- Time Coding. Cambridge University Press, New York, 2005. [34] G. Wang, W. Su, and X.-G. Xia. Orthogonal-Like Space-Time Coded CPM with Fast Decoding for Three and Four Transmit Antennas. In Proc. IEEE Global Telecom. Conf., pages 3321—3325, San Francisco, December 2003. [35] E. Lindskog and A. Paulraj. A Transmit Diversity Scheme for Channels with Intersym bol Interference. In Proceedings of IEEE International Conference on Communications (ICC), pages 307—311, New Orleans, 2000. [36] H. Bouzekri and S.L. Miller. Distance Spectra and Performance Bounds of Space— Time Trellis Codes Over Quasi—Static Fading Channels. IEEE Trans. Inform. Theory, IT-50:1820—1831, August 2004. [37] A. Stefanov and T.M. Duman. Performance Bounds for Space-Time Trellis Codes. IEEE Trans. Inform. Theory, pages 2134—2140, June 2002. [38] D. Aktas and M.P. Fitz. Distance Spectrum Analysis of Space Time Trellis—Coded Modulations in Quasi-Static Rayleigh Fading Channels. IEEE Trans. Inform. Theory, IT-49:3335—3344, December 2003. [39] A. Demir, A. Mehrotra, and J. Roychowdhury. Phase Noise in Oscillators: A Unify ing Theory and Numerical Methods for Characterization. IEEE Trans. Circuits and Systems, 47(5):655—674, May 2000. 154 Bibliography [40] Ed. W.C. Jakes, Jr. Microwave Mobile Communications. Prentice—Hall, Inc., New Jersey, 1974. [41] 0. Tirkkonen and A. Hottinen. Square-Matrix Embeddable Space-Time Block Codes for Complex Signal Constellations. IEEE Trans. Inform. Theory, IT-48:384—395, February 2002. [42] J.B. Anderson, T. Aulin, and C.-E. Sundberg. Digital Phase Modulation. Plenum Press, New York, 1986. [43] P. Laurent. Exact and Approximate Construction of Digital Phase Modulation by Superposition of Amplitude Modulated Pulses (AMP). IEEE Trans. Commun., COM 34:150—160, 1986. [44] M.K. Simon and M. Alouini. A Unified Approach to the Performance Analysis of Digital Communications over Generalized Fading Channels. Proceedings of the IEEE, 86:1860—1877, September 1998. [45] R. Raheli, A. Polydoros, and C.-K. Tzou. Per—Survivor Processing: A General Ap proach to MLSE in Uncertain Environments. IEEE Trans. Commun., 43:354—364, Feb./Apr. 1995. [46] R. Schober and L. Lampe. Noncoherent Receivers for Differential Space-Time Modu lation. IEEE Trans. Commun., 50(5):768—777, May 2002. [47] S. Lv, G. Wei, J. Zhu, and Z. Du. Differential Unitary Space-Time Modulation in Fast Fading Channel. In Proc. of Veh. Technol. Conf, pages 2374 2378, September 2004. — [48] D. Zheng and N.C. Beaulieu. Decision-Feedback Detection for Block Differential Space-Time Modulation. IEEE Trans. Commun., 54(5):900 910, May 2006. — [49] A.J. Viterbi. Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm. IEEE Trans. Commun., 13(2):260—269, April 1967. [50] G. Colavolpe and R. Raheli. Noncoherent Sequence Detection of Continuous Phase Modulations. IEEE Trans. Commun., 47(9): 1303—1307, September 1999. [51] L. Lampe, R. Schober, G. Enzner, and J. Huber. Coded Continuous Phase Modulation with Low-Complexity Noncoherent Reception. IEEE Trans. Commun., 50(4):517—520, April 2002. [52] R. Schober, L. Lampe, Y. Ma, and S. Pasupathy. DF-DD for Channels With Phase Noise. IEEE Trans. Commun., 51(6):890—893, June 2003. [53] S. Haykin. Adaptive Filter Theory. Prentice-Hall, Englewood Cliffs, New Jersey, 1986. 155 Bibliography [54] R.J. Young and J.H. Lodge. Detection of CPM Signals in Fast Rayleigh Flat-Fading Using Adaptive Channel Estimation. IEEE Trans. Veh. Technol., pages 338—347, May 1995. [55] M. V. Eyuboglu and S.U.H. Quershi. Reduced-State Sequence Estimation With Set Partitioning and Decision Feedback. IEEE Trans. Commun., 36(1):13—20, January 1988. [56] W.H. Press, S.A. Teukoisky, W.T. Vetterling, and B.P. Flannery. Numerical Receipes in Ci—i-. Cambridge University Press, New York, 2nd edition, 2002. [57] A.J. Viterbi and J.K. Omura. Principles of Digital Communications and Coding. McGraw Hill, New York, 1979. [58] T. Aulin, C.-E. Sundberg, and N. Rydbeck. Continous Phase Modulation Part II: Partial Response Signalling. IEEE Trans. Commun., COM-29:210—225, March 1981. — [59] A. Sendonaris, E. Erkip, and B. Aazhang. “User Cooperation Diversity II”. IEEE Trans. Commun., 51:1927—1948, November 2003. — Parts I and [60] R.U. Nabar, H. Bölcskei, and F.W. Kneubühler. “Fading Relay Channels: Perfor mance Limits and Space—Time Signal Design”. IEEE J. Select. Areas Commun., 22:1099—1109, August 2004. [61] G. Kramer, M. Gastpar, and P. Gupta. “Cooperative Strategies and Capacity Theo rems for Relay Networks”. IEEE Trans. Inform. Theory, pages 3037—3063, September 2005. [62] S. Cui, A.J. Goldsmith, and A. Bahai. “Energy-constrained Modulation Optimiza tion”. IEEE Trans. Wireless Commun., pages 2349—2360, September 2005. [63] H.E1 Gamal and D. Atkas. “Distributed Space-Time Filtering for Cooperative Wireless Networks”. In Proc. IEEE Global Telecom. Conf., San Francisco, December 2003. [64] R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge University Press, Cam bridge, UK, 1999. [65] B.M. Hochwald, T.L. Marzetta, T.J. Richardson, W. Sweldens, and R. Urbanke. “Sys tematic Design of Unitary Space-Time Constellations”. IEEE Trans. Inform. Theory, 46:1962—1973, September 2000. [66] B.S. Mergen and A. Scaglione. “Randomized Space-Time Coding for Distributed Cooperative Communication”. IEEE Trans. Signal Processing, 55:5003—5017, October 2007. [67] J.B. Huber. Trelliscodierung. Springer, Berlin, 1992. 156 Bibliography [68] 5. Cui, A.J. Goldsmith, and A. Bahai. Energy-constrained Modulation Optimization. IEEE Trans. Wireless Commun., 4:5:2349—2360, September 2005. [69] C. Li-Chung and J.V. Krogmeier. Analysis of the Effects of Linearity and Efficiency of Amplifiers in QAM Systems. In IEEE Wireless Corn. and Networking Conference, pages 475—479, New Orleans, USA, March 2003. [70] C. Liang, J. Jong, W. Stark, and J. East. Nonlinear Amplifier Effects in Communi cation Systems. IEEE Trans. on Microwave Theory and Tech., 47: 1461—1466, August 1999. [71] C. Rapp. Coded and Uncoded M-PSK and CPM Signals on Nonlinear Bandpass Channels: An Approach to a Fair Comparison. In Proc. IEEE Global Telecom. Conf, pages 720—724, San Diego, USA, December 1990. [72] A.M. Silvester, L. Lampe, and R. Schober. Distributed Space-Time Continuous Phase Modulation Code Design. IEEE Trans. Wireless Commun., Accepted for publication, 2008. http://www.ece.ubc.ca/ annas/Distributed ST-CPM Code Design.pdf. [73] J.B. Andersen, T.S. Rappaport, and S. Yoshida. Propagation Measurements and Models for Wireless Communications Channels. IEEE Communications Magazine, 33:1:42—49, January 1995. [74] T. Song, H.S. Oh, S. Hong, and E. Yoon. A 2.4-GHz sub-mW CMOS Receiver Frontend for Wireless Sensors Networks. IEEE Microwave and Wireless Components Let ters, 16:206—208, April 2006. [75] K. Giannopoulou, A. Katsareli, D. Dres, D. Vouyioukas, and P. Constantinou. Mea surements for 2.4 GHz Spread Spectrum System in Modern Office Buildings. In Mediterranean Electrotechnical Conference, pages 326—329, Limassol, Cyprus, May 2000. [76] C.E. Shannon. A Mathematical Theory of Communication. Bell System Tech. Journal, 27:623—656, October 1948. [77] S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara. Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding. IEEE Trans. Inform. Theory, 44:3:909—926, May 1998. [78] K.R. Narayanan and G.L. Stüber. Performance of Trellis-Coded CPM with Iterative Demodulation and Decoding. IEEE Trans. Commun., 49:4:676—687, April 2001. [79] M. Xiao and T.M. Aulin. Serially Concatenated Continuous Phase Modulation With Convolutional Codes Over Rings. IEEE Trans. Commun., 54:8:1387—1396, August 2006. 157 Bibliography [80] X. Li, A. Chindapol, and J.A. Ritcey. Bit-interleaved Coded Modulation with Iterative Decoding and 8PSK Signaling. IEEE Trans. Commun., 50:8:1250—1257, August 2002. [81] 5. Howard, C. Schlegel, and L. Perez. Differential Turbo Coded Modulation over Unsynchronized Channels. In lASTED 3rd International Conference on Wireless and Optical Communications, pages 96—101, Banif, Alberta, 2002. [82] R. Nuriyev and A. Anastasopolous. Rotationally Invariant and Rotationally Robust Codes for the AWGN and Noncoherent Channel. IEEE Trans. Commun., 51:12:2001— 2010, December 2003. [83] L.R. Bahl, J. Cocke, F. Jelinek, and J. Raviv. Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate. IEEE Trans. Inform. Theory, 20:2:264—287, March 1974. [84] T.J. Richardson and R.L. Urbanke. The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding. IEEE Trans. Inform. Theory, 47:2:599—618, Febru ary 2001. [85] S. ten Brink. Convergence Behavior of Iteratively Decoded Parallel Concatenated Codes. IEEE Trans. Commun., 49:10:1727—1737, October 2001. [86] G. Kramer. Serially and Parallel Concatenated (Turbo) Codes. Mini Course at TU Wien and FTW. [87] D.W. Marquardt. An Algorithm for Least-Squares Estimation of Nonlinear Parame ters. J. AppI. Math., 11:2:431—441, June 1963. [88] D.M. Arnold, 11.-A. Loeliger, P.O. Vontobel, A. Kavëié, and W. Zeng. SimulationBased Computation of Information Rates for Channels With Memory. IEEE Trans. Inform. Theory, 52:8:3498—3508, August 2006. [89] L. Lampe. Noncoherent Coded Modulation. Doktor-Ingenieur, Der Universität Erlangen-Nürnberg, Der Technichen Fakultät, Erwin-Rommel-Str. 60, 91058 Erlan gen, 2002. [90] S. Haykin. Digital Communications. John Wiley & Sons, mc, New York, USA, 1988. [91] S. Dolinar and D. Divsalar. Weight Distributions for Turbo Codes Using Random and Nonrandom Permutations. In JPL Progress Report, pages 42—122, 1995. 158 Appendix A Related Publications The following is a list of publications that are based on the research conducted for this thesis. Journal Papers 1. A.-M. Silvester, L. Lampe, and R. Schober. Energy Consumption of Distributed Space-Time Coding Methods. Submitted to the IEEE Transactions on Wireless Communications. 2. A.-M. Silvester, L. Lampe, and R. Schober. Distributed Space-Time Continuous Phase Modulation. IEEE Transactions on Wireless Communications, 7:11:4455- 4461, November 2008. 3. A.-M. Silvester, L. Lampe, and R. Schober. Space-Time Continuous Phase Modula tion for Non-Coherent Detection. IEEE Transactions on Wireless Communications, 7:4:1264—1275, April 2008. 4. A.-M. Silvester, R. Schober, and L. Lampe. Burst—Based Orthogonal ST Block Coding for CPM. IEEE Transactions on Wireless Communications, 6:4:1208—1212, April 2007. Conference Papers 5. A.-M. Silvester, L. Lampe, and R. Schober. Cooperative Diversity with Continuous Phase Modulation. In Proc. Sensor, Signal and Information Processing Conference, 159 Appendix A. Related Publications Invited Paper, Sedona, May 2008. 6. A.-M. Silvester, L. Lampe, and R. Schober. Distributed Space-Time Transmission with CPM. In Proc. IEEE Global Telecommunications Conference (Globecom), Wash ington, December 2007. 7. A.-M. Silvester, L. Lampe, and R. Schober. Diagonal Block Space-Time Code De sign for Continuous-Phase Modulation. In Proc. IEEE Global Telecommunications Conference (Globecom), San Francisco, December 2006. 8. A.-M. Silvester, R. Schober, and L. Lampe. Burst-based orthogonal ST Block Cod ing for CPM. In Proc. IEEE Global Telecommunications Conference (Globecom), St. Louis 2005. 160
- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Space-time continuous phase modulation
Open Collections
UBC Theses and Dissertations
Featured Collection
UBC Theses and Dissertations
Space-time continuous phase modulation Silvester, Anna-Marie 2009
pdf
Page Metadata
Item Metadata
Title | Space-time continuous phase modulation |
Creator |
Silvester, Anna-Marie |
Publisher | University of British Columbia |
Date Issued | 2009 |
Description | The combination of Space-Time (ST) coding and Continuous-Phase Modulation (CPM) produces a low power, energy efficient communication scheme suitable for wireless transmission. Space-time coding increases the reliability of transmission, and continuous-phase modulation (CPM) has the potential to provide considerable energy savings. CPM is a modulation technique that involves the transmission of a signal with continuous-phase and a constant envelope, where the continuous-phase property produces a very bandwidth efficient signal, and the constant-envelope property enables non linear (and thus energy efficient) signal amplification. The ST-CPM code is of special interest for wireless sensors because in the wireless sensor network environment energy consumption is highly constrained. The combination of ST codes and CPM is non-trivial and thus ST-CPM codes based upon block-based orthogonal and diagonal signal matrices are presented. These codes are forms the basis of a distributed ST-CPM code. The distributed ST codes are designed to operate in wireless networks containing a large set of nodes, of which only a small a priori unknown subset will be active at any time. The devised distributed ST-CPM scheme combines the ST-CPM code with a diagonal signaling matrix, (commonly assigned to all relay nodes) with signature vectors(uniquely assigned to nodes). The energy consumption of the proposed distributed ST-CPM scheme is compared with that of a distributed ST linear modulation (LM) scheme. The distributed ST-CPM scheme is shown to outperform the distributed ST-LM scheme for all but short-range transmission. Finally, a serially concatenated code for ST-CPM is proposed. The concatenated code consists of the diagonal signalling matrix as the inner code, and a class of double parity check (DPC) codes as the outer code. The resulting concatenated codes that are formed from the ST-CPM code and a DPC code are shown to provide performance close to capacity, and to provide performance superior to that provided by the more common combination of CPM, or ST-CPM schemes with convolutional codes. |
Extent | 5467033 bytes |
Genre |
Thesis/Dissertation |
Type |
Text |
File Format | application/pdf |
Language | eng |
Date Available | 2009-11-09 |
Provider | Vancouver : University of British Columbia Library |
Rights | Attribution-NonCommercial-NoDerivatives 4.0 International |
DOI | 10.14288/1.0065881 |
URI | http://hdl.handle.net/2429/14721 |
Degree |
Doctor of Philosophy - PhD |
Program |
Electrical and Computer Engineering |
Affiliation |
Applied Science, Faculty of Electrical and Computer Engineering, Department of |
Degree Grantor | University of British Columbia |
Graduation Date | 2009-05 |
Campus |
UBCV |
Scholarly Level | Graduate |
Rights URI | http://creativecommons.org/licenses/by-nc-nd/4.0/ |
Aggregated Source Repository | DSpace |
Download
- Media
- 24-ubc_2009_spring_silvester_anna-marie.pdf [ 5.21MB ]
- Metadata
- JSON: 24-1.0065881.json
- JSON-LD: 24-1.0065881-ld.json
- RDF/XML (Pretty): 24-1.0065881-rdf.xml
- RDF/JSON: 24-1.0065881-rdf.json
- Turtle: 24-1.0065881-turtle.txt
- N-Triples: 24-1.0065881-rdf-ntriples.txt
- Original Record: 24-1.0065881-source.json
- Full Text
- 24-1.0065881-fulltext.txt
- Citation
- 24-1.0065881.ris
Full Text
Cite
Citation Scheme:
Usage Statistics
Share
Embed
Customize your widget with the following options, then copy and paste the code below into the HTML
of your page to embed this item in your website.
<div id="ubcOpenCollectionsWidgetDisplay">
<script id="ubcOpenCollectionsWidget"
src="{[{embed.src}]}"
data-item="{[{embed.item}]}"
data-collection="{[{embed.collection}]}"
data-metadata="{[{embed.showMetadata}]}"
data-width="{[{embed.width}]}"
async >
</script>
</div>
Our image viewer uses the IIIF 2.0 standard.
To load this item in other compatible viewers, use this url:
http://iiif.library.ubc.ca/presentation/dsp.24.1-0065881/manifest