Adaptive estimation of hidden nearly completely decomposable Markov chains with applications in blind equalization

DOI10.1002/acs.4480080303zbMath0797.62070OpenAlexW2073454032MaRDI QIDQ4297370

No author found.

Publication date: 25 October 1994

Published in: International Journal of Adaptive Control and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/acs.4480080303

zbMATH Keywords

computational complexitymaximum likelihood estimationhidden Markov modelsimulationsNewton-Raphsonexpectation maximization algorithmestimation algorithmswhite Gaussian noisegradient estimationsignal estimatesteady state probability distributionstochastic complementationnearly completely decomposable Markov chainsexact aggregationblind equalization problemchannel coefficientsnoisy FIR channelsoff-line estimation algorithmphase-shift-keyed (PSK) signalsphase-shift-keyed signalsrecursive EM

Mathematics Subject Classification ID

Markov processes: estimation; hidden Markov models (62M05) Applications of statistics (62P99) Communication, information (94A99) Probabilistic methods, stochastic differential equations (65C99)

Cites Work

• An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition
• Unnamed Item

This page was built for publication: Adaptive estimation of hidden nearly completely decomposable Markov chains with applications in blind equalization