S/MIMO MC-CDMA Heuristic Multiuser Detectors Based on Single-Objective Optimization

This paper analyzes the complexity-performance trade-off of several heuristic near-optimum multiuser detection (MuD) approaches applied to the uplink of synchronous single/multiple-input multiple-output multicarrier code division multiple access (S/MIMO MC-CDMA) systems. Genetic algorithm (GA), short term tabu search (STTS) and reactive tabu search (RTS), simulated annealing (SA), particle swarm optimization (PSO), and 1-opt local search (1-LS) heuristic multiuser detection algorithms (Heur-MuDs) are analyzed in details, using a single-objective antenna-diversity-aided optimization approach. Monte- Carlo simulations show that, after convergence, the performances reached by all near-optimum Heur-MuDs are similar. However, the computational complexities may differ substantially, depending on the system operation conditions. Their complexities are carefully analyzed in order to obtain a general complexity-performance framework comparison and to show that unitary Hamming distance search MuD (uH-ds) approaches (1-LS, SA, RTS and STTS) reach the best convergence rates, and among them, the 1-LS-MuD provides the best trade-off between implementation complexity and bit error rate (BER) performance.

New quasi-orthogonal BCH-derived sequences for CDMA applications

European Transactions on Telecommunications, vol. 18

Multiuser detection in a dynamic environment — Part II: Joint user identification and parameter estimation

The problem of jointly estimating the number, the identities, and the data of active users in a time-varying multiuser environment was examined in a companion paper (IEEE Trans. Information Theory, vol. 53, no. 9, September 2007), at whose core was the use of the theory of finite random sets on countable spaces. Here we extend that theory to encompass the more general problem of estimating unknown continuous parameters of the active-user signals. This problem is solved here by applying the theory of random finite sets constructed on hybrid spaces. We doso deriving Bayesian recursions that describe the evolution withtime of a posteriori densities of the unknown parameters and data.Unlike in the above cited paper, wherein one could evaluate theexact multiuser set posterior density, here the continuous-parameter Bayesian recursions do not admit closed-form expressions. To circumvent this difficulty, we develop numerical approximationsfor the receivers that are based on Sequential Monte Carlo (SMC)methods (“particle filtering”). Simulation results, referring to acode-divisin multiple-access (CDMA) system, are presented toillustrate the theory.

Spatial filtering for pilot-aided WCDMA systems: a semi-blind subspace approach

This paper proposes a spatial filtering technique forthe reception of pilot-aided multirate multicode direct-sequencecode division multiple access (DS/CDMA) systems such as widebandCDMA (WCDMA). These systems introduce a code-multiplexedpilot sequence that can be used for the estimation of thefilter weights, but the presence of the traffic signal (transmittedat the same time as the pilot sequence) corrupts that estimationand degrades the performance of the filter significantly. This iscaused by the fact that although the traffic and pilot signals areusually designed to be orthogonal, the frequency selectivity of thechannel degrades this orthogonality at hte receiving end. Here,we propose a semi-blind technique that eliminates the self-noisecaused by the code-multiplexing of the pilot. We derive analyticallythe asymptotic performance of both the training-only andthe semi-blind techniques and compare them with the actual simulatedperformance. It is shown, both analytically and via simulation,that high gains can be achieved with respect to training-onlybasedtechniques.

Probabilistic algorithms for blind adaptive multiuser detection

In this paper, two probabilistic adaptive algorithmsfor jointly detecting active users in a DS-CDMA system arereported. The first one, which is based on the theory of hiddenMarkov models (HMM’s) and the Baum–Wech (BW) algorithm,is proposed within the CDMA scenario and compared withthe second one, which is a previously developed Viterbi-basedalgorithm. Both techniques are completely blind in the sense thatno knowledge of the signatures, channel state information, ortraining sequences is required for any user. Once convergencehas been achieved, an estimate of the signature of each userconvolved with its physical channel response (CR) and estimateddata sequences are provided. This CR estimate can be used toswitch to any decision-directed (DD) adaptation scheme. Performanceof the algorithms is verified via simulations as well as onexperimental data obtained in an underwater acoustics (UWA)environment. In both cases, performance is found to be highlysatisfactory, showing the near–far resistance of the analyzed algorithms.

Causas de no trombolisis en ataque cerebrovascular

