The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Design of Serially Concatenated Systems Depending on the Block Length
Abstract
Based on extrinsic information transfer (EXIT) charts, the convergence behavior of iterative decoding is studied for a number of serially concatenated systems, such as a serially concatenated code, coded data transmission over an intersymbol interference channel, bit-interleaved coded modulation, or trellis-coded modulation. Efficient optimization algorithms based on simplified EXIT chart construction are devised to find irregular codes improving the convergence of iterative decoding. One optimization criterion is to find concatenated systems exhibiting thresholds of successful decoding convergence, which are close to information-theoretic limits. However, these thresholds are approached only for very long block lengths. To overcome this problem, the decoding convergence after a fixed, finite number of iterations is optimized, which yields systems performing very well for short block lengths, too. As an example, optimal system configurations for communication over an additive white Gaussian noise channel are presented.
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
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 1×
“The concept of iterative decoding can be generalized to message passing on a graph [7], which was used to analyze the family of the low-density parity-check (LDPC) codes [8] invented in [9].”
Method
Cited by
Bit-interleaved coded modulation
Caire, G., Taricco, G., & Biglieri, E. (2002) · Proceedings of IEEE International Symposium on Information Theory · doi:10.1109/isit.1997.613011 · Cited by 1,927
Extrinsic information transfer functions: model and erasure channel properties
Ashikhmin, A., Kramer, G., & ten Brink, S. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.836693 · Cited by 756
Metadata
- Authors
- Tuchler, M.
- Venue
- IEEE Transactions on Communications
- Published
- 2004-02
- Volume
- 52
- Issue
- 2
- Pages
- 209-218
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2106825025
- Cited by
- 210
- References
- 1
- FWCI
- 18.46
- 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
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.