Pith. sign in

REVIEW 4 major objections 5 minor 80 references

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

T0 review · 4 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A modified Flower Pollination Algorithm for joint symbol detection and channel estimation in synchronous DS/CDMA claims near-single-user bit error rates under near-far interference and lower runtime than a standard genetic algorithm.

desk verdict Entropy-based diversity control in the proposed FPA is not well-defined as written, undermining the central claim, but the application and simulations are substantial. read the letter →

arxiv 2412.02023 v1 pith:SR3CPWVD submitted 2024-12-02 eess.SP

Luis M. San-José-Revuelta , Pablo Casaseca-de-la-Higuera This is my paper · ORCID
classification eess.SP
keywords DS/CDMAFlowerPollinationAlgorithmmultiuserdetectionchannelestimationpopulationdiversitycontrolentropy-basedadaptationnear-fareffectnature-inspiredoptimization
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proposes a modified Flower Pollination Algorithm (FPA) for the joint estimation of channel fading coefficients and transmitted symbols in synchronous DS/CDMA systems. The authors claim the modified detector reaches bit error rates close to the single-user bound when the user of interest is weak, many interferers are active, or near-far effects are strong, conditions where matched filter, decorrelator, genetic algorithm, tabu search, and simulated quenching degrade. The key modification is monitoring the Shannon entropy of the population's fitness values and using it to adjust the probability of switching between global and local pollination, preserving diversity during the search. Compared at equal fitness evaluations, the proposed FPA reaches the same BER in about 45% of the time a standard genetic algorithm needs, and the reported differences are backed by Kruskal-Wallis and Friedman tests.

What carries the argument

The load-bearing mechanism is the entropy-controlled probability of change in the standard Flower Pollination Algorithm. Population diversity is monitored through the Shannon entropy of normalized flower fitnesses, $H(P[k]) = -\sum_i L^*_i[k] \log L^*_i[k]$; high entropy (similar fitnesses) raises $P_c$ to favor global pollination with a L\'evy flight, and low entropy lowers $P_c$ to favor local pollination. The solution encoding is split into a symbol part $d(n)$ and a fading part $a(n)$, which receive different scale factors $\gamma_d$ and $\gamma_a$, with $\gamma_a$ shrinking by 10% every $MaxIter/4$ iterations so the already-estimated channel coefficients are only fine-tuned while symbols are re-randomized each symbol period. Fitness is the log-likelihood expression from the DS/CDMA model, and $P_c$ adjustments are applied every $MaxIter/10$ iterations with smaller updates as iterations grow.

What would settle it

Re-implement the algorithm exactly as specified, with no hidden iteration-based rule for interpreting high entropy, and run the BER versus SNR experiment of Fig. 3: if the results differ materially from Table 1, the entropy-control mechanism is not fully specified. A sharper test: replace the entropy rule with a fixed $P_c = 0.35$ and a fixed schedule of shrinking $\gamma_a$; if that simpler version matches the reported BER, the entropy monitoring is not what carries the performance.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central claim is that a Flower Pollination Algorithm whose exploration-exploitation balance is controlled by the entropy of fitness values is a practical near-far-resistant multiuser detector. Each candidate solution is a vector of the form $[d(n)|a(n)]$ containing all users' transmitted symbols and their flat-fading coefficients, and its fitness is the log-likelihood of the received matched-filter output. Global pollination, modeled as a L\'evy flight toward the current best solution, is applied with a larger step to the symbol part and a smaller, decreasing step to the fading part, while local pollination uses random pairwise differences. The probability of change $P_c$, which chooses between global and local pollination, is increased when fitness entropy is high and decreased when it is low, so the population keeps exploring early and exploits late. The paper reports lower BER than the compared conventional and nature-inspired detectors under low SNR, many users, and near-far imbalance, with channel-estimation MSE near the single-user limit and no need for supervised initialization.

Load-bearing premise

The advantage over the standard FPA depends on the claim that the algorithm can tell whether high fitness entropy means the population is still exploring or has converged, but the paper gives no formal rule for making that distinction.

Editorial extensions

