The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Robust Analog Function Computation via Wireless Multiple-Access Channels
Open accessAbstract
Wireless sensor network applications often involve the computation of pre-defined functions of the measurements such as for example the arithmetic mean or maximum value. Standard approaches to this problem separate communication from computation: digitized sensor readings are transmitted interference-free to a fusion center that reconstructs each sensor reading and subsequently computes the sought function value. Such separation-based computation schemes are generally highly inefficient as a complete reconstruction of individual sensor readings at the fusion center is not necessary to compute a function of them. In particular, if the mathematical structure of the channel is suitably matched (in some sense) to the function of interest, then channel collisions induced by concurrent transmissions of different nodes can be beneficially exploited for computation purposes. This paper proposes an analog computation scheme that allows for an efficient estimate of linear and nonlinear functions over the wireless multiple-access channel. A match between the channel and the function being evaluated is thereby achieved via some pre-processing on the sensor readings and post-processing on the superimposed signals observed by the fusion center. After analyzing the estimation error for two function examples, simulations are presented to show the potential for huge performance gains over time- and code-division multiple-access based computation schemes.
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
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
Computation Over Multiple-Access Channels
Nazer, B., & Gastpar, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904785 · Cited by 753
Cited by
Federated Learning via Over-the-Air Computation
Yang, K., Jiang, T., Shi, Y., & Ding, Z. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2961673 · Cited by 1,084
“Recent research works on AirComp have achieved significant progresses from the point of view of information theory [22], signal processing [23], transceiver design [24], [25], channel state information acquisition [26], synchronization issues [27], [28], the AirComp based model aggregation problem poses unique challen…”
BackgroundBroadband Analog Aggregation for Low-Latency Federated Edge Learning
Zhu, G., Wang, Y., & Huang, K. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2946245 · Cited by 761
Machine Learning at the Wireless Edge: Distributed Stochastic Gradient Descent Over-the-Air
Mohammadi Amiri, M., & Gunduz, D. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2981904 · Cited by 548
“It is known that separation-based approaches to distributed compression and computing over wireless channels are suboptimal in general [27], [28].”
BackgroundDistributed Learning in Wireless Networks: Recent Progress and Future Challenges
Chen, M., Gunduz, D., Huang, K., Saad, W., Bennis, M., Feljan, A. V., & Poor, H. V. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3118346 · Cited by 548
Zhu, G., Du, Y., Gunduz, D., & Huang, K. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3039309 · Cited by 376
“in [24] to wireless MACs and a more general class of non-linear functions.”
Background
Metadata
- Authors
- Goldenbaum, M., & Stanczak, S.
- Venue
- IEEE Transactions on Communications
- Published
- 2013-09
- Volume
- 61
- Issue
- 9
- Pages
- 3863-3877
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2128011496
- Cited by
- 187
- References
- 2
- FWCI
- 14.10
- 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.