EXIT-Chart-Aided Near-Capacity Quantum Turbo Code Design
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
High detection complexity is the main impediment in future gigabit-wireless systems. However, a quantum-based detector is capable of simultaneously detecting hundreds of user signals by virtue of its inherent parallel nature. This, in turn, requires near-capacity quantum error correction codes for protecting the constituent qubits of the quantum detector against undesirable environmental decoherence. In this quest, we appropriately adapt the conventional nonbinary EXtrinsic Information Transfer (EXIT) charts for quantum turbo codes (QTCs) by exploiting the intrinsic quantum-to-classical isomorphism. The EXIT chart analysis not only allows us to dispense with the time-consuming Monte Carlo simulations but facilitates the design of near-capacity codes without resorting to the analysis of their distance spectra as well. We have demonstrated that our EXIT chart predictions are in line with the Monte Carlo simulation results. We have also optimized the entanglement-assisted QTC using EXIT charts, which outperforms the existing distance-spectra-based QTCs. More explicitly, the performance of our optimized QTC is as close as 0.3 dB to the corresponding hashing bound.
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
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227 · cited 1×
“The constituent convolutional codes of a QTC belong to the class of stabilizer codes [19], which are analogous to classical linear block codes.”
MethodWilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
Dehaene, J., & De Moor, B. (2003) · Physical Review A · doi:10.1103/physreva.68.042318 · Cited by 183
Entanglement-Assisted Quantum Turbo Codes
Wilde, M. M., Hsieh, M.-H., & Babar, Z. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2292052 · Cited by 102
Self-citationBotsinis, P., Ng, S. X., & Hanzo, L. (2013) · IEEE Access · doi:10.1109/access.2013.2259536 · Cited by 64
Self-citation
Cited by
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Quantum 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-citationBotsinis, P., Alanis, D., Babar, Z., Ng, S. X., & Hanzo, L. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2015.2458857 · Cited by 48
“2) We use EXtrinsic Information Transfer (EXIT) [28], [29]”
MethodSelf-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-citationQuantum Turbo Decoding for Quantum Channels Exhibiting Memory
Mohd Izhar, M. A., Babar, Z., Nguyen, H. V., Botsinis, P., Alanis, D., Chandra, D., Ng, S. X., & Hanzo, L. (2018) · IEEE Access · doi:10.1109/access.2018.2808373 · Cited by 9
“Hence, QTCs with a QCC as the inner code have a bounded minimum distance and the EXIT curve for the inner decoder is only capable to reach (x, y) = (1, 1) point at very low values of p, whereas the classical recursive inner codes can reach (x, y) = (1, 1) point for any p value [12].”
BackgroundMethodInfluentialSelf-citation
Metadata
- Authors
- Babar, Z., Ng, S. X., & Hanzo, L.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2015-03
- Volume
- 64
- Issue
- 3
- Pages
- 866-875
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2007787077
- Cited by
- 51
- References
- 5
- FWCI
- 5.61
- Type
- journal article
- Language
- en
- Open access
- green
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: EXIT-Chart-Aided Near-Capacity Quantum Turbo Code Design. https://app.cochat.ai/papers/10.1109/tvt.2014.2328638
- The paper
- Babar, Z., Ng, S. X., & Hanzo, L. (2015). EXIT-Chart-Aided Near-Capacity Quantum Turbo Code Design. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/tvt.2014.2328638
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.