一种频选衰落信道下的Turbo多用户检测算法

联合MAP多用户检测与信道解码的迭代多用户检测(MUD)技术可显著提高宽带移动CDMA系统的容量和性能.在多径时变衰落的编码信道下,提出一种迭代实现干扰抑制、符号估计、信道解码的Turbo多用户检测算法.在每次迭代中,MUD自适应地实现干扰抑制并输出符号估计的软信息,软输入软输出的信道解码器使用LOG MAP方法实现信道解码并反馈符号估计的软信息作为下一次TurboMUD迭代的先验信息.仿真结果证实了该算法在频选衰落信道下经两次迭代就能逼近单用户编码CDMA系统的接收性能.     

Robust VB 2D-CELP image transmission over CDMA Rayleigh fading channels

This paper describes a new error resilient analysis-by-synthesis coding scheme and its application for robust still image transmission over CDMA Rayleigh fading channels. For the purpose of providing reliable transmission, a type-I hybrid ARQ protocol is used in a concatenated Reed–Solomon/convolutional coding scheme. However, for delay-constrained applications, the protocol is used with a limited number of retransmissions in addition to limited RS interleaving. Results of coded images are provided for the uplink of a communication system, where a slowly Rayleigh fading channel is considered.     

Block differential encoding for rapidly fading channels

Rapidly fading channels provide Doppler-induced diversity, but are also challenging to estimate. To bypass channel estimation, we derive two novel block differential (BD) codecs. Relying on a basis expansion model for time-varying channels, our differential designs are easy to implement, and can achieve the maximum possible Doppler diversity. The first design (BD-I) relies on a time-frequency duality, based on which we convert a time-varying channel into multiple frequency-selective channels, and subsequently into multiple flat-fading channels using orthogonal frequency-division multiplexing. Combined with a group partitioning scheme, BD-I offers flexibility to trade off decoding complexity with performance. Our second block differential design (BD-II) improves the bandwidth efficiency of BD-I at the price of increased complexity at the receiver, which relies on decision-feedback decoding. Simulation results corroborate our theoretical analysis, and compare with competing alternatives.     

On the detection of bandlimited direct-sequence spread-spectrumsignals transmitted via fading multipath channels

Recent investigations suggest bandlimited direct-sequence spread-spectrum transmission for use in CDMA mobile radio systems. In this paper, transmission systems with signal bandwidths not exceeding the chip rate are considered. First, the optimum noncoherent single-user receiver and various suboptimum approximations thereof are derived. These receivers utilize the fact that the received signals can be sampled at chip rate. This results in receiver concepts, which are well suited for fully digital implementations. Then, it is shown that the main result on the structure of the optimum single-user receiver is directly applicable to optimum noncoherent multiuser joint detection and interference cancellation. In this paper, noncoherent detection is considered. By this, we mean that only the channel statistics and not the channel itself is known to the receiver. It is shown that due to this less restrictive assumption, more powerful channel coding and interleaving schemes can be employed     

Adaptive detection of DS/CDMA signals in fading channels

This paper examines the behavior of the minimum mean-squared error (MMSE) receiver in frequency-nonselective-fading channels. It is noted that the MMSE receiver will often lose phase lock on the desired signal when the desired signal dips into a deep fade. A modification to the MMSE receiver is presented which is demonstrated to function quite nicely in flat-fading channels. Analytical results for the modified MMSE receiver are presented and found to agree very well with simulation results. These analytical results are then compared to the theoretical performance of the conventional (i.e., correlator) receiver in terms of both bit-error rate (BER) and capacity. As expected, the modified MMSE receiver was found to offer a substantial improvement in both BER and capacity. Finally, a simple empirically derived formula is given which will give a good approximation to the BER of the modified MMSE receiver in a Rayleigh-fading environment. This formula can also be used to determine the number of users a given system can support. It is noted that as E_b/N₀ grows, it is quite feasible to approach 100% channel utilization with the MMSE receiver, whereas a conventional receiver is typically limited to a utilization of 10%-20%     

Rate-adaptive transmission over correlated fading channels

In this paper, we investigate link adaptation and incremental redundancy (IR) retransmission schemes over correlated wireless channels. While computer simulations have been used to study the performance of these techniques, a numerically tractable analytical approach is more desirable to analyze generic protocols, and to reveal insights into the performance tradeoffs. An error-recursion approach is developed in this paper to mathematically analyze the throughput, delay, and energy efficiency of rate-adaptation techniques over fading channels with arbitrary correlations between retransmissions. Using Reed-Solomon codes as an example, we quantitatively predict the performance tradeoff of throughput and latency for IR schemes and the performance dependency on the channel correlation. Numerical results also show that reactive rate-adaptation schemes with IR retransmission outperform proactive rate-adaptive schemes, even with perfect channel side information, in terms of throughput and energy efficiency.     

