Skip to main content

PROCESADO DISTRIBUIDO Y COLABORATIVO DE SEÑALES SONORAS: CONTROL ACTIVO

TEC2012-38142-C04-01

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Nacional de Proyectos de Investigación Fundamental
Subprogram Subprograma de Proyectos de Investigación Fundamental no Orientada
Call Proyectos I+D
Call year 2012
State Plan 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Management unit Secretaría de Estado de Investigación, Desarrollo e Innovación
Beneficiary centre UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 23
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Headphone-Based virtual spatialization of sound with a GPU accelerator

  • Belloch Rodríguez, José Antonio
  • Ferrer Contreras, Miguel|||0000-0002-8743-1887
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • Vidal Maciá, Antonio Manuel
[EN] Multichannel audio signal processing has undergone major development in recent years. The incorporation of spatial information into an immersive audiovisual virtual environment or into video games provides a better sense of ¿presence¿ to applications. In a binaural system, spatial sound consists of reproducing audio signals with spatial cues (spatial information embedded in the sound) through headphones. This spatial information allows the listener to identify the virtual positions of the sources corresponding to different sounds. Headphone-based spatial sound is obtained by filtering different sound sources through a collection of special filters (whose frequency responses are called Head-Related Transfer Functions) prior to rendering them through headphones. These filters belong to a database composed by a limited number of spatial fixed positions. A complete audio application that can render multiple sound sources in any position of the space and virtualize movements of sound sources in real time demands high computing needs. Graphics Processing Units (GPUs) are highly parallel programmable coprocessors that provide massive computation when the needed operations are properly parallelized. This paper presents the design of a headphone-based multisource spatial audio application whose main feature is that all required processing is carried out on the GPU. To this end, two solutions have been approached in order to synthesize sound sources in spatial positions that are not included in the database and to virtualize sound sources movements between different spatial positions. The results show that the proposed application is able to move up to 240 sources simultaneously ., This work has been partially funded by Spanish Ministerio de Economia (TEC2009-13741 and TEC2012-38142-C04-01) and EU through FEDER funds, Generalitat Valenciana PROMETEO 2009/2013, and Universitat Politecnica de Valencia through Programa de Apoyo a la Investigacion y Desarrollo (PAID-05-11 and PAID-05-12).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Parallel Online Time Warping for Real-Time Audio-to-Score Alignment in Multi-core Systems

  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
  • Cortina, Raquel
  • Rodríguez-Serrano, F.J.
  • Vera-Candeas, P.
  • Alonso-González, M.
  • Ranilla, José
[EN] The Audio-to-Score framework consists of two separate stages: pre- processing and alignment. The alignment is commonly solved through offline Dynamic Time Warping (DTW), which is a method to find the path over the distortion matrix with the minimum cost to determine the relation between the performance and the musical score times. In this work we propose a par- allel online DTW solution based on a client-server architecture. The current version of the application has been implemented for multi-core architectures (x86, x64 and ARM), thus covering either powerful systems or mobile devices. An extensive experimentation has been conducted in order to validate the software. The experiments also show that our framework allows to achieve a good score alignment within the real-time window by using parallel computing techniques., This work has been partially supported by Spanish Ministry of Science and Innovation and FEDER under Projects TEC2012-38142-C04-01, TEC2012-38142-C04-03, TEC2012-38142-C04-04, TEC2015-67387-C4-1-R, TEC2015-67387-C4-3-R, TEC2015-67387-C4-4-R, the European Union FEDER (CAPAP-H5 network TIN2014-53522-REDT), and the Generalitat Valenciana under Grant PROMETEOII/2014/003.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

High performance lattice reduction on heterogeneous computing platform

  • Jozsa, Csaba M
  • Domene Oltra, Fernando
  • Vidal Maciá, Antonio Manuel
  • Piñero, Gema|||0000-0002-8719-8106
  • Gonzalez, Alberto|||0000-0002-6984-3212
