## 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. |

Bravo-Santos, Ángel M; Djuric, Petar M Detectors for Cooperative Mesh Networks with Decode-and-Forward Relays Journal Article IEEE Transactions on Signal Processing, 63 (1), pp. 5–17, 2015, ISSN: 1053-587X. Abstract | Links | BibTeX | Tags: Cooperative systems, Detectors, Mesh networks, Modulation, Relays, spread spectrum communication, Wireless communication @article{Bravo-Santos2014b, title = {Detectors for Cooperative Mesh Networks with Decode-and-Forward Relays}, author = {Bravo-Santos, Ángel M. and Djuric, Petar M. }, url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6928514}, doi = {10.1109/TSP.2014.2364016}, issn = {1053-587X}, year = {2015}, date = {2015-01-01}, journal = {IEEE Transactions on Signal Processing}, volume = {63}, number = {1}, pages = {5--17}, publisher = {IEEE}, abstract = {We consider mesh networks composed of groups of relaying nodes which operate in decode-andforward mode. Each node from a group relays information to all the nodes in the next group. We study these networks in two setups, one where the nodes have complete state information about the channels through which they receive the signals, and another when they only have the statistics of the channels. We derive recursive expressions for the probabilities of errors of the nodes and present several implementations of detectors used in these networks. We compare the mesh networks with multi-hop networks formed by a set of parallel sections of multiple relaying nodes. We demonstrate with numerous simulations that there are significant improvements in performance of mesh over multi-hop networks in various scenarios.}, keywords = {Cooperative systems, Detectors, Mesh networks, Modulation, Relays, spread spectrum communication, Wireless communication}, pubstate = {published}, tppubtype = {article} } We consider mesh networks composed of groups of relaying nodes which operate in decode-andforward mode. Each node from a group relays information to all the nodes in the next group. We study these networks in two setups, one where the nodes have complete state information about the channels through which they receive the signals, and another when they only have the statistics of the channels. We derive recursive expressions for the probabilities of errors of the nodes and present several implementations of detectors used in these networks. We compare the mesh networks with multi-hop networks formed by a set of parallel sections of multiple relaying nodes. We demonstrate with numerous simulations that there are significant improvements in performance of mesh over multi-hop networks in various scenarios. |

Bravo-Santos, Ángel M; Djuric, P M Detectors for Cooperative Mesh Networks with Decode-and-Forward Relays Journal Article IEEE Transactions on Signal Processing, 63 (1), pp. 5–17, 2015, ISSN: 1053-587X. Abstract | Links | BibTeX | Tags: Cooperative systems, Detectors, Journal, Mesh networks, Modulation, Relays, spread spectrum communication, Wireless communication @article{Bravo-Santos2014, title = {Detectors for Cooperative Mesh Networks with Decode-and-Forward Relays}, author = {Bravo-Santos, Ángel M. and Djuric, P.M.}, url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6928514}, doi = {10.1109/TSP.2014.2364016}, issn = {1053-587X}, year = {2015}, date = {2015-01-01}, journal = {IEEE Transactions on Signal Processing}, volume = {63}, number = {1}, pages = {5--17}, publisher = {IEEE}, abstract = {We consider mesh networks composed of groups of relaying nodes which operate in decode-andforward mode. Each node from a group relays information to all the nodes in the next group. We study these networks in two setups, one where the nodes have complete state information about the channels through which they receive the signals, and another when they only have the statistics of the channels. We derive recursive expressions for the probabilities of errors of the nodes and present several implementations of detectors used in these networks. We compare the mesh networks with multi-hop networks formed by a set of parallel sections of multiple relaying nodes. We demonstrate with numerous simulations that there are significant improvements in performance of mesh over multi-hop networks in various scenarios.}, keywords = {Cooperative systems, Detectors, Journal, Mesh networks, Modulation, Relays, spread spectrum communication, Wireless communication}, pubstate = {published}, tppubtype = {article} } We consider mesh networks composed of groups of relaying nodes which operate in decode-andforward mode. Each node from a group relays information to all the nodes in the next group. We study these networks in two setups, one where the nodes have complete state information about the channels through which they receive the signals, and another when they only have the statistics of the channels. We derive recursive expressions for the probabilities of errors of the nodes and present several implementations of detectors used in these networks. We compare the mesh networks with multi-hop networks formed by a set of parallel sections of multiple relaying nodes. We demonstrate with numerous simulations that there are significant improvements in performance of mesh over multi-hop networks in various scenarios. |

