Pasar al contenido principal

Resultados relacionados

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

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

Analysis of the contribution of Ito to repolarization in canine ventricular myocardium

  • Virag, L.
  • Jost, N.
  • Papp, R.
  • Koncz, I.
  • Kristof, A.
  • Kohajda, Z.
  • Harmati, G.
  • Carbonell Pascual, Beatriz
  • Papp, J. G.
  • Nanasi, P. P.
  • Varro, A.
  • Ferrero De Loma-Osorio, José María|||0000-0003-4200-9225
[EN] BACKGROUND AND PURPOSE The contribution of the transient outward potassium current (Ito) to ventricular repolarization is controversial as it depends on the experimental conditions, the region of myocardium and the species studied. The aim of the present study was therefore to characterize Ito and estimate its contribution to repolarization reserve in canine ventricular myocardium. EXPERIMENTAL APPROACH Ion currents were recorded using conventional whole-cell voltage clamp and action potential voltage clamp techniques in canine isolated ventricular cells. Action potentials were recorded from canine ventricular preparations using microelectrodes. The contribution of Ito to repolarization was studied using 100 µM chromanol 293B in the presence of 0.5 µM HMR 1556, which fully blocks IKs. KEY RESULTS The high concentration of chromanol 293B used effectively suppressed Ito without affecting other repolarizing K+ currents (IK1, IKr, Ip). Action potential clamp experiments revealed a slowly inactivating and a ‘late’ chromanol-sensitive current component occurring during the action potential plateau. Action potentials were significantly lengthened by chromanol 293B in the presence of HMR 1556. This lengthening effect induced by Ito inhibition was found to be reverse rate-dependent. It was significantly augmented after additional attenuation of repolarization reserve by 0.1 µM dofetilide and this caused the occurrence of early afterdepolarizations. The results were confirmed by computer simulation. CONCLUSIONS AND IMPLICATIONS The results indicate that Ito is involved in regulating repolarization in canine ventricular myocardium and that it contributes significantly to the repolarization reserve. Therefore, blockade of Ito may enhance pro-arrhythmic risk., This work was supported by grants from the Hungarian Scientific Research Fund (OTKA K-68911, OTKA K-68457, OTKA K-82079 and OTKA CNK-77855); Hungarian Ministry of Health (ETT 302-03/2009, ETT 306-03/2009); the National Office for Research and Technology -National Technology Programme (TECH_ 08_ A1_ CARDIO08); National Development Agency (TAMOP-4.2.2-08/1-2008-0013 and TAMOP4.2.1/B-09/1/KONV-2010-0005); European Community (EU FP7 grant ICT-2008-224381, preDiCT); the Hungarian Academy of Sciences; the Janos Bolyai Research Scholarship (to NJ); the Spanish Ministry of Science and Innovation (TEC2008-0290), and from the Generalitat Valenciana (BEST/2010/102). We wish to thank Mrs Zsuzsa Moln~r for her technical assistance.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Parallel Sphere Detector algorithm providing optimal MIMO detection on massively parallel architectures

  • Jozsa, Csaba M
  • Kolumban, Geza
  • Vidal Maciá, Antonio Manuel
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • Gonzalez, Alberto|||0000-0002-6984-3212
Multiple-input multiple-output (MIMO) systems have attracted considerable attention in wireless communications because they offer a significant increase in data throughput and link coverage without additional bandwidth requirement or increased transmit power. The price that has to be paid is the increased complexity of hardware components and algorithms. The sphere detector (SD) algorithm solves the problem of maximum likelihood (ML) detection for MIMO channels by significantly reducing the search space of possible solutions. The main drawback of the SD algorithm is in its sequential nature, consequently, running it on massively parallel architectures (MPAs) is very inefficient. In order to overcome the drawbacks of the SD algorithm, a new parallel sphere detector (PSD) algorithm is proposed. It implements a novel hybrid tree search method, where the algorithm parallelism is assured by the efficient combination of depth-first search and breadth-first search algorithms. A path metric-based parallel sorting is employed at each intermediate stage. The PSD algorithm is able to adjust its memory requirements and extent of parallelism to fit a wide range of parallel architectures. Mapping details for MPAs are proposed by giving the details of thread dependent, highly parallel building blocks of the algorithm. Based on the building blocks proposed, a mapping to general-purpose graphics processing unit is provided, and its performance is evaluated. In order to achieve high-throughput, several levels of parallelism are introduced, and different scheduling strategies are considered. Copyright © 2015 John Wiley & Sons, Ltd., This work was supported by grants TAMOP-4.2.1./B-11/2/KMR-2011-0002, TAMOP-4.2.2/B-10/1-2010-0014 from the Hungarian Government, KAP-1.3-14/001 from the Pazmany Peter Catholic University, and CICYT TEC2012-38142-CO4 from the Spanish Government. The authors would like to express their deepest gratitude for the help and support.