Equalization with oversampling in multiuser CDMA systems

Some of the major challenges in the design of new-generation wireless mobile systems are the suppression of multiuser interference (MUI) and inter-symbol interference (ISI) within a single user created by the multipath propagation. Both of these problems were addressed successfully in a recent design of A Mutually Orthogonal Usercode-Receiver (AMOUR) for asynchronous or quasisynchronous code division multiple access (CDMA) systems. AMOUR converts a multiuser CDMA system into parallel single-user systems regardless of the multipath and guarantees ISI mitigation, irrespective of the channel locations. However, the noise amplification at the receiver can be significant in some multipath channels. In this paper, we propose to oversample the received signal as a way of improving the performance of AMOUR systems. We design Fractionally Spaced AMOUR (FSAMOUR) receivers with integral and rational amounts of oversampling and compare their performance with the conventional method. An important point that is often overlooked in the design of zero-forcing channel equalizers is that sometimes, they are not unique. This becomes especially significant in multiuser applications where, as we will show, the nonuniqueness is practically guaranteed. We exploit this flexibility in the design of AMOUR and FSAMOUR receivers and achieve noticeable improvements in performance

Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks

In this paper, we consider a cognitive radio network that consists of one cognitive base station (CBS) and multiple cognitive users (CUs) in the presence of multiple eavesdroppers, where CUs transmit their data packets to CBS under a primary user's quality of service (QoS) constraint while the eavesdroppers attempt to intercept the cognitive transmissions from CUs to CBS. We investigate the physical-layer security against eavesdropping attacks in the cognitive radio network and propose the user scheduling scheme to achieve multiuser diversity for improving the security level of cognitive transmissions with a primary QoS constraint. Specifically, a cognitive user (CU) that satisfies the primary QoS requirement and maximizes the achievable secrecy rate of cognitive transmissions is scheduled to transmit its data packet. For the comparison purpose, we also examine the traditional multiuser scheduling and the artificial noise schemes. We analyze the achievable secrecy rate and intercept probability of the traditional and proposed multiuser scheduling schemes as well as the artificial noise scheme in Rayleigh fading environments. Numerical results show that given a primary QoS constraint, the proposed multiuser scheduling scheme generally outperforms the traditional multiuser scheduling and the artificial noise schemes in terms of the achievable secrecy rate and intercept probability. In addition, we derive the diversity order of the proposed multiuser scheduling scheme through an asymptotic intercept probability analysis and prove that the full diversity is obtained by using the proposed multiuser scheduling.Comment: 12 pages. IEEE Transactions on Communications, 201

Multiuser MIMO-OFDM for Next-Generation Wireless Systems

This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highlighting the limitations of conventional detection and channel estimation techniques designed for multiuser MIMO OFDM systems in the so-called rank-deficient scenarios, where the number of users supported or the number of transmit antennas employed exceeds the number of receiver antennas. This is often encountered in practice, unless we limit the number of users granted access in the base station’s or radio port’s coverage area. Following a historical perspective on the associated design problems and their state-of-the-art solutions, the second half of this treatise details a range of classic multiuser detectors (MUDs) designed for MIMO-OFDM systems and characterizes their achievable performance. A further section aims for identifying novel cutting-edge genetic algorithm (GA)-aided detector solutions, which have found numerous applications in wireless communications in recent years. In an effort to stimulate the cross pollination of ideas across the machine learning, optimization, signal processing, and wireless communications research communities, we will review the broadly applicable principles of various GA-assisted optimization techniques, which were recently proposed also for employment inmultiuser MIMO OFDM. In order to stimulate new research, we demonstrate that the family of GA-aided MUDs is capable of achieving a near-optimum performance at the cost of a significantly lower computational complexity than that imposed by their optimum maximum-likelihood (ML) MUD aided counterparts. The paper is concluded by outlining a range of future research options that may find their way into next-generation wireless systems

Opportunism in Multiuser Relay Channels: Scheduling, Routing and Spectrum Reuse

In order to understand the key merits of multiuser diversity techniques in relay-assisted cellular multihop networks, this paper analyzes the spectral efficiency of opportunistic (i.e., channel-aware) scheduling algorithms over a fading multiuser relay channel with $K$ users in the asymptotic regime of large (but finite) number of users. Using tools from extreme-value theory, we characterize the limiting distribution of spectral efficiency focusing on Type I convergence and utilize it in investigating the large system behavior of the multiuser relay channel as a function of the number of users and physical channel signal-to-noise ratios (SNRs). Our analysis results in very accurate formulas in the large (but finite) $K$ regime, provides insights on the potential performance enhancements from multihop routing and spectrum reuse policies in the presence of multiuser diversity gains from opportunistic scheduling and helps to identify the regimes and conditions in which relay-assisted multiuser communication provides a clear advantage over direct multiuser communication.Comment: 5 page

Uplink Multiuser MIMO Detection Scheme with Reduced Computational Complexity

The wireless communication systems with multiple antennas have recently received significant attention due to their higher capacity and better immunity to fading channels as compared to single antenna systems. A fast antenna selection scheme has been introduced for the uplink multiuser multiple-input multiple-output (MIMO) detection to achieve diversity gains, but the computational complexity of the fast antenna selection scheme in multiuser systems is very high due to repetitive pseudo-inversion computations. In this paper, a new uplink multiuser detection scheme is proposed adopting a switch-and-examine combining (SEC) scheme and the Cholesky decomposition to solve the computational complexity problem. K users are considered that each users is equipped with two transmit antennas for Alamouti space-time block code (STBC) over wireless Rayleigh fading channels. Simulation results show that the computational complexity of the proposed scheme is much lower than the systems with exhaustive and fast antenna selection, while the proposed scheme does not experience the degradations of bit error rate (BER) performances