## 2014 |

## Journal Articles |

Cespedes, Javier ; Olmos, Pablo M; Sanchez-Fernandez, Matilde ; Perez-Cruz, Fernando Expectation Propagation Detection for High-order High-dimensional MIMO Systems Journal Article IEEE Transactions on Communications, PP (99), pp. 1–1, 2014, ISSN: 0090-6778. Abstract | Links | BibTeX | Tags: 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 = {Cespedes, Javier and Olmos, Pablo M. and Sanchez-Fernandez, Matilde and Perez-Cruz, Fernando}, 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} } 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. |

## Inproceedings |

Djuric, Petar M; Bravo-Santos, Ángel M Cooperative Mesh Networks with EGC Detectors Inproceedings 2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop (SAM), pp. 225–228, IEEE, A Coruña, 2014, ISBN: 978-1-4799-1481-4. Abstract | Links | BibTeX | Tags: binary modulations, cooperative communications, cooperative mesh networks, decode and forward communication, decode and forward relays, Detectors, EGC detectors, Gaussian processes, Joints, Manganese, Mesh networks, multihop multibranch networks, Nakagami channels, Nakagami distribution, Nakagami distributions, relay networks (telecommunication), Signal to noise ratio, zero mean Gaussian @inproceedings{Djuric2014, title = {Cooperative Mesh Networks with EGC Detectors}, author = {Djuric, Petar M. and Bravo-Santos, Ángel M.}, url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6882381}, isbn = {978-1-4799-1481-4}, year = {2014}, date = {2014-01-01}, booktitle = {2014 IEEE 8th Sensor Array and Multichannel Signal Processing Workshop (SAM)}, pages = {225--228}, publisher = {IEEE}, address = {A Coruña}, abstract = {We address mesh networks with decode and forward relays that use binary modulations. For detection, the nodes employ equal gain combining, which is appealing because it is very easy to implement. We study the performance of these networks and compare it to that of multihop multi-branch networks. We also examine the performance of the networks when both the number of groups and total number of nodes are fixed but the topology of the network varies. We demonstrate the performance of these networks where the channels are modeled with Nakagami distributions and the noise is zero mean Gaussian}, keywords = {binary modulations, cooperative communications, cooperative mesh networks, decode and forward communication, decode and forward relays, Detectors, EGC detectors, Gaussian processes, Joints, Manganese, Mesh networks, multihop multibranch networks, Nakagami channels, Nakagami distribution, Nakagami distributions, relay networks (telecommunication), Signal to noise ratio, zero mean Gaussian}, pubstate = {published}, tppubtype = {inproceedings} } We address mesh networks with decode and forward relays that use binary modulations. For detection, the nodes employ equal gain combining, which is appealing because it is very easy to implement. We study the performance of these networks and compare it to that of multihop multi-branch networks. We also examine the performance of the networks when both the number of groups and total number of nodes are fixed but the topology of the network varies. We demonstrate the performance of these networks where the channels are modeled with Nakagami distributions and the noise is zero mean Gaussian |

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. |

## 2013 |

## Inproceedings |

