Paper Info
Title
Pairwise Algorithm For Distributed Transmit Beamforming
Abstract
In this paper, we present a novel algorithm for distributed transmit beamforming enabling multiple single-antenna nodes to simultaneously transmit a common message such that they constructively interfere at the receiver. In order to constructively interfere, the nodes iteratively estimate and adjust their carrier phases with the help of receiver feedback. The receiver's feedback is based on composite channel estimates calculated from two simultaneous transmissions initiated by the nodes at each iteration. We prove that starting from arbitrary carrier phases, the algorithm converges to the maximum gain almost surely. The algorithm is compared to the 1-Bit Feedback algorithm presented in [31 through simulation, and is shown to outperform it by margins of 4:1 and 3:1 on metrics reflecting power consumption and convergence rate, respectively. We simulate the impact of phase estimation errors on the algorithm's steady-state gain and show it to be robust to moderately large errors of +/- 20 degrees. We analyze the causes of asynchrony in simultaneous message transmissions and simulate its contribution to phase estimation errors in the context of IEEE 802.15.4 packets. We show that the contribution falls within the acceptable +/- 20 degrees range.
Year
DOI
Venue
2008
10.1109/ICC.2008.797
2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13
Keywords
Field
DocType
robustness,iterative method,convergence rate,context modeling,feedback,steady state,estimation theory,convergence,iterative methods
Beamforming,Iterative method,Control theory,Computer science,Network packet,Communication channel,Algorithm,Real-time computing,Robustness (computer science),Rate of convergence,Estimation theory,Pairwise Algorithm
Conference
ISSN
Citations 
PageRank 
1550-3607
9
0.63
References 
Authors
5
4
Name
Order
Citations
PageRank
Prasanth Jeevan190.63
Sofie Pollin21041113.94
Ahmad Bahai360265.90
Pravin Varaiya42543298.93