[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

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

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Abbreviations

ACO:

Ant colony algorithm

BPSK:

Binary phase shift keying

CSO:

Cat swarm optimization

DS/CDMA:

Direct sequence/code-division multiple-access

FPA:

Flower pollination algorithm

GA:

Genetic algorithm

GPS:

Global positioning system

ISI:

Intersymbol interference

MAI:

Multi-access interference

MF:

Matched filter

ML:

Maximum likelihood

MMSEE:

Minimum mean square error estimator

MUD:

Multiuser detector

PSO:

Particle swarm optimization

RBF:

Radial basis function

SA:

Simulated annealing

SNR:

Signal-to-noise ratio

SQ:

Simulated quenching

TS:

Tabu search

UOI:

User of interest

References

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • 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

    Google Scholar 

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

    Google Scholar 

  • 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

    Google Scholar 

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

    Google Scholar 

  • 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

    Google Scholar 

  • Č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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

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

    Google Scholar 

  • 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–1909

    MATH  Google Scholar 

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

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  • 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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • 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

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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–2250

    MATH  Google Scholar 

  • 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

    Google Scholar 

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

    MATH  Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • 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, Cambridge

    MATH  Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

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

    Google Scholar 

  • 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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ETSI Telecomunicación, Universidad de Valladolid, 47011, Valladolid, Spain

    Luis M. San-José-Revuelta & Pablo Casaseca-de-la-Higuera

  2. School of Computing, Engineering and Physical Sciences, University of the West of Scotland, Paisley Campus, High Street, Paisley, PA1 2BE, Scotland, UK

    Pablo Casaseca-de-la-Higuera

Authors
  1. Luis M. San-José-Revuelta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pablo Casaseca-de-la-Higuera
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luis M. San-José-Revuelta.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by V. Loia.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

A Particularization to a chip-rate algorithm

A Particularization to a chip-rate algorithm

In this case, taking into account that the energy of the chips is \(\mathcal {E}_\gamma = \int _0^{T_\mathrm{c}} |\gamma (t)|^2 \hbox {d}t\), a sequence of N samples is obtained for each symbol, whose components are calculated as

$$\begin{aligned} r_{n,j}= & {} \int _{nT+jT_\mathrm{c}}^{nT+(j+1)T_\mathrm{c}} r(t) \gamma (t-nT-jT_\mathrm{c}) \hbox {d}t \nonumber \\= & {} \sum _{u=1}^U a_u(n) d_u(n) s_u(j) \mathcal {E}_\gamma + \int _0^{T_\mathrm{c}} g(t+nT-jT_\mathrm{c}) \gamma (t) \hbox {d}t, \nonumber \\&\qquad \qquad j=0,1,\dots ,N-1 \end{aligned}$$
(19)

This set of N samples is normalized by the chip energy \(\mathcal {E}_\gamma \) and grouped into a vector \(\mathbf{r}_n^\mathrm{chip}\). Thus, we can write

$$\begin{aligned} \mathbf{r}_n^\mathrm{chip} = \sum _{i=1}^U \mathbf{s}_i a_i(n) d_i(n) + \mathbf{g}(n) = \mathbf{SA}{} \mathbf{d}(n) + \mathbf{g}(n) \end{aligned}$$
(20)

where \(\mathbf{S}=[\mathbf{s}_1,\mathbf{s}_2,\dots ,\mathbf{s}_U]\) is the \(N\times U\) matrix whose columns contain the users’ signatures \(\mathbf{s}_i\), and \(\mathbf{g}(n) = [g_{n,0}, g_{n,1},\dots , g_{n,L-1}]^\mathrm{T}\) stands for the normalized noise vector with components

$$\begin{aligned} g_{n,j} = \frac{1}{\mathcal {E}_\gamma } \int _0^{T_\mathrm{c}} g(t+nT+j T_\mathrm{c}) \gamma (t) \hbox {d}t, \qquad j=0,1,\dots ,N-1 \end{aligned}$$
(21)

Since g represents a zero-mean, white and Gaussian noise process, its covariance matrix is \(E\{ \mathbf{g}(n) \mathbf{g}(n)^H \} = \sigma ^2 \mathbf{I}_N\), with \(\mathbf{I}_N\) being the \(N \times N\) identity matrix.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

San-José-Revuelta, L.M., Casaseca-de-la-Higuera, P. A new flower pollination algorithm for equalization in synchronous DS/CDMA multiuser communication systems. Soft Comput 24, 13069–13083 (2020). https://doi.org/10.1007/s00500-020-04725-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-04725-x

Keywords

Search

Navigation