Vazquez, Manuel A; Jin, Jing ; Dauwels, Justin ; Vialatte, Francois B Automated Detection of Paroxysmal Gamma Waves in Meditation EEG Inproceedings 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 1192–1196, IEEE, Vancouver, 2013, ISSN: 1520-6149. Abstract | Links | BibTeX | Tags: automated detection, Bhramari Pranayama, Blind source separation, brain active region, brain multiple source identification, Detectors, EEG activity, Electroencephalogram, Electroencephalography, left temporal lobe, medical signal detection, Meditation, meditation EEG, meditator, neurophysiology, neuroscience, Paroxysmal gamma wave, paroxysmal gamma waves, PGW, Principal component analysis, Sensitivity, signal processing community, Spike detection, Temporal lobe, yoga type meditation @inproceedings{Vazquez2013, title = {Automated Detection of Paroxysmal Gamma Waves in Meditation EEG}, author = {Vazquez, Manuel A. and Jin, Jing and Dauwels, Justin and Vialatte, Francois B.}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6637839}, issn = {1520-6149}, year = {2013}, date = {2013-01-01}, booktitle = {2013 IEEE International Conference on Acoustics, Speech and Signal Processing}, pages = {1192--1196}, publisher = {IEEE}, address = {Vancouver}, abstract = {Meditation is a fascinating topic, yet has received limited attention in the neuroscience and signal processing community so far. A few studies have investigated electroencephalograms (EEG) recorded during meditation. Strong EEG activity has been observed in the left temporal lobe of meditators. Meditators exhibit more paroxysmal gamma waves (PGWs) in active regions of the brain. In this paper, a method is proposed to automatically detect PGWs from meditation EEG. The proposed algorithm is able to identify multiple sources in the brain that generate PGWs, and the sources associated with different types of PGWs can be distinguished. The effectiveness of the proposed method is assessed on 3 subjects possessing different degrees of expertise in practicing a yoga type meditation known as Bhramari Pranayama.}, keywords = {automated detection, Bhramari Pranayama, Blind source separation, brain active region, brain multiple source identification, Detectors, EEG activity, Electroencephalogram, Electroencephalography, left temporal lobe, medical signal detection, Meditation, meditation EEG, meditator, neurophysiology, neuroscience, Paroxysmal gamma wave, paroxysmal gamma waves, PGW, Principal component analysis, Sensitivity, signal processing community, Spike detection, Temporal lobe, yoga type meditation}, pubstate = {published}, tppubtype = {inproceedings} } Meditation is a fascinating topic, yet has received limited attention in the neuroscience and signal processing community so far. A few studies have investigated electroencephalograms (EEG) recorded during meditation. Strong EEG activity has been observed in the left temporal lobe of meditators. Meditators exhibit more paroxysmal gamma waves (PGWs) in active regions of the brain. In this paper, a method is proposed to automatically detect PGWs from meditation EEG. The proposed algorithm is able to identify multiple sources in the brain that generate PGWs, and the sources associated with different types of PGWs can be distinguished. The effectiveness of the proposed method is assessed on 3 subjects possessing different degrees of expertise in practicing a yoga type meditation known as Bhramari Pranayama. |

## 2009 |

## Journal Articles |

