Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 392

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Complete Characterization of the Pareto Boundary for the MISO Interference Channel

Open access
Jorswieck, E.A., Larsson, E.G., Danev, D.·2008·IEEE Transactions on Signal Processing

Abstract

In this correspondence, we study the achievable rate region of the multiple-input single-output (MISO) interference channel, under the assumption that all receivers treat the interference as additive Gaussian noise. Our main result is an explicit parametrization of the Pareto boundary for an arbitrary number of users and antennas. The parametrization describes the boundary in terms of a low-dimensional manifold. For the two-user case we show that a single real-valued parameter per user is sufficient to achieve all points on the Pareto boundary and that any point on the Pareto boundary corresponds to beamforming vectors that are linear combinations of the zero-forcing (ZF) and maximum-ratio transmission (MRT) beamformers. We further specialize the results to the MISO broadcast channel (BC). A numerical example illustrates the result.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tsp.2008.928095

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 392

Metadata

Authors
Jorswieck, E. A., Larsson, E. G., & Danev, D.
Venue
IEEE Transactions on Signal Processing
Published
2008-10
Volume
56
Issue
10
Pages
5292-5296
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W2105147943
Cited by
392
References
1
FWCI
31.98
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Complete Characterization of the Pareto Boundary for the MISO Interference Channel. https://app.cochat.ai/papers/10.1109/tsp.2008.928095
The paper
Jorswieck, E. A., Larsson, E. G., & Danev, D. (2008). Complete Characterization of the Pareto Boundary for the MISO Interference Channel. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2008.928095

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.