2014
Alvarado, Alex; Brannstrom, Fredrik; Agrell, Erik; Koch, Tobias
High-SNR Asymptotics of Mutual Information for Discrete Constellations With Applications to BICM Artículo de revista
En: IEEE Transactions on Information Theory, vol. 60, no 2, pp. 1061–1076, 2014, ISSN: 0018-9448.
Resumen | Enlaces | BibTeX | Etiquetas: additive white Gaussian noise channel, Anti-Gray code, bit-interleaved coded modulation, discrete constellations, Entropy, Gray code, high-SNR asymptotics, IP networks, Labeling, minimum-mean square error, Modulation, Mutual information, Signal to noise ratio, Vectors
@article{Alvarado2014,
title = {High-SNR Asymptotics of Mutual Information for Discrete Constellations With Applications to BICM},
author = {Alex Alvarado and Fredrik Brannstrom and Erik Agrell and Tobias Koch},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6671479
http://www.tsc.uc3m.es/~koch/files/IEEE_TIT_60%282%29.pdf},
issn = {0018-9448},
year = {2014},
date = {2014-01-01},
journal = {IEEE Transactions on Information Theory},
volume = {60},
number = {2},
pages = {1061--1076},
abstract = {Asymptotic expressions of the mutual information between any discrete input and the corresponding output of the scalar additive white Gaussian noise channel are presented in the limit as the signal-to-noise ratio (SNR) tends to infinity. Asymptotic expressions of the symbol-error probability (SEP) and the minimum mean-square error (MMSE) achieved by estimating the channel input given the channel output are also developed. It is shown that for any input distribution, the conditional entropy of the channel input given the output, MMSE, and SEP have an asymptotic behavior proportional to the Gaussian Q-function. The argument of the Q-function depends only on the minimum Euclidean distance (MED) of the constellation and the SNR, and the proportionality constants are functions of the MED and the probabilities of the pairs of constellation points at MED. The developed expressions are then generalized to study the high-SNR behavior of the generalized mutual information (GMI) for bit-interleaved coded modulation (BICM). By means of these asymptotic expressions, the long-standing conjecture that Gray codes are the binary labelings that maximize the BICM-GMI at high SNR is proven. It is further shown that for any equally spaced constellation whose size is a power of two, there always exists an anti-Gray code giving the lowest BICM-GMI at high SNR.},
keywords = {additive white Gaussian noise channel, Anti-Gray code, bit-interleaved coded modulation, discrete constellations, Entropy, Gray code, high-SNR asymptotics, IP networks, Labeling, minimum-mean square error, Modulation, Mutual information, Signal to noise ratio, Vectors},
pubstate = {published},
tppubtype = {article}
}
Cespedes, Javier; Olmos, Pablo M; Sanchez-Fernandez, Matilde; Perez-Cruz, Fernando
Expectation Propagation Detection for High-order High-dimensional MIMO Systems Artículo de revista
En: IEEE Transactions on Communications, vol. PP, no 99, pp. 1–1, 2014, ISSN: 0090-6778.
Resumen | Enlaces | BibTeX | Etiquetas: Approximation methods, computational complexity, Detectors, MIMO, Signal to noise ratio, Vectors
@article{Cespedes2014,
title = {Expectation Propagation Detection for High-order High-dimensional MIMO Systems},
author = {Javier Cespedes and Pablo M Olmos and Matilde Sanchez-Fernandez and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6841617},
issn = {0090-6778},
year = {2014},
date = {2014-01-01},
journal = {IEEE Transactions on Communications},
volume = {PP},
number = {99},
pages = {1--1},
abstract = {Modern communications systems use multiple-input multiple-output (MIMO) and high-order QAM constellations for maximizing spectral efficiency. However, as the number of antennas and the order of the constellation grow, the design of efficient and low-complexity MIMO receivers possesses big technical challenges. For example, symbol detection can no longer rely on maximum likelihood detection or sphere-decoding methods, as their complexity increases exponentially with the number of transmitters/receivers. In this paper, we propose a low-complexity high-accuracy MIMO symbol detector based on the Expectation Propagation (EP) algorithm. EP allows approximating iteratively at polynomial-time the posterior distribution of the transmitted symbols. We also show that our EP MIMO detector outperforms classic and state-of-the-art solutions reducing the symbol error rate at a reduced computational complexity.},
keywords = {Approximation methods, computational complexity, Detectors, MIMO, Signal to noise ratio, Vectors},
pubstate = {published},
tppubtype = {article}
}
Read, Jesse; Bielza, Concha; Larranaga, Pedro
Multi-Dimensional Classification with Super-Classes Artículo de revista
En: IEEE Transactions on Knowledge and Data Engineering, vol. 26, no 7, pp. 1720–1733, 2014, ISSN: 1041-4347.
Resumen | Enlaces | BibTeX | Etiquetas: Accuracy, Bayes methods, Classification, COMPRHENSION, conditional dependence, Context, core goals, data instance, evaluation metrics, Integrated circuit modeling, modeling class dependencies, multi-dimensional, Multi-dimensional classification, multidimensional classification problem, multidimensional datasets, multidimensional learners, multilabel classification, multilabel research, multiple class variables, ordinary class, pattern classification, problem transformation, recently-popularized task, super classes, super-class partitions, tractable running time, Training, Vectors
@article{Read2014bb,
title = {Multi-Dimensional Classification with Super-Classes},
author = {Jesse Read and Concha Bielza and Pedro Larranaga},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6648319},
issn = {1041-4347},
year = {2014},
date = {2014-01-01},
journal = {IEEE Transactions on Knowledge and Data Engineering},
volume = {26},
number = {7},
pages = {1720--1733},
publisher = {IEEE},
abstract = {The multi-dimensional classification problem is a generalisation of the recently-popularised task of multi-label classification, where each data instance is associated with multiple class variables. There has been relatively little research carried out specific to multi-dimensional classification and, although one of the core goals is similar (modelling dependencies among classes), there are important differences; namely a higher number of possible classifications. In this paper we present method for multi-dimensional classification, drawing from the most relevant multi-label research, and combining it with important novel developments. Using a fast method to model the conditional dependence between class variables, we form super-class partitions and use them to build multi-dimensional learners, learning each super-class as an ordinary class, and thus explicitly modelling class dependencies. Additionally, we present a mechanism to deal with the many class values inherent to super-classes, and thus make learning efficient. To investigate the effectiveness of this approach we carry out an empirical evaluation on a range of multi-dimensional datasets, under different evaluation metrics, and in comparison with high-performing existing multi-dimensional approaches from the literature. Analysis of results shows that our approach offers important performance gains over competing methods, while also exhibiting tractable running time.},
keywords = {Accuracy, Bayes methods, Classification, COMPRHENSION, conditional dependence, Context, core goals, data instance, evaluation metrics, Integrated circuit modeling, modeling class dependencies, multi-dimensional, Multi-dimensional classification, multidimensional classification problem, multidimensional datasets, multidimensional learners, multilabel classification, multilabel research, multiple class variables, ordinary class, pattern classification, problem transformation, recently-popularized task, super classes, super-class partitions, tractable running time, Training, Vectors},
pubstate = {published},
tppubtype = {article}
}
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}
}
Bravo-Santos, Ángel M
Polar Codes for Gaussian Degraded Relay Channels Artículo de revista
En: IEEE Communications Letters, vol. 17, no 2, pp. 365–368, 2013, ISSN: 1089-7798.
Resumen | Enlaces | BibTeX | Etiquetas: channel capacity, Channel Coding, Decoding, Encoding, Gaussian channels, Gaussian degraded relay channel, Gaussian noise, Gaussian-degraded relay channels, log-likelihood expression, Markov coding, Noise, parity check codes, polar code detector, polar codes, relay-destination link, Relays, Vectors
@article{Bravo-Santos2013,
title = {Polar Codes for Gaussian Degraded Relay Channels},
author = {\'{A}ngel M Bravo-Santos},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6412681},
issn = {1089-7798},
year = {2013},
date = {2013-01-01},
journal = {IEEE Communications Letters},
volume = {17},
number = {2},
pages = {365--368},
publisher = {IEEE},
abstract = {In this paper we apply polar codes for the Gaussian degraded relay channel. We study the conditions to be satisfied by the codes and provide an efficient method for constructing them. The relay-destination link is special because the noise is the sum of two components: the Gaussian noise and the signals from the source. We study this link and provide the log-likelihood expression to be used by the polar code detector. We perform simulations of the channel and the results show that polar codes of high rate and large codeword length are closer to the theoretical limit than other good codes.},
keywords = {channel capacity, Channel Coding, Decoding, Encoding, Gaussian channels, Gaussian degraded relay channel, Gaussian noise, Gaussian-degraded relay channels, log-likelihood expression, Markov coding, Noise, parity check codes, polar code detector, polar codes, relay-destination link, Relays, Vectors},
pubstate = {published},
tppubtype = {article}
}
2012
Maiz, Cristina S; Molanes-Lopez, Elisa M; Miguez, Joaquin; Djuric, Petar M
A Particle Filtering Scheme for Processing Time Series Corrupted by Outliers Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 60, no 9, pp. 4611–4627, 2012, ISSN: 1053-587X.
Resumen | Enlaces | BibTeX | Etiquetas: Kalman filters, Mathematical model, nonlinear state space model, Outlier detection, prediction theory, predictive distribution, Probability density function, State-space methods, state-space models, statistical distributions, Target tracking, time serie processing, Vectors, Yttrium
@article{Maiz2012,
title = {A Particle Filtering Scheme for Processing Time Series Corrupted by Outliers},
author = {Cristina S Maiz and Elisa M Molanes-Lopez and Joaquin Miguez and Petar M Djuric},
url = {http://www.tsc.uc3m.es/~jmiguez/papers/P34_2012_A Particle Filtering Scheme for Processing Time Series Corrupted by Outliers.pdf http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6203606},
issn = {1053-587X},
year = {2012},
date = {2012-01-01},
journal = {IEEE Transactions on Signal Processing},
volume = {60},
number = {9},
pages = {4611--4627},
abstract = {The literature in engineering and statistics is abounding in techniques for detecting and properly processing anomalous observations in the data. Most of these techniques have been developed in the framework of static models and it is only in recent years that we have seen attempts that address the presence of outliers in nonlinear time series. For a target tracking problem described by a nonlinear state-space model, we propose the online detection of outliers by including an outlier detection step within the standard particle filtering algorithm. The outlier detection step is implemented by a test involving a statistic of the predictive distribution of the observations, such as a concentration measure or an extreme upper quantile. We also provide asymptotic results about the convergence of the particle approximations of the predictive distribution (and its statistics) and assess the performance of the resulting algorithms by computer simulations of target tracking problems with signal power observations.},
keywords = {Kalman filters, Mathematical model, nonlinear state space model, Outlier detection, prediction theory, predictive distribution, Probability density function, State-space methods, state-space models, statistical distributions, Target tracking, time serie processing, Vectors, Yttrium},
pubstate = {published},
tppubtype = {article}
}
2007
Leiva-Murillo, Jose M; Artés-Rodríguez, Antonio
Maximization of Mutual Information for Supervised Linear Feature Extraction Artículo de revista
En: IEEE Transactions on Neural Networks, vol. 18, no 5, pp. 1433–1441, 2007, ISSN: 1045-9227.
Resumen | Enlaces | BibTeX | Etiquetas: Algorithms, Artificial Intelligence, Automated, component-by-component gradient-ascent method, Computer Simulation, Data Mining, Entropy, Feature extraction, gradient methods, gradient-based entropy, Independent component analysis, Information Storage and Retrieval, information theory, Iron, learning (artificial intelligence), Linear discriminant analysis, Linear Models, Mutual information, Optimization methods, Pattern recognition, Reproducibility of Results, Sensitivity and Specificity, supervised linear feature extraction, Vectors
@article{Leiva-Murillo2007,
title = {Maximization of Mutual Information for Supervised Linear Feature Extraction},
author = {Jose M Leiva-Murillo and Antonio Art\'{e}s-Rodr\'{i}guez},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=4298118},
issn = {1045-9227},
year = {2007},
date = {2007-01-01},
journal = {IEEE Transactions on Neural Networks},
volume = {18},
number = {5},
pages = {1433--1441},
publisher = {IEEE},
abstract = {In this paper, we present a novel scheme for linear feature extraction in classification. The method is based on the maximization of the mutual information (MI) between the features extracted and the classes. The sum of the MI corresponding to each of the features is taken as an heuristic that approximates the MI of the whole output vector. Then, a component-by-component gradient-ascent method is proposed for the maximization of the MI, similar to the gradient-based entropy optimization used in independent component analysis (ICA). The simulation results show that not only is the method competitive when compared to existing supervised feature extraction methods in all cases studied, but it also remarkably outperform them when the data are characterized by strongly nonlinear boundaries between classes.},
keywords = {Algorithms, Artificial Intelligence, Automated, component-by-component gradient-ascent method, Computer Simulation, Data Mining, Entropy, Feature extraction, gradient methods, gradient-based entropy, Independent component analysis, Information Storage and Retrieval, information theory, Iron, learning (artificial intelligence), Linear discriminant analysis, Linear Models, Mutual information, Optimization methods, Pattern recognition, Reproducibility of Results, Sensitivity and Specificity, supervised linear feature extraction, Vectors},
pubstate = {published},
tppubtype = {article}
}