Optimal decision strategies for acquisition of spread-spectrumsignals in frequency-selective fading channels

The focus of this paper is on the initial acquisition of a direct sequence (DS) spread-spectrum signal utilizing a purely parallel search strategy. A parallel search strategy is utilized because it reduces the acquisition time compared to either serial or partially parallel strategies. In particular, the purpose of this paper is to derive the optimal decision rule, based on the maximum-likelihood criterion, for frequency-selective fading channels. The performance of the conventional decision rule, optimized for additive white Gaussian noise and flat-fading channels, the optimal decision rule derived, and a suboptimal decision rule, also presented in this paper, are compared. It is shown that the optimal and suboptimal decision rules for Rayleigh-fading channels outperform the conventional decision rule. For Rician-fading channels, it is shown both that the optimal decision rule outperforms the conventional decision rule, and that the optimum decision rule for Rayleigh-fading channels, when implemented on a Rician-fading channel, yields approximately optimum performance     

Multiuser detection in asynchronous CDMA frequency-selective fading channels

Multipath fading severely limits the performances of conventional code division multiple-access (CDMA) systems. Since every signal passes through an independent frequency-selective fading channel, even modest cross-correlations among signature sequences may induce severe near-far effects in a central multiuser receiver. This paper presents a systematic approach to the detection problem in CDMA frequency-selective fading channels and proposes a low complexity linear multiuser receiver, which eliminates fading induced near-far problem.We initially analyze an optimal multiuser detector, consisting of a bank of RAKE filters followed by a dynamic programming algorithm and evaluate its performance through error probability bounds. The concepts of error sequence decomposition and asymptotic multiuser efficiency, used to characterize the optimal receiver performance, are extended to multipath fading channels.The complexity of the optimal detector motivates the work on a near-far resistant, low complexity decorrelating multiuser detector, which exploits multipath diversity by using a multipath decorrelating filter followed by maximal-ratio combining. Analytic expressions for error probability and asymptotic multiuser efficiency of the suboptimal receiver are derived that include the effects of multipath fading, multiple-access interference and signature sequences correlation on the receiver's performance.The results indicate that multiuser detectors not only alleviate the near-far problem but approach single-user RAKE performance, while preserving the multipath diversity gain. In interference-limited scenarios multiuser receivers significantly outperform the RAKE receiver.This paper was presented in part at the Twenty-Sixth Annual Conference on Information Sciences and Systems, Princeton, NJ, March 1992 and MILCOM'92, San Diego, CA, October 1992. This work was performed while author was with the Department of Electrical and Computer Engineering, Northeastern University, Boston, USA.     

On CDMA with space-time codes over multipath fading channels

We explore code-division multiple-access systems with multiple transmitter and receiver antennas combined with algebraic constellations over a quasi-static multipath fading channel. We first propose a technique to obtain transmit diversity for a single user over quasi-static fading channels by combining algebraic constellations with full spatial diversity and spreading sequences with good cross-correlation properties. The proposed scheme is then generalized to a multiuser system using the same algebraic constellation and different spreading sequences. We also propose a linear multiuser detector based on the combination of linear decorrelation with respect to all users, and the application of the sphere decoder to decode each user separately. Finally, we consider the generalization to multipath fading channels where the additional diversity advantage due to multipath is exploited by the sphere decoder, and a method of blind channel estimation based on subspace decomposition is examined.     

Adaptive transmission scheduling over fading channels for energy-efficient cognitive radio networks by reinforcement learning

In this paper, we address a cross-layer issue of long-term average utility maximization in energy-efficient cognitive radio networks supporting packetized data traffic under the constraint of collision rate with licensed users. Utility is determined by the number of packets transmitted successfully per consumed power and buffer occupancy. We formulate the problem by dynamic programming method namely constrained Markov decision process (CMDP). Reinforcement learning (RL) approach is employed to finding a near-optimal policy under undiscovered environment. The policy learned by RL can guide transmitter to access available channels and select proper transmission rate at the beginning of each frame for its long-term optimal goals. Some implement problems of the RL approach are discussed. Firstly, state space compaction is utilized to cope with so-called curse of dimensionality due to large state space of formulated CMDP. Secondly, action set reduction is presented to reduce the number of actions for some system states. Finally, the CMDP is converted to a corresponding unconstrained Markov decision process (UMDP) by Lagrangian multiplier approach and a golden section search method is proposed to find the proper multiplier. In order to evaluate the performance of the policy learned by RL, we present two naive policies and compare them by simulations.     