The lattice reduction (LR) technique has become very important in many engineering fields. However, its high complexity makes difficult its use in real-time applications, especially in applications that deal with large matrices. As a solution, the modified block LLL (MB-LLL) algorithm was introduced, where several levels of parallelism were exploited: (a) fine-grained parallelism was achieved through the cost-reduced all-swap LLL (CR-AS-LLL) algorithm introduced together with the MB-LLL by Jzsa et al. (Proceedings of the tenth international symposium on wireless communication systems, 2013) and (b) coarse-grained parallelism was achieved by applying the block-reduction concept presented by Wetzel (Algorithmic number theory. Springer, New York, pp 323-337, 1998). In this paper, we present the cost-reduced MB-LLL (CR-MB-LLL) algorithm, which allows to significantly reduce the computational complexity of the MB-LLL by allowing the relaxation of the first LLL condition while executing the LR of submatrices, resulting in the delay of the Gram-Schmidt coefficients update and by using less costly procedures during the boundary checks. The effects of complexity reduction and implementation details are analyzed and discussed for several architectures. A mapping of the CR-MB-LLL on a heterogeneous platform is proposed and it is compared with implementations running on a dynamic parallelism enabled GPU and a multi-core CPU. The mapping on the architecture proposed allows a dynamic scheduling of kernels where the overhead introduced is hidden by the use of several CUDA streams. Results show that the execution time of the CR-MB-LLL algorithm on the heterogeneous platform outperforms the multi-core CPU and it is more efficient than the CR-AS-LLL algorithm in case of large matrices., Financial support for this study was provided by grants TAMOP-4.2.1./B-11/2/KMR-2011-0002, TAMOP-4.2.2/B-10/1-2010-0014 from the Pazmany Peter Catholic University, European Union ERDF, Spanish Government through TEC2012-38142-C04-01 project and Generalitat Valenciana through PROMETEO/2009/013 project.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Automatic routine tuning to represent landform attributes on multicore and multi-GPU systems

  • DO CARMO BORATTO, MURILO
  • Giménez Cánovas, Domingo
  • Barreto, Marcos
  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
Auto-tuning techniques have been used in the design of routines in recent years. The goal is to develop routines which automatically adapt to the conditions of the computational system in such a way that efficient executions are obtained indepen- dently of the end-user experience. This paper aims to explore programming routines that can be automatically adapted to the computational system conditions, making possible to use auto-tuning to represent landform attributes on multicores and multi- GPU systems using high- performance computing techniques for efficient solution of two-dimensional polynomial regression models that allow large problem instances to be addressed., This work has been partially supported by European Union ERDF and Spanish Government through TEC2012-38142-C04 project.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Improving NNMFPACK with heterogeneous and efficient kernels for ß-divergence metrics

  • Díaz-Gracia, N.
  • Cocaña-Fernández, A.
  • Alonso-González, M:
  • Cortina, Raquel
  • Alonso, P.
  • Ranilla, J.
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • García Mollá, Víctor Manuel|||0000-0003-4768-7367
  • Vidal Maciá, Antonio Manuel
NnmfPack is a library for the nonnegative matrix factorization (NNMF) problem. Nowadays NNMF is an essential tool in many fields spanning machine learning, data analysis, image analysis or audio source separation, among others. NnmfPack is an efficient numerical library conceived for shared memory heterogeneous parallel systems, and it supports, from its conception, both conventional multi-core processors and many-core coprocessors. In this article, NnmfPack is extended to handle different metrics options ( ββ -divergence), and some other parallel algorithms have been added and tested. The performance of the new functionalities of NnmfPack is tested, and some precision results of the implementations are showed using an example borrowed from the image processing field., This work has been partially supported by "Ministerio de Economia y Competitividad" from Spain, under the projects TEC2012-38142-C04-01 and TEC2012-38142-C04-04 and by ISIC/2012/006 and PROMETEO FASE II 2014/003 projects of Generalitat Valenciana.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Improving the performance of water distribution systems’ simulation on multicore systems

  • Alvarruiz Bermejo, Fernando|||0000-0001-5957-9561
  • Martínez Alzamora, Fernando|||0000-0001-9952-6966
  • Vidal Maciá, Antonio Manuel
Hydraulic solvers for the simulation of flows and pressures in water distribution systems (WDS) are used extensively, and their computational performance is key when considering optimization problems. This paper presents an approach to speedup the hydraulic solver using OpenMP with two efficient methods for WDS simulation. The paper identifies the different tasks carried out in the simulation, showing their contribution to the execution time, and selecting the target tasks for parallelization. After describing the algorithms for the selected tasks, parallel OpenMP versions are derived, with emphasis on the task of linear system update. Results are presented for four different large WDS models, showing considerable reduction in computing time, This work has been partially supported by Ministerio de Economia y Competitividad from Spain, under the project TEC2012-38142-C04-01, and by project PROMETEO FASE II 2014/003 of Generalitat Valenciana.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

