Pith. sign in

REVIEW 4 major objections 5 minor 64 references

Two-stage memetic algorithm for blind equalization in direct-sequence/code-division multiple-access 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 two-stage memetic algorithm solves DS/CDMA blind equalization with about 80% less computation than a standard genetic algorithm, while approaching single-user performance.

desk verdict Plausible memetic-algorithm paper whose abstract's significance and speed claims are contradicted by its own statistics; body is more honest than the abstract. read the letter →

arxiv 2412.12840 v1 pith:EVXAG2HL submitted 2024-12-17 eess.SP

Luis M. San-José-Revuelta , Pablo Casaseca-de-la-Higuera This is my paper · ORCID
classification eess.SP
keywords blindequalizationDS/CDMAmemeticalgorithmgenetick-optlocalsearchmultiuserdetectionchannelestimationnear-farresistance
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 two-stage memetic algorithm for blind joint channel estimation and symbol detection in DS/CDMA systems, where no training sequence is available. The first stage is a genetic algorithm whose mutation and crossover probabilities are adjusted online using the Shannon entropy of the population's fitness, allowing it to work with far fewer individuals; the second stage applies a k-opt local search to refine the best solution. The paper claims this receiver approaches the single-user bit-error-rate bound, supports stronger interference and near-far effects, and saves about 80% of computation relative to a standard genetic algorithm and about 15% relative to an earlier two-stage memetic algorithm, while keeping a statistically significant performance advantage. The central practical promise is that high-rate, near-optimal multiuser detection is feasible at moderate computational cost.

What carries the argument

The central object is the fitness-entropy-controlled genetic algorithm plus k-opt local search. Fitness entropy H(P[k]) = -Σ Φ*ᵢ log Φ*ᵢ measures population diversity from normalized fitness values; the algorithm raises mutation and lowers crossover when entropy is high (similar individuals) and does the reverse when entropy is low, balancing exploration and exploitation. The k-opt local search then explores the Hamming neighborhood of the best GA solution, flipping bits with the highest fitness gain, to refine the solution under the assumption that the GA has reached a near-optimum basin. The fitness function is the log-likelihood L(B(n), x(n)) = 2Re{xᵀ E [B]ᵀ z} − xᵀ E B R [B]ᵀ E x from the matched-filter output, so the same criterion guides both stages.

What would settle it

Run the proposed MA on a DS/CDMA channel with a deliberately deceptive fitness landscape, where the likelihood has a local optimum far from the global one, and check whether the k-opt refinement recovers the single-user BER bound; if it does not, the near-optimum assumption fails. A simpler check: replicate the BER comparison between the proposed MA and the MA-LV detector over many independent runs and apply the Wilcoxon test; the paper itself reports p = 0.112 for that pair, so a replication showing a p-value below 0.05 is required to support the claimed statistically significant higher performance.

Watch

Extended reading notes

Core claim

The paper's central claim is that a two-stage memetic algorithm—a genetic algorithm with fitness-entropy-based diversity control followed by a k-opt local-search refinement—can solve the DS/CDMA blind equalization problem (jointly estimating fading coefficients and transmitted symbols from the matched-filter bank output) with performance close to the single-user bound and with substantially lower computation than existing heuristic detectors. Concretely, the proposed MA is reported to save about 80% of computation time versus a standard genetic algorithm and about 15% versus a comparable two-stage memetic algorithm (MA-LV), while achieving better or equal bit-error rates, a near-far resistance up to roughly 10 dB power disparity, and a complexity that grows by a factor of about 5 when the number of active users doubles, versus a factor of 32 for the maximum-likelihood detector.

Load-bearing premise

The whole algorithm works only if the genetic algorithm's final population has actually reached the neighbourhood of the global optimum; the paper provides no proof that the entropy-controlled GA converges, so a deceptive fitness landscape or a poor initial population would leave the k-opt stage refining a wrong solution.

Editorial extensions

If this is right

  • The proposed receiver can support higher transmission rates over existing channels because it requires no training sequences and approaches the single-user BER bound.
  • Computation scales as roughly a factor of 5 when the number of active users doubles, versus a factor of 32 for the optimal maximum-likelihood detector, making the MA more practical for larger user counts.
  • The MA is near-far resistant: performance holds up to about 10 dB power disparity between the user of interest and interferers, where a decorrelator degrades noticeably.
  • The MA achieves accurate channel response estimates in about 20–30 symbol periods, faster than MAP-based Bayesian approaches that need 45–60 samples and a training period.
  • The fitness-entropy diversity control lets the GA operate with fewer individuals (60 vs 300) and fewer generations, which is the main source of the reported computation savings.

