Although each application has its own quality of service (QoS) requirements, the resource allocation for multiclass services has not been studied adequately in multiuser orthogonal frequency division multiplexing (OFDM) systems. In this paper, a total transmit power minimization problem for downlink transmission is examined while satisfying multiclass services consisting of different data rates and target bit-error rates (BER). Lagrangian relaxation is used to find an optimal subcarrier allocation criterion in the context of subcarrier time-sharing by all users. We suggest an iterative algorithm using this criterion to find the upper and lower bounds of optimal power consumption. We also propose a prioritized subcarrier allocation (PSA) algorithm that provides low computation cost and performance very close to that of the iterative algorithm. The PSA algorithm employs subcarrier selection order (SSO) in order to decide which user takes its best subcarrier first over other users. The SSO is determined by the data rates, channel gain, and target BER of each user. The proposed algorithms are simulated in various QoS parameters and the fading channel model. Furthermore, resource allocation is performed not only subcarrier by subcarrier but also frequency block by frequency block (comprises several subcarriers). These extensive simulation environments provide a more complete assessment of the proposed algorithms. Simulation results show that the proposed algorithms significantly outperform existing algorithms in terms of total transmit power consumption.

In this letter, we propose a novel singular value decomposition zero-forcing beamforming (SVD-ZFBF) relaying scheme in the multiuser downlink MIMO broadcasting channel with fixed relays. Based on the processing scheme, we apply SUS [5] to select users at the relay station (RS) and develop a joint power allocation strategy at the base station (BS) and RS. By increasing the power at RS or selecting active users to obtain more multiuser diversity, SVD-ZFBF can approach an upper bound and outperform SVD-ZFDPC [1] with much lower complexity. Moreover, we show that the noise power ratio of RS to users significantly impacts the performance.

This paper addresses the problem of joint transceiver design for Tomlinson-Harashima Precoding (THP) in the multiuser multiple-input-multiple-output (MIMO) downlink under both perfect and imperfect channel state information at the transmitter (CSIT). For the case of perfect CSIT, we differ from the previous work by performing stream-wise (both inter-user and intra-user) interference pre-cancelation at the transmitter. A minimum total mean square error (MT-MSE) criterion is used to formulate our optimization problem. By some convex analysis of the problem, we obtain the necessary conditions for the optimal solution. An iterative algorithm is proposed to handle this problem and its convergence is proved. Then we extend our designed algorithm to the robust version by minimizing the conditional expectation of the T-MSE under imperfect CSIT. Simulation results are given to verify the efficacy of our proposed schemes and to show their superiorities over existing MMSE-based THP schemes.

This letter addresses the problem of robust transceiver design for the multiuser multiple-input-multiple-output (MIMO) downlink where the channel state information at the base station (BS) is imperfect. A stochastic approach which minimizes the expectation of the total mean square error (MSE) of the downlink conditioned on the channel estimates under a total transmit power constraint is adopted. The iterative algorithm reported in [2] is improved to handle the proposed robust optimization problem. Simulation results show that our proposed robust scheme effectively reduces the performance loss due to channel uncertainties and outperforms existing methods, especially when the channel errors of the users are different.

In this letter, a codebook based multiuser MIMO precoding scheme is proposed for a space-division multiple access (SDMA) system with limited feedback. Focusing on the case of SDMA systems with two transmit antennas, a precoder codebook design is proposed based on the idea that a precoder inducing larger fluctuations in the signal to interference and noise ratio (SINR) at each link can lead to a larger gain in terms of multiuser diversity. It is shown that the proposed multiuser MIMO precoding outperforms existing multiuser MIMO techniques in terms of the average system throughput.

In time-varying channels, the channel state information available at the transmitter (CSIT) is outdated due to inherent time delay between the uplink channel estimation and the downlink data transmission in TDD systems. In this letter, we propose an iterative precoding method and a linear decoding method which are both based on minimum mean-squared error (MMSE) criteria to mitigate the interference among data streams and users created by outdated CSIT for multiuser MIMO downlink systems. Analysis and simulation results show that the proposed method can effectively reduce the impairment of the outdated CSIT and improve the system capacity.

Sum power iterative water-filling (SPIWF) algorithm provides sum-rate-optimal transmission scheme for wireless multiple-input multiple-output (MIMO) broadcast channels (BC), whereas it suffers from its high complexity. In this paper, we propose a new transmission scheme based on a novel block zero-forcing dirty paper coding (Block ZF-DPC) strategy and multiuser-diversity-achieving user selection procedure. The Block ZF-DPC can be considered as an extension of existing ZF-DPC into MIMO BCs. Two user selection algorithms having linear increasing complexity with the number of users have been proposed. One aims at maximizing the achievable sum rate directly and the other is based on Gram-Schmidt Orthogonalization (GSO) and Frobenius norm. The proposed scheme is shown to achieve a sum rate close to the sum capacity of MIMO BC and obtain optimal multiplexing and multiuser diversity gain. In addition, we also show that both selection algorithms achieve a significant part of the sum rate of the optimal greedy selection algorithm at low computation expenditure.

