Evolutionary-Algorithm-Assisted Joint Channel Estimation and Turbo Multiuser Detection/Decoding for OFDM/SDMA
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
The development of evolutionary algorithms (EAs), such as genetic algorithms (GAs), repeated weighted boosting search (RWBS), particle swarm optimization (PSO), and differential evolution algorithms (DEAs), have stimulated wide interests in the communication research community. However, the quantitative performance-versus-complexity comparison of GA, RWBS, PSO, and DEA techniques applied to the joint channel estimation (CE) and turbo multiuser detection (MUD)/decoding in the context of orthogonal frequency-division multiplexing/space-division multiple-access systems is a challenging problem, which has to consider both the CE problem formulated over a continuous search space and the MUD optimization problem defined over a discrete search space. We investigate the capability of the GA, RWBS, PSO, and DEA to achieve optimal solutions at an affordable complexity in this challenging application. Our study demonstrates that the EA-assisted joint CE and turbo MUD/decoder is capable of approaching both the Cramér-Rao lower bound of the optimal CE and the bit error ratio (BER) performance of the idealized optimal maximum-likelihood (ML) turbo MUD/decoder associated with perfect channel state information, respectively, despite imposing only a fraction of the idealized turbo ML-MUD/decoder's complexity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
A discrete binary version of the particle swarm algorithm
Kennedy, J., & Eberhart, R. C. (2002) · 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation · doi:10.1109/icsmc.1997.637339 · Cited by 4,767
OFDM and MC‐CDMA for Broadband Multi‐User Communications, WLANs and Broadcasting
Hanzo, L., Münster, M., Choi, B. J., & Keller, T. (2003) · Wiley eBooks · doi:10.1002/9780470861813 · Cited by 1,095
Self-citationZhang, J., Chen, S., Mu, X., & Hanzo, L. (2011) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2011.2161356 · Cited by 38
Self-citation
Cited by
Power-Domain Non-Orthogonal Multiple Access (NOMA) in 5G Systems: Potentials and Challenges
Islam, S. M. R., Avazov, N., Dobre, O. A., & Kwak, K.-S. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2621116 · Cited by 2,458
“I. INTRODUCTION From analog phone calls through to all Internet Protocol services, including voice and messaging, each transition has been encouraged by the need to meet the requirements of the new generation of mobile technology.”
BackgroundA Survey of Non-Orthogonal Multiple Access for 5G
Dai, L., Wang, B., Ding, Z., Wang, Z., Chen, S., & Hanzo, L. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2835558 · Cited by 1,327
Self-citationQuantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149
Self-citationJoint Quantum-Assisted Channel Estimation and Data Detection
Botsinis, P., Alanis, D., Babar, Z., Ng, S. X., & Hanzo, L. (2016) · IEEE Access · doi:10.1109/access.2016.2591903 · Cited by 29
Self-citation
Metadata
- Authors
- Zhang, J., Chen, S., Mu, X., & Hanzo, L.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2014-03
- Volume
- 63
- Issue
- 3
- Pages
- 1204-1222
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2091815971
- Cited by
- 52
- References
- 4
- FWCI
- 2.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Evolutionary-Algorithm-Assisted Joint Channel Estimation and Turbo Multiuser Detection/Decoding for OFDM/SDMA. https://app.cochat.ai/papers/10.1109/tvt.2013.2283069
- The paper
- Zhang, J., Chen, S., Mu, X., & Hanzo, L. (2014). Evolutionary-Algorithm-Assisted Joint Channel Estimation and Turbo Multiuser Detection/Decoding for OFDM/SDMA. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/tvt.2013.2283069
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.