Pasar al contenido principal

SPATIAL AUDIO SYSTEMS BASED ON MASSIVE PARALLEL PROCESSING OF MULTICHANNEL ACOUSTIC SIGNALS WITH GENERAL PURPOSE-GRAPHICS PROCESSING UNITS (GP-GPU) AND MULTICORES

TEC2009-13741

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2009
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación 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
Publicación Artículo científico (JournalArticle)

Block pivoting implementation of a symmetric Toeplitz solver

  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
  • Vidal Maciá, Antonio Manuel
  • Dolz Zaragozá, Manuel Francisco
Toeplitz matrices are characterized by a special structure that can be exploited in order to obtain fast linear system solvers. These solvers are difficult to parallelize due to their low computational cost and their closely coupled data operations. We propose to transform the Toeplitz system matrix into a Cauchy-like matrix since the latter can be divided into two independent matrices of half the size of the system matrix and each one of these smaller arising matrices can be factorized efficiently in multicore computers. We use OpenMP and store data in memory by blocks in consecutive positions yielding a simple and efficient algorithm. In addition, by exploiting the fact that diagonal pivoting does not destroy the special structure of Cauchy-like matrices, we introduce a local diagonal pivoting technique which improves the accuracy of the solution and the stability of the algorithm., This work was partially supported by the Spanish Ministerio de Ciencia e Innovacion (Project TIN2008-06570-C04-02 and TEC2009-13741), Vicerrectorado de Investigacion de la Universidad Politecnica de Valencia through PAID-05-10 (ref. 2705), and Generalitat Valenciana through project PROMETEO/2009/2013.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Real-time adaptive algorithms using a Graphics Processing Units

  • Lorente Giner, Jorge
  • Belloch Rodríguez, José Antonio
  • Piñero, Gema
  • Ferrer Contreras, Miguel|||0000-0002-8743-1887
  • de Diego Antón, María|||0000-0001-9948-3396
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Vidal Maciá, Antonio Manuel
[EN] Graphics Processing Units (GPUs) have been recently used as coprocessors capable of performing tasks that are not necessarily related to graphics processing in order to optimize computing resources. The use of GPUs has being extended to a wide variety of intensive-computation applications among which audio processing is included. However data transactions between the CPU and the GPU and vice versa have questioned the viability of GPUs for applications in which direct and real-time interaction between microphone and loudspeaker is required. One of the audio applications that requires real-time feedback is adaptive channel identification. Particularly, when the partitioned Least Mean Squares (LMS) algorithm is used in the frequency domain, the size of input-data buffers and filters and how they can be managed in order to successfully exploit the GPU resources is an important key in the design process. This paper discusses the design and implementation of all the processing blocks of an adaptive channel identification system on a GPU, proposing a GPU implementation that can be easily adapted to any acoustic scenario, while freeing up CPU resources for other tasks., This work has been financially supported by the Spanish Ministerio de Ciencia e Innovación TEC2009-13741, Universitat Politècnica de València through “Programa de Apoyo a la Investigación y Desarrollo (PAID-05-11)” and Generalitat Valenciana through project PROMETEO/2009/013 and GV/2010/027
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Practical aspects of preprocessing techniques for K-Best tree search MIMO detectors

  • Roger Varea, Sandra
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Almenar Terre, Vicenç|||0000-0002-8742-2315
  • Vidal Maciá, Antonio Manuel
It has been shown in several works that some preprocessing techniques can improve data detection performance when they are applied to the channel matrix of MIMO wireless systems. In particular, these techniques can be used previously to K-Best tree search algorithms, and they are known to achieve successful results. Throughout this work, the performance and complexity of two preprocessing techniques (VBLAST ZF-DFE ordering and LLL lattice-reduction) are evaluated and compared. The LLL algorithm and a recently proposed fixed-complexity version of it are tested. In addition, a low-complexity implementation of the VBLAST ZF-DFE method is proposed. Results show that the LLL preprocessing is less costly than the VBLAST ZF-DFE ordering in average. Also, the BER curves of the K-Best detector in a 4 x 4 MIMO system reveal that the LLL method can only present better detection performance than the VBLAST ZF-DFE ordering for high SNRs and low values of K. (C) 2011 Elsevier Ltd. All rights reserved., This work was supported by the PROMETEO/2009/013 and TEC2009-13741 projects and by AP2007-01417 FPU grant from the Spanish Ministry of Education.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Multicore implementation of a fixed-complexity tree-search detector for MIMO communications

  • Ramiro Sánchez, Carla
  • Roger Varea, Sandra
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Almenar Terre, Vicenç|||0000-0002-8742-2315
  • Vidal Maciá, Antonio Manuel
