Rafael Trujillo-Rasúa

Rafael Trujillo-Rasúa

Auto-generated profile, based on publicly available information

Rafael Trujillo-Rasúa

Universidad de las Ciencias Informáticas

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 December 2009
Verified
Conference Paper
Closed access
RTRafael A. Trujillo
Rafael A. Trujillo
VGVictor M. Garcia
Victor M. Garcia
AVAntonio M. Vidal
Antonio M. Vidal
Sandra RogerSandra Roger
Sandra Roger
AGAlberto Gonzalez
Alberto Gonzalez
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.

22 September 2018
Verified
Book Chapter
Closed access
PDF file
JRJairo Rojas-Delgado
Jairo Rojas-Delgado
RTRafael Trujillo-Rasúa
Rafael Trujillo-Rasúa

22 October 2019
Verified
Book Chapter
Closed access
PDF file
JRJairo Rojas-Delgado
Jairo Rojas-Delgado
VNVladimir Milián Núñez
Vladimir Milián Núñez
RTRafael Trujillo-Rasúa
Rafael Trujillo-Rasúa
RBRafael Bello
Rafael Bello

1 October 2010
Verified
Conference Paper
Closed access
VGVictor M. Garcia
Victor M. Garcia
Sandra RogerSandra Roger
Sandra Roger
RTRafael A. Trujillo
Rafael A. Trujillo
AVAntonio M. Vidal
Antonio M. Vidal
AGAlberto Gonzalez
Alberto Gonzalez
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 January 2006 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
RRRafael A. Trujillo Rasúa
Rafael A. Trujillo Rasúa
AVAntonio M. Vidal
Antonio M. Vidal
VGVíctor M. García
Víctor M. García

22 October 2019
Verified
Book Chapter
Closed access
PDF file
JRJairo Rojas-Delgado
Jairo Rojas-Delgado
RTRafael Trujillo-Rasúa
Rafael Trujillo-Rasúa
RBRafael Bello
Rafael Bello
GMGerdys Ernesto Jiménez Moya
Gerdys Ernesto Jiménez Moya