The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Trellis and Convolutional Precoding for Transmitter- Based Interference Presubtraction
Abstract
This paper studies the combination of practical trellis and convolution codes with Tomlinson-Harashima precoding (THP) for the presubtraction of multiuser interference that is known at the transmitter but not known at the receiver. It is well known that a straightforward application of THP suffers power, modulo, and shaping losses. This paper proposes generalizations of THP that recover some of these losses. At a high signal-to-noise ratio (SNR), the precoding loss is dominated by the shaping loss, which is about 1.53 dB. To recover shaping loss, a trellis-shaping technique is developed that takes into account the knowledge of a noncausal interfering sequence, rather than just the instantaneous interference. At rates of 2 and 3 bits per transmission, trellis shaping is shown to be able to recover almost all of the 1.53-dB shaping loss. At a low SNR, the precoding loss is dominated by power and modulo losses, which can be as large as 3-4 dB. To recover these losses, a technique that incorporates partial interference presubtraction (PIP) within convolutional decoding is developed. At rates of 0.5 and 0.25 bits per transmission, PIP is able to recover 1-1.5 dB of the power loss. For intermediate SNR channels, a combination of the two schemes is shown to recover both power and shaping losses.
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
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 need for the modified metric highlights the difficulty in truly achieving the capacity of the dirty-paper channel in the low-SNR regime using newer iterative decoding methods, such as the sum-product algorithm (see [ 24 ] and references therein).”
Method
Cited by
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
Taesa, & Goldsmith, A. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.862421 · Cited by 2,057
Multi-Cell MIMO Cooperative Networks: A New Look at Interference
Gesbert, D., Hanly, S., Huang, H., Shamai Shitz, S., Simeone, O., & Yu, W. (2010) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2010.101202 · Cited by 1,760
Self-citationTransmitter Optimization for the Multi-Antenna Downlink With Per-Antenna Power Constraints
Yu, W., & Lan, T. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.890905 · Cited by 839
Self-citationMIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
Metadata
- Authors
- Yu, W., Varodayan, D. P., & Cioffi, J. M.
- Venue
- IEEE Transactions on Communications
- Published
- 2005-07
- Volume
- 53
- Issue
- 7
- Pages
- 1220-1230
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2136093293
- Cited by
- 167
- References
- 1
- FWCI
- 15.89
- 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: Trellis and Convolutional Precoding for Transmitter- Based Interference Presubtraction. https://app.cochat.ai/papers/10.1109/tcomm.2005.851605
- The paper
- Yu, W., Varodayan, D. P., & Cioffi, J. M. (2005). Trellis and Convolutional Precoding for Transmitter- Based Interference Presubtraction. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2005.851605
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.