On the performance of multi-GPU-based expert systems for acoustic localization involving massive microphone array

  • Belloch Rodríguez, José Antonio
  • Cobos Serrano, Máximo
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Vidal Maciá, Antonio Manuel
Sound source localization is an important topic in expert systems involving microphone arrays, such as automatic camera steering systems, human-machine interaction, video gaming or audio surveillance. The Steered Response Power with Phase Transform (SRP-PHAT) algorithm is a well-known approach for sound source localization due to its robust performance in noisy and reverberant environments. This algorithm analyzes the sound power captured by an acoustic beamformer on a defined spatial grid, estimating the source location as the point that maximizes the output power. Since localization accuracy can be improved by using high-resolution spatial grids and a high number of microphones, accurate acoustic localization systems require high computational power. Graphics Processing Units (GPUs) are highly parallel programmable co-processors that provide massive computation when the needed operations are properly parallelized. Emerging GPUs offer multiple parallelism levels; however, properly managing their computational resources becomes a very challenging task. In fact, management issues become even more difficult when multiple GPUs are involved, adding one more level of parallelism. In this paper, the performance of an acoustic source localization system using distributed microphones is analyzed over a massive multichannel processing framework in a multi-GPU system. The paper evaluates and points out the influence that the number of microphones and the available computational resources have in the overall system performance. Several acoustic environments are considered to show the impact that noise and reverberation have in the localization accuracy and how the use of massive microphone systems combined with parallelized GPU algorithms can help to mitigate substantially adverse acoustic effects. In this context, the proposed implementation is able to work in real time with high-resolution spatial grids and using up to 48 microphones. These results confirm the advantages of suitable GPU architectures in the development of real-time massive acoustic signal processing systems., This work has been partially funded by the Spanish Ministerio de Economia y Competitividad (TEC2009-13741, TEC2012-38142-C04-01, and TEC2012-37945-C02-02), Generalitat Valenciana PROMETEO 2009/2013, and Universitat Politecnica de Valencia through Programa de Apoyo a la Investigacion y Desarrollo (PAID-05-11 and PAID-05-12).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Parallel approach to NNMF on multicore architecture

  • Alonso, P.
  • García Mollá, Víctor Manuel|||0000-0003-4768-7367
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • Salazar Afanador, Addisson|||0000-0001-5849-5104
  • Vergara Domínguez, Luís|||0000-0001-6803-4774
  • Vidal Maciá, Antonio Manuel
We tackle the parallelization of Non-Negative Matrix Factorization (NNMF), using the Alternating Least Squares and Lee and Seung algorithms, motivated by its use in audio source separation. For the first algorithm, a very suitable technique is the use of active set algorithms for solving several non-negative inequality constraints least squares problems. We have addressed the NNMF for dense matrix on multicore architectures, by organizing these optimization problems for independent columns. Although in the sequential case, the method is not as efficient as the block pivoting variant used by other authors, they are very effective in the parallel case, producing satisfactory results for the type of applications where is to be used. For the Lee and Seung method, we propose a reorganization of the algorithm steps that increases the convergence speed and a parallelization of the solution. The article also includes a theoretical and experimental study of the performance obtained with similar matrices to that which arise in applications that have motivated this work., This work has been supported by European Union ERDF and Spanish Government through TEC2012-38142-C04 project and Generalitat Valenciana through PROMETEO/2009/013 project.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A multicore solution to Block-Toeplitz linear systems of equations

  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
  • Vidal Maciá, Antonio Manuel
  • Argüelles, Daniel
  • Ranilla, José
