The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Distributed Transmit Beamforming Using Feedback Control
Abstract
The concept of distributed transmit beamforming is implicit in many key results of network information theory. However, its implementation in a wireless network involves the fundamental challenge of ensuring phase coherence of the radio frequency signals from the different transmitters in the presence of unknown phase offsets between the transmitters and unknown channel gains from the transmitters to the receiver. In this paper, it is shown that such phase alignment can be achieved using distributed adaptation by the transmitters with minimal feedback from the receiver. Specifically, each transmitter independently makes a small random adjustment to its phase at each iteration, while the receiver broadcasts a single bit of feedback, indicating whether the signal-to-noise ratio (SNR) improved or worsened after the current iteration. The transmitters keep the ¿good¿ phase adjustments and discard the ¿bad¿ ones, thus implementing a distributed ascent algorithm. It is shown that, for a broad class of distributions for the random phase adjustments, this procedure leads to asymptotic phase coherence with probability one. A simple analytical model, borrowing ideas from statistical mechanics, is used to characterize the progress of the algorithm, and to provide guidance on parameter choices. This analytical model is based on a conjecture on the distribution of the received phases when the number of transmitters becomes large. Finally, the proposed system is shown to be scalable: the random phase perturbations can be chosen such that the convergence time is linear in the number of collaborating nodes.
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
Probability, Random Variables, and Stochastic Processes.
Abrahams, J., & Papoulis, A. (1984) · Journal of the American Statistical Association · doi:10.2307/2288754 · Cited by 16,226
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
User cooperation diversity-part I: system description
Sendonaris, A., Erkip, E., & Aazhang, B. (2003) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.818096 · Cited by 6,285
Random variables and stochastic processes
Larson, H. J., & Shubert, B. O. (1979) · Wiley eBooks · Cited by 4,640
Capacity theorems for the relay channel
Cover, T., & Gamal, A. E. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056084 · Cited by 4,123
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
Laneman, J. N., & Wornell, G. W. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817829 · Cited by 4,002
Probability and Random Processes
(2004) · Elsevier eBooks · doi:10.1016/b978-0-12-172651-5.x5000-3 · Cited by 2,535
Stochastic Approximation Algorithms and Applications
Puhalskii, A., Kushner, H. J., & Yin, G. G. (1998) · Journal of the American Statistical Association · doi:10.2307/2669885 · Cited by 994
Stochastic Approximation Algorithms and Applications
Kushner, H. J., & Yin, G. G. (1997) · Springer eBooks · doi:10.1007/978-1-4899-2696-8 · Cited by 869
Shiryaev, A. N. (1996) · Graduate texts in mathematics · doi:10.1007/978-1-4757-2539-1 · Cited by 834
Cited by
Wireless powered communication: opportunities and challenges
Bi, S., Ho, C. K., & Zhang, R. (2015) · IEEE Communications Magazine · doi:10.1109/mcom.2015.7081084 · Cited by 1,092
Metadata
- Authors
- Mudumbai, R., Hespanha, J., Madhow, U., & Barriac, G.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2010-01
- Volume
- 56
- Issue
- 1
- Pages
- 411-426
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2119161934
- Cited by
- 260
- References
- 14
- FWCI
- 37.37
- 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: Distributed Transmit Beamforming Using Feedback Control. https://app.cochat.ai/papers/10.1109/tit.2009.2034786
- The paper
- Mudumbai, R., Hespanha, J., Madhow, U., & Barriac, G. (2010). Distributed Transmit Beamforming Using Feedback Control. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2009.2034786
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.