scholarly journals H∞Channel Estimation for DS-CDMA Systems: A Partial Difference Equation Approach

2013 ◽  
Vol 2013 ◽  
pp. 1-8
Author(s):  
Wei Wang ◽  
Chunyan Han

In the communications literature, a number of different algorithms have been proposed for channel estimation problems with the statistics of the channel noise and observation noise exactly known. In practical systems, however, the channel parameters are often estimated using training sequences which lead to the statistics of the channel noise difficult to obtain. Moreover, the received signals are corrupted not only by the ambient noises but also by multiple-access interferences, so the statistics of observation noises is also difficult to obtain. In this paper, we will investigate theH∞channel estimation problem for direct-sequence code-division multiple-access (DS-CDMA) communication systems with time-varying multipath fading channels. The channel estimator is designed by applying a partial difference equation approach together with the innovation analysis theory. This method can give a sufficient and necessary condition for the existence of anH∞channel estimator.

2018 ◽  
Vol 7 (2.6) ◽  
pp. 311
Author(s):  
Sumitra N. Motade ◽  
Anju V. Kulkarni

Nowadays, Multicarrier Direct sequence code division multiple access (MC DS-CDMA) systems are used in mobile communication. Performance of these systems are limited by multiple access interference (MAI) created by spread-spectrum users in the channel as well as background channel noise. This paper proposes an incremental gradient descent (IGD) multi-user detection (MUD) for MC DS-CDMA system that can achieve near-optimum performance while the number of users is linear in its implementation complexity.  The IGD algorithm make an effort to perform optimum MUD by updating one user's bit decision each iteration in the best way. This algorithm accelerates the gradient algorithm convergence by averaging. When a minimum mean square error (MMSE) MUD is employed to initialize the proposed algorithm, in all cases tested the gradient search converges to a solution with optimum performance. Further, the iterative tests denote that the proposed IGD algorithm provides significant performance for cases where other suboptimum algorithms perform poorly. Simulation compares the proposed IGD algorithm with the conventional detectors. 


1999 ◽  
Vol 3 (2-4) ◽  
pp. 265-275 ◽  
Author(s):  
R. Brak ◽  
J. W. Essam ◽  
A. L. Owczarek

Sign in / Sign up

Export Citation Format

Share Document