There exist algorithms, also called "fast" algorithms, which exploit the special structure of Toeplitz matrices so that, e.g., allow to solve a linear system of equations in O(n2) flops. However, some implementations of classical algorithms that do not use this structure (O(n3) flops) highly reduce the time to solution when several cores are available. That is why it is necessary to work on "fast" algorithms so that they do not lose track of the benefits of new hardware/software. In this work, we propose a new approach to the Generalized Schur Algorithm, a very known al- gorithm for the solution of Toeplitz systems, to work on a Block-Toeplitz matrix. Our algorithm is based on matrix-matrix multiplications, thus allowing to exploit an efficient implementation of this operation if it exists. Our algorithm also makes use of the thread level parallelism featured by multicores to decrease execution time., PROMETEO/2009/013, Generalitat Valenciana. Projects TEC2009-13741, TIN2010-14971 and TIN2011-15734-E of the Ministerio Espanol de Ciencia e Innovacion, and TEC2012-38142-C04 of the Ministerio Espanol de Economia y Competitividad.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Active noise control over adaptive distributed networks

  • Ferrer Contreras, Miguel|||0000-0002-8743-1887
  • de Diego Antón, María|||0000-0001-9948-3396
  • Piñero, Gema|||0000-0002-8719-8106
  • Gonzalez, Alberto|||0000-0002-6984-3212
This paper presents the implementation of Active Noise Control (ANC) systems over a network of distributed acoustic nodes. For this purpose we define a general acoustic node consisting of one or several microphones and one or several loudspeakers together with a unique processor with communication capabilities. ANC systems can use a wide range of adaptive algorithms, but we have considered specifically the Multiple Error Filtered-x Least Mean Square (MEFxLMS), which has been proved to perform very well for ANC systems with multiple microphones and loudspeakers, and centralized processing. We present a new formulation to introduce the distributed version of the MEFxLMS together with an incremental collaborative strategy in the network. We demonstrate that the distributed MEFxLMS exhibits the same performance as the centralized one when there are no communication constraints in the network. Then, we re-formulate the distributed MEFxLMS to include parameters related to its implementation on an acoustic sensor network: latency of the network, computational capacity of the nodes, and trustworthiness of the signals measured at each node. Simulation results in realistic scenarios show the ability of the proposed distributed algorithms to achieve good performance when proper values of these parameters are chosen. (C) 2014 Elsevier B.V. All rights reserved., This work has been supported by European Union ERDF and Spanish Government through TEC2012-38142-C04 Project, and Generalitat Valenciana through PROMETEOII/2014/003 Project.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A GPU implementation of an iterative receiver for energy saving MIMO ID-BICM systems

  • Ramiro Sánchez, Carla
  • Simarro, M. Angeles|||0000-0001-6238-2532
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • Vidal Maciá, Antonio Manuel
  • Gonzalez, Alberto|||0000-0002-6984-3212
Iterative detection and decoding in communication systems with multiple transmitter and receiver antennas suffer from a significant increase in the computational cost and energy consumption. Nowadays, application of specific high-performance computing techniques for signal processing in communication systems is receiving considerable attention. In this paper, we present an accelerated and efficient iterative receiver, which has been implemented following two strategies. First, we reduce the computational cost using parallelized algorithms executed on graphics processing unit. In addition, our receiver allows the selection between two types of detectors with different complexity and performance. The selection can be done to fulfill a given compromise between bit error rate and power consumption, This work has been supported by European Union ERDF and Spanish Government through TEC2012-38142-C04 project and Generalitat Valenciana through PROMETEO/2009/013 project.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Maximum likelihood soft-output detection through Sphere Decoding combined with box optimization

  • García Mollá, Víctor Manuel|||0000-0003-4768-7367
  • Simarro, M. Angeles|||0000-0001-6238-2532
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Vidal Maciá, Antonio Manuel
This paper focuses on the improvement of known algorithms for maximum likelihood soft-output detection. These algorithms usually have large computational complexity, that can be reduced by using clipping. Taking two well-known soft-output maximum likelihood algorithms (Repeated Tree Search and Single Tree Search) as a starting point, a number of modifications (based mainly on box optimization techniques) are proposed to improve the efficiency of the search. As a result, two new algorithms are proposed for soft-output maximum likelihood detection. One of them is based on Repeated Tree Search (which can be applied with and without clipping). The other one is based on Single Tree Search, which can only be applied to the case with clipping. The proposed algorithms are compared with the Single Tree Search algorithm, and their efficiency is evaluated in standard detection problems (4 4 16-QAM and 4 4 64-QAM) with and without clipping. The results show that the efficiency of the proposed algorithms is similar to that of the Single Tree Search algorithm in the case 4 4 16-QAM; however, in the case 4 4 64- QAM, the new algorithms are far more efficient than the Single Tree Search algorithm. & 2016 Elsevier B.V. All rights reserved., This work has been partially funded by Generalitat Valenciana through the projects ISIC/2012/006 and PROMETEO II/2014/003, and by Ministerio Espanol de Economia y Competitividad through the project TEC2012-38142-C04 and through the Grant RACHEL TEC2013-47141-C4-4-R.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

