The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Complete Characterization of the Pareto Boundary for the MISO Interference Channel
Open accessAbstract
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.
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
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
A new achievable rate region for the interference channel
Han, T., & Kobayashi, K. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056307 · Cited by 1,588
Space-Time Block Coding for Wireless Communications
Larsson, E. G., & Stoica, P. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511550065 · Cited by 1,035
Self-citationCarleial, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055812 · Cited by 694
Competition Versus Cooperation on the MISO Interference Channel
Larsson, E., & Jorswieck, E. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080904 · Cited by 304
Self-citationJorswieck, E. A., & Larsson, E. G. (2008) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2008.4518872 · Cited by 85
Self-citationAchievable Rate Region for Downlink Beamforming in the Presence of Interference
Shang, X., & Chen, B. (2007) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2007.4487519 · Cited by 28
Cited by
Cramér-Rao Bound Optimization for Joint Radar-Communication Beamforming
Liu, F., Liu, Y.-F., Li, A., Masouros, C., & Eldar, Y. C. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3135692 · Cited by 774
Foundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
Optimal Resource Allocation in Coordinated Multi-Cell Systems
Björnson, E., & Jorswieck, E. (2013) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000069 · Cited by 349
Self-citationBjornson, E., Zakhour, R., Gesbert, D., & Ottersten, B. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2049996 · Cited by 334
Coding Techniques for Repairability in Networked Distributed Storage Systems
Oggier, F., & Datta, A. (2013) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000068 · Cited by 305
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
- 7
- 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
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.