A new timing estimation algorithm for asynchronous DS/CDMA multiuser communication system is proposed in this paper. The algorithm is based on the Minimum Variance Distortionless Response (MVDR) beamforming technique that minimizes the beamformer's output power with the constraint that only the signal with exact timing is distortionlessly passed. Exploiting the characteristics that the MVDR beamformer's output power is severely degraded according to erroneous timing estimation, we develop an efficient algorithm to estimate each user's timing by scanning the beamformer's output power variation. Compared to the maximum a posteriori (MAP) or maximum likelihood (ML) based multiuser timing estimator, the complexity is extensively reduced by separating the multi-dimensional optimization problem into several one-dimensional optimization problems. Furthermore, the algorithm is computationally feasible than the subspace-based timing estimator since no eigendecomposition (EVD) is required. Moreover, the proposed algorithm is near-far resistant since the MVDR beamformer is inherently energy independent to the interferers.

This paper aims to provide a robust multiuser detection structure that adaptively tracks signature waveform distortion for CDMA multipath signals. In practical wireless environment, multipath fading leads to signature waveform distortion that severely degrades the performance of the linear multiuser detectors (LMDs) designed by exploiting the original signature waveform. In what follows, an iterative algorithm is proposed to track the signature waveform perturbation. The rationale of adaptive processing is based on the subspace method and the Minimum Variance Distortionless Response (MVDR) beamforming concept. Performance evaluation reveals that the proposed adaptive multiuser detection structure reduces the impact of signature waveform perturbation on the performance of the LMDs to a great extent. Moreover, the proposed iterative algorithm is near-far resistant since both the subspace method and the MVDR beamforming technique are energy independent to the interferers.

In this paper, we first prove that the Randomly Addressed Polling (RAP) protocol is unstable under the random access channel with heavy traffic. We also show that network stability can be ensured by controlling the arrival rate λ or by expanding the available addresses p on the assumption that there are M finite stations within the coverage of the controller (the base station). From analyses and results, we see the equilibrium of arrival rate is inversely proportional to the product of users (stations) and the exponent of stations. We also see that the maximum throughput can be derived at the point of λ1/M. This maximum performance can be easily obtained under the consideration of RAP protocol's stability. It also implies that the maximum throughput is independent of the available addresses of RAP protocol when pM.