GPU Implementation of multichannel adaptive algorithms for local active noise control

  • Lorente Giner, Jorge
  • Ferrer Contreras, Miguel|||0000-0002-8743-1887
  • de Diego Antón, María|||0000-0001-9948-3396
  • Gonzalez, Alberto|||0000-0002-6984-3212
Multichannel active noise control (ANC) systems are commonly based on adaptive signal processing algorithms that require high computational capacity, which constrains their practical implementation. Graphics Processing Units (GPUs) are well known for their potential for highly parallel data processing. Therefore, GPUs seem to be a suitable platform for multichannel scenarios. However, efficient use of parallel computation in the adaptive filtering context is not straightforward due to the feedback loops. This paper compares two GPU implementations of a multichannel feedforward local ANC system working as a real-time prototype. Both GPU implementations are based on the filtered-x Least Mean Square algorithms; one is based on the conventional filtered-x scheme and the other is based on the modified filtered-x scheme. Details regarding the parallelization of the algorithms are given. Finally, experimental results are presented to compare the performance of both multichannel ANC GPU implementations. The results show the usefulness of many-core devices for developing versatile, scalable, and low-cost multichannel ANC systems., This work was supported by the European Union ERDF and Spanish Government under Project TEC2012-38142-C04, and Generalitat Valenciana under Project PROMETEO/2009/013. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Thushara D. Abhayapala.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Non-linear parallel solver for detecting point sources in CMB maps using Bayesian techniques

  • Alonso, P.
  • Argüeso, F.
  • Cortina, R.
  • Ranilla, J.
  • Vidal Maciá, Antonio Manuel
Abstract In this work we present a suitable computational tool to deal with large matrices and solve systems of non-linear equations. This technique is applied to a very interesting problem: the detection and flux estimation of point sources in Cos- mic Microwave Background (CMB) maps, which allows a good determination of CMB primordial fluctuations and leads to a better knowledge of the chemistry at the early stages of the Universe. The method uses previous information about the statis- tical properties of the sources, so that this knowledge is incorporated in a Bayesian scheme. Simulations show that our approach allows the detection of more sources than previous non-Bayesian techniques, with a small computation time, This work was financially supported by the Spanish Ministerio de Ciencia e Innovacion and by FEDER Projects (TEC2012-38142-C04, TIN2010-14971, TEC2009-13741 and CAPAP-H4 TIN2011-15734-E) Universitat Politecnica de Valencia through Programa de Apoyo a la Investigacion y Desarrollo (PAID-05-11) and Generalitat Valenciana through project PROMETEO/2009/013. We thank Diego Herranz for his help with the CMB simulations.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Adaptive step ODE algorithms for the 3D simulation of electric heart activity with graphics processing units

  • García Mollá, Víctor Manuel|||0000-0003-4768-7367
  • Vidal Maciá, Antonio Manuel
  • Guillem Sánchez, María Salud|||0000-0001-5660-3693
  • Millet Roig, José|||0000-0002-8879-003X
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • Liberos Mascarell, Alejandro
  • Climent, Andreu M.
In this paper we studied the implementation and performance of adaptive step methods for large systems of ordinary differential equations systems in graphics processing units, focusing on the simulation of three-dimensional electric cardiac activity. The Rush-Larsen method was applied in all the implemented solvers to improve efficiency. We compared the adaptive methods with the fixed step methods, and we found that the fixed step methods can be faster while the adaptive step methods are better in terms of accuracy and robustness. (c) 2013 Elsevier Ltd. All rights reserved., This work has been partially funded by Universitat Politecnica de Valencia through Programa de Apoyo a la InvestigaciOn y Desarrollo (PAID-06-11) and (PAID-05-12), by Generalitat Valenciana through projects PROMETEO/2009/013 and Ayudas para la realizacion de proyectos de I+D para grupos de investigacion emergentes GV/2012/039, and by Ministerio Espafiol de Economia y Competitividad through project TEC2012-38142-004.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Adaptación para multiples GPU de un simulador de actividad eléctrica en el corazón, Multi-GPU adaptation of a simulator of heart electric activity

  • García Mollá, Víctor Manuel|||0000-0003-4768-7367
  • Vidal Maciá, Antonio Manuel
  • Liberos Mascarell, Alejandro
  • Climent, Andreu M.
