## 2015 |

## Journal Articles |

Ramírez, David ; Schreier, Peter J; Via, Javier ; Santamaria, Ignacio ; Scharf, Louis L Detection of Multivariate Cyclostationarity Journal Article IEEE Transactions on Signal Processing, 63 (20), pp. 5395–5408, 2015, ISSN: 1053-587X. Abstract | Links | BibTeX | Tags: ad hoc function, asymptotic GLRT, asymptotic LMPIT, block circulant, block-Toeplitz structure, Correlation, covariance matrices, Covariance matrix, covariance structure, cycle period, cyclic spectrum, Cyclostationarity, Detectors, Frequency-domain analysis, generalized likelihood ratio test, generalized likelihood ratio test (GLRT), hypothesis testing problem, locally most powerful invariant test, locally most powerful invariant test (LMPIT), Loe{&}{#}x0300, maximum likelihood estimation, multivariate cyclostationarity detection, power spectral density, random processes, s theorem, scalar valued CS time series, signal detection, spectral analysis, statistical testing, Testing, Time series, Time series analysis, Toeplitz matrices, Toeplitz matrix, ve spectrum, vector valued random process cyclostationary, vector valued WSS time series, wide sense stationary, Wijsman theorem, Wijsman{&}{#}x2019 @article{Ramirez2015, title = {Detection of Multivariate Cyclostationarity}, author = {Ramírez, David and Schreier, Peter J. and Via, Javier and Santamaria, Ignacio and Scharf, Louis L.}, url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=7134806}, doi = {10.1109/TSP.2015.2450201}, issn = {1053-587X}, year = {2015}, date = {2015-10-01}, journal = {IEEE Transactions on Signal Processing}, volume = {63}, number = {20}, pages = {5395--5408}, publisher = {IEEE}, abstract = {This paper derives an asymptotic generalized likelihood ratio test (GLRT) and an asymptotic locally most powerful invariant test (LMPIT) for two hypothesis testing problems: 1) Is a vector-valued random process cyclostationary (CS) or is it wide-sense stationary (WSS)? 2) Is a vector-valued random process CS or is it nonstationary? Our approach uses the relationship between a scalar-valued CS time series and a vector-valued WSS time series for which the knowledge of the cycle period is required. This relationship allows us to formulate the problem as a test for the covariance structure of the observations. The covariance matrix of the observations has a block-Toeplitz structure for CS and WSS processes. By considering the asymptotic case where the covariance matrix becomes block-circulant we are able to derive its maximum likelihood (ML) estimate and thus an asymptotic GLRT. Moreover, using Wijsman's theorem, we also obtain an asymptotic LMPIT. These detectors may be expressed in terms of the Loève spectrum, the cyclic spectrum, and the power spectral density, establishing how to fuse the information in these spectra for an asymptotic GLRT and LMPIT. This goes beyond the state-of-the-art, where it is common practice to build detectors of cyclostationarity from ad-hoc functions of these spectra.}, keywords = {ad hoc function, asymptotic GLRT, asymptotic LMPIT, block circulant, block-Toeplitz structure, Correlation, covariance matrices, Covariance matrix, covariance structure, cycle period, cyclic spectrum, Cyclostationarity, Detectors, Frequency-domain analysis, generalized likelihood ratio test, generalized likelihood ratio test (GLRT), hypothesis testing problem, locally most powerful invariant test, locally most powerful invariant test (LMPIT), Loe{&}{#}x0300, maximum likelihood estimation, multivariate cyclostationarity detection, power spectral density, random processes, s theorem, scalar valued CS time series, signal detection, spectral analysis, statistical testing, Testing, Time series, Time series analysis, Toeplitz matrices, Toeplitz matrix, ve spectrum, vector valued random process cyclostationary, vector valued WSS time series, wide sense stationary, Wijsman theorem, Wijsman{&}{#}x2019}, pubstate = {published}, tppubtype = {article} } This paper derives an asymptotic generalized likelihood ratio test (GLRT) and an asymptotic locally most powerful invariant test (LMPIT) for two hypothesis testing problems: 1) Is a vector-valued random process cyclostationary (CS) or is it wide-sense stationary (WSS)? 2) Is a vector-valued random process CS or is it nonstationary? Our approach uses the relationship between a scalar-valued CS time series and a vector-valued WSS time series for which the knowledge of the cycle period is required. This relationship allows us to formulate the problem as a test for the covariance structure of the observations. The covariance matrix of the observations has a block-Toeplitz structure for CS and WSS processes. By considering the asymptotic case where the covariance matrix becomes block-circulant we are able to derive its maximum likelihood (ML) estimate and thus an asymptotic GLRT. Moreover, using Wijsman's theorem, we also obtain an asymptotic LMPIT. These detectors may be expressed in terms of the Loève spectrum, the cyclic spectrum, and the power spectral density, establishing how to fuse the information in these spectra for an asymptotic GLRT and LMPIT. This goes beyond the state-of-the-art, where it is common practice to build detectors of cyclostationarity from ad-hoc functions of these spectra. |

## 2014 |

## Inproceedings |

Cespedes, Javier ; Olmos, Pablo M; Sanchez-Fernandez, Matilde ; Perez-Cruz, Fernando Improved Performance of LDPC-Coded MIMO Systems with EP-based Soft-Decisions Inproceedings 2014 IEEE International Symposium on Information Theory, pp. 1997–2001, IEEE, Honolulu, 2014, ISBN: 978-1-4799-5186-4. Abstract | Links | BibTeX | Tags: Approximation algorithms, Approximation methods, approximation theory, Channel Coding, channel decoder, communication complexity, complexity, Complexity theory, Detectors, encoding scheme, EP soft bit probability, EP-based soft decision, error statistics, expectation propagation, expectation-maximisation algorithm, expectation-propagation algorithm, Gaussian approximation, Gaussian channels, LDPC, LDPC coded MIMO system, Low Complexity receiver, MIMO, MIMO communication, MIMO communication systems, MIMO receiver, modern communication system, multiple input multiple output, parity check codes, per-antenna soft bit probability, posterior marginalization problem, posterior probability computation, QAM constellation, Quadrature amplitude modulation, radio receivers, signaling, spectral analysis, spectral efficiency maximization, symbol detection, telecommunication signalling, Vectors @inproceedings{Cespedes2014b, title = {Improved Performance of LDPC-Coded MIMO Systems with EP-based Soft-Decisions}, author = {Cespedes, Javier and Olmos, Pablo M. and Sanchez-Fernandez, Matilde and Perez-Cruz, Fernando}, url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6875183}, isbn = {978-1-4799-5186-4}, year = {2014}, date = {2014-01-01}, booktitle = {2014 IEEE International Symposium on Information Theory}, pages = {1997--2001}, publisher = {IEEE}, address = {Honolulu}, abstract = {Modern communications systems use efficient encoding schemes, multiple-input multiple-output (MIMO) and high-order QAM constellations for maximizing spectral efficiency. However, as the dimensions of the system grow, the design of efficient and low-complexity MIMO receivers possesses technical challenges. Symbol detection can no longer rely on conventional approaches for posterior probability computation due to complexity. Marginalization of this posterior to obtain per-antenna soft-bit probabilities to be fed to a channel decoder is computationally challenging when realistic signaling is used. In this work, we propose to use Expectation Propagation (EP) algorithm to provide an accurate low-complexity Gaussian approximation to the posterior, easily solving the posterior marginalization problem. EP soft-bit probabilities are used in an LDPC-coded MIMO system, achieving outstanding performance improvement compared to similar approaches in the literature for low-complexity LDPC MIMO decoding.}, keywords = {Approximation algorithms, Approximation methods, approximation theory, Channel Coding, channel decoder, communication complexity, complexity, Complexity theory, Detectors, encoding scheme, EP soft bit probability, EP-based soft decision, error statistics, expectation propagation, expectation-maximisation algorithm, expectation-propagation algorithm, Gaussian approximation, Gaussian channels, LDPC, LDPC coded MIMO system, Low Complexity receiver, MIMO, MIMO communication, MIMO communication systems, MIMO receiver, modern communication system, multiple input multiple output, parity check codes, per-antenna soft bit probability, posterior marginalization problem, posterior probability computation, QAM constellation, Quadrature amplitude modulation, radio receivers, signaling, spectral analysis, spectral efficiency maximization, symbol detection, telecommunication signalling, Vectors}, pubstate = {published}, tppubtype = {inproceedings} } Modern communications systems use efficient encoding schemes, multiple-input multiple-output (MIMO) and high-order QAM constellations for maximizing spectral efficiency. However, as the dimensions of the system grow, the design of efficient and low-complexity MIMO receivers possesses technical challenges. Symbol detection can no longer rely on conventional approaches for posterior probability computation due to complexity. Marginalization of this posterior to obtain per-antenna soft-bit probabilities to be fed to a channel decoder is computationally challenging when realistic signaling is used. In this work, we propose to use Expectation Propagation (EP) algorithm to provide an accurate low-complexity Gaussian approximation to the posterior, easily solving the posterior marginalization problem. EP soft-bit probabilities are used in an LDPC-coded MIMO system, achieving outstanding performance improvement compared to similar approaches in the literature for low-complexity LDPC MIMO decoding. |