Blind adaptive multiuser detection for DS/CDMA over multipathfading channels

Using a hard null scheme, multipath fading and multiple access interference suppression can be realised for a multiple constrained minimum variance (MCMV) detector at the same time. A modified version of the MCMV detector is also presented, which utilises the eigenstructure of the correlation matrix to enhance the performance of the MCMV detector. Numerical results demonstrate the effectiveness of the proposed detectors     

Parallel group detection for synchronous CDMA communication overfrequency-selective Rayleigh fading channels

A group detector jointly detects a group of users, and a parallel group detection scheme is a bank of J independently operating group detectors, one for each group of a J group partition of the K transmitting users of a code-division multiple-access (CDMA) channel. In this paper, two group detectors are introduced for the frequency-selective Rayleigh fading (FSRF) CDMA channel. While the optimum multiuser detector has a time complexity per symbol (TCS) of O(M ^K/K) for M-ary signaling, each of the two group detectors has a TCS of O(M(|G|)/|G|) where |G| is the group size. Hence, there are parallel group detection schemes, based on each of the two group detectors, that satisfy a wide range of complexity constraints that result from the choice of partition. Each of the two group detectors is minimax optimal in the corresponding conditional group near-far resistance measure. Furthermore, a succinct indicator of the average BER over high SNR regions is defined via the asymptotic efficiency. A lower bound and an exact formula for the asymptotic efficiency are derived for the first and second group detectors, respectively. The group detection approach for the FSRF-CDMA channel generalizes previous approaches to the complexity-performance tradeoff problem. It yields the optimum detector when the group size is K. When the group size is equal to one, the first group detector results in a new optimum linear detector and the second reduces to a recently proposed suboptimum linear detector. All other nontrivial partitions yield new multiuser detectors whose performances are commensurate with their complexities     

Error statistics in data transmission over fading channels

We investigate the behavior of block errors which arise in data transmission on fading channels. Our approach takes into account the details of the specific coding/modulation scheme and tracks the fading process symbol by symbol. It is shown that a Markov approximation for the block error process (possibly degenerating into an identically distributed (i.i.d.) process for sufficiently fast fading) is a good model for a broad range of parameters. Also, it is observed that the relationship between the marginal error rate and the transition probability is largely insensitive to parameters such as block length, degree of forward error correction and modulation format, and depends essentially on an appropriately normalized version of the Doppler frequency. This relationship can therefore be computed in the simple case of a threshold model and then used more generally as an accurate approximation. This observation leads to a unified approach for the channel modeling, and to a simplified performance analysis of upper layer protocols     

Multiuser detectors for large CDMA random access systems over Rayleigh fading channels

In this paper, large code division multiple access (CDMA) random access systems employing the decorrelator and minimum mean square error (MMSE) detectors are investigated over Rayleigh fading channels under the assumption that both the number of users and the spreading gain tend to infinity, but their ratio converges to a constant. The signal to interference ratio (SIR) is shown to converge almost surely to a constant and the bit‐error rate (BER) is expressed as a function of the traffic load, transmission probability, channel coefficient, and distribution of transmission power. Furthermore, the throughput, the spectrum efficiency, and the stability region are analyzed and simulated. For dominating systems, it is shown that the MMSE detector achieves much higher throughput and spectral efficiency than decorrelator detector. Besides, it is also disclosed that, when the signal to noise ratio (SNR) is larger than an optimum value, the spectrum efficiency increases as the ratio of bit energy to noise power spectrum density (E_b/N₀) increases; however, when SNR is smaller than the optimum value, the spectrum efficiency decreases as E_b/N₀ increases. For ordinary stable systems, it is demonstrated that their stability region gets narrower as the traffic load increases. Copyright © 2010 John Wiley & Sons, Ltd.     

Hierarchical constellation for multi-resolution data transmission over block fading channels