[EN] The simulation of the electrical activity of the heart is calculated by solving a large system of ordinary differential equations; this takes an enormous amount of computation time. In recent years graphics processing unit (GPU) are being introduced in the field of high performance computing. These powerful computing devices have attracted research groups requiring simulate the electrical activity of the heart. The research group signing this paper has developed a simulator of cardiac electrical activity that runs on a single GPU. This article describes the adaptation and modification of the simulator to run on multiple GPU. The results confirm that the technique significantly reduces the execution time compared to those obtained with a single GPU, and allows the solution of larger problems., [ES] La simulación de la actividad eléctrica del corazón se calcula mediante la resolución de un gran sistema de ecuaciones diferenciales ordinarias, que necesita una enorme cantidad de tiempo de computación. Sin embargo, en los últimos años se están introduciendo, en el ámbito de la computación de alto rendimiento, las unidades de procesamiento gráfico (GPU). Estos potentes dispositivos han atraído a grupos de investigación que requieren simular la actividad eléctrica del corazón. El grupo de investigación que firma este artículo ha desarrollado un simulador de actividad eléctrica cardíaca que se ejecuta en una sola GPU. En este artículo se describe la adaptación y modificaciones de dicho simulador para su ejecución en múltiples GPU. Los resultados confirman que la técnica empleada permite reducir sensiblemente los tiempos de ejecución respecto a los que se obtienen con una sola GPU, además de permitir afrontar problemas mucho más grandes., Este trabajo ha sido financiado por la Universitat Politècnica de València a través de su Programa de Apoyo a la Investigación y Desarrollo (PAID-06-11) y (PAID-05-12), por la Generalitat Valenciana a través de los proyectos PROMETEO/2009/013 y Ayudas para la realización de proyectos de I+D para grupos de investigación emergentes GV/2012/039, y por el Ministerio Español de Economía y Competitividad y el fondo europeo de Desarrollo Regional (FEDER) de la Comunidad Europea través del proyecto TEC2012-38142-C04.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Channel Quantization Based on the Statistical Characterization of Spatially Correlated Fading

  • Domene Oltra, Fernando
  • Piñero, Gema|||0000-0002-8719-8106
  • de Diego Antón, María|||0000-0001-9948-3396
  • Gonzalez, Alberto|||0000-0002-6984-3212
Multiuser multiple-input-multiple-output (MUMIMO) techniques, such as scheduling and precoding, have shown to improve the spectral efficiency of wireless communication systems. However, these techniques require an accurate knowledge of the channel of the different users at the transmitter. In frequency-division duplex (FDD) systems, this information has to be provided by the different users, motivating the research of efficient limited feedback schemes. This paper presents a novel statistical characterization of the spatial multiple-input-single-output (MISO) channel. In this characterization, one antenna is selected as the reference, and the channel fading experienced from this antenna is also considered to be the reference. The conditional probability density functions (CPDFs) of the envelope and phase of the channel fading coefficients from the rest of the antennas (denoted as nonreference channel fading and nonreference antennas) are obtained given the reference one. Based on this statistical characterization, this paper proposes a channel quantization scheme that individually quantizes the channel fading coefficient of each transmit antenna that is seen by each user. The envelope and phase of the reference channel fading are quantized considering a Rayleigh distribution and a uniform distribution, respectively. The nonreference channel fading coefficients are quantized according to their respective CPDFs, which in turn depend on the spatial correlation between each channel fading and the reference channel fading. Numerical simulations have been carried out to compare the performance of the proposed conditional quantization (CQ) scheme with a polar quantization (PQ) and with a quantization based on the Karhunen-Loève (KL) transform. PQ does not consider spatial correlation, CQ needs one spatial correlation coefficient per nonreference antenna, and the KL scheme makes use of the full spatial correlation matrix. The results show that CQ achieves a lower quantization mean square error (MSE) than the other two schemes in highly and moderately correlated environments. When the spatial channel model (SCM) is considered, the proposed scheme allows the spatial correlation to be successfully exploited in arrays with N=hbox4 and N=hbox8 transmit antennas for antenna separations that are lower than d=hbox1.3lambda and d=hbox0.75lambda, respectively, This work was supported by European Union ERDF and Spanish Government through Project TEC2012-38142-C04 and Generalitat Valenciana through Project PROME-TEOII/2014/003.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

