2013
Vazquez, Manuel A; Miguez, Joaquin
User Activity Tracking in DS-CDMA Systems Artículo de revista
En: IEEE Transactions on Vehicular Technology, vol. 62, no 7, pp. 3188–3203, 2013, ISSN: 0018-9545.
Resumen | Enlaces | BibTeX | Etiquetas: Activity detection, activity tracking, Bayes methods, Bayesian framework, Channel estimation, code division multiple access, code-division multiple access (CDMA), computer simulations, data detection, direct sequence code division multiple-access, DS-CDMA systems, Equations, joint channel and data estimation, joint channel estimation, Joints, MAP equalizers, Mathematical model, maximum a posteriori, MIMO communication, Multiaccess communication, multiple-input-multiple-output communication chann, multiuser communication systems, per-survivor processing (PSP), radio receivers, Receivers, sequential Monte Carlo (SMC) methods, time-varying number, time-varying parameter, Vectors, wireless channels
@article{Vazquez2013a,
title = {User Activity Tracking in DS-CDMA Systems},
author = {Manuel A Vazquez and Joaquin Miguez},
url = {http://www.tsc.uc3m.es/~jmiguez/papers/P39_2013_User Activity Tracking in DS-CDMA Systems.pdf http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6473922},
issn = {0018-9545},
year = {2013},
date = {2013-01-01},
journal = {IEEE Transactions on Vehicular Technology},
volume = {62},
number = {7},
pages = {3188--3203},
abstract = {In modern multiuser communication systems, users are allowed to enter or leave the system at any given time. Thus, the number of active users is an unknown and time-varying parameter, and the performance of the system depends on how accurately this parameter is estimated over time. The so-called problem of user identification, which consists of determining the number and identities of users transmitting in a communication system, is usually solved prior to, and hence independently of, that posed by the detection of the transmitted data. Since both problems are tightly connected, a joint solution is desirable. In this paper, we focus on direct-sequence (DS) code-division multiple-access (CDMA) systems and derive, within a Bayesian framework, different receivers that cope with an unknown and time-varying number of users while performing joint channel estimation and data detection. The main feature of these receivers, compared with other recently proposed schemes for user activity detection, is that they are natural extensions of existing maximum a posteriori (MAP) equalizers for multiple-input-multiple-output communication channels. We assess the validity of the proposed receivers, including their reliability in detecting the number and identities of active users, by way of computer simulations.},
keywords = {Activity detection, activity tracking, Bayes methods, Bayesian framework, Channel estimation, code division multiple access, code-division multiple access (CDMA), computer simulations, data detection, direct sequence code division multiple-access, DS-CDMA systems, Equations, joint channel and data estimation, joint channel estimation, Joints, MAP equalizers, Mathematical model, maximum a posteriori, MIMO communication, Multiaccess communication, multiple-input-multiple-output communication chann, multiuser communication systems, per-survivor processing (PSP), radio receivers, Receivers, sequential Monte Carlo (SMC) methods, time-varying number, time-varying parameter, Vectors, wireless channels},
pubstate = {published},
tppubtype = {article}
}
2009
Vazquez, Manuel A; Miguez, Joaquin
Maximum-Likelihood Sequence Detection in Time- and Frequency-Selective MIMO Channels With Unknown Order Artículo de revista
En: IEEE Transactions on Vehicular Technology, vol. 58, no 1, pp. 499–504, 2009, ISSN: 0018-9545.
Resumen | Enlaces | BibTeX | Etiquetas: channel impulse response, channel order estimation, CIR, frequency-selective multiple-input-multiple-output, joint channel and data estimation, maximum likelihood detection, maximum-likelihood sequence detection, MIMO channels, MIMO communication, MLSD, Multiple Input Multiple Output (MIMO), multiple-input–multiple-output (MIMO), per-survivor processing, per-survivor processing (PSP), telecommunication channels, time-selective multiple-input-multiple-output chan
@article{Vazquez2009,
title = {Maximum-Likelihood Sequence Detection in Time- and Frequency-Selective MIMO Channels With Unknown Order},
author = {Manuel A Vazquez and Joaquin Miguez},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4510724},
issn = {0018-9545},
year = {2009},
date = {2009-01-01},
journal = {IEEE Transactions on Vehicular Technology},
volume = {58},
number = {1},
pages = {499--504},
abstract = {In the equalization of frequency-selective multiple-input-multiple-output (MIMO) channels, it is usually assumed that the length of the channel impulse response (CIR), which is also referred to as the channel order, is known. However, this is not true in most practical situations, and it is a common approach to overestimate the channel order to avoid the serious performance degradation that occurs when the CIR length is underestimated. Unfortunately, the computational complexity of maximum-likelihood sequence detection (MLSD) in frequency-selective channels exponentially grows with the channel order; hence, overestimation can actually be undesirable because it leads to more expensive and inefficient receivers. In this paper, we introduce an algorithm for MLSD that incorporates the full estimation of the MIMO CIR parameters, including its order. The proposed technique is based on the per-survivor processing (PSP) methodology; it admits both blind and semiblind implementations, depending on the availability of pilot data, and is designed to work with time-selective channels. In addition to the analytical derivation of the algorithm, we provide computer simulation results that illustrate the effectiveness of the resulting receiver.},
keywords = {channel impulse response, channel order estimation, CIR, frequency-selective multiple-input-multiple-output, joint channel and data estimation, maximum likelihood detection, maximum-likelihood sequence detection, MIMO channels, MIMO communication, MLSD, Multiple Input Multiple Output (MIMO), multiple-input\textendashmultiple-output (MIMO), per-survivor processing, per-survivor processing (PSP), telecommunication channels, time-selective multiple-input-multiple-output chan},
pubstate = {published},
tppubtype = {article}
}
2008
Vazquez, Manuel A; Bugallo, Monica F; Miguez, Joaquin
Sequential Monte Carlo Methods for Complexity-Constrained MAP Equalization of Dispersive MIMO Channels Artículo de revista
En: Signal Processing, vol. 88, no 4, pp. 1017–1034, 2008.
Resumen | Enlaces | BibTeX | Etiquetas: joint channel and data estimation, Multiple Input Multiple Output (MIMO), Sequential Monte Carlo (SMC)
@article{Vazquez2008b,
title = {Sequential Monte Carlo Methods for Complexity-Constrained MAP Equalization of Dispersive MIMO Channels},
author = {Manuel A Vazquez and Monica F Bugallo and Joaquin Miguez},
url = {http://www.sciencedirect.com/science/article/pii/S0165168407003763},
year = {2008},
date = {2008-01-01},
journal = {Signal Processing},
volume = {88},
number = {4},
pages = {1017--1034},
abstract = {The ability to perform nearly optimal equalization of multiple input multiple output (MIMO) wireless channels using sequential Monte Carlo (SMC) techniques has recently been demonstrated. SMC methods allow to recursively approximate the a posteriori probabilities of the transmitted symbols, as observations are sequentially collected, using samples from adequate probability distributions. Hence, they are a class of online (adaptive) algorithms, suitable to handle the time-varying channels typical of high speed mobile communication applications. The main drawback of the SMC-based MIMO-channel equalizers so far proposed is that their computational complexity grows exponentially with the number of input data streams and the length of the channel impulse response, rendering these methods impractical. In this paper, we introduce novel SMC schemes that overcome this limitation by the adequate design of proposal probability distribution functions that can be sampled with a lesser computational burden, yet provide a close-to-optimal performance in terms of the resulting equalizer bit error rate and channel estimation error. We show that the complexity of the resulting receivers grows polynomially with the number of input data streams and the length of the channel response, and present computer simulation results that illustrate their performance in some typical scenarios.},
keywords = {joint channel and data estimation, Multiple Input Multiple Output (MIMO), Sequential Monte Carlo (SMC)},
pubstate = {published},
tppubtype = {article}
}