Top

Soft Computing

Published in:

01-02-2020 | Methodologies and Application

A new flower pollination algorithm for equalization in synchronous DS/CDMA multiuser communication systems

Authors: Luis M. San-José-Revuelta, Pablo Casaseca-de-la-Higuera

Published in: Soft Computing | Issue 17/2020

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

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’ fitness is 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.

previous article Optimum design and analysis of HRES for rural electrification: a case study of Korkadu district

next article Estimating the distribution of enterprise values with quantile neural networks

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Available only for authorised users

Abdel-Baset M, Hezam IM (2015) An improved flower pollination algorithm based on simulated annealing for solving engineering optimization problems. Asian J Math Comput Res 3:149–170

Abdel-Baset M, Hezam IM (2016) A hybrid flower pollination algorithm for solving ill-conditioned set of equations. Int J Bio Inspired Comput 8:215–220

Abdel-Basset M, Zhou Y (2018) An elite opposition-flower pollination algorithm for a 0–1 knapsack problem. Int J Bio Inspired Comput 11:46–53

Abdel-Basset M, Shawky LA (2019) Flower pollination algorithm: a comprehensive review. Artif Intell Rev 52:2533–2557

Abdel-Baset M, Wu H, Zhou Y (2017a) A complex encoding flower pollination algorithm for constrained engineering optimisation problems. Int J Math Model Numer Optim 8:108–126

Abdel-Baset M, Wu H, Zhou Y, Abdel-Fatah L (2017b) Elite opposition-flower pollination algorithm for quadratic assignment problem. J Intell Fuzzy Syst 33:901–911

Abdel-Basset M, El-Shahat D, El-Henawy I, Sangaiah AK (2018) A modified flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making. Soft Comput 22:4221–4239

Abdel-Raouf O, Abdel-Baset M et al (2014) A new hybrid flower pollination algorithm for solving constrained global optimization problems. Int J Appl Oper Res 4:1–13

Agarwal P, Mehta S (2014) Nature-inspired algorithms: state-of-art, problems and prospects. Nature 100:14–21

Alam D, Yousri D, Eteiba M (2015) Flower pollination algorithm based solar PV parameter estimation. Energy Convers Manag 101:410–422

Arani AHJ, Azmi P (2013) Joint multiuser and inter-symbol interference suppression in CDMA systems using particle swarm optimization algorithms. In: 21st Iranian conference on electrical engineering (ICEE). IEEE, pp 1–6

Arora S, Anand P (2017) Chaos-enhanced flower pollination algorithms for global optimization. J Intell Fuzzy Syst 33:3853–3869

Balasubramani K, Marcus K (2014) A study on flower pollination algorithm and its applications. Int J Appl Innov Eng Manag: IJAIEM 3:230–235

Balamurugan M, Narendiran S, Sahoo SK (2018) Misc. swarm intelligence techniques. In: A Nayyar, DN Le, NG Nguyen (eds) Advances in swarm intelligence for optimizing problems in computer science. Boca Raton: CRC, pp 225–252

Bekdaş G, Nigdeli SM, Yang X-S (2015) Sizing optimization of truss structures using flower pollination algorithm. Appl Soft Comput 37:322–331

Buehrer RM, Woerner BD (1996) Analysis of adaptive multistage interference cancellation for CDMA using an improved gaussian approximation. IEEE Trans Commun 44:1308–1321

Chiroma H, Shuib NLM, Muaz SA, Abubakar AI, Ila LB, Maitama JZ (2015) A review of the applications of bio-inspired flower pollination algorithm. Procedia Comput Sci 62:435–441

Črepinšek M, Liu S-H, Mernik M (2014) Replication and comparison of computational experiments in applied evolutionary computing: common pitfalls and guidelines to avoid them. Appl Soft Comput 19:161–170

Dahi ZAEM, Mezioud C, Draa A (2016) On the efficiency of the binary flower pollination algorithm: application on the antenna positioning problem. Appl Soft Comput 47:395–414

Datta T, Srinidhi N, Chockalingam A, Rajan BS (2010) Random-restart reactive tabu search algorithm for detection in large-mimo systems. IEEE Commun Lett 14:1107–1109