MIMOPack: a high-performance computing library for MIMO communication systems

  • Ramiro Sánchez, Carla
  • Vidal Maciá, Antonio Manuel
  • Gonzalez, Alberto|||0000-0002-6984-3212
This paper presents MIMOPack, a set of optimized functions to perform some of themost complex stages in multiple-input multiple-output (MIMO) communication systems such as channel coding, preprocessing, precoding and detection. These functions are optimized to be run in a wide range of architectures increasing the portability of scientific codes between different computing environments. MIMOPack aims to become a useful library for the research community facilitating to the programmer the development of adaptable parallel applications and also to speed up simulation platforms used to assess different technologies proposed by several companies involved in standarization processes., This work has been supported by SP20120646 project of Universitat Politecnica de Valencia, by ISIC/2012/006 and PROMETEO FASE II 2014/003 projects of Generalitat Valenciana; and has been supported by European Union ERDF and Spanish Government through TEC2012-38142-C04-01.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Improving the efficiency of the loop method for the simulation of water distribution networks

  • Alvarruiz Bermejo, Fernando|||0000-0001-5957-9561
  • Martínez Alzamora, Fernando|||0000-0001-9952-6966
  • Vidal Maciá, Antonio Manuel
Efficiency of hydraulic solvers for the simulation of flows and pressures in water distribution systems (WDSs) is very important, especially in the context of optimization and risk analysis problems, where the hydraulic simulation has to be repeated many times. Among the methods used for hydraulic solvers, the most prominent nowadays is the global gradient algorithm (GGA), based on a hybrid node-loop formulation. Previously, another method based just on loop flow equations was proposed, which presents the advantage that it leads to a system matrix that is in most cases much smaller than in the GGA method, but has also some disadvantages, mainly a less sparse system matrix and the fact that introducing some types of valves requires the redefinition of the set of network loops initially defined. The contribution of this paper is to present solutions for overcoming the mentioned disadvantages of the method based on loop flow equations. In particular, efficient procedures are shown for selecting the network loops so as to achieve a highly sparse matrix and methods are presented to incorporate check valves and automatic control valves while avoiding the need to redefine the loops initially selected. (C) 2015 American Society of Civil Engineers., This work has been partially supported by "Ministerio de Economia y Competitividad" from Spain, under the project TEC2012-38142-C04-01 and by PROMETEO FASE II 2014/003 project of Generalitat Valenciana.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Parallel Implementation Strategies for MIMO ID-BICM Systems

  • Simarro, M. Angeles|||0000-0001-6238-2532
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • Vidal Maciá, Antonio Manuel
  • Piñero, Gema|||0000-0002-8719-8106
  • García Mollá, Víctor Manuel|||0000-0003-4768-7367
  • Ramiro Sánchez, Carla
  • González Téllez, Alberto