Introducción. El ataque cerebrovascular (ACV) ocupa el primer lugar en frecuencia entre todas las enfermedades neurológicas de la vida adulta, y el tercer lugar como causa más frecuente de muerte. Se aprobó para el manejo agudo, la terapia con activador del plasminógeno tisular recombinante (t-PA) en las primeras 4,5 horas después del inicio de los síntomas, demostrando mayor sobrevida y menos niveles de discapacidad. Sin embargo solo el 5-10% de pacientes reciben este manejo. Por estas razones es necesario conocer que factores se asocian con la no intervención terapéutica. Objetivo. Describir los factores asociados con la no trombolisis en pacientes con ataque cerebrovascular en un hospital de IV nivel en Bogotá, Colombia. Métodos. Estudio analítico de corte transversal, en un centro de cuarto nivel en Bogotá entre enero de 2009 y enero de 2011. Resultados. Se encontraron 178 pacientes en un promedio de edad de 65,9 años (DE± 10 años) con una relación hombre-mujer 1:1, la principal causa de no trombolisis fue la ventana mayor a 4.5 horas, 33,7% (n=60), 26,4% por cambios en imágenes diagnosticas, y 14% por puntajes leves o severos en las escala National Institute of Health Stroke Scale (NIHSS), historia quirúrgica 7.3% y laboratorios 4.5%. El tiempo promedio de atención fue 23 minutos (DE ± 21 min) para la activación del código de ACV, 39 minutos para valoración por neurología (DE ± 25 min), 46 minutos (DE ± 19,1 min) para toma de paraclínicos, 66 minutos para toma de imágenes y 97 minutos para trombolisis (DE ± 21min, DE ± 17 min, respectivamente). Se realizó trombolisis en 17 pacientes, 9,6%. No se encontró asociación significativa entre cultura de organización con trombolisis ni de tiempos de atención con trombolisis. Conclusiones. La principal razón de no trombolisis, fue la ventana mayor a 4.5 horas, no se encontró relación entre cultura de organización institucional con trombolisis. El tiempo promedio de trombolisis fue de 90 minutos. Deben instaurarse medidas para reducir el tiempo de llegada al hospital, y los tiempos de atención en urgencias. Deben realizarse nuevas evaluaciones del código ACV posterior a las estrategias de mejoría.

Orthogonal on-off BPSK: a convenient signaling scheme for near-far resistant detection in DS/CDMA

This paper proposes a convenient signaling scheme-orthogonal on-off BPSK (O3BPSK)-for near-far (NF) resistant detection in asynchronous direct-sequence code-division multiple-access (DS/CDMA) systems (uplink). The temporally adjacent bits from different users in the received signals are decoupled by using the on-off signaling, and the original data rate is maintained with no increase in transmission rate by adopting an orthogonal structure. The detector at the receiver is a one-shot linear decorrelating detector, which depends upon neither hard decision nor specific channel coding. The application of O3 strategy to the differentially encoded BPSK (D-BPSK) sequences is also presented. Finally, some computer simulations are shown to confirm the theoretical analysis.

Time diversity decorrelator (TDD); a near-far resistant detector for asynchronous CDMA system

Greater attention has been focused on the use of CDMA for future cellular mobile communications. CA near-far resistant detector for asynchronous code-division multiple-access (CDMA) systems operating in additive white Gaussian noise (AWGN) channels is presented. The multiuser interference caused by K users transmitting simultaneously, each with a specific signature sequence, is completely removed at the receiver. The complexity of this detector grows only linearly with the number of users, as compared to the optimum multiuser detector which requires exponential complexity in the number of users. A modified algorithm based on time diversity is described. It performs detection on a bit-by-bit basis and overcomes the complexity of using a sequence detector. The performance of this detector is shown to be superior to that of the conventional receiver.

Adaptive least mean square CDMA detection with Gram–Schmidt pre-processing

The Gram-Schmidt (GS) orthogonalisation procedure has been used to improve the convergence speed of least mean square (LMS) adaptive code-division multiple-access (CDMA) detectors. However, this algorithm updates two sets of parameters, namely the GS transform coefficients and the tap weights, simultaneously. Because of the additional adaptation noise introduced by the former, it is impossible to achieve the same performance as the ideal orthogonalised LMS filter, unlike the result implied in an earlier paper. The authors provide a lower bound on the minimum achievable mean squared error (MSE) as a function of the forgetting factor λ used in finding the GS transform coefficients, and propose a variable-λ algorithm to balance the conflicting requirements of good tracking and low misadjustment.

Constrained surplus energy adaptive blind CDMA detection

The blind minimum output energy (MOE) adaptive detector for code division multiple access (CDMA) signals requires exact knowledge of the received spreading code of the desired user. This requirement can be relaxed by constraining the so-called surplus energy of the adaptive tap-weight vector, but the ideal constraint value is not easily obtained in practice. An algorithm is proposed to adaptively track this value and hence to approach the best possible performance for this class of CDMA detector.