If this is right

  • Under low SNR, many active users, or 4-15 dB near-far power imbalance, the entropy-controlled FPA keeps BER closer to the single-user bound than MF, decorrelator RLS, MMSE-RLS, Std-GA, TS, and SQ in the tested regimes.
  • At equal fitness-function evaluations, the FPA reaches the same target BER in about 45% of the time used by Std-GA and about two-thirds of the time used by TS or SQ.
  • The channel estimator part of the FPA reaches MSE near the single-user limit, comparable to a Bayesian detector, without requiring a supervised training period or burn-in.
  • Kruskal-Wallis tests with Bonferroni correction and a Friedman test report statistically significant performance differences favoring the FPA over Std-GA, TS, and SQ for most tested SNRs.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the entropy-based diversity control is what carries the gain, the same control rule could be bolted onto other population metaheuristics (PSO, cuckoo search, cat swarm) for the same DS/CDMA problem; the paper does not test that transfer.
  • Because the ambiguity about early versus late high-entropy states is resolved only by knowing the iteration count, the adaptive $P_c$ may effectively reduce to an iteration-dependent schedule; a fixed schedule might reproduce most of the benefit.
  • The complexity comparison is in time-to-target-BER, so the practical "less complexity" claim should be checked with a direct operation count or hardware implementation, since entropy computation and population management add overhead not captured by fitness evaluations.
  • Extending the algorithm to asynchronous users or non-binary alphabets, which the paper lists as future work, is non-trivial because the model assumes perfect synchronization, BPSK, and symbol-rate processing; the near-far robustness shown here is for that narrower setting.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper proposes a modified Flower Pollination Algorithm (FPA) for joint symbol detection and flat-fading channel estimation in synchronous DS/CDMA systems. The main novelties are an entropy-based adaptation of the probability of change Pc (Sec. 3.2) and a split encoding in which global and local pollination act differently on the symbol part and the channel-coefficient part of each candidate solution. The authors evaluate the resulting detector by Monte Carlo simulations of BER versus SNR, BER versus number of users, channel-estimation MSE, and near-far performance, comparing against matched filter, decorrelator, MMSE-RLS, Mahalanobis-RBF, standard GA, tabu search, simulated quenching, and several Bayesian detectors, with Kruskal-Wallis and Friedman tests for statistical significance. The central claim is that the proposed FPA offers competitive or lower BER under difficult conditions (many users, low SNR, near-far effects) while requiring less computation than conventional methods with similar performance.

Significance. If the algorithm were fully and reproducibly specified, the claimed results would be of practical interest for DS/CDMA multiuser detection, particularly the near-far resistance and the ability to adapt exploration/exploitation through population-diversity monitoring. The paper has clear strengths: the BER and MSE results are direct simulation outcomes rather than circular derivations; the authors compare against several strong baselines, including their own previous Bayesian detectors; and they report statistical significance tests and make an explicit effort to equalize computational load in terms of fitness-function evaluations. These features make the empirical comparison credible in broad outline. However, the significance is currently conditional on correcting a load-bearing technical defect: the entropy measure in Eq. (16) is undefined for the log-likelihood fitness in Eq. (7), and the adaptive Pc rule in Sec. 3.2 is under-specified. These issues prevent exact reproduction and make it impossible to isolate the contribution of the paper's central novelty.

major comments (4)
  1. [Sec. 3.2, Eq. (16)] The Shannon entropy in Eq. (16) uses normalized fitness values L_i^*[k] = L_i[k] / (sum_j L_j[k]) as probabilities, but the log-likelihood L in Eq. (7) is not nonnegative. For a single-user BPSK noiseless channel with a=1, E=1 and true symbol d=+1, Eq. (7) gives L(+1)=1 and L(-1)=-3; after normalization both signs can occur, so log L_i^* is undefined for typical populations, including the 25-flower random initializations described in Sec. 4. The entropy-controlled Pc update therefore cannot be executed as written, and the central novelty of the paper is not reproducible from the text. Please redefine the diversity measure over a nonnegative fitness mapping (for example, exponentiating L or using likelihoods rather than log-likelihoods) or justify the current formula.
  2. [Sec. 3.2, step 6] The adjustment rule for Pc is under-specified. The two bullets state only qualitative directions (higher entropy increases Pc, lower entropy decreases Pc), and the text adds that modifications are smaller as iteration t increases and are applied every MaxIter/10 iterations, but it gives no formula for the step size, no bounds on Pc, and no quantitative criterion for deciding whether the algorithm is in the 'first or last iterations'. Because the BER advantage over the standard FPA is attributed to this adaptive mechanism, the missing rule prevents exact reproduction and also prevents isolating the entropy control's contribution. Please provide an explicit update equation for Pc(t) or a table of the parameter settings used in the simulations.
  3. [Sec. 3.1, step 1] Step 1 of the algorithm description states that the best solution b* is the flower with the lowest fitness value, whereas Eq. (8) and step 7 define the solution as the one maximizing the log-likelihood L. Since the selection and replacement logic in step 5 depends on this objective, the two statements cannot both be correct. Please correct the description and state explicitly whether L is maximized or minimized in the simulations.
  4. [Sec. 4.5] The near-far experiment introduces an ISI channel H_UOI(z) = a0 + 0.471 z^{-1} + 0.063 z^{-2}, but the system model in Sec. 2 and the flower encoding in Sec. 3.1 assume a single flat-fading coefficient a_i(n) per user with no intersymbol interference. It is not explained how this multipath transfer function is incorporated into Eq. (7), the state vector in Eq. (9), or the matched-filter output z(n). As the near-far resistance claim rests on this experiment, please reconcile the channel model or clarify the extension used there.
