Test environment running 7.6.6

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Local Convergence of the Sato Blind Equalizer and Generalizations Under Practical Constraints

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

An early use of recursive identification in blind adaptive channel equalization is an algorithm developed by Sato. An important generalization of the Sato algorithm with extensive analysis appears in the work of Benveniste, Goursat, and Ruget. These generalized algorithms have been shown to possess a desirable global convergence property under two idealized conditions. The convergence properties of this class of blind algorithms under practical constraints common to a variety of channel equalization applications that violate these idealized conditions are studied. Results show that, in practice, when either the equalizer is finite-dimensional and/or the input is discrete (as in digital communications) the equalizer parameters may converge to parameter settings that fail to achieve the objective of approximating the channel inverse. It is also shown, that a center spike initialization is insufficient to guarantee avoiding such ill-convergence. Simulations verify the analytical results.

Description

Citation

Source

IEEE Transactions on Information Theory

Book Title

Entity type

Access Statement

License Rights

Restricted until