Reading between the lines

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

  • The fitness-entropy diversity control is a separable idea that could be dropped into other evolutionary multiuser detectors or combinatorial optimizers; the paper does not test it in isolation, so its marginal contribution is unquantified.
  • The paper's own Wilcoxon test between the proposed MA and MA-LV yields p = 0.112, so the practical advantage over that baseline is most plausibly the computation saving, not the BER; the 'statistically significant' wording in the abstract overstates what the reported numbers support.
  • Because a GA runs afresh each symbol period, a natural extension is to warm-start the population from the previous symbol's final individuals (the paper already initializes fading estimates this way) or to process blocks of symbols to amortize the search cost.
  • The near-far resistance up to about 10 dB suggests testing the MA in modern non-orthogonal multiple-access or IoT-style overloaded CDMA scenarios, where power disparities are common and training overhead is undesirable.
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 two-stage memetic algorithm (MA) for blind joint channel estimation and symbol detection in synchronous DS/CDMA systems. Stage 1 is a genetic algorithm whose mutation and crossover probabilities are adapted using the Shannon entropy of normalized population fitness, with elitism and a low crossover probability; stage 2 is a k-opt local search that refines the best stage-1 solution. The fitness function is the log-likelihood in Eq. (7), taken from prior work. The authors evaluate BER versus SNR, BER versus number of users, channel estimation accuracy, near-far resistance, and computational load, comparing against standard GA, GA-SJ, MA-LV, GA-MSD, MF, MMSE, and decorrelator detectors, and they report Friedman and Wilcoxon tests.

Significance. If the claimed results were fully supported, this would be a useful contribution: the likelihood-based formulation is standard and correctly attributed, the entropy-controlled diversity mechanism is an interesting idea for reducing population size, and the complexity scaling of about 5x for doubled user count versus 32x for ML is practically relevant. The experimental comparison attempts to control computational load across algorithms. However, the paper's central empirical claim of statistically significant superiority over the closest two-stage baseline, MA-LV, is contradicted by its own Wilcoxon test (p = 0.112), and the claimed computational savings with respect to a similar two-stage algorithm are not measured. These issues are load-bearing and must be resolved before the contribution can be accepted.

major comments (4)
  1. [Section 5.2 / Abstract] The abstract states that the proposed MA 'keeps a statistically significant higher performance,' but the paper's own Wilcoxon test between MA and MA-LV gives p = 0.112, and the text explicitly says 'MA is not significantly better than MA-LV.' The Friedman test (p = 0.0015) is an omnibus test over three algorithms and does not establish pairwise superiority of MA over MA-LV. Please either remove or substantially qualify the significance claim, or provide a proper pairwise test with corrections that actually supports it.
  2. [Section 5.1 / Abstract] The abstract claims 'about 15% with respect to a similar two-stage memetic algorithm,' but Section 5.1 reports time reductions only with respect to Std-GA (approximately 77%) and GA-SJ (approximately 20%). No measured runtime comparison against MA-LV is given. Table 2 reports population sizes and generations, but not wall-clock time or fitness evaluations for MA-LV, so the 15% figure is unsupported. Please provide a direct measured comparison and correct the abstract accordingly.
  3. [Section 4.1.5, Eqs. (12)-(13)] The diversity control mechanism is based on the claim that 'when entropy H is high, it means that population individuals are very similar.' However, H is computed from normalized fitness values, so high entropy corresponds to equal fitness values, not genotypically or phenotypically similar individuals. Distinct solutions can have identical fitness, and similar solutions can have very different fitness values. This interpretation is load-bearing because the algorithm adjusts mutation and crossover probabilities based on this entropy. The paper provides no analysis linking fitness entropy to actual population diversity, and the direction of the effect is not justified.
  4. [Section 4.2] The k-opt local search is run 'assuming that the first stage (GA) has reached a near-optimum solution estimate.' No formal convergence guarantee or empirical diagnostics are provided for the GA with fitness-entropy control, so it is plausible that in some regimes the local search only refines a suboptimal candidate. Since the claimed advantages over GA-SJ and MA-LV depend on the quality of the stage-1 output, please provide convergence evidence, such as success-rate curves or the distribution of stage-1-to-stage-2 improvements across the tested scenarios.
