The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Channel coding and decoding in a relay system operated with physical-layer network coding
Open accessAbstract
This paper investigates link-by-link channel-coded PNC (physical layer network coding), in which a critical process at the relay is to transform the superimposed channel-coded packets received from the two end nodes (plus noise), Y3= X1+ X2+W3, to the network-coded combination of the source packets, S1oplus S2. This is in contrast to the traditional multiple-access problem, in which the goal is to obtain both S1and S2explicitly at the relay node. Trying to obtain S1and S2explicitly is an overkill if we are only interested in S1oplusS2. In this paper, we refer to the transformation Y3rarr S1oplus S2as the channel-decoding- network-coding process (CNC) in that it involves both channel decoding and network coding operations. This paper shows that if we adopt the repeat accumulate (RA) channel code at the two end nodes, then there is a compatible decoder at the relay that can perform the transformation Y3rarr S1oplusS2efficiently. Specifically, we redesign the belief propagation decoding algorithm of the RA code for traditional point-to-point channel to suit the need of the PNC multiple-access channel. Simulation results show that our new scheme outperforms the previously proposed schemes significantly in terms of BER without added 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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 3×
“Parallel to the generic updating rules in [16], we also have the same message updating rules at our check nodes and variable nodes.”
MethodInfluentialLow-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
The capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
Hot topic: physical-layer network coding
Zhang, S., Liew, S. C., & Lam, P. P. (2006) · Proceedings of the 12th annual international conference on Mobile computing and networking · doi:10.1145/1161089.1161129 · Cited by 1,512
Self-citationComputation Over Multiple-Access Channels
Nazer, B., & Gastpar, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904785 · Cited by 753
Coding theorems for 'turbo-like' codes
Divsalar, D. (1998) · Medical Entomology and Zoology · Cited by 524
Joint Physical Layer Coding and Network Coding for Bidirectional Relaying
Wilson, M. P., Narayanan, K., Pfister, H. D., & Sprintson, A. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2068750 · Cited by 494
Physical Layer Network Coding Schemes over Finite and Infinite Fields
Zhang, S., Liew, S. C., & Lu, L. (2008) · Globecom · doi:10.1109/glocom.2008.ecp.726 · Cited by 143
Self-citationCapacity of Two-Way Relay Channel
Zhang, S., Liew, S. C., Wang, H., & Lin, X. (2010) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-11664-3_17 · Cited by 32
Self-citationThe Case for Structured Random Codes in Network Communication Theorems
Nazer, B., & Gastpar, M. (2007) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2007.4313084 · Cited by 28
Cited by
Physical-layer network coding: Tutorial, survey, and beyond
Liew, S. C., Zhang, S., & Lu, L. (2013) · Physical Communication · doi:10.1016/j.phycom.2012.05.002 · Cited by 329
Self-citationReliable Physical Layer Network Coding
Nazer, B., & Gastpar, M. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2094170 · Cited by 276
Metadata
- Authors
- Zhang, S.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2009-06
- Volume
- 27
- Issue
- 5
- Pages
- 788-796
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2119676644
- Cited by
- 319
- References
- 12
- FWCI
- 42.68
- 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
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.