[EN] Multicore systems allow the efficient implementation of signal processing algorithms for communication systems due to their high parallel processing capabilities. In this paper, we present a high-throughput multicore implementation of a fixed-complexity tree-search-based detector interesting for MIMO wireless communication systems. Experimental results confirm that this implementation allows to accelerate the data detection stage for different constellation sizes and number of subcarriers., This work was supported by the TEC2009-13741 project of the Spanish Ministry of Science, by the PROMETEO/2009/013 project and ACOMP/2012/076 of the Generalitat Valenciana, and the Vicerrectorado de Investigacion de la UPV through Programa de Apoyo a la Investigacion y desarrollo (PAID-05-11-2898).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación 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
Publicación Artículo científico (JournalArticle)

Solving systems of symmetric Toeplitz tridiagonal equations: Rojo&apos, s algorithm revisited

  • Vidal Maciá, Antonio Manuel
  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
More than 20 years ago, Rojo published [1] an algorithm for solving linear systems where the matrix is tridiagonal symmetric Toeplitz and diagonal dominant. The technique proposed by Rojo is very efficient, O(n), and has been applied successfully in the solution of other similar problems: circulant tridiagonal systems, pentadiagonal Toeplitz systems, etc. In this article we extend Rojo's algorithm to the case of non-diagonal dominant matrices, thus completing a good tool in the aforementioned applications. Other algorithms that solve the same problem are also analysed and compared with the new version of Rojo's algorithm. © 2012 Elsevier Inc. All rights reserved., Supported by Spanish Government (Projects TIN2008-06570-C04 and TEC2009-13741), and Generalitat Valenciana (Project PROMETEO/2009/013).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación 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
Publicación Artículo científico (JournalArticle)

Evolutionary and variable step size strategies for multichannel filtered-x affine projection algorithms

  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Ferrer Contreras, Miguel|||0000-0002-8743-1887
  • de Diego Antón, María|||0000-0001-9948-3396
  • Albu, Felix
This study is focused on the necessity to improve the performance of the affine projection (AP) algorithm for active noise control (ANC) applications. The proposed algorithms are evaluated regarding their steady-state behaviour, their convergence speed and their computational complexity. To this end, different strategies recently applied to the AP for channel identification are proposed for multichannel ANC. These strategies are based either on a variable step size, an evolving projection order, or the combination of both strategies. The developed efficient versions of the AP algorithm use the modified filtered-x structure, which exhibits faster convergence than other filtering schemes. Simulation results show that the proposed approaches exhibit better performance than the conventional AP algorithm and represent a meaningful choice for practical multichannel ANC applications., This work was supported by a grant of the Romanian National Authority for Scientific Research, CNCS-UEFISCDI, project number PN-II-ID-PCE-2011-3-0097, Spanish Ministerio de Ciencia e Innovacion TEC2009-13741 and Generalitat Valenciana PROMETEO 2009/2013.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Tridimensional block multiword LDPC decoding on GPUs

  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • Vidal Maciá, Antonio Manuel
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Almenar Terre, Vicenç|||0000-0002-8742-2315
[EN] In this paper, we describe a parallel algorithm for LDPC (Low Density Parity Check codes) decoding on a GPU (Graphics Processing Unit) using CUDA (Compute Unified Device Architecture). The strategy of the kernel grid and block design is shown and the multiword decoding operation is described using tridimensional blocks. The performance (speedup) of the proposed parallel algorithm is slightly better than the performance found in the literature when this is relatively good, and shows a great improvement in those cases with previously reported moderate or bad performance. © 2011 Springer Science+Business Media, LLC., This work was financially supported by the Spanish Ministerio de Ciencia e Innovación (Projects TIN2008-06570-C04-02, TEC2009-13741 and TEC2008-06787), Universidad Politécnica de Valencia through “Programa de Apoyo a la Investigación y Desarrollo (PAID-05-09)” and Generalitat Valenciana through project PROMETEO/2009/013.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Transient analysis of the conventional filtered-x affine projection algorithm for active noise control

  • Ferrer Contreras, Miguel|||0000-0002-8743-1887
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • de Diego Antón, María|||0000-0001-9948-3396
  • Piñero, Gema|||0000-0002-8719-8106