Convergence analysis of chip- and fractionally spaced LMS adaptive multiuser CDMA detectors

This paper analyzes the convergence behavior of the least mean square (LMS) filter when used in an adaptive code division multiple access (CDMA) detector consisting of a tapped delay line with adjustable tap weights. The sampling rate may be equal to or higher than the chip rate, and these correspond to chip-spaced (CS) and fractionally spaced (FS) detection, respectively. It is shown that CS and FS detectors with the same time-span exhibit identical convergence behavior if the baseband received signal is strictly bandlimited to half the chip rate. Even in the practical case when this condition is not met, deviations from this observation are imperceptible unless the initial tap-weight vector gives an extremely large mean squared error (MSE). This phenomenon is carefully explained with reference to the eigenvalues of the correlation matrix when the input signal is not perfectly bandlimited. The inadequacy of the eigenvalue spread of the tap-input correlation matrix as an indicator of the transient behavior and the influence of the initial tap weight vector on convergence speed are highlighted. Specifically, a initialization within the signal subspace or to the origin leads to very much faster convergence compared with initialization in the a noise subspace.

Performance analysis of the LMS blind minimum-output-energy CDMA detector

Adaptive filters used in code division multiple access (CDMA) receivers to counter interference have been formulated both with and without the assumption of training symbols being transmitted. They are known as training-based and blind detectors respectively. We show that the convergence behaviour of the blind minimum-output-energy (MOE) detector can be quite easily derived, unlike what was implied by the procedure outlined in a previous paper. The simplification results from the observation that the correlation matrix determining convergence performance can be made symmetric, after which many standard results from the literature on least mean square (LMS) filters apply immediately.

Hybrid heuristic-waterfilling game theory approach in MC-CDMA resource allocation

This paper discusses the power allocation with fixed rate constraint problem in multi-carrier code division multiple access (MC-CDMA) networks, that has been solved through game theoretic perspective by the use of an iterative water-filling algorithm (IWFA). The problem is analyzed under various interference density configurations, and its reliability is studied in terms of solution existence and uniqueness. Moreover, numerical results reveal the approach shortcoming, thus a new method combining swarm intelligence and IWFA is proposed to make practicable the use of game theoretic approaches in realistic MC-CDMA systems scenarios. The contribution of this paper is twofold: (i) provide a complete analysis for the existence and uniqueness of the game solution, from simple to more realist and complex interference scenarios; (ii) propose a hybrid power allocation optimization method combining swarm intelligence, game theory and IWFA. To corroborate the effectiveness of the proposed method, an outage probability analysis in realistic interference scenarios, and a complexity comparison with the classical IWFA are presented. (C) 2011 Elsevier B.V. All rights reserved.

A New Approach for Evaluating the BER of a Multirate, Multiclass OFFH-CDMA System

In this letter, we propose a new approach to evaluate the bit error rate (BER) of a multirate, multiclass optical fast frequency hopping code-division multiple-access (OFFH-CDMA) system. This proposed approach does not require knowledge of the generated users' code sequences, which makes the system analysis straightforward. Furthermore, the presented formalism can also be successfully applied to most multi-weight multi-length family of codes, as long as the corresponding code parameters are employed.

Development of a diagnostic online tool system for Swiss sport psychology practitioners

Psychological assessment is a central component of applied sport psychology. Despite obvious and well-documented advantages of diagnostic online tools, there is a lack of a system for such tools for sport psychologists so far in Switzerland. Having the most frequently used questionnaires available online in one single tool for all listed Swiss sport psychologists would make the work of practitioners a lot easier and less time consuming. Therefore, the main goal of this project is to develop a diagnostic online tool system with the possibility to make available different questionnaires often used in sport psychology. Furthermore, we intend to survey status and use of this diagnostic online tool system and the questionnaires by Swiss sport psychologists. A specific challenge is to limit the access to qualified sport psychologists and to secure the confidentiality for the client. In particular, approved sport psychologists get an individual code for each of their athletes for the required questionnaire. With the help of this code, athletes can access the test via a secure website at any place of the world. As soon as they complete and submit the online questionnaire, analysed and interpreted data reach the sport psychologist via E-Mail, which is timesaving and easy applicable for the sport psychologist. Furthermore, data are available for interpretation with athletes and documentation of individual development over time is possible. Later on, completed and anonymised questionnaires will be collected and analysed. Bigger number of collected data give more insight in the psychometric properties, thus helping to improve and further develop the questionnaires. In this presentation, we demonstrate the tool and its feasibility using the German version of the Test of Performance Strategies (TOPS, Schmid et al., 2010). To conclude, this diagnostic online tool system offers new possibilities for sport psychologists working as practitioner.