Name
Abstract | ||
|---|---|---|
We present a novel approach to the problem of distributed nullforming where a set of transmitters cooperatively transmit a common message signal in such a way that their individual transmissions precisely cancel each other at a designated receiver. Under our approach, each transmitter iteratively makes an adjustment to the phase of its transmitted RF signal, by effectively implementing a gradient descent algorithm to reduce the amplitude of the overall received signal to zero. We show that this gradient search can be implemented in a purely distributed fashion at each transmitter assuming only that each transmitter has an estimate of its own channel gain to the receiver. This is an important advantage of our approach and assures its scalability; in contrast any non-iterative approach to the nullforming problem requires centralized knowledge of the channel gain of every transmitter. We prove analytically that the gradient search algorithm converges to a null at the designated receiver. We also present numerical simulations to illustrate the robustness of this approach. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-41773-3_9 | Lecture Notes of the Institute for Computer Sciences Social Informatics and Telecommunications Engineering |
Keywords | Field | DocType |
distributed nullforming,cooperative transmission,virtual antenna arrays | Transmitter,Gradient descent,Search algorithm,Computer science,Robustness (computer science),Radio frequency,Channel gain,Amplitude,Scalability,Distributed computing | Conference |
Volume | ISSN | Citations |
121 | 1867-8211 | 6 |
PageRank | References | Authors |
0.51 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Muhammad M. Rahman | 1 | 35 | 2.43 |
| Soura Dasgupta | 2 | 679 | 96.96 |
| R. Mudumbai | 3 | 1020 | 70.72 |