[EN] Affine projection (AP) algorithms have been proposed in recent years for use in active noise control systems. This is due to their potential high convergence speed along with their robustness and moderate computational cost. However, these algorithms can exhibit an excessive computational cost for high projection orders (just when higher convergence speed is achieved). Thus, computationally efficient versions of these algorithms have been proposed. For the particular case of the AP algorithms applied to active noise control, the use of the conventional filtered-x structure instead of the commonly used modified filtered-x method can be understood as an efficient strategy, since it needs fewer operations to update the adaptive filter coefficients. However, the use of this structure implies different algorithm behavior for the following two reasons: the signals needed in the coefficient updates do not correspond exactly to the AP algorithm and this structure introduces a delay between the update of the adaptive filter coefficients and its effect on the noise signal. In practice, this dual effect mainly affects convergence of the algorithms in the transient regime. This correspondence presents a mathematical model so that the transient behavior of the conventional filtered-x AP algorithm can be predicted from the reference signal statistics and algorithm parameters., This work was supported in part by the Spanish Ministerio de Ciencia e Innovacion TEC2009-13741, Generalitat Valenciana PROMETEO 2009/0013, Generalitat Valenciana GV/2010/027, and Universidad Politécnica de Valencia PAID-06-09.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Real-time massive convolution for audio applications on GPU

  • Belloch Rodríguez, José Antonio
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • Vidal Maciá, Antonio Manuel
[EN] Massive convolution is the basic operation in multichannel acoustic signal processing. This field has experienced a major development in recent years. One reason for this has been the increase in the number of sound sources used in playback applications available to users. Another reason is the growing need to incorporate new effects and to improve the hearing experience. Massive convolution requires high computing capacity. GPUs offer the possibility of parallelizing these operations. This allows us to obtain the processing result in much shorter time and to free up CPU resources. One important aspect lies in the possibility of overlapping the transfer of data from CPU to GPU and vice versa with the computation, in order to carry out real-time applications. Thus, a synthesis of 3D sound scenes could be achieved with only a peer-to-peer music streaming environment using a simple GPU in your computer, while the CPU in the computer is being used for other tasks. Nowadays, these effects are obtained in theaters or funfairs at a very high cost, requiring a large quantity of resources. Thus, our work focuses on two mains points: to describe an efficient massive convolution implementation and to incorporate this task to real-time multichannel-sound applications. © 2011 Springer Science+Business Media, LLC., This work was partially supported by the Spanish Ministerio de Ciencia e Innovacion (Projects TIN2008-06570-C04-02 and TEC2009-13741), Universidad Politecnica de Valencia through PAID-05-09 and Generalitat Valenciana through project PROMETEO/2009/2013
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Fully Parallel GPU Implementation of a Fixed-Complexity Soft-Output MIMO Detector

  • Roger Varea, Sandra
  • Ramiro Sánchez, Carla
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Almenar Terre, Vicenç|||0000-0002-8742-2315
  • Vidal Maciá, Antonio Manuel