Murillo-Fuentes, Juan Jose ; Perez-Cruz, Fernando Gaussian Process Regressors for Multiuser Detection in DS-CDMA Systems Journal Article IEEE Transactions on Communications, 57 (8), pp. 2339–2347, 2009, ISSN: 0090-6778. Abstract | Links | BibTeX | Tags: analytical nonlinear multiuser detectors, code division multiple access, communication systems, Detectors, digital communication, digital communications, DS-CDMA systems, Gaussian process for regressi, Gaussian process regressors, Gaussian processes, GPR, Ground penetrating radar, least mean squares methods, maximum likelihood, maximum likelihood detection, maximum likelihood estimation, mean square error methods, minimum mean square error, MMSE, Multiaccess communication, Multiuser detection, nonlinear estimator, nonlinear state-ofthe- art solutions, radio receivers, Receivers, regression analysis, Support vector machines @article{Murillo-Fuentes2009, title = {Gaussian Process Regressors for Multiuser Detection in DS-CDMA Systems}, author = {Murillo-Fuentes, Juan Jose and Perez-Cruz, Fernando}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5201027}, issn = {0090-6778}, year = {2009}, date = {2009-01-01}, journal = {IEEE Transactions on Communications}, volume = {57}, number = {8}, pages = {2339--2347}, abstract = {In this paper we present Gaussian processes for Regression (GPR) as a novel detector for CDMA digital communications. Particularly, we propose GPR for constructing analytical nonlinear multiuser detectors in CDMA communication systems. GPR can easily compute the parameters that describe its nonlinearities by maximum likelihood. Thereby, no cross-validation is needed, as it is typically used in nonlinear estimation procedures. The GPR solution is analytical, given its parameters, and it does not need to solve an optimization problem for building the nonlinear estimator. These properties provide fast and accurate learning, two major issues in digital communications. The GPR with a linear decision function can be understood as a regularized MMSE detector, in which the regularization parameter is optimally set. We also show the GPR receiver to be a straightforward nonlinear extension of the linear minimum mean square error (MMSE) criterion, widely used in the design of these receivers. We argue the benefits of this new approach in short codes CDMA systems where little information on the users' codes, users' amplitudes or the channel is available. The paper includes some experiments to show that GPR outperforms linear (MMSE) and nonlinear (SVM) state-ofthe- art solutions.}, keywords = {analytical nonlinear multiuser detectors, code division multiple access, communication systems, Detectors, digital communication, digital communications, DS-CDMA systems, Gaussian process for regressi, Gaussian process regressors, Gaussian processes, GPR, Ground penetrating radar, least mean squares methods, maximum likelihood, maximum likelihood detection, maximum likelihood estimation, mean square error methods, minimum mean square error, MMSE, Multiaccess communication, Multiuser detection, nonlinear estimator, nonlinear state-ofthe- art solutions, radio receivers, Receivers, regression analysis, Support vector machines}, pubstate = {published}, tppubtype = {article} } In this paper we present Gaussian processes for Regression (GPR) as a novel detector for CDMA digital communications. Particularly, we propose GPR for constructing analytical nonlinear multiuser detectors in CDMA communication systems. GPR can easily compute the parameters that describe its nonlinearities by maximum likelihood. Thereby, no cross-validation is needed, as it is typically used in nonlinear estimation procedures. The GPR solution is analytical, given its parameters, and it does not need to solve an optimization problem for building the nonlinear estimator. These properties provide fast and accurate learning, two major issues in digital communications. The GPR with a linear decision function can be understood as a regularized MMSE detector, in which the regularization parameter is optimally set. We also show the GPR receiver to be a straightforward nonlinear extension of the linear minimum mean square error (MMSE) criterion, widely used in the design of these receivers. We argue the benefits of this new approach in short codes CDMA systems where little information on the users' codes, users' amplitudes or the channel is available. The paper includes some experiments to show that GPR outperforms linear (MMSE) and nonlinear (SVM) state-ofthe- art solutions. |

## Inproceedings |

Bravo-Santos, Ángel M; Djuric, Petar M Cooperative Relay Communications in Mesh Networks Inproceedings 2009 IEEE 10th Workshop on Signal Processing Advances in Wireless Communications, pp. 499–503, IEEE, Perugia, 2009, ISBN: 978-1-4244-3695-8. Abstract | Links | BibTeX | Tags: binary transmission, bit error probability, Bit error rate, cooperative relay communications, decode-and-forward relays, Detectors, error statistics, Maximum likelihood decoding, maximum likelihood detection, Mesh networks, mesh wireless networks, multi-hop networks, Network topology, optimal node decision rules, Peer to peer computing, radio networks, Relays, spread spectrum communication, telecommunication network topology, Wireless Sensor Networks @inproceedings{Bravo-Santos2009, title = {Cooperative Relay Communications in Mesh Networks}, author = {Bravo-Santos, Ángel M. and Djuric, Petar M.}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5161835}, isbn = {978-1-4244-3695-8}, year = {2009}, date = {2009-01-01}, booktitle = {2009 IEEE 10th Workshop on Signal Processing Advances in Wireless Communications}, pages = {499--503}, publisher = {IEEE}, address = {Perugia}, abstract = {In previous literature on cooperative relay communications, the emphasis has been on the study of multi-hop networks. In this paper we address mesh wireless networks that use decode-and-forward relays for which we derive the optimal node decision rules in case of binary transmission. We also obtain the expression for the overall bit error probability. We compare the mesh networks with multi-hop networks and show the improvement in performance that can be achieved with them when both networks have the same number of nodes and equal number of hops.}, keywords = {binary transmission, bit error probability, Bit error rate, cooperative relay communications, decode-and-forward relays, Detectors, error statistics, Maximum likelihood decoding, maximum likelihood detection, Mesh networks, mesh wireless networks, multi-hop networks, Network topology, optimal node decision rules, Peer to peer computing, radio networks, Relays, spread spectrum communication, telecommunication network topology, Wireless Sensor Networks}, pubstate = {published}, tppubtype = {inproceedings} } In previous literature on cooperative relay communications, the emphasis has been on the study of multi-hop networks. In this paper we address mesh wireless networks that use decode-and-forward relays for which we derive the optimal node decision rules in case of binary transmission. We also obtain the expression for the overall bit error probability. We compare the mesh networks with multi-hop networks and show the improvement in performance that can be achieved with them when both networks have the same number of nodes and equal number of hops. |