We propose a new technique for multi-resolution video/image data transmission over block fading channels. The proposed scheme uses an adaptive scheduling protocol employing a retransmission strategy in conjunction with a hierarchical signal constellation (known also as nonuniform, asymmetric, multi-resolution constellation) to give different transmission priorities to different resolution levels. Transmission priorities are given in terms of average packet loss rate as well as average throughput. Basically, according to the transmission scheduling and channel state (acknowledgment signal) of the previous transmission, it dynamically selects packets from different resolution levels to transmit for the current transmission. The bits from the selected packets are assigned to different hierarchies of a hierarchical 4/16-quadrature amplitude modulation to transmit them with different error protections. The selection of packets for transmission and the assignment of these selected packets to different hierarchies of the hierarchical constellation are referred to as the scheduling protocol in our proposed scheme. We model this protocol by a finite state first order Markov chain and obtain the packet loss rate and the packet transmission rate over Nakagami-m block fading channel in closed-form. Some selected numerical results show that the proposed scheme can control the relative packet loss rate and the packet transmission rate of different resolution levels by varying the priority parameter (or equivalently, the asymmetry) of the hierarchical constellation and the maximum number of allowed retransmissions.     

Error protection for progressive image transmission over memorylessand fading channels

Product channel codes are proposed to protect progressively compressed and packetized images for noisy channels. Within packets, the product code uses the concatenation of a rate-compatible punctured convolutional code and an error detecting parity check code. Across packets, Reed-Solomon codes are used. Benefits include flexible choice of delay, adaptability of error protection level (i.e., unequal error protection), and scalable decoding complexity. The system outperforms the best known image coders for memoryless channels and performs well on fading channels     

Packet data transmission over mobile radio channels

Since in mobile radio Rayleigh fading poses the main threat to accurate data transmission, a mathematical model of the dynamics of Rayleigh fading is used to explore the optimum duration of data packets. The performance criterion is the rate of information transfer through the mobile radio channel. In addition to packet size, the information rate depends on: the speed of the mobile terminal, the channel bit rate, the size of the packet header, and the fade margin of the modulation and coding techniques. In particular, attention is focused on line rates of 16 kb/s and 256 kb/s (which are representative of the rates proposed for digital mobile radio systems in North America and Europe, respectively). At 16 kb/s, the optimum packet size is approximately 17 B (8.5-ms duration). At 256 kb/s, maximum throughput occurs when the packet contains about 48 B (1.5-ms duration). The precise optimum depends on vehicle speed, header size, and fade margin. The optimum packets are considerably shorter than the 125-B packets customarily used in terrestrial and satellite systems     

Throughput performance of slotted DS/CDMA ALOHA with packetcombining over generalised fading channels

A time diversity automatic repeat-request (ARQ) scheme is investigated for a slotted narrowband DS/CDMA wireless data network over a Nakagami fading channel. Numerical results reveal that the proposed adaptive retransmission diversity with packet combining provides a considerable advantage over the conventional slotted DS/CDMA ALOHA at the expense of a slight increase in implementation complexity     

Performance analysis of coded space‐time adaptive detection in DS/CDMA systems over Rayleigh fading channels

In this paper, we study the use of channel coding in a direct‐sequence code‐division multiple‐access (DS‐CDMA) system that employs space‐time adaptive minimum‐mean square‐error (MMSE) interference suppression over Rayleigh fading channels. It is shown that the employment of adaptive antenna arrays at the receiver can assist in attenuating multiuser interference and at the same time speeds‐up the convergence rate of the adaptive receiver. In this work, we assess the accuracy of the theoretical results developed for the uncoded and convolutionally coded space‐time multiuser detector when applied to the adaptive case. It is found that the use of antenna arrays brings the receiver performance very close to its multiuser counterpart. Using performance error bounds, we show that a user‐capacity gain of approximately 200% can easily be achieved for the space‐time adaptive detector when used with a rate 1/2 convolutional code (CC) and a practical channel interleaver. This capacity gain is only 10% less than the gain achieved for the more complicated multiuser‐based receiver. Finally, we perform a comparison between convolutional and turbo coding where we find that the latter outperforms the former at all practical bit‐error rates (BER). Copyright © 2006 John Wiley & Sons, Ltd.     

Error performance of multiple-symbol differential detection of PSKsignals transmitted over correlated Rayleigh fading channels

The error performance of multiple-symbol differential detection of uncoded QPSK signals transmitted over correlated Rayleigh fading channels is studied. The optimal detector is presented, along with an exact expression for the corresponding pairwise error event probability. It is shown that multiple-symbol differential detection is a very effective strategy for eliminating the irreducible error floor associated with a conventional differential detector. In all of the cases investigated, a detector with an observation interval as small as two symbols is sufficient for this purpose. It is also found that the error performance of a multiple-symbol differential detector is not sensitive to the mismatch between the decoding metric and the channel fading statistics