Source-Channel Coding Theorems for the Multiple-Access Relay Channel

We study reliable transmission of arbitrarily correlated sources over multiple-access relay channels (MARCs) and multiple-access broadcast relay channels (MABRCs). In MARCs only the destination is interested in reconstructing the sources, while in MABRCs both the relay and the destination want to reconstruct them. In addition to arbitrary correlation among the source signals at the users, both the relay and the destination have side information correlated with the source signals. Our objective is to determine whether a given pair of sources can be losslessly transmitted to the destination for a given number of channel symbols per source sample, defined as the source-channel rate. Sufficient conditions for reliable communication based on operational separation, as well as necessary conditions on the achievable source-channel rates are characterized. Since operational separation is generally not optimal for MARCs and MABRCs, sufficient conditions for reliable communication using joint source-channel coding schemes based on a combination of the correlation preserving mapping technique with Slepian-Wolf source coding are also derived. For correlated sources transmitted over fading Gaussian MARCs and MABRCs, we present conditions under which separation (i.e., separate and stand-alone source and channel codes) is optimal. This is the first time optimality of separation is proved for MARCs and MABRCs.Comment: Accepted to IEEE Transaction on Information Theor

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

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

L2 OSTC-CPM: Theory and design

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