minor comments (5)
  1. [Section 5.2] The text says the Wilcoxon test shows a significant improvement of MA over Std-GA 'at the 0.1 level of significance' (p = 0.0398), but 0.0398 is below 0.05; the phrasing is unnecessarily weak and should be corrected.
  2. [Table 1 / Section 5.1] The text refers to 'three two-stage nature-inspired methods' but Table 1 includes Std-GA, which is a one-stage method. Please reconcile the labeling or the test description.
  3. [Section 4.2, Eq. (14)] The neighborhood size formula |NH_{k-opt}(CHR_i)| = sum_{i=0}^k C(k,i) is incorrect for a chromosome of length K; the number of binary vectors at Hamming distance at most k from a given vector is sum_{j=0}^k C(K,j), not sum_{i=0}^k C(k,i). Please correct this expression.
  4. [Throughout] There are typographical and formatting artifacts, such as 'V enkatesk' instead of 'Venkatesh' and the repeated 'i /nequalj' fragments, that should be cleaned up.
  5. [Eq. (9)] The index i is used both for the population individual and for the user, which makes the notation in Eq. (9) confusing. Please use distinct indices.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation: evaluation uses external BER/near-far benchmarks; abstract's 'statistically significant' claim is contradicted by the paper's own Wilcoxon p=0.112, but that is an overclaim, not circularity.

full rationale

The paper's derivation chain is: DS/CDMA observation model (Eqs. 1-6) -> log-likelihood fitness in Eq. (7) taken from Fawer & Aazhang [58] -> GA maximizing Eq. (7) (Eqs. 9-13) -> k-opt local refinement (Eq. 14) -> Monte-Carlo BER/near-far comparisons. No fitted parameter is renamed as a prediction, and no definitional identity equates an output with an input. The self-citations ([29] GA-SJ comparator, [45] entropy-guided micro-GA background) describe prior, externally published algorithms; they are not used as a uniqueness theorem or as the sole justification for the central claim, and the entropy-based diversity control is presented and implemented in the present paper as a heuristic design choice rather than derived from those citations. The paper's own significance analysis actually undercuts the abstract: Section 5.2 reports a Wilcoxon p=0.112 and states 'showing that MA is not significantly better than MA-LV', which is a statistical overclaim/correctness risk, not a circular step. Likewise Section 4.2's assumption that the GA 'has reached a near-optimum solution estimate' is an unproved heuristic premise, but it is not a circular input. Thus the derivation is self-contained; the appropriate finding is no significant circularity.

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

The paper's central claims rest on standard DS/CDMA channel assumptions and the likelihood objective from prior literature. The algorithm introduces several hand-tuned parameters (mutation and crossover probabilities, population size, generation count) that are adjusted to achieve good performance. No new physical entities or exotic constructs are introduced. The most significant assumption is that the genetic stage reliably reaches a near-optimum region before local search begins, which is not formally proven.

free parameters (6)
  • Initial mutation probability Pm(0) = 0.02-0.05
    Section 4.1.3 sets Pm(0) in [0.02, 0.05] based on a reference, then adjusts it online with the fitness entropy. This is a hand-chosen tuning parameter.
  • Crossover probability Pc = 0.01
    Section 4.1.4 fixes Pc = 0.01 with the justification that it should be low; no data-driven selection is reported.
  • Elite mutation probability Pm,e = 0.2 * Pm
    Section 4.1.4 scales the elite mutation probability as a fraction of the main mutation probability, an arbitrary heuristic.
  • Population size np = 60, 150, 400 for U = 10, 15, 20
    Table 2 lists population sizes chosen to achieve good performance; baselines are then adjusted to match, indicating these values are tuned to the target outcome.
  • Number of generations ng = 250, 300, 400 for U = 10, 15, 20
    Table 2 lists generation counts chosen alongside population size; these are tuned to balance performance and computation.
  • Mutation standard deviation sigma = not specified
    Section 4.1.3 introduces sigma in the mutation operator but never gives a numerical value, which is needed for exact replication.
