The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Algorithms for iterative decoding in the presence of strong phase noise
Abstract
We present two new iterative decoding algorithms for channels affected by strong phase noise and compare them with the best existing algorithms proposed in the literature. The proposed algorithms are obtained as an application of the sum-product algorithm to the factor graph representing the joint a posteriori probability mass function of the information bits given the channel output. In order to overcome the problems due to the presence in the factor graph of continuous random variables, we apply the method of canonical distributions . Several choices of canonical distributions have been considered in the literature. Well-known approaches consist of discretizing continuous variables or treating them as jointly Gaussian, thus obtaining a Kalman estimator. Our first new approach, based on the Fourier series expansion of the phase probability density function, yields better complexity/performance tradeoff with respect to the usual discretized-phase method. Our second new approach, based on the Tikhonov canonical distribution, yields near-optimal performance at very low complexity and is shown to be much more robust than the Kalman method to the placement of pilot symbols in the coded frame. We present numerical results for binary LDPC codes and LDPC-coded modulation, with particular reference to some phase-noise models and coded-modulation formats standardized in the next-generation satellite Digital Video Broadcasting (DVB-S2). These results show that our algorithms achieve near-coherent performance at very low complexity without requiring any change to the existing DVB-S2 standard.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1972) · Cited by 17,806
Discrete-Time Signal Processing
Oppenheim, A. V., & Schafer, R. W. (1989) · Cited by 11,775
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 2×
“THE FACTOR GRAPH (FG) representation and the sumproduct algorithm (SPA) provide a general and powerful framework to derive low-complexity Bayesian detection and decoding algorithms [1].”
MethodUnified design of iterative receivers using factor graphs
Worthen, A. P., & Stark, W. E. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910595 · Cited by 232
Chen, R.-R., Koetter, R., Madhow, U., & Agrawal, D. (2003) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.818087 · Cited by 107
Phase estimation by message passing
Dauwels, J., & Loeliger, H. (2004) · International Conference on Communications · doi:10.1109/icc.2004.1312544 · Cited by 96
Pilot-symbol-assisted coded transmission over the block-noncoherent awgn channel
Nuriyev, R., & Anastasopoulos, A. (2003) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.813258 · Cited by 51
Joint decoding and phase estimation: an exercise in factor graphs
Dauwels, J., & Loeliger, H. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2003.1228245 · Cited by 37
Cited by
The Factor Graph Approach to Model-Based Signal Processing
Loeliger, H.-A., Dauwels, J., Hu, J., Korl, S., Ping, L., & Kschischang, F. R. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.896497 · Cited by 526
Liu, Y., Tan, Z., Hu, H., Cimini, L. J., & Li, G. Y. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2320074 · Cited by 394
Metadata
- Authors
- Colavolpe, G., Barbieri, A., & Caire, G.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2005-09
- Volume
- 23
- Issue
- 9
- Pages
- 1748-1757
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2129362928
- Cited by
- 272
- References
- 9
- FWCI
- 20.45
- 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: Algorithms for iterative decoding in the presence of strong phase noise. https://app.cochat.ai/papers/10.1109/jsac.2005.853813
- The paper
- Colavolpe, G., Barbieri, A., & Caire, G. (2005). Algorithms for iterative decoding in the presence of strong phase noise. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2005.853813
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.