### Sherman Ng and Mark Johnson

###
EECS Department

University of California, Berkeley

Technical Report No. UCB/EECS-2009-161

November 30, 2009

### http://www2.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-161.pdf

Beamforming is a common technique used to increase signal gain in communication networks. We developed an efficient 1-bit feedback beamforming algorithm that runs in time proportional to the number of transmitters in the network. There are 2 variable parameters in the algorithm: the probability of any transmitter changing its phase in the next iteration, and the amount by which a transmitter is permitted to change its phase in a single iteration. The parameters producing the optimal running times were discovered through numerical stimulations in MATLAB. We then analyzed the running time of the algorithm mathematically and showed that the lower bound of the running time of our proposed algorithm is linear in proportion to the total number of transmitters. Our work provides a basis for future development of beamforming algorithms that are more robust to noise.

BibTeX citation:

@techreport{Ng:EECS-2009-161, Author = {Ng, Sherman and Johnson, Mark}, Title = {Performance Analysis of a 1-bit Feedback Beamforming Algorithm}, Institution = {EECS Department, University of California, Berkeley}, Year = {2009}, Month = {Nov}, URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-161.html}, Number = {UCB/EECS-2009-161}, Abstract = {Beamforming is a common technique used to increase signal gain in communication networks. We developed an efficient 1-bit feedback beamforming algorithm that runs in time proportional to the number of transmitters in the network. There are 2 variable parameters in the algorithm: the probability of any transmitter changing its phase in the next iteration, and the amount by which a transmitter is permitted to change its phase in a single iteration. The parameters producing the optimal running times were discovered through numerical stimulations in MATLAB. We then analyzed the running time of the algorithm mathematically and showed that the lower bound of the running time of our proposed algorithm is linear in proportion to the total number of transmitters. Our work provides a basis for future development of beamforming algorithms that are more robust to noise.} }

EndNote citation:

%0 Report %A Ng, Sherman %A Johnson, Mark %T Performance Analysis of a 1-bit Feedback Beamforming Algorithm %I EECS Department, University of California, Berkeley %D 2009 %8 November 30 %@ UCB/EECS-2009-161 %U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-161.html %F Ng:EECS-2009-161