DMT Optimal On-Demand Relaying for Mesh Networks

This paper presents a new cooperative MAC (Medium Access Control) protocol called BRIAF (Best Relay based Incremental Amplify-and-Forward). The proposed protocol presents two features: on-demand relaying and selection of the best relay terminal. “On-demand relaying” means that a cooperative transmission is implemented between a source terminal and a destination terminal only when the destination terminal fails in decoding the data transmitted by the source terminal. This feature maximizes the spatial multiplexing gain r of the transmission. “Selection of the best relay terminal” means that a selection of the best relay among a set of (m-1) relay candidates is implemented when a cooperative transmission is needed. This feature maximizes the diversity order d(r) of the transmission. Hence, an optimal DMT (Diversity Multiplexing Tradeoff) curve is achieved with a diversity order d(r) = m(1-r) for 0 ≤ r ≤ 1

Adaptive detection for a differential chaos-based multiple access system on unknown multipath fading channels

This paper addresses the problem of bit detection for a chaos-based multiple-access system. In particular, one considers the Differential Chaos Shift Keying modulation. It is assumed that the transmission channels are frequency-selective. Moreover, the channel coefficients and the channel delays are unknown to the receiver. It is only assumed that vague estimates of the minimum and maximum channel delays are available for the user of interest. In this context, the detection is achieved using a training sequence from which an LMS detector is derived. The theoretical performance results are compared to those of the optimal detector for which all channel characteristics are known. Simulation results are given, which confirm the theoretical study

Statistical Modeling of Bit-Error-Rates in Asynchronous Multicarrier CDMA and Direct-Sequence CDMA Systems

This paper presents a method for modeling the bit-error-rate (BER) probability density functions (pdf) of asynchronous Multicarrier Code Division Multiple Access (MC-CDMA) and Direct-Sequence Code Division Multiple Access (DS-CDMA) systems. An uplink channel is considered and it is assumed that the only channel distortion introduced by the channel is caused by the timing misalignments. Deterministic spreading sequences are used and the pdfs of each interferer'’s multiple access interference (MAI) are determined as a function of timing offset. A Nakagami-m distribution is fitted to the pdf of the total MAI power and the BER pdf is obtained directly from this Nakagami-m pdf. Both Walsh-Hadamard (WH) and Gold sequences are analyzed and the mean BERs are compared amongst the two multiple access systems for both sets of spreading sequences of varying lengths. The results suggest a higher resistance to MAI in the MC-CDMA technique for the considered environment

Statistical Modeling of Multiple Access Interference Power: a Nakagami-m Random Variable

This paper proposes a statistical model for the total multiple access interference (MAI) power for both Direct-Sequence Code Division Multiple Access (DS-CDMA) and Multicarrier Code Division Multiple Access (MC-CDMA) systems. We consider the use of both Walsh-Hadamard (WH) and Gold spreading codes transmitting over the asynchronous uplink channel. Detailed signal models of both CDMA systems are derived illustrating the production of MAI under asynchronous conditions. The paper demonstrates the Gaussian nature of the total MAI and shows that the probability density function (pdf) of the total MAI power can be very accurately characterized by the Nakagami-m distribution

Turbo receivers for interleave-division multiple-access systems

In this paper several turbo receivers for Interleave-Division Multiple-Access (IDMA) systems will be discussed. The multiple access system model is presented first. The optimal, Maximum A Posteriori (MAP) algorithm, is then presented. It will be shown that the use of a precoding technique at the emitter side is applicable to IDMA systems. Several low complexity Multi-User Detector (MUD), based on the Gaussian approximation, will be next discussed. It will be shown that the MUD with Probabilistic Data Association (PDA) algorithm provides faster convergence of the turbo receiver. The discussed turbo receivers will be evaluated by means of Bit Error Rate (BER) simulations and EXtrinsic Information Transfer (EXIT) charts