De Oliveira LD, Ciriaco F, Abrao T, Jeszensky PJE (2006) Particle swarm and quantum particle swarm optimization applied to DS/CDMA multiuser detection in flat Rayleigh channels. In: 2006 IEEE 9th International symposium on spread spectrum techniques and applications. IEEE, pp 133–137

Dong L, Youyun X, Wentao S, Hanwen L, XingZhao L (2004) Genetic algorithm based multiuser detection for cdma systems. In: Proceedings of IEEE 6th circuits and systems symposium on emerging technologies: frontiers of mobile and wireless communication, vol 1. IEEE, pp 321–324

Draa A (2015) On the performances of the flower pollination algorithm-qualitative and quantitative analyses. Appl Soft Comput 34:349–371

Driouch E, Ajib W, Gaha M (2010) A tabu search scheduling algorithm for MIMO CDMA systems. In: IEEE global telecommunications conference (GLOBECOM 2010). IEEE, pp 1–5

Dubey HM, Pandit M, Panigrahi BK (2015) A biologically inspired modified flower pollination algorithm for solving economic dispatch problems in modern power systems. Cogn Comput 7:594–608

Ergun C, Hacioglu K (2000) Multiuser detection using a genetic algorithm in CDMA communications systems. IEEE Trans Commun 48:1374–1383

Farhang-Boroujeny B, Zhu H, Shi Z (2006) Markov chain Monte Carlo algorithms for CDMA and MIMO communication systems. IEEE Trans Signal Process 54:1896–1909MATH

Fawer U, Aazhang B (1995) A multiuser receiver for code division multiple access communications over multipath channels. IEEE Trans Commun 43:1556–1565

Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11:86–92MathSciNetMATH

Gao H, Diao M (2009) Multiuser detection using the novel particle swarm optimization with simulated annealing. In: 5th international conference on wireless communication, networking and mobile computing. IEEE, pp 1–5

Guntu Nooka R, Rao BP (2013) Adaptive genetic algorithm assisted multi user detection of FD-MC-CDMA in frequency selective fading channels. Comput Sci Telecommun 39:30–39

He X, Yang X-S, Karamanoglu M, Zhao Y (2017) Global convergence analysis of the flower pollination algorithm: a discrete-time Markov chain approach. Procedia Comput Sci (International conference on computational science, ICCS 2017, 12–14 June 2017, Zurich, Switzerland), 108C:1354–1363

Hezam IM, Abdel-Baset M, Hassan BM (2016) A hybrid flower pollination algorithm with tabu search for unconstrained optimization problems. Inf Sci Lett 5:29–34

Hijazi SL, Natarajan B (2004) Novel low-complexity DS-CDMA multiuser detector based on ant colony optimization. In: 2004 IEEE 60th vehicular technology conference, vol 3. IEEE, pp 1939–1943

Huang Y, Djuric PM (2002) Multiuser detection of synchronous code-division multiple-access signals by perfect sampling. IEEE Trans Signal Process 50:1724–1734

Huang Y-F, Tan T-H, Cheng C-H, Lai W-C, Chen H-C (2017) Performance of a novel evolutionary genetic-based multi-user detector for multi-carrier CDMA communication systems. Soft Comput 21:1031–1039

Juntti M, Schlosser T, Lilleberg J (1997) Genetic algorithms for multiuser detection in synchronous CDMA. In: Proceedings 1997 IEEE international symposium on information theory. IEEE, p 492

Kaur A (2016) Comparison analysis of CDMA multiuser detection using PSO and SMO. Int J Comput Appl 133:47–50

Khan MA, Umair M, Choudhry MAS (2015) GA based adaptive receiver for MC-CDMA system. Turk J Electr Eng Comput Sci 23:2267–2277

Kowalski PA, Kamiński J, Łukasik S, Świebocka-Wiȩk J, Gołuńska D, Tarasiuk J, Kulczycki P (2019) Application of the flower pollination algorithm in the analysis of micro-CT scans. In: Cornejo M, Kóczy L, Medina J, De Barros Ruano A (eds) Trends in mathematics and computational intelligence. Springer, New York, pp 1–9

