Low Complexity Noncoherent Iterative Detector for Continuous Phase Modulation Systems

This paper focuses on the noncoherent iterative detection of continuous phase modulation. A class of simplified receivers based on Principal-Component-Analysis (PCA) and Exponential-Window (EW) is developed. The proposed receiver is evaluated in terms of minimum achievable Euclidean distance, simulated bit error rate and achievable capacity. The performance of the proposed receiver is discussed in the context of mismatched receiver and the equivalent Euclidean distance is derived. Analysis and numerical results reveal that the proposed algorithm can approach the coherent performance and outperforms existing algorithm in terms of complexity and performance. It is shown that the proposed receiver can significantly reduce the detection complexity while the performance is comparable with existing algorithms

Detection, Receivers, and Performance of CPFSK and CPCK

Continuous Phase Modulation (CPM) is a power/bandwidth efficient signaling technique for data transmission. In this thesis, two subclasses of this modulation called Continuous Phase Frequency Shift Keying (CPFSK) and Continuous Phase Chirp Keying (CPCK) are considered and their descriptions and properties are discussed in detail and several illustrations are given. Bayesian Maximum Likelihood Ratio Test (MLRT) is designed for detection of CPFSK and CPCK in AWGN channel. Based on this test, an optimum receiver structure, that minimizes the total probability of error, is obtained. Using high- and low-SNR approximations in the Bayesian test, two receivers, whose performances are analytically easy-to-evaluate relative to the optimum receiver, are identified. Next, a Maximum Likelihood Sequence Detection (MLSD) technique for CPFSK and CPCK is considered and a simplified and easy-to-understand structure of the receiver is presented. Finally, a novel Decision Aided Receiver (DAR) for detection of CPFSK and CPCK is presented and closed-form expressions for its Bits Error Rate (BER) performance are derived. Throughout the thesis, performances of the receivers are presented in terms of probability of error as a function of Signal-to-Noise Ratio (SNR), modulation parameters and number of observation intervals of the received waveform. Analytical results wherever possible and, in general, simulation results are presented. An analysis of numerical results is given from the viewpoint of the ability of CPFSK and CPCK to operate over AWGN Channel

Considerations of digital phase modulation for narrowband satellite mobile communication

The Inmarsat-M system for mobile satellite communication is specified as a frequency division multiple access (FDMA) system, applying Offset Quadrature Phase Shift Keying (QPSK) for transmitting 8 kbit/sec in 10 kHz user channel bandwidth. We consider Digital Phase Modulation (DPM) as an alternative modulation format for INMARSAT-M. DPM is similar to Continuous Phase Modulation (CPM) except that DPM has a finite memory in the premodular filter with a continuous varying modulation index. It is shown that DPM with 64 states in the VA obtains a lower bit error rate (BER). Results for a 5 kHz system, with the same 8 kbit/sec transmitted bitstream, is also presented

Binary Continuous Phase Modulations Robust to a Modulation Index Mismatch

International audienceWe consider binary continuous phase modulation (CPM) signals used in some recent low-cost and low-power consumption telecommunications standard. When these signals are generated through a low-cost transmitter, the real modulation index can end up being quite different from the nominal value employed at the receiver and a significant performance degradation is observed, unless proper techniques for the estimation and compensation are employed. For this reason, we design new binary schemes with a much higher robustness. They are based on the concatenation of a suitable precoder with binary input and a ternary CPM format. The result is a family of CPM formats whose phase state is constrained to follow a specific evolution. Two of these precoders are considered. We will discuss many aspects related to these schemes, such as the power spectral density, the spectral efficiency, simplified detection, the minimum distance, and the uncoded performance. The adopted precoders do not change the recursive nature of CPM schemes. So these schemes are still suited for serial concatenation, through a pseudo-random interleaver, with an outer channel encoder

Trellis coding with Continuous Phase Modulation (CPM) for satellite-based land-mobile communications

This volume of the final report summarizes the results of our studies on the satellite-based mobile communications project. It includes: a detailed analysis, design, and simulations of trellis coded, full/partial response CPM signals with/without interleaving over various Rician fading channels; analysis and simulation of computational cutoff rates for coherent, noncoherent, and differential detection of CPM signals; optimization of the complete transmission system; analysis and simulation of power spectrum of the CPM signals; design and development of a class of Doppler frequency shift estimators; design and development of a symbol timing recovery circuit; and breadboard implementation of the transmission system. Studies prove the suitability of the CPM system for mobile communications

Capacity -based parameter optimization of bandwidth constrained CPM

Continuous phase modulation (CPM) is an attractive modulation choice for bandwidth limited systems due to its small side lobes, fast spectral decay and the ability to be noncoherently detected. Furthermore, the constant envelope property of CPM permits highly power efficient amplification. The design of bit-interleaved coded continuous phase modulation is characterized by the code rate, modulation order, modulation index, and pulse shape. This dissertation outlines a methodology for determining the optimal values of these parameters under bandwidth and receiver complexity constraints. The cost function used to drive the optimization is the information-theoretic minimum ratio of energy-per-bit to noise-spectral density found by evaluating the constrained channel capacity. The capacity can be reliably estimated using Monte Carlo integration. A search for optimal parameters is conducted over a range of coded CPM parameters, bandwidth efficiencies, and channels. Results are presented for a system employing a trellis-based coherent detector. To constrain complexity and allow any modulation index to be considered, a soft output differential phase detector has also been developed.;Building upon the capacity results, extrinsic information transfer (EXIT) charts are used to analyze a system that iterates between demodulation and decoding. Convergence thresholds are determined for the iterative system for different outer convolutional codes, alphabet sizes, modulation indices and constellation mappings. These are used to identify the code and modulation parameters with the best energy efficiency at different spectral efficiencies for the AWGN channel. Finally, bit error rate curves are presented to corroborate the capacity and EXIT chart designs

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

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