assumptions (4)
  • domain assumption Synchronous transmission, flat Rayleigh fading, AWGN, and BPSK modulation are sufficient models for the DS/CDMA channel.
    Section 3.1 states these assumptions for simplicity; asynchronous or frequency-selective channels are not analyzed, limiting the scope of the claims.
  • standard math The log-likelihood function in Eq. (7) is the correct objective for joint channel and symbol estimation.
    This is taken directly from Fawer and Aazhang [58]; the paper relies on this derivation without reproducing or questioning it.
  • domain assumption Fading coefficients are constant within a symbol interval and independent across users.
    Section 3.1 states this; it is required for the symbol-by-symbol GA formulation to be valid.
  • ad hoc to paper The GA with fitness-entropy control and the k-opt local search reliably reaches a near-optimum solution.
    Section 4.2 explicitly assumes the GA output is near-optimum; no convergence proof or formal analysis is provided, so the algorithm's success rests on this heuristic.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Two-stage memetic algorithm for blind equalization in direct-sequence/code-division multiple-access Systems." pith.science (2026). https://pith.science/paper/EVXAG2HL

@misc{pith2026241212840,
  author       = {Pith},
  title        = {Pith review of: Two-stage memetic algorithm for blind equalization in direct-sequence/code-division multiple-access Systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/EVXAG2HL}},
  note         = {Machine review of arXiv:2412.12840}
}
read the original abstract

This paper proposes a novel memetic algorithm (MA) for the blind equalization of digital multiuser channels with Direct-Sequence / Code-Division Multiple-Access (DS/CDMA) sharing scheme. Equalization involves two different tasks, the estimation of: (1) channel response and (2) transmitted data. The corresponding channel model is first analyzed and then the MA is developed for this specific communication system. Convergence, population diversity and near-far resistance have been analyzed. Numerical experiments include comparative results with traditional multiuser detectors as well as with other nature-inspired approaches. Proposed receiver is proved to allow higher transmission rates over existing channels, while supporting stronger interferences as well as fading and time-variant effects. Required computation requisites are kept moderate in most cases. Proposed MA saves approximately 80% of computation time with respect to a standard genetic algorithm and about 15% with respect to a similar two-stage memetic algorithm, while keeping a statistically significant higher performance. Besides, complexity increases only by a factor of 5, when the number of active users doubles, instead of 32x found for the optimum maximum likelihood algorithm. The proposed method also exhibits high near-far resistance and achieves accurate channel response estimates, becoming an interesting and viable alternative to so far proposed methods.

Figures

Figures reproduced from arXiv: 2412.12840 by the authors.