Multicore and graphic processing units (GPUs) can be combined to efficiently implement signal-processing algorithms for communication systems, due to their parallel processing capabilities. This paper proposes a fully parallel fixed-complexity soft-output detector, which is suitable for GPU implementation and allows a considerable decrease in the computational time required for the data detection stage in multiple-input-multiple-output (MIMO) systems. A novel channel matrix preprocessing stage, based on column-norm ordering, is developed to efficiently match the multicore architecture. The throughput of the implementation is shown to outperform other recent implementations and to support some of the configurations in the long-term evolution (LTE) standard., This work was supported in part by the PROMETEO/2009/013 and TEC2009-13741 Projects and in part by the AP2007-01417 FPU Ph.D. grant. The review of this paper was coordinated by Prof. Y. Su.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A limited feedback scheme based on spatially correlated channels for coordinated multipoint systems

  • Domene Oltra, Fernando
  • Piñero, Gema
  • Botella Mascarell, Carmen
  • Gonzalez, Alberto|||0000-0002-6984-3212
High spectral efficiency can be achieved in the downlink of multi-antenna coordinated multi-point systems provided that the multiuser interference is appropriately managed at the transmitter side. For this sake, downlink channel information needs to be sent back by the users, thus reducing the rate available at the uplink channel. The amount and type of feedback information required has been extensively studied and many limited feedback schemes have been proposed lately. A common pattern to all of them is that achieving low rates of feedback information is possible at the cost of increasing complexity at the user side and, sometimes, assuming that some statistics of the channel are known. In this article, we propose a simple and versatile limited feedback scheme that exploits the spatial correlation at each multi-antenna base station (BS) without requiring any previous statistical information of the channel and without adding significant computational complexity. It is based on the separate quantization of the channel impulse response modulus and phase and it shows better mean square error performance than the standard scheme based on quantization of real and imaginary parts. In order to evaluate the performance of the downlink regarding multiuser interference management, different precoding techniques at the BSs, such as zero-forcing (ZF), Tomlinson-Harashima precoding (THP) and lattice reduction Tomlinson- Harashima precoding (LRTHP), have been evaluated. Simulations results show that LRTHP and THP present a higher robustness than ZF precoding against channel quantization errors but at the cost of a higher complexity at the BS. Regarding sum-capacity and bit error rate performances, our versatile scheme achieves better results than the standard one in the medium and high SNR regime, that is, in the region where quantization errors are dominant against noise, for the same feedback cost measured in bits per user., The authors would like to thank the anonymous reviewers for their valuable comments and suggestions, which have greatly helped to improve the quality of this work. This work has been supported by the Spanish Ministry of Science and Innovation through CICYT Grant TEC2009-13741, Regional Government Generalitat Valenciana through Grant PROMETEO/2009/013, and by Universitat Politecnica de Valencia through its PAID-FPI program. C. Botella's work is supported by the Spanish MEC Grants CONSOLIDER-INGENIO 2010 CSD2008-00010 "COMON-SENS" and COSIMA TEC2010-19545-C04-01. The authors are within VLC/campus "Sustainable Communications and Computing (COCOS)" cluster.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación 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
Publicación Artículo científico (JournalArticle)

An affine projection algorithm with variable step-size and projection order

  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Ferrer Contreras, Miguel|||0000-0002-8743-1887
  • de Diego Antón, María|||0000-0001-9948-3396
  • Piñero, Gema|||0000-0002-8719-8106