This paper proposes an antenna selection method for terminal antennas employing orthogonal polarizations and patterns, which is suitable for outdoor MultiUser Multi-Input Multi-Output (MU-MIMO) systems. In addition, this paper introduces and verifies two other antenna selection methods for comparison. For the sake of simplicity, three orthogonal dipoles are considered, and this antenna configuration using the proposed selection method is compared to an antenna configuration with three vertical or horizontal dipoles. In the proposed antenna selection method, we always choose the vertical dipole, and choose one of two horizontal dipoles, which are orthogonal to each other, based on the Signal-to-Noise Ratio (SNR). We measured the MU-MIMO transmission properties and found that the proposed selection method employing the antenna with orthogonal polarizations and patterns can offer fairly high channel capacity in a multiuser scenario.

Dirty paper coding (DPC) is a strategy to achieve the region capacity of multiple input multiple output (MIMO) downlink channels and a DPC scheduler is throughput optimal if users are selected according to their queue states and current rates. However, DPC is difficult to implement in practical systems. One solution, zero-forcing beamforming (ZFBF) strategy has been proposed to achieve the same asymptotic sum rate capacity as that of DPC with an exhaustive search over the entire user set. Some suboptimal user group selection schedulers with reduced complexity based on ZFBF strategy (ZFBF-SUS) and proportional fair (PF) scheduling algorithm (PF-ZFBF) have also been proposed to enhance the throughput and fairness among the users, respectively. However, they are not throughput optimal, fairness and throughput decrease if each user queue length is different due to different users channel quality. Therefore, we propose two different scheduling algorithms: a throughput optimal scheduling algorithm (ZFBF-TO) and a reduced complexity scheduling algorithm (ZFBF-RC). Both are based on ZFBF strategy and, at every time slot, the scheduling algorithms have to select some users based on user channel quality, user queue length and orthogonality among users. Moreover, the proposed algorithms have to produce the rate allocation and power allocation for the selected users based on a modified water filling method. We analyze the schedulers complexity and numerical results show that ZFBF-RC provides throughput and fairness improvements compared to the ZFBF-SUS and PF-ZFBF scheduling algorithms.

The computation involved in multiuser detection (MUD) for multicarrier CDMA (MC-CDMA) based on maximum likelihood (ML) principle grows exponentially with the number of users. Particle swarm optimization (PSO) with soft decisions has been proposed to mitigate this problem. The computational complexity of PSO, is comparable with genetic algorithm (GA), but is much less than the optimal ML detector and yet its performance is much better than GA.

Due to the computational complexity of the optimum maximum likelihood detector (OMD) growing exponentially with the number of users, suboptimum techniques have received significant attention. We have proposed the particle swarm optimization (PSO) for the multiuser detection (MUD) in asynchronous multicarrier code division multiple access (MC-CDMA) system. The performance of PSO based MUD is near optimum, while its computational complexity is far less than OMD. Performance of PSO-MUD has also been shown to be better than that of genetic algorithm based MUD (GA-MUD) at practical SNR.

Ultra fast switching speed of superconducting digital circuits enable realization of Digital Signal Processors with performance unattainable by any other technology. Based on rapid-single-flux technology (RSFQ) logic, these integrated circuits are capable of delivering high computation capacity up to 30 GOPS on a single processor and very short latency of 0.1 ns. There are two main applications of such hardware for practical telecommunication systems: filters for superconducting ADCs operating with digital RF data and recursive filters at baseband. The later of these allows functions such as multiuser detection for 3G WCDMA, equalization and channel precoding for 4G OFDM MIMO, and general blind detection. The performance gain is an increase in the cell capacity, quality of service, and transmitted data rate. The current status of the development of the RSFQ baseband DSP is discussed. Major components with operating speed of 30 GHz have been developed. Designs, test results, and future development of the complete systems including cryopackaging and CMOS interface are reviewed.

We investigate the MIMO broadcast channels with imperfect channel knowledge due to estimation error and much more users than transmit antennas to exploit multiuser diversity. The channel estimation error causes the interference among users, resulting in the sum-rate loss. A tight upper bound of this sum-rate loss based on zeroforcing beamforming is derived theoretically. This bound only depends on the channel estimation quality and transmit antenna number, but not on the user number. Based on this upper bound, we show this system maintains full multiuser diversity, and always benefits from the increasing transmit power.

