TY - JOUR
T1 - Optimal and suboptimal finger selection algorithms for MMSE rake receivers in impulse radio ultra-wideband systems
AU - Gezici, Sinan
AU - Chiang, Mung
AU - Poor, H. Vincent
AU - Kobayashi, Hisashi
PY - 2006
Y1 - 2006
N2 - The problem of choosing the optimal multipath components to be employed at a minimum mean square error (MMSE) selective Rake receiver is considered for an impulse radio ultra-wideband system. First, the optimal finger selection problem is formulated as an integer programming problem with a nonconvex objective function. Then, the objective function is approximated by a convex function and the integer programming problem is solved by means of constraint relaxation techniques. The proposed algorithms are suboptimal due to the approximate objective function and the constraint relaxation steps. However, they perform better than the conventional finger selection algorithm, which is suboptimal since it ignores the correlation between multipath components, and they can get quite close to the optimal scheme that cannot be implemented in practice due to its complexity. In addition to the convex relaxation techniques, a genetic-algorithm- (GA-) based approach is proposed, which does not need any approximations or integer relaxations. This iterative algorithm is based on the direct evaluation of the objective function, and can achieve near-optimal performance with a reasonable number of iterations. Simulation results are presented to compare the performance of the proposed finger selection algorithms with that of the conventional and the optimal schemes.
AB - The problem of choosing the optimal multipath components to be employed at a minimum mean square error (MMSE) selective Rake receiver is considered for an impulse radio ultra-wideband system. First, the optimal finger selection problem is formulated as an integer programming problem with a nonconvex objective function. Then, the objective function is approximated by a convex function and the integer programming problem is solved by means of constraint relaxation techniques. The proposed algorithms are suboptimal due to the approximate objective function and the constraint relaxation steps. However, they perform better than the conventional finger selection algorithm, which is suboptimal since it ignores the correlation between multipath components, and they can get quite close to the optimal scheme that cannot be implemented in practice due to its complexity. In addition to the convex relaxation techniques, a genetic-algorithm- (GA-) based approach is proposed, which does not need any approximations or integer relaxations. This iterative algorithm is based on the direct evaluation of the objective function, and can achieve near-optimal performance with a reasonable number of iterations. Simulation results are presented to compare the performance of the proposed finger selection algorithms with that of the conventional and the optimal schemes.
UR - http://www.scopus.com/inward/record.url?scp=33746867557&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33746867557&partnerID=8YFLogxK
U2 - 10.1155/WCN/2006/84249
DO - 10.1155/WCN/2006/84249
M3 - Article
AN - SCOPUS:33746867557
SN - 1687-1472
VL - 2006
JO - Eurasip Journal on Wireless Communications and Networking
JF - Eurasip Journal on Wireless Communications and Networking
M1 - 84249
ER -