It is known that the performance of adaptive algorithms is constrained by their computational cost. Thus, affine projection adaptive algorithms achieve higher convergence speed when the projection order increases, which is at the expense of a higher computational cost. However, regardless of computational cost, a high projection order also leads to higher final error at steady state. For this reason it seems advisable to reduce the computational cost of the algorithm when high convergence speed is not needed (steady state) and to maintain or increase this cost only when the algorithm is in transient state to encourage rapid transit to the permanent regime. The adaptive order affine projection algorithm presented here addresses this subject. This algorithm adapts its projection order and step size depending on its convergence state by simple and meaningful rules. Thus it achieves good convergence behavior at every convergence state and very low computational cost at steady state., This work was partially funded by Spanish MICINN TEC2009-13741, GV-PROMETEO/2009/0013, GV/2010/027 and UPV/2009-1034.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An efficient fixed-complexity sphere decoder with quantized soft outputs

  • Roger Varea, Sandra
  • Matz, Gerald
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Almenar Terre, Vicenç|||0000-0002-8742-2315
In practical multiple-input multiple-output bit-interleaved-coded-modulation (MIMO-BICM) systems, demodulators have to deliver finite word-length (quantized) log-likelihood-ratios (LLRs). In this letter, we propose an efficient modification of the fixed-complexity sphere decoder for MIMO-BICM systems working with quantized LLRs. Our approach reduces the complexity of previously proposed schemes via pruning strategies that exploit the clipping and quantization of LLRs. Numerical results confirm that our scheme achieves a significant complexity reduction (by 37% for the case of 2 bits per LLR and by 31% for the case of 3 bits per LLR) with negligible degradation in bit error rate performance., This work was supported in part by the PROMETEO/2009/013 and TEC2009-13741 projects, by the AP2007-01417 FPU grant, and by FWF grant S10606.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Convex combination filtered-X algorithms for active noise control systems

  • Ferrer Contreras, Miguel|||0000-0002-8743-1887
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • de Diego Antón, María|||0000-0001-9948-3396
  • Piñero, Gema|||0000-0002-8719-8106
Adaptive filtering schemes exhibit a compromise between convergence speed and steady-state mean square error. Trying to overcome this trade-off, convex combination of adaptive filters have been recently developed for system identification achieving better performance than traditional approaches. The purpose of this work is to apply the convex combination strategy to single-channel and multichannel active noise control systems. In these systems it is necessary to take into account the secondary path between the adaptive filter output and the error sensor and the possible unavailability of the disturbance signal, which depends on the filtering scheme considered. Even though this strategy involves a higher computational burden than the classic adaptive filters, it exhibits a good performance in terms of convergence speed and steady-state mean square error., This work was supported in part by the Spanish Ministerio de Ciencia e Innovacion TEC2009-13741, Generalitat Valenciana PROMETEO 2009/0013, Generalitat Valenciana GV/2010/027, and Universitat Politecnica de Valencia PAID-06-09. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Boaz Rafaely.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An efficient GPU implementation of fixed-complexity sphere decoders for MIMO wireless systems

  • Roger Varea, Sandra
  • Ramiro Sánchez, Carla
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Almenar Terre, Vicenç|||0000-0002-8742-2315
  • Vidal Maciá, Antonio Manuel
The use of many-core processors such as general purpose Graphic Processing Units (GPUs) has recently become attractive for the efficient implementation of signal processing algorithms for communication systems. This is due to the cost-effectiveness of GPUs together with their potential capability of parallel processing. This paper presents an implementation of the widely employed fixed-complexity sphere decoder on GPUs, which allows to considerably decrease the computational time required for the data detection stage in multiple-input multiple-output systems. Both, the hard-and soft-output versions of the method have been implemented. Speedup results show the proposed GPU implementation boosts the runtime of the parallel execution of the methods in a high performance multi-core CPU. In addition, the throughput of the algorithm is evaluated and is shown to outperform other recent implementations and to fulfill the real-time requirements of several LTE configurations. ©2012-IOS Press and the authors. All rights reserved., This work was partially funded by the TEC2009-13741 project of the Spanish Ministry of Science and by the PROMETEO/2009/013 project of the Generalitat Valenciana.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The impact of GPU/Multicore in Signal Processing: a quantitative approach

  • García Mollá, Víctor Manuel|||0000-0003-4768-7367
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • Vidal Maciá, Antonio Manuel
  • González García, Cristina Yenixe
  • Ramiro Sánchez, Carla
  • Roger Varea, Sandra
[EN] This paper presents a meaningful practical performance comparison between the last generation of Graphics Processing Units (GPUs) and the last generation multi-core CPUs when they are used to solve given Signal Processing algorithms. Two kinds of tests were considered: when GPU pre-designed computational libraries were available, and when the GPU code was developed by the authors. Results show that GPUs offer great possibilities, but its programming is still hard and high performances can be obtained only if the algorithm can be adapted to the GPU programming model., This work was financially supported by the Spanish Ministerio de Ciencia e Innovación (Projects TIN2008-06570-C04-02, TEC2009-13741 and CAPAP-H3 TIN2010-12011-E), Universitat Politècnica de València through “Programa de Apoyo a la Investigación y Desarrollo (PAID-05-10)” and Generalitat Valenciana through project PROMETEO/2009/013.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Estudio, informe, memoria (Report)

