Jeronimo Arenas-Garcia

Jeronimo Arenas-Garcia

Auto-generated profile, based on publicly available information

Jeronimo Arenas-Garcia

Universidad Carlos III de Madrid Avda. Universidad 30. 28911 Leganés Madrid Spain

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 December 2012 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
MSMagno T. M. Silva
Magno T. M. Silva
JAJerónimo Arenas-Garcia
Jerónimo Arenas-Garcia
Blind equalizers avoid the transmission of pilot sequences, allowing a more efficient use of the channel bandwidth. Normally, after a first rough equalization is achieved, it is necessary to switch these equalizers to a decision-directed (DD) mode to reduce the steady-state mean-square error (MSE) to acceptable levels. The selection of an appropriate MSE threshold for switching between the blind and the DD modes is critical to obtain a good overall performance; however, this is not an easy task, since it depends on several factors such as the signal constellation, the communication channel, or the signal-to-noise ratio. In this paper, we propose an equalization scheme that adaptively combines a blind and a DD equalizers running in parallel. The combination is itself adapted in a blind manner, and as a result the overall scheme can automatically switch between the component filters, avoiding the need to set the transition MSE level a priori. The performance of our proposal is illustrated both analytically and through an extensive set of simulations, where we show its advantages with respect to existing hard- and soft-switching equalization schemes.

30 March 2022 in Scientometrics
Verified
Journal Article
Open access
PDF file
MVManuel A. Vázquez
Manuel A. Vázquez
JPJorge Pereira-Delgado
Jorge Pereira-Delgado
JCJesús Cid-Sueiro
Jesús Cid-Sueiro
JAJerónimo Arenas-García
Jerónimo Arenas-García
Probabilistic topic modeling algorithms like Latent Dirichlet Allocation (LDA) have become powerful tools for the analysis of large collections of documents (such as papers, projects, or funding applications) in science, technology an innovation (STI) policy design and monitoring. However, selecting an appropriate and stable topic model for a specific application (by adjusting the hyperparameters of the algorithm) is not a trivial problem. Common validation metrics like coherence or perplexity, which are focused on the quality of topics, are not a good fit in applications where the quality of the document similarity relations inferred from the topic model is especially relevant. Relying on graph analysis techniques, the aim of our work is to state a new methodology for the selection of hyperparameters which is specifically oriented to optimize the similarity metrics emanating from the topic model. In order to do this, we propose two graph metrics: the first measures the variability of the similarity graphs that result from different runs of the algorithm for a fixed value of the hyperparameters, while the second metric measures the alignment between the graph derived from the LDA model and another obtained using metadata available for the corresponding corpus. Through experiments on various corpora related to STI, it is shown that the proposed metrics provide relevant indicators to select the number of topics and build persistent topic models that are consistent with the metadata. Their use, which can be extended to other topic models beyond LDA, could facilitate the systematic adoption of this kind of techniques in STI policy analysis and design.

1 August 2010
Verified
Conference Paper
Closed access
DGDario Garcia-Garcia
Dario Garcia-Garcia
JAJeronimo Arenas-Garcia
Jeronimo Arenas-Garcia
EPEmilio Parrado-Hernández
Emilio Parrado-Hernández
Fernando Díaz-de-MaríaFernando Díaz-de-María
Fernando Díaz-de-María
This paper evaluates the capabilities of model-based distances between time series to identify the musical genre of songs. In contrast with standard approaches, this kind of metrics can take into account the structure of the songs by modeling the dynamics of the parameter sequences. We tackle the problem from a non-supervised and from a supervised perspective, in order to point out the usefulness of dynamic-based distances. Experiments on a real-world dataset containing genres with different degrees of a priori overlapping give insights about the discriminant capabilities of these distances.

3 August 2006
Verified
Conference Paper
Closed access
JAJ. Arenas-Garcia
J. Arenas-Garcia
AFA.R. Figueiras-Vidal
A.R. Figueiras-Vidal
Adaptive blind equalization plays an essential role in modern communication systems. We propose to improve the performance of constant modulus algorithm (CMA) based equalizers by using an adaptive convex combination of two CMA filters with a large and small step size, respectively, in order to simultaneously obtain fast convergence with low misadjustment during stationary periods. Some experiments show the effectiveness of the new algorithm and suggest that it is a reasonable alternative to blind equalizers that commute between the CMA and the (decision-directed) least mean square filter

1 March 2010
Verified
Conference Paper
Closed access
MZMarcus Zeller
Marcus Zeller
LALuis Antonio Azpicueta-Ruiz
Luis Antonio Azpicueta-Ruiz
JAJeronimo Arenas-Garcia
Jeronimo Arenas-Garcia
WKWalter Kellermann
Walter Kellermann
This paper presents a method for estimating the optimum number of second-order kernel diagonals of an adaptive Volterra filter in system identification tasks. To this end, a recently proposed time-domain mechanism is carried over to the very efficient partitioned-block DFT-domain Volterra filtering technique. The size of the nonlinear memory is controlled by monitoring the performance of an adaptive combination scheme with two differently-sized quadratic kernels. Subsequently, an efficient version is derived, requiring only minor additional computations as compared to a single Volterra filter. The effectiveness of the outlined estimation procedure is demonstrated by various simulations with real nonlinear systems and both noise and speech inputs in an acoustic echo cancellation scenario.

1 May 2015
Verified
Conference Paper
Open access
BDBijit K. Das
Bijit K. Das
MCMrityunjoy Chakraborty
Mrityunjoy Chakraborty
JAJeronimo Arenas-Garcia
Jeronimo Arenas-Garcia
In-network distributed estimation of sparse parameter vectors via diffusion LMS strategies has been studied and investigated in recent years. In all the existing works, some convex regularization approach has been used at each node of the network in order to achieve an overall network performance superior to that of the simple diffusion LMS, albeit at the cost of increased computational overhead. In this paper, we provide analytical as well as experimental results which show that the convex regularization can be selectively applied only to some chosen nodes keeping rest of the nodes sparsity agnostic, while still enjoying the same optimum behavior as can be realized by deploying the convex regularization at all the nodes. Due to the incorporation of unregularized learning at a subset of nodes, less computational cost is needed in the proposed approach. We also provide a guideline for selection of the sparsity aware nodes and a closed form expression for the optimum regularization parameter.