## 2008 |

## Inproceedings |

Santiago-Mozos, Ricardo ; Fernandez-Lorenzana, R; Perez-Cruz, Fernando ; Artés-Rodríguez, Antonio On the Uncertainty in Sequential Hypothesis Testing Inproceedings 2008 5th IEEE International Symposium on Biomedical Imaging: From Nano to Macro, pp. 1223–1226, IEEE, Paris, 2008, ISBN: 978-1-4244-2002-5. Abstract | Links | BibTeX | Tags: binary hypothesis test, Biomedical imaging, Detectors, H infinity control, likelihood ratio, Medical diagnostic imaging, medical image application, medical image processing, Medical tests, patient diagnosis, Probability, Random variables, Sequential analysis, sequential hypothesis testing, sequential probability ratio test, Signal processing, Testing, tuberculosis diagnosis, Uncertainty @inproceedings{Santiago-Mozos2008, title = {On the Uncertainty in Sequential Hypothesis Testing}, author = {Santiago-Mozos, Ricardo and Fernandez-Lorenzana, R. and Perez-Cruz, Fernando and Artés-Rodríguez, Antonio}, url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=4541223}, isbn = {978-1-4244-2002-5}, year = {2008}, date = {2008-01-01}, booktitle = {2008 5th IEEE International Symposium on Biomedical Imaging: From Nano to Macro}, pages = {1223--1226}, publisher = {IEEE}, address = {Paris}, abstract = {We consider the problem of sequential hypothesis testing when the exact pdfs are not known but instead a set of iid samples are used to describe the hypotheses. We modify the classical test by introducing a likelihood ratio interval which accommodates the uncertainty in the pdfs. The test finishes when the whole likelihood ratio interval crosses one of the thresholds and reduces to the classical test as the number of samples to describe the hypotheses tend to infinity. We illustrate the performance of this test in a medical image application related to tuberculosis diagnosis. We show in this example how the test confidence level can be accurately determined.}, keywords = {binary hypothesis test, Biomedical imaging, Detectors, H infinity control, likelihood ratio, Medical diagnostic imaging, medical image application, medical image processing, Medical tests, patient diagnosis, Probability, Random variables, Sequential analysis, sequential hypothesis testing, sequential probability ratio test, Signal processing, Testing, tuberculosis diagnosis, Uncertainty}, pubstate = {published}, tppubtype = {inproceedings} } We consider the problem of sequential hypothesis testing when the exact pdfs are not known but instead a set of iid samples are used to describe the hypotheses. We modify the classical test by introducing a likelihood ratio interval which accommodates the uncertainty in the pdfs. The test finishes when the whole likelihood ratio interval crosses one of the thresholds and reduces to the classical test as the number of samples to describe the hypotheses tend to infinity. We illustrate the performance of this test in a medical image application related to tuberculosis diagnosis. We show in this example how the test confidence level can be accurately determined. |