RT info:eu-repo/semantics/article
T1 A new flower pollination algorithm for equalization in synchronous DS/CDMA multiuser communication systems
A1 San José Revuelta, Luis Miguel
A1 Casaseca de la Higuera, Juan Pablo
K1 Telecomunicaciones
K1 Estimación
K1 Detección
K1 DS/CDMA
K1 Computación Natural
K1 Comunicaciones mutiusuario
K1 Algoritmos Genéticos
K1 DS/CDMA
K1 Nature-inspired algorithms
K1 Flower pollination algorithm
K1 Channel estimation
K1 Symbol detection
K1 Multiuser detection
K1 Population diversity
K1 Estimación
K1 Detección
K1 Comunicaciones multiusuario
K1 3306 Ingeniería y Tecnología Eléctricas
K1 3325 Tecnología de las Telecomunicaciones
AB This work proposes a modified version of an emerging nature-inspired technique, named flower pollination algorithm, for equalizing digital multiuser channels. This equalization involves two different tasks: (1) estimation of the channel impulse response, and (2) estimation of the users’ transmitted symbols. The new algorithm is developed and applied in a direct sequence/code-division multiple-access multiuser communications system. Important issues such as robustness, convergence speed and population diversity control have been in deep investigated. A method based on the entropy of the flowers’ fitnessis proposed for in-service monitoring and adjusting population diversity. Numerical simulations analyze the performance, showing comparisons with well-known conventional multiuser detectors such as matched filter, minimum mean square error estimator or several Bayesian schemes, as well as with other nature-inspired strategies. Numerical analysis shows that the proposed algorithm enables transmission at higher symbol rates under stronger fading and interference conditions, constituting an attractive alternative to previous algorithms, both conventional and nature-inspired, whose performance is frequently sensible to near–far effects and multiple-access interference problems. These results have been validated by running hypothesis tests to confirm statistical significance.
PB Springer-Verlag GmbH Germany
SN 1432-7643
YR 2020
FD 2020
LK https://uvadoc.uva.es/handle/10324/71324
UL https://uvadoc.uva.es/handle/10324/71324
LA spa
NO Soft Computing, vol. 24, No. 17, pp. 13069-13083, Sept. 2020.
NO Producción Científica
DS UVaDOC
RD 21-nov-2024