Parallel Two-Stage Least Squares algorithms for Simultaneous Equations Models on GPU

  • Ramiro Sánchez, Carla
  • López-Espín, José J.
  • Giménez, Domingo
  • Vidal, Antonio M.
Today it is usual to have computational systems formed by a multicore together with one or more GPUs. These systems are heterogeneous, due to the di erent types of memory in the GPUs and to the di erent speeds of computation of the cores in the CPU and the GPU. To accelerate the solution of complex problems it is necessary to combine the two basic components (CPU and GPU) in the heterogeneous system. This paper analyzes the use of a multicore+multiGPU system for solving Simultaneous Equations Models by the Two-Stage Least Squares method with QR decomposition. The combination of CPU and GPU allows us to reduce the execution time in the solution of large SEM.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Heuristics and metaheuristics for accelerating the computation of simultaneous equations models through a Steiner tree

  • Lopez-Espin, Jose J
  • Gimenez, Domingo
  • Vidal Maciá, Antonio Manuel
Simultaneous equations models can be solved with a variety of algorithms. Some methods use the QR-decomposition of several matrices associated to the equations in the system. To accelerate the computation of those QR-decompositions and consequently the solution of simultaneous equations models, the QR-decomposition of a matrix associated to an equation can be obtained from that of another matrix associated to another equation which contains the variables of the first equation. A Steiner tree can be used, with nodes representing the equations in the model and with edges whose associated weight is the cost of computing the QR-decomposition of an equation from that of another equation. The Steiner tree of the graph associated to the simultaneous equations model gives the order of computation of the QR-decompositions of lowest computational cost. But the number of nodes in the graph is very large, and exact methods to obtain the Steiner tree are not applicable. In this paper, the application of heuristics and metaheuristics to approach the Steiner tree of the graph associated to a simultaneous equations model is considered. A heuristic and a genetic algorithm are presented and analyzed. The quality of the tree obtained and its usability in an algorithm to solve simultaneous equations models efficiently is experimentally studied. (C) 2013 Elsevier B.V. All rights reserved., This work has been funded in part by Fundacion Seneca, Consejeria de Educacion de la Region de Murcia, 08763/PI/08, the Spanish Ministry of Science, projects TEC2009-13741 and TIN2012-38341-C04-03, and by the PROMETEO/2009/013 project of the Generalitat Valenciana. We thank Dr. Bora Ucar for his valuable comments on Steiner tree and combinational problems.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación 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
Publicación Artículo científico (JournalArticle)

Fast exact variable order affine projection algorithm

  • Ferrer Contreras, Miguel|||0000-0002-8743-1887
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • de Diego Antón, María|||0000-0001-9948-3396
  • Piñero, Gema|||0000-0002-8719-8106