Figure 1
Figure 1. The first block in the proposed receiver consists of a s [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Simplified flowchart of the proposed GA constitutin [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 3
Figure 3. Estimation of the Bit Error Rate performance for di [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Estimates of the Bit Error Rate depending on the num [PITH_FULL_IMAGE:figures/full_fig_p013_4.png]
Figure 5
Figure 5. Figure 5: Average MSE of the channel estimate over the first 10 [PITH_FULL_IMAGE:figures/full_fig_p015_5.png]
Figure 6
Figure 6. Figure 6: BER performance for K = 10 users with Ek /E1 = 0, 5, 10 and 15 dB for k = 2, . . . , U. User 1: user of interest. even some Bayesian approaches, as well. Proposed MA is an efficient alternative when approaching this complex optimization problem, offering a remarkable p…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

64 extracted references · 64 canonical work pages

  1. [1]

    Proakis, J.G.: ‘Digital Communications‘. 4th. edition (McGraw-Hill Companies, Inc., New York, NY , 1998)

    work page 1998

  2. [2]

    (Cambridge University Press, 1998)

    V erd ´ u, S.:‘Multiuser Detection‘. (Cambridge University Press, 1998)

    work page 1998

  3. [3]

    Hoshyar, R., W athan, F.P ., Tafazolli, R., ‘Novel low-de nsity signature for synchronous CDMA systems over AWGN channel‘, IEEE T rans Sig Proc, 2008 56, (4), pp: 1616–1626 16

    work page 2008

  4. [4]

    Cai, Y ., Qin, Z., Cui, F., Li, G.Y ., McCann, J.A.: ‘Modula tion and multiple access for 5G networks‘, IEEE Commun Surv T ut, 2018, 20, (1), pp. 629–646

    work page 2018

  5. [5]

    Kumar, T.D., V enkatesan, P .: ‘Performance estimation of multicarrier CDMA using adaptive brain storm optimization for 5G communication system in frequency sele ctive fading channel‘, T rans Emerg T elecomm T echnol, 2020, 31, (4), pp. e3829

    work page 2020

  6. [6]

    (VTC-Fall), 01, 2018

    W ang, C., Wu, Y ., Chen, Y ., Bayesteh, A., ‘Sparse code mul tiple access for 5G radio transmission‘, In: 2017 IEEE 86th V ehicular Technology Conf. (VTC-Fall), 01, 2018

    work page 2017

  7. [7]

    Zhang, L.: ‘Sparse code multiple access for downlink mul tiple access of 5G wireless networks‘, Comput Commun, 2020, 158, pp. 17 – 23

    work page 2020

  8. [8]

    Qualcomm, ‘Future of 5G building a unified, more capable 5 G air interface for the next decade and beyond‘, 2020, Available from: https://www.qualcomm.com/media/documents/files/ making-5g-nr-a-commercial-reality.pdf, last accessed: 18 May 2020

    work page 2020

Show all 64 references
  1. [9]

    3GPP , ‘Future of 5G Building a unified, more capable 5G air interface for the next decade and beyond‘, 2020, Available from: https://www.3gpp.org/release-16, last accessed: 18 May 2020

    2020

  2. [10]

    ‘Challenge s and features of IoT communications in 5G net- works‘

    Yassein, M.B., Aljawarneh, S., Al-Sadi, A. ‘Challenge s and features of IoT communications in 5G net- works‘. In: 2017 Int. Conf. on Electrical and Computing Tech nologies and Applications (ICECTA), 2017, pp. 1—5

    2017

  3. [11]

    ‘Realization of CDMA-based IoT services with shared band operation of LTE in 5G‘

    Sagari, S.S., Mathur, S., Saha, D., Amin, S.O., Ravindr an, R., Seskar, I., et al. ‘Realization of CDMA-based IoT services with shared band operation of LTE in 5G‘. In: Pro c. W orkshop on Mobile Edge Communi- cations. MECOMM ’17. (New York, NY , USA: Association for Computing...

    2017

  4. [12]

    4583-–4589

    Hu, S., Guo, H., Jin, C., Huang, Y ., Yu, B., Li, S.: ‘Frequ ency-domain oversampling for cognitive CDMA systems: Enabling robust and massive multiple access for in ternet of things‘, IEEE Access , 2016, 4, pp. 4583-–4589

    2016

  5. [13]

    In: 2019 IEEE Int

    Liu, L., Ren, H., Zhai, P ., Niu, J., Zhao, H., Mao, J., ‘Ch aotic composite spread spectrum sequence based PAPR suppression for underwater acoustic MC-CDMA communication system‘. In: 2019 IEEE Int. Conf. Signal Processing, Communications and Computing (ICSPCC) , 2019. pp. 1-–5

    2019

  6. [14]

    Kim, K.Y ., Kim, M.S., Ko, H.L., Im, T.H.: ‘Performance a nalysis of OFDM and CDMA communication methods in underwater acoustic channel‘, J Acoust Soc Korea , 2019, 38, (1), pp. 30–38

    2019

  7. [15]

    Rahmati, M., Petroccia, R., Pompili, D.: ‘In-network c ollaboration for CDMA-based reliable underwater acoustic communications‘, IEEE J Ocean Eng , 2019, 44, (4), pp. 881–894

    2019

  8. [16]

    Petrosky , E.E., Michaels, A.J., Ernst, J.M.: ‘A low pow er IoT medium access control for receiver-assigned CDMA‘, Int J Inter T elecomm Net, 2019, 11, (2), pp. 24-–41

    2019

  9. [17]

    38941–38949

    Ji, J., Zheng, Z., Peng, F., Zhang, J., Wu, B., Xu, M., et a l.: ‘10Gb/s two-user spatial diversity FSO- CDMA wiretap channel based on reconfigurable optical encode r/decoders‘, IEEE Access , 2020, 8, pp. 38941–38949

    2020

  10. [18]

    Chang, C., Yang, G., Glesk, I., Kwong, W .C.: ‘On the perf ormance of the effects of temperature variation in ultrafast incoherent fiber-optic CDMA systems with SOA-b ased tunable dispersion compensator‘, IEEE Photon J, 2019, 11, (3), pp. 1—10

    2019

  11. [19]

    Papathanassiou, A., Salkintzis, A.K., Mathiopoulos, P .T.: ‘A comparison study of the uplink performance of W-CDMA and OFDM for mobile multimedia communications via LEO satellites‘, IEEE Pers Commun, 2001, 8, (3), pp. 35-–43

    2001

  12. [20]

    Divya, P ., Madhavi, K., Priyanka, J.: ‘Performance com parison of FH-CDMA scheme using chaotic se- quences over fading channels‘, IOSR J Electr Commun Eng ), 2018, 13, (5), pp. 63—70

    2018

  13. [21]

    ‘Role of chaos in spread s pectrum communication‘

    Kumar, D., Kumar, D., Kalra, D. ‘Role of chaos in spread s pectrum communication‘. In: Int. Conf. Intel- ligent Computing and Smart Communication 2019. (Springer, 2020. pp. 1293-–1310

    2019

  14. [22]

    2621—2648

    Kaddoum, G.: ‘Wireless chaos-based communication sys tems: A comprehensive survey‘, IEEE Access , 2016, 4, pp. 2621—2648

    2016

  15. [23]

    Tutueva, A.V ., Nepomuceno, E.G., Karimov , A.I., Andre ev , V .S., Butusov , D.N.: ‘Adaptive chaotic maps and their application to pseudo-random numbers generation ‘, Chaos Soliton Fract , 2020, 133, pp. 109615

    2020

  16. [24]

    Yao, J.L., Sun, Y .Z., Ren, H.P ., Grebogi, C.: ‘Experime ntal wireless communication using chaotic base- band waveform‘, IEEE T rans Veh T echnol, 2018, 68, (1), pp. 578—591

    2018

  17. [25]

    1024—1031

    Rahnama, N., Talebi, S.: ‘Performance comparison of ch aotic spreading sequences generated by two dif- ferent classes of chaotic systems in a chaos-based direct se quence-code division multiple access system‘, IET Commun, 2013, 7, (10), pp. 1024—1031

    2013

  18. [26]

    Mehrizi, S., Mahboobi, B.: ‘Cooperative MIMO relay bea mforming in over-loaded DS/CDMA multicast networks‘, IET Commun, 2017, 11, (3), pp. 344—354

    2017

  19. [27]

    556-–561

    Lain, J.K., Lai, J.J.: ‘Ant colony optimisation-based multiuser detection for direct-sequence CDMA sys- tems with diversity reception‘, IET Commun, 2007, 1, (4), pp. 556-–561

    2007

  20. [28]

    Khan, M.A., Umair, M., Choudhry , M.A.S.: ‘GA based adap tive receiver for MC-CDMA system‘, T urk J 17 Electr Eng Comput Sci , 2015, 23, (Sup. 1), pp. 2267—2277

    2015

  21. [29]

    San-Jos´ e-Revuelta, L.M., Arribas, J.I.: ‘Three natu ral computation methods for joint channel estimation and symbol detection in multiuser communications‘, Appl Soft Comput, 2016, 49, pp. 561—569

    2016

  22. [30]

    Iqbal, K., Khan, M.A., Abbas, S., Hasan, Z.: ‘Time compl exity analysis of GA-based variants uplink MC-CDMA system‘, SN Appl Sci, 2019, 1, (9), pp. 953

    2019

  23. [31]

    ‘Analysis of space and time complexity with PSO based synchronous MC-CDMA system‘

    Asif, M., Khan, M.A., Abbas, S., Saleem, M. ‘Analysis of space and time complexity with PSO based synchronous MC-CDMA system‘. In: 2019 2nd Int. Conf. Comput ing, Mathematics and Engineering Technologies (iCoMET), 2019. pp. 1-–5

    2019

  24. [32]

    1031—1039

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

    2017

  25. [33]

    In: Spread Spectrum Techniques and Applications, 8th Int

    Lim, H.S., V enkatesh, B.: ‘An effective memetic algori thm for the optimum multiuser detection problem‘. In: Spread Spectrum Techniques and Applications, 8th Int. S ymp. on. (IEEE), 2004, pp. 885-–889

    2004

  26. [34]

    Handbook of Heuristics, 2018, 1-2, pp

    Cotta, C., Mathieson, L., Moscato, P .: ‘Memetic algori thms‘. Handbook of Heuristics, 2018, 1-2, pp. 607– 638

    2018

  27. [35]

    Kernighan, B.W ., Lin, S.: ‘An efficient heuristic proce dure for partitioning graphs‘, Bell Syst T ech J, 1970, 49, (2), pp. 291—307

    1970

  28. [36]

    Lin, S., Kernighan, B.W .: ‘An effective heuristic algo rithm for the traveling salesman problem‘, Oper Res, 1973, 21, (2), pp. 498—516

    1973

  29. [37]

    In: Information theory

    Juntti, M., Schlosser, T., Lilleberg, J.: ‘Genetic alg orithms for multiuser detection in synchronous CDMA‘. In: Information theory . 1997. Proc. 1997 IEEE Int. Symp. (IE EE), 1997. p. 492

    1997

  30. [38]

    1413-–1422

    Yen, K., Hanzo, L.: ‘Genetic-algorithm-assisted mult iuser detection in asynchronous CDMA communi- cations‘, IEEE T rans Veh T echnol, 2004, 53, (5), pp. 1413-–1422

    2004

  31. [39]

    In: V ehicular Technology Conf

    Yen, K., Hanzo, L.: ‘Hybrid genetic algorithm based det ection schemes for synchronous CDMA systems‘. In: V ehicular Technology Conf. Proc., 2000. VTC 2000-Spring Tokyo. 2000. IEEE 51st. vol. 2. (IEEE), 2000. pp. 1400—1404

    2000

  32. [40]

    1374—1383

    Ergun, C., Hacioglu, K.: ‘Multiuser detection using a g enetic algorithm in CDMA communications sys- tems‘, IEEE T rans Commun, 2000, 48, (8), pp. 1374—1383

    2000

  33. [41]

    In: Systems Man and Cybernetics (SMC), 2010 IEEE Int

    Tan, T.H., Huang, Y .F., Hsu, L.C., Wu, C.H.: ‘Joint chan nel estimation and multiuser detection for MC- CDMA system using genetic algorithm and simmulated anneali ng‘. In: Systems Man and Cybernetics (SMC), 2010 IEEE Int. Conf. (IEEE), 2010. pp. 249—256

    2010

  34. [42]

    Maradia, K.G., Joshi, S., Patel, J.S.: ‘Genetic algori thm for CDMA-based MUD techniques under Rayleigh fading environment‘, IUP J T elecomm, 2009, I, (2), pp. 7-–23

    2009

  35. [43]

    In: Machine Learning and Cyberneti cs (ICMLC), 2013 Int

    Rashid, A., Khan, F.M., Qureshi, I.M.: ‘Genetic algori thm based multiuser detection in DS-CDMA: A comparative analysis‘. In: Machine Learning and Cyberneti cs (ICMLC), 2013 Int. Conf. vol. 2. (IEEE),

    2013

  36. [44]

    Guntu Nooka, R., Rao, B.P .: ‘Adaptive genetic algorith m assisted multiuser detection of FD-MC-CDMA in frequency selective fading channels‘, Comput Sci T elecomm, 2013, 39, (3), pp. 30–39

    2013

  37. [45]

    1572-–1587

    San-Jos´ e-Revuelta, L.M.: ‘Entropy-guided micro-ge netic algorithm for multiuser detection in CDMA communications‘, Sig Proc, 2005, 85, (8), pp. 1572-–1587

    2005

  38. [46]

    In: V ehicular Technology Conf., 2004

    Hijazi, S.L., Natarajan, B.: ‘Novel low-complexity DS -CDMA multiuser detector based on ant colony optimization‘. In: V ehicular Technology Conf., 2004. VTC2 004-Fall. 2004 IEEE 60th. vol. 3. (IEEE), 2004. pp. 1939—1943

    2004

  39. [47]

    12876—12884

    Marinello Filho, J.C., De Souza, R.N., Abrao, T.: ‘Ant c olony input parameters optimization for multiuser detection in DS/CDMA systems‘, Expert Syst Appl, 2012, 39, (17), pp. 12876—12884

    2012

  40. [48]

    In: V ehicular Technology Conference, 2007

    Xu, C., Yang, L.L., Hanzo, L.: ‘Ant-colony-based multi user detection for MC DS-CDMA systems‘. In: V ehicular Technology Conference, 2007. VTC-2007 Fall. 2007 IEEE 66th. (IEEE), 2007. pp. 960—964

    2007

  41. [49]

    In: Electr ical Engineering (ICEE), 2013 21st Iranian Conf

    Arani, A.H.J., Azmi, P .: ‘Joint multiuser and intersym bol interference suppression in CDMA systems using particle swarm optimization algorithms‘. In: Electr ical Engineering (ICEE), 2013 21st Iranian Conf. (IEEE), 2013. pp. 1-–6

    2013

  42. [50]

    In: Spread Spectrum Techniques and Applications, 2006 IEEE 9th Int

    De Oliveira, L.D., Ciriaco, F., Abrao, T., Jeszensky , P .J.E.: ‘Particle swarm and quantum particle swarm optimization applied to DS/CDMA multiuser detection in flat rayleigh channels‘. In: Spread Spectrum Techniques and Applications, 2006 IEEE 9th Int. Symp. (IEEE ), 2006. pp...

    2006

  43. [51]

    3006—3013

    Soo, K.K., Siu, Y .M., Chan, W .S., Yang, L., Chen, R.S.: ‘ Particle-swarm-optimization-based multiuser detector for CDMA communications‘, IEEE trans Veh T echnol, 2007, 56, (5), pp. 3006—3013

    2007

  44. [52]

    In: Intel- ligent Human-Machine Systems and Cybernetics (IHMSC), 201 4 6th Int

    W ang, C.: ‘A completely binary and hardware-efficient P SO for CDMA multiuser detection‘. In: Intel- ligent Human-Machine Systems and Cybernetics (IHMSC), 201 4 6th Int. Conf. vol. 1. (IEEE), 2014. pp. 3—6

    2014

  45. [53]

    Kaur, A.: ‘Comparison analysis of CDMA multiuser detec tion using PSO and SMO‘, Int J Comput Appl , 18 2016, 133, (2), pp. 47—50

    2016

  46. [54]

    In: Proc

    Lu, Z.S., Yan, S.: ‘Multiuser detector based on particl e swarm algorithm‘. In: Proc. IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No. 04EX710). vol. 2. (IEEE), 2004. pp. 783—786

    2004

  47. [55]

    In: Multimedia Computing and Systems (ICMCS), 2014 I nt

    Larbi, N., Debbat, F., Stambouli, A.B.: ‘A review of heu ristic near-optimum MUD for MC-CDMA sys- tems‘. In: Multimedia Computing and Systems (ICMCS), 2014 I nt. Conf. (IEEE), 2014. pp. 1484-–1489

    2014

  48. [56]

    1930—1942

    De Lamare, R.C.: ‘Joint iterative power allocation and linear interference suppression algorithms for cooperative DS-CDMA networks‘, IET Commun, 2012, 6, (13), pp. 1930—1942

    2012

  49. [57]

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

    2001

  50. [58]

    1556—1565

    Fawer, U., Aazhang, B.: ‘A multiuser receiver for code d ivision multiple access communications over multipath channels‘, IEEE T rans Commun, 1995, 43, (234), pp. 1556—1565

    1995

  51. [59]

    Mitchell, M.: ‘An introduction to genetic algorithms‘ , (MIT Press, 1998)

    1998

  52. [60]

    Lai, W .K., Coghill, G.G.: ‘Channel assignment through evolutionary optimization‘, IEEE T rans Veh T ech- nol, 1996, 45, (1), pp. 91-–96

    1996

  53. [61]

    Ursem, R.K.: ‘Diversity-guided evolutionary algorit hms‘. In: Int. Conf. Parallel Problem Solving from Nature. (Springer), 2002. pp. 462—471

    2002

  54. [62]

    Friedman, M.: ‘A comparison of alternative tests of sig nificance for the problem of m rankings‘, Ann Math Stat., 1940, 11, (1), pp. 86-–92

    1940

  55. [63]

    Derrac, J., Garc´ ıa, S., Molina, D., Herrera, F.: ‘A pra ctical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms‘, Swarm Evol Comput, 2011, 1, (1), pp. 3—18

    2011

  56. [64]

    1724-–1734 19

    Huang, Y ., Djuric, P .M.: ‘Multiuser detection of synch ronous code-division multiple-access signals by perfect sampling‘, IEEE T rans Sig Proc, 2002, 50, (7), pp. 1724-–1734 19

    2002

Pith tools

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