Chapters 4 through 9 considered the transient response characteristics and implementation considerations associated with different classes of algorithms that are widely used for adaptive array applications. This chapter summarizes the principal characteristics of each algorithm class before considering some practical problems associated with adaptive array system design. In each chapter of Part 2 the convergence speed of an algorithm representing a distinct adaptation philosophy was compared with the convergence speed of the least mean squares (LMS) algorithm. The convergence speeds of the various algorithms are compared for a selected example in this chapter. Since the misadjustment versus rate of adaptation tradeoffs for the random search algorithms-linear random search (LRS), accelerated random search (ARS), and guided accelerated random search (GARS) - and for the differential steepest descent (DSD) algorithm of Chapter 4 are unfavorable compared with the LMS algorithm, recourse to these methods would be taken only if the meager instrumentation required was regarded as a cardinal advantage or nonunimodal performance surfaces were of concern. Furthermore, the Howells-Applebaum maximum signal-to-noise ratio (SNR) algorithm has a misadjustment versus convergence speed trade-off that is nearly identical with the LMS algorithm.
Adaptive Algorithm Performance Summary, Page 1 of 2
< Previous page Next page > /docserver/preview/fulltext/books/ew/sbew046e/SBEW046E_ch9-1.gif /docserver/preview/fulltext/books/ew/sbew046e/SBEW046E_ch9-2.gif