[EN] One of the current techniques proposed for multiple transmit and receive antennas wireless communication systems is the use of error control coding and iterative detection and decoding at the receiver. These sophisticated techniques produce a significant increase of the computational cost and require large computational power. The use of modern computer facilities as multicore and multi-GPU (Graphics Processing Unit) processors can decrease the computational time required, representing a promising solution for the receiver implementation in these systems. In this paper we explain how iterative receivers can improve the performance of suboptimal detectors. We also introduce a novel parallel receiver scheme based on a hybrid computing model where CPUs and GPUs work together to accelerate the detection and decoding steps; this design comes to exploit the features of the GPU NVIDIA Kepler architecture respect to the previous one in order to optimize the communication system performance., This work has been partially funded by PROMETEO/2009/013 project of Generalitat Valenciana, projects TEC2009-13741 of the Ministerio Español de Ciencia e Innovación, TEC2012-38142-C04 of the Ministerio Español de Economía y Competitividad, and PAID-05-2011 of Universitat Politècnica de València.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Experiments with the NNMFPACK library: influence of beta parameter in the NNMF approximation error

  • San Juan Sebastián, Pablo
  • Ranilla, J.
  • Alonso, P.
  • Alonso-González, M.
  • Cortina, R.
  • Vidal Maciá, Antonio Manuel
  • García Mollá, Víctor Manuel|||0000-0003-4768-7367
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
[EN] NnmfPack is a numerical library designed to compute efficiently the Non-Negative Matrix Factorization (NNMF). It has been conceived for shared memory heterogeneous parallel systems, and it supports, from its conception, both conventional multi-core processors and many-core coprocessors. NnmfPack offers different algorithms which allow to handle different metrics options such as beta-divergence or Frobenius norm. In real applications the choice of the beta parameter presents a problem for the users of the NNMF that must decide which value to use to obtain the best approximation. In this paper, the influence of the parameter beta in the NNMF approximation error for different problems is empirically evaluated. Different datasets have been used in order to analyze and evaluate the dependency between the quality of the approximation provided by NnmfPack and the value of the beta parameter used., This work has been partially supported by Ministerio de Economía y Competitividad from Spain, under the projects TEC2012-38142-C04-01 and TEC2012-38142-C04-04 and by PROMETEO FASE II 2014/003 projects of Generalitat Valenciana.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Improved Maximum Likelihood Detection through Sphere Decoding combined with Box Optimization

  • García Mollá, Víctor Manuel|||0000-0003-4768-7367
  • Vidal Maciá, Antonio Manuel
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Roger Varea, Sandra
Sphere Decoding is a popular Maximum Likelihood algorithm that can be used to detect signals coming from multiple-input, multiple-output digital communication systems. It is well known that the complexity required to detect each signal with the Sphere Decoding algorithm may become unacceptable, especially for low signal-to-noise ratios. In this paper, we describe an auxiliary technique that drastically decreases the computation required to decode a signal. This technique was proposed by Stojnic, Hassibi and Vikalo in 2008, and is based on using continuous box-bounded minimization in combination with Sphere Decoding. Their implementation is, however, not competitive due to the box minimization algorithm selected. In this paper we prove that by judiciously selecting the box minimization algorithm and tailoring it to the Sphere Decoding environment, the computational complexity of the resulting algorithm for low signal-to-noise ratios is better (by orders of magnitude) than standard Sphere Decoding implementations. & 2013 Elsevier B.V. All rights reserved., This work has been partially funded by Universitat Politecnica de Valencia through Programa de Apoyo a la Investigacion y Desarrollo de la UPV (PAID-06-11) and (PAID-05-12), by Generalitat Valenciana through projects PROMETEO/2009/013 and Ayudas para la realizacion de proyectos de I+D para grupos de investigacion emergentes GV/2012/039, and by Ministerio Espanol de Economia y Competitividad through project TEC2012-38142-C04.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Multi-user interference mitigation under limited feedback requirements for WCDMA systems with base station cooperation

  • Botella Mascarell, Carmen
  • Piñero, Gema|||0000-0002-8719-8106
  • de Diego Antón, María|||0000-0001-9948-3396
One of the techniques that has been recently identified for dealing with multi-user interference (MUI) in future communications systems is base station (BS) cooperation or joint processing. However, perfect MUI cancellation with this technique demands severe synchronization requirements, perfect and global channel state information (CSI), and an increased backhaul and signaling overhead. In this paper, we consider a more realistic layout with the aim of mitigating the MUI, where only local CSI is available at the BSs. Due to synchronization inaccuracies and errors in the channel estimation, the system becomes partially asynchronous. In the downlink of wideband code division multiple access based systems, this asynchronism stands for the loss of the orthogonality of the spreading codes allocated to users and thus, for an increase in the MUI level of the system. In this contribution, we propose a framework for mitigating the MUI which builds in three main steps: definition of a cooperation area based on the channel characteristics, statistical modeling of the average MUI power experienced by each user and a specific spreading code allocation scheme for users served with joint processing. This code allocation assigns spreading codes to users in such a way that minimum average cross-correlation between active users can be achieved. Interestingly, these steps can be performed with a limited amount of extra feedback from the user's side., C. Botella's work has been partially supported by the Spanish MINECO Grants CONSOLIDER-INGENIO 2010 CSD 2008-00010 COMONSENS and RACHEL TEC2013-47141-C4-4-R. G. Pinero and M. de Diego's work has been supported by European Union ERDF and Spanish Government through TEC2012-38142-C04 Project, and Generalitat Valenciana through PROMETEOII/2014/003 Project.