## 2012 |

## Inproceedings |

Monzon, Sandra ; Trigano, Tom ; Luengo, David ; Artés-Rodríguez, Antonio Sparse Spectral Analysis of Atrial Fibrillation Electrograms. Inproceedings 2012 IEEE International Workshop on Machine Learning for Signal Processing, pp. 1–6, IEEE, Santander, 2012, ISSN: 1551-2541. Abstract | Links | BibTeX | Tags: Algorithm design and analysis, atrial fibrillation, atrial fibrillation electrogram, biomedical signal processing, dominant frequency, Doped fiber amplifiers, electrocardiography, Harmonic analysis, Heart, heart disorder, Indexes, Mathematical model, medical signal processing, multiple foci, multiple uncoordinated activation foci, signal processing technique, sparse spectral analysis, sparsity-aware learning, sparsity-aware learning technique, spectral analysis, spike train @inproceedings{Monzon2012, title = {Sparse Spectral Analysis of Atrial Fibrillation Electrograms.}, author = {Monzon, Sandra and Trigano, Tom and Luengo, David and Artés-Rodríguez, Antonio}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6349721}, issn = {1551-2541}, year = {2012}, date = {2012-01-01}, booktitle = {2012 IEEE International Workshop on Machine Learning for Signal Processing}, pages = {1--6}, publisher = {IEEE}, address = {Santander}, abstract = {Atrial fibrillation (AF) is a common heart disorder. One of the most prominent hypothesis about its initiation and maintenance considers multiple uncoordinated activation foci inside the atrium. However, the implicit assumption behind all the signal processing techniques used for AF, such as dominant frequency and organization analysis, is the existence of a single regular component in the observed signals. In this paper we take into account the existence of multiple foci, performing a spectral analysis to detect their number and frequencies. In order to obtain a cleaner signal on which the spectral analysis can be performed, we introduce sparsity-aware learning techniques to infer the spike trains corresponding to the activations. The good performance of the proposed algorithm is demonstrated both on synthetic and real data.}, keywords = {Algorithm design and analysis, atrial fibrillation, atrial fibrillation electrogram, biomedical signal processing, dominant frequency, Doped fiber amplifiers, electrocardiography, Harmonic analysis, Heart, heart disorder, Indexes, Mathematical model, medical signal processing, multiple foci, multiple uncoordinated activation foci, signal processing technique, sparse spectral analysis, sparsity-aware learning, sparsity-aware learning technique, spectral analysis, spike train}, pubstate = {published}, tppubtype = {inproceedings} } Atrial fibrillation (AF) is a common heart disorder. One of the most prominent hypothesis about its initiation and maintenance considers multiple uncoordinated activation foci inside the atrium. However, the implicit assumption behind all the signal processing techniques used for AF, such as dominant frequency and organization analysis, is the existence of a single regular component in the observed signals. In this paper we take into account the existence of multiple foci, performing a spectral analysis to detect their number and frequencies. In order to obtain a cleaner signal on which the spectral analysis can be performed, we introduce sparsity-aware learning techniques to infer the spike trains corresponding to the activations. The good performance of the proposed algorithm is demonstrated both on synthetic and real data. |