minor comments (5)
  1. [Table 1] The Standard GA row at SNR=10 dB reports 0.007 ± 0.019, which has a standard deviation larger than the mean and is inconsistent with the decreasing BER trend; please check this entry.
  2. [Eq. (9)] The subscript i is used both for the flower index and for the elements d_i,t(u), which can be confused with user indices; consider denoting the flower index differently, for example x^(m)[t].
  3. [Sec. 4.1, Fig. 3 caption] The caption mentions 'np: population size of the standard GA', but np is not defined in the text; please specify the GA population size and the number of generations used for the results in Fig. 3.
  4. [General terminology] The abbreviation 'MMSEE' appears in the abstract and in Sec. 4.3, while the text mainly uses 'MMSE' and 'MMSE-RLS'; please unify the terminology.
  5. [Sec. 4.5] The text says that 'the first coefficient (a0) varies in such a way that signal-to-interference ratio is -10 ≤ SIR ≤ 10 dB', but the horizontal axis of Fig. 7 is labeled 'Power difference (dB)'; please clarify the relationship between SIR and the plotted quantity.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the claimed FPA performance rests on independent Monte Carlo simulations, and the entropy-based Pc adaptation is an adaptive heuristic, not a quantity defined from the target result.

full rationale

The paper's central claim is empirical: FPA achieves lower BER/MSE in the simulated DS/CDMA scenarios of Secs. 4.1, 4.4, and 4.5. These values are direct simulation outputs, not quantities derived from the algorithm's parameters by construction. The entropy-diversity control of Sec. 3.2 (Eq. 16) uses the Shannon entropy of normalized fitness to adjust Pc, but the reported BER is not algebraically forced by that rule; it is the outcome of running the search. Tuning choices such as Pc = 0.35 and the gamma factors are heuristic and stated as such ('after several simulations'), not fitted parameters renamed as predictions. The self-citations (San-José-Revuelta 2007; San-José-Revuelta & Cid-Sueiro 2003) appear only as comparison baselines (Figs. 5-7), so they are not load-bearing for the novelty claim. The most serious defect, that Eq. (16) requires the logarithm of possibly negative normalized likelihoods and the informal 'first or last iterations' disambiguation, is a correctness/reproducibility issue, not a circular derivation, because the entropy rule does not encode the target BER or MSE values.

Assumptions & free parameters 8 free parameters · 4 assumptions · 0 invented entities

The central performance claim rests on several hand-tuned algorithmic parameters and domain assumptions inherited from cited models. The entropy-diversity control is an ad-hoc heuristic that is under-specified, and the channel model changes between experiments. No new physical or mathematical entities are introduced.

free parameters (8)
  • Initial probability of change Pc(0) = 0.35
    Chosen after several simulations (Sec. 3.1); affects the balance of global vs local pollination.
  • Levy flight exponent lambda = 1.0
    Set after heuristic trials in the range [0.7, 2] (Sec. 3.1).
  • Levy distribution parameter beta = 1.5
    Fixed as suggested by Yang (2012), cited in Sec. 3.1.
  • Scale factor gamma_d for symbol part = 0.1
    Constant scale for the d(n) part in global pollination (Sec. 3.2).
  • Scale factor gamma_a for fading part = 0.05 initial, decreasing 10% every MaxIter/4
    Hand-set schedule for the a(n) part (Sec. 3.2).
  • Population size NumFl = 25
    Simulation default (Sec. 4); not justified.
  • Maximum iterations MaxIter = 2000
    Simulation default (Sec. 4); not justified.
  • Entropy-based Pc adjustment step size = unspecified
    Step 6 of Sec. 3.2 says Pc is modified but does not give the functional relationship between entropy H and Pc; this is a missing tuning parameter.
assumptions (4)
  • domain assumption The log-likelihood in Eq. (7) is the correct objective for joint estimation of A(n) and d(n).
    Taken from Fawer & Aazhang (1995); assumes Gaussian noise and known codeword correlations. Invoked in Sec. 2.
  • ad hoc to paper Fitness entropy H(P[k]) is a valid and directionally correct diversity measure, i.e., high entropy implies low dispersion and should increase Pc.
    Sec. 3.2 asserts this without proof; the paper itself notes H is also high at convergence, which contradicts the simple rule and requires an unspecified exception.
  • domain assumption The time-varying flat-fading model ai(n+1)=alpha ai(n)+nu (Eq. 5) is the channel model for all experiments; no ISI is present except in Sec. 4.5.
    Sec. 2 defines flat fading; Sec. 4.5 silently introduces an ISI channel for the UOI, inconsistent with the model and the fitness function.
  • ad hoc to paper Comparison against baseline detectors is fair in terms of computational effort and tuning.
    The paper states equal fitness-evaluation load for TS and SQ in Sec. 4.2, but the GA tuning (np, ng) and the sensitivity of all algorithms to their own tuned parameters are not fully addressed.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A new flower pollination algorithm for equalization in synchronous DS/CDMA multiuser communication systems." pith.science (2026). https://pith.science/paper/SR3CPWVD

@misc{pith2026241202023,
  author       = {Pith},
  title        = {Pith review of: A new flower pollination algorithm for equalization in synchronous DS/CDMA multiuser communication systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SR3CPWVD}},
  note         = {Machine review of arXiv:2412.02023}
}
read the original abstract

