Title :
A randomised algorithm for improving source and channel estimates by exploiting the finite alphabet property
Author :
Manton, Jonathan H. ; Hua, Yingbo
Author_Institution :
Dept. of Electr. & Electron. Eng., Melbourne Univ., Parkville, Vic., Australia
fDate :
Oct. 29 2000-Nov. 1 2000
Abstract :
Many channel identification algorithms do not take into account the fact that the source symbols belong to a finite alphabet. This paper proposes an algorithm which exploits this finite alphabet property to refine the estimates of the source symbols and channel parameters obtained by any identification algorithm. The key idea is to reformulate the problem as minimising a quadratic cost function on a set of discrete points. Since it is known that this problem is NP-hard, a randomised algorithm is proposed, which guesses the direction in which to search for the minimum.
Keywords :
computational complexity; digital communication; least squares approximations; minimisation; parameter estimation; random processes; telecommunication channels; NP-hard problem; additive noise; channel identification algorithms; channel parameter estimation; digital communication systems; finite alphabet property; identification algorithm; least squares cost function; quadratic approximation; quadratic cost function minimisation; randomised algorithm; source estimates; source symbols; Additive noise; Australia Council; Convolution; Cost function; Equations; Frequency conversion; Least squares approximation; OFDM; Upper bound; Vectors;
Conference_Titel :
Signals, Systems and Computers, 2000. Conference Record of the Thirty-Fourth Asilomar Conference on
Conference_Location :
Pacific Grove, CA, USA
Print_ISBN :
0-7803-6514-3
DOI :
10.1109/ACSSC.2000.911256
