The DOI matches its Crossref record.
Iterative Receiver Design
Abstract
Iterative processing is an important technique with numerous applications. Exploiting the power of factor graphs, this detailed survey provides a general framework for systematically developing iterative algorithms for digital receivers, and highlights connections between important algorithms. Starting with basic concepts in digital communications, progressively more complex ideas are presented and integrated resulting in the development of cutting-edge algorithms for iterative receivers. Real-world applications are covered in detail, including decoding for turbo and LDPC codes, and detection for multi-antenna and multi-user systems. This accessible framework will allow the reader to apply factor graphs to practical problems, leading to the design of new algorithms in applications beyond digital receivers. With many examples and algorithms in pseudo-code, this book is an invaluable resource for graduate students and researchers in electrical engineering and computer science, and for practitioners in the communications industry. Additional resources for this title are available online at www.cambridge.org/9780521873154.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Attempts to jointly optimize each of these components, e.g., based on factor graphs, provide gains but lead to unwieldy and computationally complex systems.
“Attempts to jointly optimize each of these components, e.g., based on factor graphs [12], provide gains but lead to unwieldy and computationally complex systems.”
From An Introduction to Deep Learning for the Physical Layer (2017) · cites this paper as [12]
Citations
Cited by
Sorted by citations
An Introduction to Deep Learning for the Physical Layer
O'Shea, T., & Hoydis, J. (2017) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2017.2758370 · Cited by 2,980
Metadata
- Authors
- Wymeersch, H.
- Affiliations
- Massachusetts Institute of Technology (US)
- Corresponding author
- Wymeersch, Henk
- ORCID
- Wymeersch, Henk
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2007-09-06
- OpenAlex
- W599135353
- Cited by
- 168
- References
- 0
- Citations by year
- 2026: 7 · 2025: 1 · 2024: 5 · 2023: 6 · 2022: 4 · 2021: 5 · 2020: 4 · 2019: 5 · 2018: 7 · 2017: 11 · 2016: 19 · 2015: 11 · 2014: 15 · 2013: 17 · 2012: 22
- FWCI
- 2.98
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Cambridge University Press eBooks (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Communication Techniques
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Communication Networks Research
- Keywords
- iterative receiver, factor graphs, iterative detection algorithms, turbo codes, LDPC codes, channel decoding, multiuser detection, digital receiver, iterative methods
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
