Victor Manuel García Mollá

Victor Manuel García Mollá

Auto-generated profile, based on publicly available information

Victor Manuel García Mollá

Universitat Politécnica de Valencia, Valencia, Spain

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

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

Representative Publications

View All Publications
1 January 2014 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
VGV.M. Garcia-Molla
V.M. Garcia-Molla
ALA. Liberos
A. Liberos
AVA. Vidal
A. Vidal
MGM.S. Guillem
M.S. Guillem
JMJosé Millet
José Millet
ACA.M. Climent
A.M. Climent

3 May 2023 in Signal Processing
Verified
Journal Article
Open access
MFMiguel Ferrer
Miguel Ferrer
VGVíctor M. García-Mollá
Víctor M. García-Mollá
AVAntonio M. Vidal-Maciá
Antonio M. Vidal-Maciá
Universitat Politècnica de ValènciaUniversitat Politècnica de València
Universitat Politècnica de València
AGAlberto Gonzalez
Alberto Gonzalez

1 May 2014 in Signal Processing
Verified
Journal Article
Closed access
VGVictor M. Garcia-Molla
Victor M. Garcia-Molla
AVAntonio M. Vidal
Antonio M. Vidal
AGAlberto Gonzalez
Alberto Gonzalez
Sandra RogerSandra Roger
Sandra Roger

23 May 2023 in Signal Processing
Verified
Journal Article
Open access
MFMiguel Ferrer
Miguel Ferrer
MDMaria de Diego
Maria de Diego
VGVíctor M. García-Mollá
Víctor M. García-Mollá
AGAlberto Gonzalez
Alberto Gonzalez

1 December 2009
Verified
Conference Paper
Closed access
JFJohannes Fink
Johannes Fink
Sandra RogerSandra Roger
Sandra Roger
AGAlberto Gonzalez
Alberto Gonzalez
VAVicenç Almenar
Vicenç Almenar
VGVictor M. Garciay
Victor M. Garciay
Sphere Decoding (SD) algorithms have been shown to provide maximum likelihood (ML) detection over Gaussian multiple input-multiple output (MIMO) channels with lower complexity than the exhaustive search. These methods are based on a closest lattice point search over a limited search space (hypersphere). There exist several implementations of these algorithms pursuiting different search strategies and working either within a set of real numbers, thus called real sphere decoders (RSD), or performing the search directly within a set of complex numbers, commonly known as complex sphere decoders (CSD). In this paper, a performance comparison between the real and the complex version of the Schnorr-Euchner (SE) sphere decoder has been carried out in order to find out which algorithm is the most suitable depending on the application. Furthermore a recently appeared fixed-complexity version of the SE decoder (FSD) has been evaluated both in terms of complexity and performance and the results have been compared with the original version. In contrast to yet existing complexity analyses, not only the number of visited nodes has been investigated but also the total number of operations.

19 January 2022 in The Journal of Supercomputing
Verified
Journal Article
Open access
PDF file
VGVictor M. Garcia-Molla
Victor M. Garcia-Molla
PAPedro Alonso-Jordá
Pedro Alonso-Jordá
RGRicardo García-Laguía
Ricardo García-Laguía
Border tracking in binary images is an important kernel for many applications. There are very efficient sequential algorithms, most notably, the algorithm proposed by Suzuki et al., which has been implemented for CPUs in well-known libraries. However, under some circumstances, it would be advantageous to perform the border tracking in GPUs as efficiently as possible. In this paper, we propose a parallel version of the Suzuki algorithm that is designed to be executed in GPUs and implemented in CUDA. The proposed algorithm is based on splitting the image into small rectangles. Then, a thread is launched for each rectangle, which tracks the borders in its associated rectangle. The final step is to perform the connection of the borders belonging to several rectangles. The parallel algorithm has been compared with a state-of-the-art sequential CPU version, using two different CPUs and two different GPUs for the evaluation. The computing times obtained show that in these experiments with the GPUs and CPUs that we had available, the proposed parallel algorithm running in the fastest GPU is more than 10 times faster than the sequential CPU routine running in the fastest CPU.