This work proposes a modified version of an emerging nature-inspired technique, named Flower Pollination Algorithm (FPA), 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 (DS/CDMA) 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 (MF), Minimum Mean Square Error Estimator (MMSEE) 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.

Figures

Figures reproduced from arXiv: 2412.02023 by the authors.

Figure 3
Figure 3. In order to get a fair comparison, SQ and TS [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

80 extracted references · 78 canonical work pages

  1. [1]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize "" * " " * ...

  2. [2]

    , & author Hezam, I

    author Abdel-Baset, M. , & author Hezam, I. M. ( year 2015 ). title An improved flower pollination algorithm based on simulated annealing for solving engineering optimization problems . journal Asian Journal of Mathematics and Computer Research \/ , volume 3 \/ , pages 149--170

    work page 2015

  3. [3]

    , & author Hezam, I

    author Abdel-Baset, M. , & author Hezam, I. M. ( year 2016 ). title A hybrid flower pollination algorithm for solving ill-conditioned set of equations . journal International Journal of Bio-Inspired Computation \/ , volume 8 \/ , pages 215--220

    work page 2016

  4. [4]

    , author Wu, H

    author Abdel-Baset, M. , author Wu, H. , & author Zhou, Y. ( year 2017 a ). title A complex encoding flower pollination algorithm for constrained engineering optimisation problems . journal International Journal of Mathematical Modelling and Numerical Optimisation \/ , volume 8 \/ , pages 108--126

    work page 2017

  5. [5]

    , author Wu, H

    author Abdel-Baset, M. , author Wu, H. , author Zhou, Y. , & author Abdel-Fatah, L. ( year 2017 b ). title Elite opposition-flower pollination algorithm for quadratic assignment problem . journal Journal of Intelligent & Fuzzy Systems \/ , volume 33 \/ , pages 901--911

    work page 2017

  6. [6]

    , author El-Shahat, D

    author Abdel-Basset, M. , author El-Shahat, D. , author El-Henawy, I. , & author Sangaiah, A. K. ( year 2018 ). title A modified flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making . journal Soft Computing \/ , volume 22 \/ , pages 4221--4239

    work page 2018

  7. [7]

    , & author Shawky, L

    author Abdel-Basset, M. , & author Shawky, L. A. ( year 2019 ). title Flower pollination algorithm: a comprehensive review . journal Artificial Intelligence Review \/ , volume 52 \/ , pages 2533--2557

    work page 2019

  8. [8]

    , & author Zhou, Y

    author Abdel-Basset, M. , & author Zhou, Y. ( year 2018 ). title An elite opposition-flower pollination algorithm for a 0-1 knapsack problem . journal International Journal of Bio-Inspired Computation \/ , volume 11 \/ , pages 46--53

    work page 2018

Show all 80 references
  1. [9]

    , author Abdel-Baset, M

    author Abdel-Raouf, O. , author Abdel-Baset, M. et al. ( year 2014 ). title A new hybrid flower pollination algorithm for solving constrained global optimization problems . journal Int. J. Applied Operational Research \/ , volume 4 \/ , pages 1--13

    2014

  2. [10]

    , & author Mehta, S

    author Agarwal, P. , & author Mehta, S. ( year 2014 ). title Nature-inspired algorithms: state-of-art, problems and prospects . journal Nature \/ , volume 100 \/ , pages 14--21

    2014

  3. [11]

    , author Yousri, D

    author Alam, D. , author Yousri, D. , & author Eteiba, M. ( year 2015 ). title Flower pollination algorithm based solar pv parameter estimation . journal Energy Conversion and Management \/ , volume 101 \/ , pages 410--422

    2015

  4. [12]

    author Arani, A. H. J. , & author Azmi, P. ( year 2013 ). title Joint multiuser and inter-symbol interference suppression in cdma systems using particle swarm optimization algorithms . In booktitle Electrical Engineering (ICEE), 21st Iranian Conf. on \/ (pp. pages 1--6 ). orga...

    2013

  5. [13]

    , & author Anand, P

    author Arora, S. , & author Anand, P. ( year 2017 ). title Chaos-enhanced flower pollination algorithms for global optimization . journal Journal of Intelligent & Fuzzy Systems \/ , volume 33 \/ , pages 3853--3869

    2017

  6. [14]

    , author Narendiran, S

    author Balamurugan, M. , author Narendiran, S. , & author Sahoo, S. K. ( year 2018 ). title Misc. swarm intelligence techniques . In booktitle Advances in Swarm Intelligence for Optimizing Problems in Computer Science \/ (pp. pages 225--252 ). publisher Chapman and Hall/CRC

    2018

  7. [15]

    , & author Marcus, K

    author Balasubramani, K. , & author Marcus, K. ( year 2014 ). title A study on flower pollination algorithm and its applications . journal International Journal of Application or Innovation in Engineering & Management (IJAIEM) \/ , volume 3 \/ , pages 230--235

    2014

  8. [16]

    , author Nigdeli, S

    author Bekda s , G. , author Nigdeli, S. M. , & author Yang, X.-S. ( year 2015 ). title Sizing optimization of truss structures using flower pollination algorithm . journal Applied Soft Computing \/ , volume 37 \/ , pages 322--331

    2015

  9. [17]

    author Buehrer, R. M. , & author Woerner, B. D. ( year 1996 ). title Analysis of adaptive multistage interference cancellation for cdma using an improved gaussian approximation . journal IEEE Trans. on communications \/ , volume 44 \/ , pages 1308--1321

    1996

  10. [18]

    , author Shuib, N

    author Chiroma, H. , author Shuib, N. L. M. , author Muaz, S. A. , author Abubakar, A. I. , author Ila, L. B. , & author Maitama, J. Z. ( year 2015 ). title A review of the applications of bio-inspired flower pollination algorithm . journal Procedia Computer Science \/ , volum...

    2015

  11. [19]

    , author Liu, S.-H

    author C repin s ek, M. , author Liu, S.-H. , & author Mernik, M. ( year 2014 ). title Replication and comparison of computational experiments in applied evolutionary computing: common pitfalls and guidelines to avoid them . journal Applied Soft Computing \/ , volume 19 \/ , p...

    2014

  12. [20]

    author Dahi, Z. A. E. M. , author Mezioud, C. , & author Draa, A. ( year 2016 ). title On the efficiency of the binary flower pollination algorithm: application on the antenna positioning problem . journal Applied Soft Computing \/ , volume 47 \/ , pages 395--414

    2016

  13. [21]

    , author Srinidhi, N

    author Datta, T. , author Srinidhi, N. , author Chockalingam, A. , & author Rajan, B. S. ( year 2010 ). title Random-restart reactive tabu search algorithm for detection in large-mimo systems . journal IEEE Communications Letters \/ , volume 14 \/ , pages 1107--1109

    2010

  14. [22]

    author De Oliveira, L. D. , author Ciriaco, F. , author Abrao, T. , & author Jeszensky, P. J. E. ( year 2006 ). title Particle swarm and quantum particle swarm optimization applied to ds/cdma multiuser detection in flat rayleigh channels . In booktitle Spread Spectrum Techniqu...

    2006

  15. [23]

    , author Youyun, X

    author Dong, L. , author Youyun, X. , author Wentao, S. , author Hanwen, L. , & author XingZhao, L. ( year 2004 ). title Genetic algorithm based multiuser detection for cdma systems . In booktitle Emerging technologies: frontiers of mobile and wireless communication. Proc. IEE...

    2004

  16. [24]

    ( year 2015 )

    author Draa, A. ( year 2015 ). title On the performances of the flower pollination algorithm--qualitative and quantitative analyses . journal Applied Soft Computing \/ , volume 34 \/ , pages 349--371

    2015

  17. [25]

    , author Ajib, W

    author Driouch, E. , author Ajib, W. , & author Gaha, M. ( year 2010 ). title A tabu search scheduling algorithm for mimo cdma systems . In booktitle Global Telecommunications Conf. (GLOBECOM 2010), IEEE \/ (pp. pages 1--5 ). organization IEEE

    2010

  18. [26]

    author Dubey, H. M. , author Pandit, M. , & author Panigrahi, B. K. ( year 2015 ). title A biologically inspired modified flower pollination algorithm for solving economic dispatch problems in modern power systems . journal Cognitive Computation \/ , volume 7 \/ , pages 594--608

    2015

  19. [27]

    , & author Hacioglu, K

    author Ergun, C. , & author Hacioglu, K. ( year 2000 ). title Multiuser detection using a genetic algorithm in cdma communications systems . journal IEEE Trans. on communications \/ , volume 48 \/ , pages 1374--1383

    2000

  20. [28]

    , author Zhu, H

    author Farhang-Boroujeny, B. , author Zhu, H. , & author Shi, Z. ( year 2006 ). title Markov chain monte carlo algorithms for cdma and mimo communication systems . journal IEEE Trans. on Signal Processing \/ , volume 54 \/ , pages 1896--1909

    2006

  21. [29]

    , & author Aazhang, B

    author Fawer, U. , & author Aazhang, B. ( year 1995 ). title A multiuser receiver for code division multiple access communications over multipath channels . journal IEEE Trans. on Communications \/ , volume 43 \/ , pages 1556--1565

    1995

  22. [30]

    ( year 1940 )

    author Friedman, M. ( year 1940 ). title A comparison of alternative tests of significance for the problem of m rankings . journal The Annals of Mathematical Statistics \/ , volume 11 \/ , pages 86--92 . :https://www.jstor.org/stable/2235971

    1940

  23. [31]

    , & author Diao, M

    author Gao, H. , & author Diao, M. ( year 2009 ). title Multiuser detection using the novel particle swarm optimization with simulated annealing . In booktitle Wireless Comm., Networking and Mobile Computing. 5th Int. Conf. on \/ (pp. pages 1--5 ). organization IEEE

    2009

  24. [32]

    , & author Rao, B

    author Guntu Nooka, R. , & author Rao, B. P. ( year 2013 ). title Adaptive genetic algorithm assisted multi user detection of fd-mc-cdma in frequency selective fading channels . journal Computer Science & Telecommunications \/ , volume 39 \/ , pages 30--39

    2013

  25. [33]

    , author Yang, X.-S

    author He, X. , author Yang, X.-S. , author Karamanoglu, M. , & author Zhao, Y. ( year 2017 ). title Global convergence analysis of the flower pollination algorithm: a discrete-time markov chain approach . journal Procedia Computer Science (Int. Conf. on Computational Science,...

    2017

  26. [34]

    author Hezam, I. M. , author Abdel-Baset, M. , & author Hassan, B. M. ( year 2016 ). title A hybrid flower pollination algorithm with tabu search for unconstrained optimization problems . journal Information Sciences Letters \/ , volume 5 \/ , pages 29--34

    2016

  27. [35]

    author Hijazi, S. L. , & author Natarajan, B. ( year 2004 ). title Novel low-complexity ds-cdma multiuser detector based on ant colony optimization . In booktitle Vehicular Technology Conf. 2004 IEEE 60th \/ (pp. pages 1939--1943 ). organization IEEE volume volume 3

    2004

  28. [36]

    , & author Djuric, P

    author Huang, Y. , & author Djuric, P. M. ( year 2002 ). title Multiuser detection of synchronous code-division multiple-access signals by perfect sampling . journal IEEE Trans. on Signal Processing \/ , volume 50 \/ , pages 1724--1734

    2002

  29. [37]

    , author Tan, T.-H

    author Huang, Y.-F. , author Tan, T.-H. , author Cheng, C.-H. , author Lai, W.-C. , & author Chen, H.-C. ( year 2017 ). title Performance of a novel evolutionary genetic-based multi-user detector for multi-carrier cdma communication systems . journal Soft Computing \/ , volume...

    2017

  30. [38]

    , author Schlosser, T

    author Juntti, M. , author Schlosser, T. , & author Lilleberg, J. ( year 1997 ). title Genetic algorithms for multiuser detection in synchronous cdma . In booktitle Information theory. Proc., 1997 IEEE Int. Symp. on \/ (p. pages 492 ). organization IEEE

    1997

  31. [39]

    ( year 2016 )

    author Kaur, A. ( year 2016 ). title Comparison analysis of cdma multiuser detection using pso and smo . journal International journal of computer applications \/ , volume 133 \/ , pages 47--50

    2016

  32. [40]

    author Khan, M. A. , author Umair, M. , & author Choudhry, M. A. S. ( year 2015 ). title Ga based adaptive receiver for mc-cdma system . journal Turkish J. of Electrical Engineering & Computer Sciences \/ , volume 23 \/ , pages 2267--2277

    2015

  33. [41]

    author Kowalski, P. A. , author Kami \'n ski, J. , author ukasik, S. , author \'S wiebocka-Wi?k, J. , author Go u \'n ska, D. , author Tarasiuk, J. , & author Kulczycki, P. ( year 2019 ). title Application of the flower pollination algorithm in the analysis of micro-ct scans ....

    2019

  34. [42]

    , & author Lai, J.-J

    author Lain, J.-K. , & author Lai, J.-J. ( year 2007 ). title Ant colony optimisation-based multiuser detection for direct-sequence cdma systems with diversity reception . journal IET communications \/ , volume 1 \/ , pages 556--561

    2007

  35. [43]

    , author Debbat, F

    author Larbi, N. , author Debbat, F. , & author Stambouli, A. B. ( year 2014 ). title A review of heuristic near-optimum mud for mc-cdma systems . In booktitle Multimedia Computing and Systems (ICMCS), 2014 Int. Conf. on \/ (pp. pages 1484--1489 ). organization IEEE

    2014

  36. [44]

    , author Ravindhranath, R

    author Lenin, K. , author Ravindhranath, R. , & author Surya, K. ( year 2014 ). title Shrinkage of active power loss by hybridization of flower pollination algorithm with chaotic harmony search algorithm . journal Control Theory Inform \/ , volume 4 \/ , pages 31--38

    2014

  37. [45]

    author Lim, T. J. , author Rasmussen, L. K. , & author Sugimoto, H. ( year 1998 ). title An asynchronous multiuser cdma detector based on the kalman filter . journal IEEE J. on Selected Areas in Communications \/ , volume 16 \/ , pages 1711--1722

    1998

  38. [46]

    , & author Verdu, S

    author Lupas, R. , & author Verdu, S. ( year 1989 ). title Linear multiuser detectors for synchronous code-division multiple-access channels . journal IEEE Trans. on Information Theory \/ , volume 35 \/ , pages 123--136

    1989

  39. [47]

    author Maradia, K. G. , author Joshi, S. , & author Patel, J. S. ( year 2009 ). title Genetic algorithm for cdma-based mud techniques under rayleigh fading environment . journal The IUP J. of Telecommunications \/ , volume I \/ , pages 7--23

    2009

  40. [48]

    author Marinello Filho, J. C. , author De Souza, R. N. , & author Abr \ a O, T. ( year 2012 ). title Ant colony input parameters optimization for multiuser detection in ds/cdma systems . journal Expert Systems with Applications \/ , volume 39 \/ , pages 12876--12884

    2012

  41. [49]

    , & author Mahboobi, B

    author Mehrizi, S. , & author Mahboobi, B. ( year 2017 ). title Cooperative mimo relay beamforming in overloaded ds/cdma multicast networks . journal IET Communications \/ , volume 11 \/ , pages 344--354

    2017

  42. [50]

    , & author Deb, S

    author Mishra, A. , & author Deb, S. ( year 2019 ). title Assembly sequence optimization using a flower pollination algorithm-based approach . journal Journal of Intelligent Manufacturing \/ , volume 30 \/ , pages 461--482

    2019

  43. [51]

    author Nigdeli, S. M. , author Bekda s , G. , & author Yang, X.-S. ( year 2016 ). title Application of the flower pollination algorithm in structural engineering . In booktitle Metaheuristics and optimization in civil engineering \/ (pp. pages 25--42 ). publisher Springer

    2016

  44. [52]

    , author Kumar, A

    author Pant, S. , author Kumar, A. , & author Ram, M. ( year 2017 ). title Flower pollination algorithm development: a state of art review . journal International Journal of System Assurance Engineering and Management \/ , volume 8 \/ , pages 1858--1866

    2017

  45. [53]

    ( year 2007 )

    author Pavlyukevich, I. ( year 2007 ). title L \'e vy flights, non-local search and simulated annealing . journal Journal of Computational Physics \/ , volume 226 \/ , pages 1830--1844

    2007

  46. [54]

    author Pradhan, P. M. , & author Panda, G. ( year 2012 ). title Solving multiobjective problems using cat swarm optimization . journal Expert Systems with Applications \/ , volume 39 \/ , pages 2956--2964

    2012

  47. [55]

    , author Moses, M

    author Prathiba, R. , author Moses, M. B. , & author Sakthivel, S. ( year 2014 ). title Flower pollination algorithm applied for different economic load dispatch problems . journal International Journal of Engineering and Technology \/ , volume 6 \/ , pages 1009--1016

    2014

  48. [56]

    author Proakis, J. G. ( year 1998 ). title Digital communications, fourth edition, 2001

    1998

  49. [57]

    , & author Talebi, S

    author Rahnama, N. , & author Talebi, S. ( year 2013 ). title 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 . journal IET Communications \/ , vol...

    2013

  50. [58]

    , author Silva, G

    author Rodrigues, D. , author Silva, G. F. , author Papa, J. P. , author Marana, A. N. , & author Yang, X.-S. ( year 2016 ). title Eeg-based person identification through binary flower pollination algorithm . journal Expert Systems with Applications \/ , volume 62 \/ , pages 81--90

    2016

  51. [59]

    , & author Bazant, M

    author Rycroft, C. , & author Bazant, M. ( year 2005 ). title Introduction to random walks and diffusion . journal Random Walks and Diffusion-2005 Lecture Notes, MIT \/ ,

    2005

  52. [60]

    author San-Jos \'e -Revuelta, L. M. ( year 2007 ). title A bayesian framework for the development of suboptimal blind multiuser detectors for ds/cdma signals in synchronous channels . journal Signal Processing \/ , volume 87 \/ , pages 2231--2250

    2007

  53. [61]

    author San-Jose-Revuelta, L. M. , & author Cid-Sueiro, J. ( year 2003 ). title Bayesian and rbf structures for wireless communications detection . In booktitle Neural Networks for Signal Processing. 2003 IEEE 13th Workshop on \/ (pp. pages 749--758 ). organization IEEE

    2003

  54. [62]

    , author Emary, E

    author Sharawi, M. , author Emary, E. , author Saroit, I. A. , & author El-Mahdy, H. ( year 2014 ). title Flower pollination optimization algorithm for wireless sensor network lifetime global optimization . journal International Journal of Soft Computing and Engineering \/ , v...

    2014

  55. [63]

    author Shayesteh, M. G. , author Menhaj, M. B. , & author Nobary, B. G. ( year 2003 ). title A modified genetic algorithm for multiuser detection in ds/cdma systems . journal IEICE Trans. on Communications \/ , volume 86 \/ , pages 2377--2388

    2003

  56. [64]

    , author Alam, S

    author Sohail, M. , author Alam, S. , author Hussain, A. , author Ghauri, S. A. , author Sarfraz, M. , & author Ahmed, M. ( year 2017 ). title Multiuser detection: Comparative analysis of heuristic approach . journal International Journal of Advanced and Applied Sciences \/ , ...

    2017

  57. [65]

    , author Siu, Y.-M

    author Soo, K.-K. , author Siu, Y.-M. , author Chan, W.-S. , author Yang, L. , & author Chen, R.-S. ( year 2007 ). title Particle-swarm-optimization-based multiuser detector for cdma communications . journal IEEE Trans. on Vehicular Technology \/ , volume 56 \/ , pages 3006--3013

    2007

  58. [66]

    , author Datta, T

    author Srinidhi, N. , author Datta, T. , author Chockalingam, A. , & author Rajan, B. S. ( year 2011 ). title Layered tabu search algorithm for large-mimo detection and a lower bound on ml performance . journal IEEE Trans. on Comm. \/ , volume 59 \/ , pages 2955--2963

    2011

  59. [67]

    author Tan, P. H. , & author Rasmussen, L. K. ( year 2004 ). title Multiuser detection in cdma-a comparison of relaxations, exact, and heuristic search methods . journal IEEE Trans. on Wireless Communications \/ , volume 3 \/ , pages 1802--1809

    2004

  60. [68]

    , author Chang, C.-C

    author Tan, T.-H. , author Chang, C.-C. , author Jean, F.-R. , author Chiang, J. Y. , & author Lu, Y.-C. ( year 2013 ). title Joint channel estimation and multi-user detection for ofdma systems using a genetic algorithm with simulated annealing-based mutation . In booktitle Sy...

    2013

  61. [69]

    , author Huang, Y.-F

    author Tan, T.-H. , author Huang, Y.-F. , author Hsu, L.-C. , & author Wu, C.-H. ( year 2010 a ). title Joint channel estimation and multi-user detection for mc-cdma system using genetic algorithm and simulated annealing . In booktitle Systems Man and Cybernetics, IEEE Int. Co...

    2010

  62. [70]

    , author Huang, Y.-F

    author Tan, T.-H. , author Huang, Y.-F. , & author Liu, F.-T. ( year 2010 b ). title Multi-user detection in ds-cdma systems using a genetic algorithm with redundancy saving strategy . journal Int. J. Innov. Comput. Inf. Control \/ , volume 6 \/ , pages 3347--3364

    2010

  63. [71]

    ( year 1998 )

    author Verdu, S. ( year 1998 ). title Multiuser Detection \/ . publisher Cambridge university press

    1998

  64. [72]

    ( year 2014 )

    author Wang, C. ( year 2014 ). title A completely binary and hardware-efficient pso for cdma multiuser detection . In booktitle Intelligent Human-Machine Systems and Cybernetics (IHMSC), 6th Int. Conf. on \/ (pp. pages 3--6 ). organization IEEE volume volume 1

    2014

  65. [73]

    , author Yang, L.-L

    author Xu, C. , author Yang, L.-L. , & author Hanzo, L. ( year 2007 ). title Ant-colony-based multiuser detection for mc ds-cdma systems . In booktitle Vehicular Technology Conference. 2007 IEEE 66th \/ (pp. pages 960--964 ). organization IEEE

    2007

  66. [74]

    ( year 2012 )

    author Yang, X.-S. ( year 2012 ). title Flower pollination algorithm for global optimization . In booktitle UCNC \/ (pp. pages 240--249 ). organization Springer

    2012

  67. [75]

    , & author Deb, S

    author Yang, X.-S. , & author Deb, S. ( year 2014 ). title Cuckoo search: recent advances and applications . journal Neural Computing and Applications \/ , volume 24 \/ , pages 169--174

    2014

  68. [76]

    , author Cheng, C.-H

    author Yao, Y.-C. , author Cheng, C.-H. , author Wen, G.-J. , & author Wen, J.-H. ( year 2011 ). title Multiuser detection using simulated annealing hopfield neural network for ds-uwb systems . In booktitle Machine Learning and Cybernetics (ICMLC), 2011 Int. Conf. on \/ (pp. p...

    2011

  69. [77]

    , & author Hanzo, L

    author Yen, K. , & author Hanzo, L. ( year 2000 ). title Hybrid genetic algorithm based detection schemes for synchronous cdma systems . In booktitle Vehicular Technology Conf. Proc., 2000. Tokyo. IEEE 51st \/ (pp. pages 1400--1404 ). organization IEEE volume volume 2

    2000

  70. [78]

    , & author Hanzo, L

    author Yen, K. , & author Hanzo, L. ( year 2001 ). title Genetic algorithm assisted joint multiuser symbol detection and fading channel estimation for synchronous cdma systems . journal IEEE J. on Selected Areas in Comm. \/ , volume 19 \/ , pages 985--998

    2001

  71. [79]

    , & author Hanzo, L

    author Yen, K. , & author Hanzo, L. ( year 2004 ). title Genetic-algorithm-assisted multiuser detection in asynchronous cdma communications . journal IEEE Trans. on Vehicular Technology \/ , volume 53 \/ , pages 1413--1422

    2004

  72. [80]

    , author Wang, R

    author Zhou, Y. , author Wang, R. , author Zhao, C. , author Luo, Q. , & author Metwally, M. A. ( year 2019 ). title Discrete greedy flower pollination algorithm for spherical traveling salesman problem . journal Neural Computing and Applications \/ , volume 31 \/ , pages 2155--2170

    2019

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.