Lain J-K, Lai J-J (2007) Ant colony optimisation-based multiuser detection for direct-sequence cdma systems with diversity reception. IET Commun 1:556–561

Larbi N, Debbat F, Stambouli AB (2014) A review of heuristic near-optimum mud for MC-CDMA systems. In: 2014 international conference on multimedia computing and systems (ICMCS). IEEE, pp 1484–1489

Lenin K, Ravindhranath R, Surya K (2014) Shrinkage of active power loss by hybridization of flower pollination algorithm with chaotic harmony search algorithm. Control Theory Inf 4:31–38

Lim TJ, Rasmussen LK, Sugimoto H (1998) An asynchronous multiuser CDMA detector based on the Kalman filter. IEEE J Sel Areas Commun 16:1711–1722

Lupas R, Verdu S (1989) Linear multiuser detectors for synchronous code-division multiple-access channels. IEEE Trans Inf Theory 35:123–136MathSciNetMATH

Maradia KG, Joshi S, Patel JS (2009) Genetic algorithm for CDMA-based mud techniques under Rayleigh fading environment. IUP J Telecommun I:7–23

Marinello Filho JC, De Souza RN, AbrãO T (2012) Ant colony input parameters optimization for multiuser detection in DS/CDMA systems. Expert Syst Appl 39:12876–12884

Mehrizi S, Mahboobi B (2017) Cooperative mimo relay beamforming in overloaded DS/CDMA multicast networks. IET Commun 11:344–354

Mishra A, Deb S (2019) Assembly sequence optimization using a flower pollination algorithm-based approach. J Intell Manuf 30:461–482

Nigdeli SM, Bekdaş G, Yang X-S (2016) Application of the flower pollination algorithm in structural engineering. In: Yang X-S, Bekdaş G, Nigdeli SM (eds) Metaheuristics and optimization in civil engineering. Springer, New York, pp 25–42

Pant S, Kumar A, Ram M (2017) Flower pollination algorithm development: a state of art review. Int J Syst Assur Eng Manag 8:1858–1866

Pavlyukevich I (2007) Lévy flights, non-local search and simulated annealing. J Comput Phys 226:1830–1844MathSciNetMATH

Pradhan PM, Panda G (2012) Solving multiobjective problems using cat swarm optimization. Expert Syst Appl 39:2956–2964

Prathiba R, Moses MB, Sakthivel S (2014) Flower pollination algorithm applied for different economic load dispatch problems. Int J Eng Technol 6:1009–1016

Proakis J, Salehi M (2008) Digital communications, 5th edn. McGraw Hill Education, New York, USA

Rahnama N, Talebi S (2013) Performance comparison of chaotic spreading sequences generated by two different classes of chaotic systems in a chaos-based direct sequence-code division multiple access system. IET Commun 7:1024–1031

Rodrigues D, Silva GF, Papa JP, Marana AN, Yang X-S (2016) EEG-based person identification through binary flower pollination algorithm. Expert Syst Appl 62:81–90

Rycroft C, Bazant M (2005) Introduction to random walks and diffusion. Random walks and diffusion-2005 lecture notes. MIT

San-José-Revuelta LM (2007) A bayesian framework for the development of suboptimal blind multiuser detectors for DS/CDMA signals in synchronous channels. Sig Process 87:2231–2250MATH

San-Jose-Revuelta LM, Cid-Sueiro J (2003) Bayesian and RBF structures for wireless communications detection. In: 2003 IEEE 13th workshop on neural networks for signal processing. IEEE, pp 749–758

Sharawi M, Emary E, Saroit IA, El-Mahdy H (2014) Flower pollination optimization algorithm for wireless sensor network lifetime global optimization. Int J Soft Comput Eng 4:54–59

Shayesteh MG, Menhaj MB, Nobary BG (2003) A modified genetic algorithm for multiuser detection in DS/CDMA systems. IEICE Trans Commun 86:2377–2388MATH

