A gradient search interpretation of the super-exponential algorithm

DOI10.1109/18.887889MaRDI QIDQ2706013zbMATH OpenOpenAlexFDO

Authors Mamadou Mboup, Phillip A. Regalia

Publication date 19 March 2001

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/3cd6ff8a911d59e3ed851f9f61aeff2ca7791dc0

zbMATH Keywords

blind channel equalizationgradient methodgradient searchHadamard exponentiationHadamard powerstationary pointssuper-exponential algorithm

Mathematics Subject Classification ID

Signal detection and filtering (aspects of stochastic processes) (60G35) Numerical mathematical programming methods (65K05) Identification in stochastic control theory (93E12) Communication theory (94A05)

Review text

This correspondence reviews the super-exponential algorithm proposed by \textit{O. S. Shalvi} and \textit{E. Weinstein} [ibid. 39, 504-519 (1993; Zbl 0782.93090)] for blind channel equalization. The principle of this algorithm -- Hadamard exponentiation, projection over the set of attainable combined channel-equalizer impulse responses followed by a normalization -- is shown to coincide with a gradient search of an extremum of a cost function. The cost function belongs to the family of functions given as the ratio of the standard \(\ell_{2p}\) and \(\ell_2\) sequence norms, where \(p> 1\). This family is very relevant in blind channel equalization, tracing back to \textit{D. Donoho's} work on minimum entropy deconvolution [Applied time series analysis II, Proc. Symp., Tulsa/USA 1980, 565-608 (1981; Zbl 0481.62075)] and also underlying the Godard (or constant modulus) and the earlier Shalvi-Weinstein algorithms [\textit{D. N. Godard}, Self-recovering equalization and carfrier tracking in two-dimensional data communication systems, IEEE Trans. Commun. COM-28, 1867-1875 (1980) and \textit{O. S. Shalvi} and \textit{E. Weinstein}, IEEE Trans. Inf. Theory 36, 312-321 (1990; Zbl 0704.94001)]. Using this gradient search interpretation, which is more tractable for analytical study, we give a simple proof of convergence for the super-exponential algorithm. Finally, we show that the gradient step-size choice giving rise to the super-exponential algorithm is optimal.

Recommendations

• Super-exponential algorithms for multichannel blind deconvolution
• On a variable-step constant-modulus blind equalization algorithm modified by memory gradient method
• Super-exponential methods for blind deconvolution
• Blind deconvolution (equalization): Some new results
• On the convergence of subgradient based blind equalization algorithm

Cited in

(3)

• Super-exponential algorithms for multichannel blind deconvolution
• Super-exponential methods for blind deconvolution
• A numerically robust blind equalization scheme applied to MIMO communication systems

This page was built for publication: A gradient search interpretation of the super-exponential algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706013)