Robust window design of the optimal windowed RLS algorithm

Author

Lin, Jingdong ; Lev-Ari, Hanoch ; Proakis, John G.

Author_Institution

Motorola Codex, Mansfield, MA, Germany

fYear

1994

fDate

1-5 May 1994

Firstpage

1448

Abstract

Two robust designed windows are proposed for the recursive least squares (RLS) algorithm, namely, the average robust window (ARW) and the minimax robust window (MRW). These robust design techniques provide satisfactory performance for tracking of nonstationary channels. The theoretical results obtained are reinforced by simulations. The Northern American Digital Cellular (NADC) system is employed as an example to illustrate the superior performance of the robust windows over that of exponential windows

Keywords

cellular radio; digital radio; fading; least squares approximations; minimax techniques; recursive estimation; signal detection; time division multiple access; time-varying channels; NADC system; Northern American Digital Cellular; average robust window; design techniques; exponential windows; minimax robust window; nonstationary channels; optimal windowed RLS algorithm; performance; recursive least squares; robust window design; tracking; AWGN; Algorithm design and analysis; Fading; Least squares methods; Minimax techniques; Radio communication; Resonance light scattering; Robustness; Time division multiple access; Time-varying channels;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 1994. ICC '94, SUPERCOMM/ICC '94, Conference Record, 'Serving Humanity Through Communications.' IEEE International Conference on

Conference_Location

New Orleans, LA

Print_ISBN

0-7803-1825-0

Type

conf

DOI

10.1109/ICC.1994.368790

Filename

368790