We propose a new broadcast strategy for a multiple-input multiple-output (MIMO) system with N transmit antennas at the transmitter and M≤N single antenna receivers. The proposed method, based on dirty-paper coding (DPC), spatially separates the M users but does not suffer from the power loss of classical spatial division multiple access (SDMA). For the special case of M=N=2 and when the two single antenna receivers are assumed to be co-located, the proposed scheme produces a 2 transmit, 2 receiver antenna MIMO transmission system that doubles the symbol rate of MIMO space-time block code (STBC) systems from one to two symbol per transmission time. It is proved theoretically and experimentally that the proposed scheme provides the same performance level as that of MIMO STBC systems (i.e., the Alamouti scheme) for the first symbol, and the same performance as the Bell labs layered space-time (BLAST) system for the second symbol. When compared to the BLAST system, the proposed scheme has the same symbol rate, but achieves significantly better performance, since it provides 2 level diversity per symbol on the first symbol while the BLAST system does not provide any diversity.

A rate control scheme is described for zero-forcing beamforming (ZFBF) multiuser multiple-input and multiple-output (MU-MIMO) systems with a QR-decomposition maximum likelihood detector (MLD) at the receiver. For selected users, a modulation-and-coding set is selected for each substream by estimating the per-substream post-MLD signal-to-interference-plus-noise ratio. Iterative modified QR-decomposition MLD is employed at the receiver to achieve the throughput expected from the transmitter. The simulation results demonstrated that the proposed rate-control scheme achieved the target packet error rate while increasing the throughout for ZFBF-MU-MIMO systems as the number of user candidates increases.

In this letter, a Tomlinson-Harashima precoding (THP) scheme is proposed for the downlink of multiuser MIMO systems with multiple antennas at each receiver. Assuming single data stream communication for each user, joint transmitter and receiver design is done to maximize the signal to noise ratio (SNR) for each user. Furthermore, a heuristic user ordering algorithm is proposed to optimize the encoding order and improve the bit error rate (BER) performance. Simulation results have shown that the proposed approach is superior to some existing precoding schemes.

This paper proposes a new partial channel state information (CSI) reporting method for spatial scheduling in TDD/MIMO systems. In the proposed method, a terminal transmits pilot signals using transmit beams which have large channel gains between the base station (BS) and the terminal. Then, the BS can obtain partial CSI through responses of the pilot signals. Furthermore, adaptive allocation of pilot signals is proposed, in which pilot signals for CSI reporting are adaptively allocated to terminals depending on the number of terminals. We evaluate system throughput of spatial scheduling under the partial CSI reporting from multiple terminals. Numerical results show that the proposed method reduces uplink signalling for CSI reporting effectively, keeping high system throughput of spatial scheduling.

Based on an analysis of the error patterns in lattice-reduction (LR) precoding in a multiple-antenna broadcast channel, this paper proposes a simple precoding technique that can reduce the quantization error. The proposed scheme establishes a lattice list to provide more candidates for transmission power reduction based on the analysis of the patterns of the error in the LR precoding method [9]. Simulation results show that the proposed scheme matches the BER performance of more complex precedents (such as the vector perturbation using sphere encoding) with significant saving in complexity.

The performance of multiuser MIMO downlink systems with block diagonalization (BD) relies on the channel state information (CSI) at the transmitter to a great extent. For time division duplex TDD systems, the transmitter estimates the CSI while receiving data at current time slot and then uses the CSI to transmit at the next time slot. When the wireless channel is time-varying, the CSI for transmission is imperfect due to the time delay between the estimation of the channel and the transmission of the data and severely degrades the system performance. In this paper, we propose a linear method to suppress the interferences among users and data streams caused by imperfect CSI at transmitter. The transmitter first sends pilot signals through a linear spatial precoding matrix so as to make possible that the receiver can estimate CSI of other users, and then the receiver exploits a linear prefilter to suppress the interference. The numerical results show that the proposed schemes achieve obvious performance enhancement in comparison to the BD scheme with imperfect CSI at the transmitter.

This letter deals with multiuser detection under imprecise knowledge of the received signature codes of all active users for multicarrier code division multiple access (MC-CDMA) systems. The weight vector of the modified multiple constrained minimum variance (MMCMV) is found by projecting the multiple constrained minimum variance (MCMV) weight vector onto a vector subspace constructed from the eigenstructure of the correlation matrix. However, MMCMV still cannot handle the large code-mismatch. Shaping the noise subspace with all estimated active spreading codes, we present an effective approach to achieve more robust capabilities than the MMCMV. Computer simulations show the effectiveness of the proposed detector.