Among all the techniques combining multi-carrier modulation and spread spectrum, the multi-carrier code division multiple access (MC-CDMA) system is by far the most widely studied. In this paper, we present the performance of the MC-CDMA system associated with key single-user detection techniques. We are interested in problems related to identification and equalization of mobile radio channels, using the kernel method in Hilbert space with a reproducing kernel, and a linear adaptive algorithm, for MC-CDMA systems. In this context, we tested the efficiency of these algorithms, considering practical frequency selective fading channels, called broadband radio access network (BRAN), standardized for MC-CDMA systems. As far as the equalization problem encountered after channel identification is concerned, we use the orthogonality restoration combination (ORC) and the minimum mean square error (MMSE) equalizer techniques to correct the distortion of the channel. Simulation results demonstrate that the kernel algorithm is efficient for practical channel.
In recent years, researchers have tried to estimate the direction-of-arrival (DOA) of wideband sources and several novel techniques have been proposed. In this paper, we compare six algorithms for calculating the DOA of broadband signals, namely coherent subspace signal method (CSSM), two-sided correlation transformation (TCT), incoherent multiple signal classification (IMUSIC), test of orthogonality of frequency subspaces (TOFS), test of orthogonality of projected subspaces (TOPS), and squared TOPS (S-TOPS). The comparison is made through computer simulations for different parameters, such as signal-to-noise ratio (SNR), in order to establish the efficiency and performance of the discussed methods in noisy environments. CSSM and TCT require initial values, but the remaining approaches do not need any preprocessing.
In recent years, kernel methods have provided an important alternative solution, as they offer a simple way of expanding linear algorithms to cover the non-linear mode as well. In this paper, we propose a novel recursive kernel approach allowing to identify the finite impulse response (FIR) in non-linear systems, with binary value output observations. This approach employs a kernel function to perform implicit data mapping. The transformation is performed by changing the basis of the data In a high-dimensional feature space in which the relations between the different variables become linearized. To assess the performance of the proposed approach, we have compared it with two other algorithms, such as proportionate normalized least-meansquare (PNLMS) and improved PNLMS (IPNLMS). For this purpose, we used three measurable frequency-selective fading radio channels, known as the broadband radio access Network (BRAN C, BRAN D, and BRAN E), which are standardized by the European Telecommunications Standards Institute (ETSI), and one theoretical frequency selective channel, known as the Macchi’s channel. Simulation results show that the proposed algorithm offers better results, even in high noise environments, and generates a lower mean square error (MSE) compared with PNLMS and IPNLMS.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.