Adaptive step-size blind multi-user detectors for DS-CDMA systems under deterministically and Markovian time-varying multipath environments

Author(s):  
P. Arasaratnam ◽  
S. Zhu ◽  
A.G. Constantinides
2012 ◽  
Vol 16 (S3) ◽  
pp. 355-375 ◽  
Author(s):  
Olena Kostyshyna

An adaptive step-size algorithm [Kushner and Yin,Stochastic Approximation and Recursive Algorithms and Applications, 2nd ed., New York: Springer-Verlag (2003)] is used to model time-varying learning, and its performance is illustrated in the environment of Marcet and Nicolini [American Economic Review93 (2003), 1476–1498]. The resulting model gives qualitatively similar results to those of Marcet and Nicolini, and performs quantitatively somewhat better, based on the criterion of mean squared error. The model generates increasing gain during hyperinflations and decreasing gain after hyperinflations end, which matches findings in the data. An agent using this model behaves cautiously when faced with sudden changes in policy, and is able to recognize a regime change after acquiring sufficient information.


2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Zahoor Uddin ◽  
Ayaz Ahmad ◽  
Muhammad Iqbal ◽  
Zeeshan Kaleem

Independent component analysis (ICA) is a technique of blind source separation (BSS) used for separation of the mixed received signals. ICA algorithms are classified into adaptive and batch algorithms. Adaptive algorithms perform well in time-varying scenario with high-computational complexity, while batch algorithms have better separation performance in quasistatic channels with low-computational complexity. Amongst batch algorithms, the gradient-based ICA algorithms perform well, but step size selection is critical in these algorithms. In this paper, an adaptive step size gradient ascent ICA (ASS-GAICA) algorithm is presented. The proposed algorithm is free from selection of the step size parameter with improved convergence and separation performance. Different performance evaluation criteria are used to verify the effectiveness of the proposed algorithm. Performance of the proposed algorithm is compared with the FastICA and optimum block adaptive ICA (OBAICA) algorithms for quasistatic and time-varying wireless channels. Simulation is performed over quadrature amplitude modulation (QAM) and binary phase shift keying (BPSK) signals. Results show that the proposed algorithm outperforms the FastICA and OBAICA algorithms for a wide range of signal-to-noise ratio (SNR) and input data block lengths.


Sign in / Sign up

Export Citation Format

Share Document