- Advanced Wireless Communication Techniques
- Blind Source Separation Techniques
- Advanced Adaptive Filtering Techniques
- Error Correcting Code Techniques
- Advanced Wireless Communication Technologies
- Speech and Audio Processing
- Cooperative Communication and Network Coding
- Indoor and Outdoor Localization Technologies
- Algorithms and Data Compression
- Sparse and Compressive Sensing Techniques
- Advanced Image and Video Retrieval Techniques
- Robotics and Sensor-Based Localization
- Wireless Communication Networks Research
- Simulation Techniques and Applications
- Real-time simulation and control systems
- Medical Image Segmentation Techniques
- Fluid Dynamics and Heat Transfer
- Advanced Electrical Measurement Techniques
- EEG and Brain-Computer Interfaces
- Matrix Theory and Algorithms
- Magnetic confinement fusion research
- Control Systems and Identification
- ECG Monitoring and Analysis
- Acoustic Wave Phenomena Research
- Advanced Control Systems Optimization
Universitat Politècnica de València
2013-2023
This paper addresses the assessment of stability distributed active noise control (ANC) systems, which are designed to cancel acoustic at given points in space. These systems distribute task across several simple nodes that generate signals by filtering a reference signal. The coefficients each node filter iteratively calculated filtered-X LMS algorithm. remain stable when adaptive filters computed converge finite values. However, coupling among can cause instability (i.e., divergence)....
Abstract 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 CPUs well-known libraries. However, under some circumstances, it would be advantageous to perform border GPUs as efficiently possible. In this paper, we propose a parallel version of that designed executed and CUDA. The based on splitting image into small rectangles. Then,...
Abstract Border tracking in binary images is an important operation many computer vision applications. The problem consists finding borders a 2D image (where all of the pixels are either 0 or 1). There several algorithms available for this problem, but most them sequential. In former paper, parallel border algorithm was proposed. This designed to run Graphics Processing units, and it based on sequential known as Suzuki algorithm. we adapt previously proposed GPU so that can be executed...
The choice of a suitable convergence step that allows the fast filtered-x LMS algorithm in practical scenarios is usually carried out by trial and error, since theoretical developments provide only indicative values. particularity structure, which adds delay between output adaptive filter error signal colors reference signal, increases inaccuracy models. Furthermore, use band-limited signals beyond scope most studies, focus on cases full-band signals, making it difficult to extrapolate these...
Generalized Spatial Modulation (GSM) is a recent Multiple-Input Multiple-Output (MIMO) scheme, which achieves high spectral and energy efficiencies. Specifically, soft-output detectors have key role in achieving the highest coding gain when an error-correcting code (ECC) used. Nowadays, Maximum Likelihood (ML) detection MIMO-GSM systems leads to computational complexity that unfeasible for real applications; however, it important develop low-complexity decoding algorithms provide reasonable...
Generalized Spatial Modulation (GSM) is a trans-mission technique used in wireless communications which only part of the transmitter antennas are activated during each time signaling period. A low complexity Sphere Decoding (SD) algorithm to achieve maximum likelihood (ML) detection has recently been proposed by using subproblem partitions, sorting preprocessing and radius updating. However, ordering method serious limitation when number equal received antennas. Therefore, alternative...
Abstract Generalized Spatial Modulation is a recently developed technique that designed to enhance the efficiency of transmissions in MIMO Systems. However, procedure for correctly retrieving sent signal at receiving end quite demanding. Specifically, computation maximum likelihood solution computationally very expensive. In this paper, we propose parallel method using computing library OpenMP. The proposed algorithm computes faster than sequential version, and substantially reduces worst-case times.
In this paper, we present a low and variable computation complexity decoder based on K-Best for uncoded detection in spatially multiplexed MIMO systems. the (VKB), of each symbol is carried out using only constellation size. This obtained by considering channel properties given target SNR. Simulations show that proposed technique almost matches performance original decoder. Moreover, it able to reduce average at least 75% terms number visited nodes.