Variable order affine projection algorithms have been recently presented to be used when not only the convergence speed of the algorithm has to be adjusted but also its computational cost and its final residual error. These kind of affine projection (AP) algorithms improve the standard AP algorithm performance at steady state by reducing the residual mean square error. Furthermore these algorithms optimize computational cost by dynamically adjusting their projection order to convergence speed requirements. The main cost of the standard AP algorithm is due to the matrix inversion that appears in the coefficient update equation. Most efforts to decrease the computational cost of these algorithms have focused on the optimization of this matrix inversion. This paper deals with optimization of the computational cost of variable order AP algorithms by recursive calculation of the inverse signal matrix. Thus, a fast exact variable order AP algorithm is proposed. Exact iterative expressions to calculate the inverse matrix when the algorithm projection order either increases or decreases are incorporated into a variable order AP algorithm leading to a reduced complexity implementation. The simulation results show the proposed algorithm performs similarly to the variable order AP algorithms and it has a lower computational complexity. © 2012 Elsevier B.V. All rights reserved., Partially supported by TEC2009-13741, PROMETEO 2009/0013, GV/ 2010/027, ACOMP/2010/006 and UPV PAID-06-09.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Steady-state mean square performance of the multichannel filtered-X affine projection algorithm

  • Ferrer Contreras, Miguel|||0000-0002-8743-1887
  • de Diego Antón, María|||0000-0001-9948-3396
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Piñero, Gema|||0000-0002-8719-8106
This paper provides a unified analysis of the steady-state behavior of different multichannel filtered-x affine projection algorithms when used in active noise control (ANC) systems. The analysis deals with two different filtering schemes: the modified filtered-x affine projection (MFXAP) algorithm, with the modified filtered-x structure embedded, that has been studied in previous works, and the filtered-x affine projection (CFXAP) algorithm, with the conventional filtered-x structure embedded, that becomes the main contribution of this work. This study is based on energy conservation principles and does not require a specific signal distribution. The derived theoretical models allow to accurately predict the steady-state performance of the considered algorithms for moderate AP orders and low step sizes mu. Simulation results obtained in practical ANC systems validate both the analysis and the achieved expressions, showing a relative good match between theory and practice. © 2012 IEEE., This work was supported in part by PROMETEO/2009/013, CICYT grant TEC2009-13741, Generalitat Valenciana GV/2010/027, and the Universitat Politecnica de Valencia PAID-06-09.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Detecting point sources in CMB maps using an efficient parallel algorithm

  • Alonso, P.
  • Argüeso, F.
  • Cortina, R.
  • Ranilla, J.
  • Vidal Maciá, Antonio Manuel
The Cosmic Microwave Background (CMB) is a diffuse radiation which is contaminated by the radiation emitted by point sources. The precise knowledge of CMB fluctuations can lead to a better knowledge of the chemistry at the early stages of the Universe. In this work, we present an efficient algorithm, with a high degree of parallelism, which can improve, from the computational point of view, the classical approaches for detecting point sources in Cosmic Microwave Background maps. High performance computing libraries and parallel computing techniques have allowed to construct a portable, fast and numerically stable algorithm. To check the performance of the new method, we have carried out several simulations resembling the observational data collected by the Low Frequency Instrument of the Planck satellite. The sources are detected in their real positions. © 2011 Springer Science+Business Media, LLC., This work was financially supported by the Spanish Ministerio de Ciencia e Innovacion and by FEDER (Projects TIN2010-14971, TIN2008-06570-C04-02, TEC2009-13741 and CAPAP-H3 TIN2010-12011-E), Universitat Politecnica de Valencia through Programa de Apoyo a la Investigacion y Desarrollo (PAID-05-10) 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
Publicación Artículo científico (JournalArticle)

Multichannel massive audio processing for a generalized crosstalk cancellation and equalization application using GPUs

  • Belloch Rodríguez, José Antonio
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • Vidal Maciá, Antonio Manuel
[EN] Multichannel acoustic signal processing has undergone major development in recent years due to the increased com- plexity of current audio processing applications, which involves the processing of multiple sources, channels, or filters. A gen- eral scenario that appears in this context is the immersive reproduction of binaural audio without the use of headphones, which requires the use of a crosstalk canceler. However, generalized crosstalk cancellation and equalization (GCCE) requires high com- puting capacity, which is a considerable limitation for real-time applications. This paper discusses the design and implementation of all the processing blocks of a multichannel convolution on a GPU for real-time applications. To this end, a very efficient fil- tering method using specific data structures is proposed, which takes advantage of overlap-save filtering and filter fragmentation. It has been shown that, for a real-time application with 22 inputs and 64 outputs, the system is capable of managing 1408 filters of 2048 coefficients with a latency time less than 6 ms. The proposed GPU implementation can be easily adapted to any acoustic environment, demonstrating the validity of these co-processors for managing intensive multichannel audio applications., This work has been partially funded by Spanish Ministerio de Ciencia e Innovacion TEC2009-13741, Generalitat Valenciana PROMETEO 2009/2013 and GV/2010/027, and Universitat Politecnica de Valencia through Programa de Apoyo a la Investigacion y Desarrollo (PAID-05-11).