Analysis and Development of Blind Adaptive Beamforming Algorithms

Files

etd1.pdf (2.15 MB)
Downloads: 4843

TR Number

Date

2001-10-18

Journal Title

Journal ISSN

Volume Title

Publisher

Virginia Tech

Abstract

This dissertation presents a new framework for the development and analysis of blind adaptive algorithms. An adaptive algorithm is said to be 'blind' if it does not require a known training sequence. The main focus is on application of these algorithms to adaptive antenna arrays in mobile radio communications. Adaptive antenna arrays can reduce the effects of cochannel interference, multipath fading, and background noise as compared to more conventional antenna systems. For these reasons, the use of adaptive antennas in wireless communication has received a great deal of attention in the literature.

There are several reasons why the study of blind adaptive algorithms is important. First, it is common practice to switch to a blind mode once the training sequence has been processed in order to track a changing environment. Furthermore, the use of a blind algorithm can completely eliminate the need for a training sequence. This is desirable since the use of a training sequence reduces the number of bits available for transmitting information.

The analysis framework introduced here is shown to include the well-known Constant Modulus Algorithm (CMA) and decision directed algorithm (DDA). New results on the behavior of the CMA and DDA are presented here, including analytic results on the convergence rate. Previous results have relied on Monte Carlo simulation. This framework is also used to propose a new class of blind adaptive algorithms that offer the potential for improved convergence rate.

Description

Keywords

propagation, Adaptive array, CMA, decision-directed, convergence analysis

Citation