Sohail M, Alam S, Hussain A, Ghauri SA, Sarfraz M, Ahmed M (2017) Multiuser detection: comparative analysis of heuristic approach. Int J Adv Appl Sci 4:115–120

Soo K-K, Siu Y-M, Chan W-S, Yang L, Chen R-S (2007) Particle-swarm-optimization-based multiuser detector for CDMA communications. IEEE Trans Veh Technol 56:3006–3013

Srinidhi N, Datta T, Chockalingam A, Rajan BS (2011) Layered tabu search algorithm for large-MIMO detection and a lower bound on ML performance. IEEE Trans Commun 59:2955–2963

Tan PH, Rasmussen LK (2004) Multiuser detection in CDMA—a comparison of relaxations, exact, and heuristic search methods. IEEE Trans Wirel Commun 3:1802–1809

Tan T-H, Huang Y-F, Hsu L-C, Wu C-H (2010a) Joint channel estimation and multi-user detection for MC-CDMA system using genetic algorithm and simulated annealing. In: IEEE international conference on systems man and cybernetics. IEEE, pp 249–256

Tan T-H, Huang Y-F, Liu F-T (2010b) Multi-user detection in DS-CDMA systems using a genetic algorithm with redundancy saving strategy. Int J Innov Comput Inf Control 6:3347–3364

Tan T-H, Chang C-C, Jean F-R, Chiang JY, Lu Y-C (2013) Joint channel estimation and multi-user detection for OFDMA systems using a genetic algorithm with simulated annealing-based mutation. In: IEEE International conference on systems, man, and cybern. IEEE, pp 162–167

Verdu S (1998) Multiuser detection. Cambridge University Press, CambridgeMATH

Wang C (2014) A completely binary and hardware-efficient PSO for CDMA multiuser detection. In: 6th international conference on intelligent human-machine systems and cybernetics (IHMSC), vol 1, pp 3–6. IEEE

Xu C, Yang L-L, Hanzo L (2007) Ant-colony-based multiuser detection for MC DS-CDMA systems. In: 2007 IEEE 66th vehicular technology conference. IEEE, pp 960–964

Yang X-S (2012) Flower pollination algorithm for global optimization. In: UCNC. Springer, pp 240–249

Yang X-S, Deb S (2014) Cuckoo search: recent advances and applications. Neural Comput Appl 24:169–174

Yao Y-C, Cheng C-H, Wen G-J, Wen J-H (2011) Multiuser detection using simulated annealing hopfield neural network for DS-UWB systems. In: 2011 international conference on machine learning and cybernetics (ICMLC), vol 2. IEEE, pp 763–768

Yen K, Hanzo L (2000) Hybrid genetic algorithm based detection schemes for synchronous CDMA systems. In: IEEE 51st vehicular technology conference proceedings, 2000. Tokyo, vol 2. IEEE, pp 1400–1404

Yen K, Hanzo L (2001) Genetic algorithm assisted joint multiuser symbol detection and fading channel estimation for synchronous CDMA systems. IEEE J Sel Areas Commun 19:985–998

Yen K, Hanzo L (2004) Genetic-algorithm-assisted multiuser detection in asynchronous CDMA communications. IEEE Trans Veh Technol 53:1413–1422

Zhou Y, Wang R, Zhao C, Luo Q, Metwally MA (2019) Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Comput Appl 31:2155–2170

Title: A new flower pollination algorithm for equalization in synchronous DS/CDMA multiuser communication systems
Authors: Luis M. San-José-Revuelta
Pablo Casaseca-de-la-Higuera
Publication date: 01-02-2020
Publisher: Springer Berlin Heidelberg
Published in: Soft Computing / Issue 17/2020
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI: https://doi.org/10.1007/s00500-020-04725-x

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Other articles of this Issue 17/2020

Research on the performance of multi-population genetic algorithms with different complex network structures

Some generalizations of p-semisimple BCI algebras and groups

A novel nature-inspired meta-heuristic algorithm for optimization: bear smell search algorithm

Island artificial bee colony for global optimization

New method for interval-valued hesitant fuzzy decision making based on preference relations

Knowledge-enhanced temporal word embedding for diachronic semantic change estimation

Premium Partner