Rafael Trujillo-Rasúa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Rafael Trujillo-Rasúa has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Antonio M. Vidal
Universitat Politécnica de Valencia, Valencia, Spain
3 shared publications - Jairo Rojas-Delgado
Universidad de las Ciencias Informáticas
3 shared publications - Alberto Gonzalez
Institute of Telecommunications and Multimedia Applications (iTEAM), Universitat Politcnica de Valncia (UPV), Valencia, Spain
2 shared publications - Sandra Roger
Computer Science Department, Universitat de València, Valencia, Spain
2 shared publications - Victor Manuel García Mollá
Universitat Politécnica de Valencia, Valencia, Spain
2 shared publications - Gerdys Ernesto Jiménez Moya
Vice-Rectorate for Research and Postgraduate Studies, University of Informatics Sciences, Havana 19370, Cuba
1 shared publication
Latest Publications
- 22 October 2019
- Published by Springer Nature
- p. 458-468
Continuous Hyper-parameter Configuration for Particle Swarm Optimization via Auto-tuning
- 22 October 2019
- Published by Springer Nature
- p. 458-468
Continuous Hyper-parameter Configuration for Particle Swarm Optimization via Auto-tuning
- 22 October 2019
- Published by Springer Nature
- p. 769-779
Video Popularity Forecasting to Improve Cache Miss Rate in Content Delivery Networks
- 22 October 2019
- Published by Springer Nature
- p. 769-779
Video Popularity Forecasting to Improve Cache Miss Rate in Content Delivery Networks
- 22 September 2018
- Published by Springer Nature
- p. 59-67
Training Neural Networks by Continuation Particle Swarm Optimization
- 22 September 2018
- Published by Springer Nature
- p. 59-67
Training Neural Networks by Continuation Particle Swarm Optimization
- 1 October 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21621020,p. 11-16
A deterministic lower bound for the radius in sphere decoding search
In this paper we examine the problem of MIMO detection with sphere decoding (SD) methods. These methods obtain the Maximum Likelihood solution in a reasonable time, through restriction of the space search to an hypersphere of a given radius, with center in the received signal. The performance of the sphere decoding algorithms will be acceptable only if the initial radius estimate is close to the final, optimal radius. Here we give a nontrivial lower bound for the radius, based only on the received signal and on the channel matrix, being then a purely deterministic estimate. This lower bound can be successfully integrated in some SD algorithms, providing a substantial decrease of the computational cost of the search.
- 1 October 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21621020,p. 11-16
A deterministic lower bound for the radius in sphere decoding search
In this paper we examine the problem of MIMO detection with sphere decoding (SD) methods. These methods obtain the Maximum Likelihood solution in a reasonable time, through restriction of the space search to an hypersphere of a given radius, with center in the received signal. The performance of the sphere decoding algorithms will be acceptable only if the initial radius estimate is close to the final, optimal radius. Here we give a nontrivial lower bound for the radius, based only on the received signal and on the channel matrix, being then a purely deterministic estimate. This lower bound can be successfully integrated in some SD algorithms, providing a substantial decrease of the computational cost of the search.
- 1 December 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5-8
A gradient-based ordering for MIMO decoding
The ordering of the columns of the channel matrix has a deep impact in the performance of many decoding methods for MIMO problems. The most popular algorithms for computation of good orderings use as only input the channel matrix (such as the V-BLAST ordering). However, there are other interesting algorithms that compute the ordering as a function of the matrix and of the signal to be decoded. Here we propose a new gradient-based scheme to obtain a good ordering that uses as input the channel matrix and the signal to be decoded. In this paper, this new ordering method is compared experimentally with other algorithms, showing that it is an interesting method, specially in connection with maximum likelihood decoding algorithms such as sphere decoding algorithms.
- 1 December 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5-8
A gradient-based ordering for MIMO decoding
The ordering of the columns of the channel matrix has a deep impact in the performance of many decoding methods for MIMO problems. The most popular algorithms for computation of good orderings use as only input the channel matrix (such as the V-BLAST ordering). However, there are other interesting algorithms that compute the ordering as a function of the matrix and of the signal to be decoded. Here we propose a new gradient-based scheme to obtain a good ordering that uses as input the channel matrix and the signal to be decoded. In this paper, this new ordering method is compared experimentally with other algorithms, showing that it is an interesting method, specially in connection with maximum likelihood decoding algorithms such as sphere decoding algorithms.
- 1 January 2006
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 324-331
Parallel Optimization Methods Based on Direct Search
- 1 January 2006
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 324-331
Parallel Optimization Methods Based on Direct Search