Adaptive deterministic maximum likelihood using a quasi-discrete prior
A block algorithm is presented to solve the joint blind channel identification and blind symbol estimation problem. It is based on a deterministic maximum likelihood (DML) method. A partial prior on the symbols is incorporated into the DML criterion in order to improve the estimation accuracy. We pr...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A block algorithm is presented to solve the joint blind channel identification and blind symbol estimation problem. It is based on a deterministic maximum likelihood (DML) method. A partial prior on the symbols is incorporated into the DML criterion in order to improve the estimation accuracy. We propose a test which permits to circumvent the local minima problem and which is pertinent for a large class of criteria. The structure of the block algorithm is well-suited for deriving recursive and adaptive versions. We prove that, in the noiseless case, the obtained recursive algorithm converges only towards the global minimum. Numerical results show that the prior on the symbols improves the accuracy of the estimators and brings robustness to the lack of channel diversity. At the same time, this method introduces fewer local minima than the use of a full prior. |
---|---|
ISSN: | 1520-6149 2379-190X |
DOI: | 10.1109/ICASSP.2000.861063 |