On the inclusion of channel's time dependence in a hidden Markov model for blind channel estimation
PublisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Rights accessOpen Access
In this paper, the theory of hidden Markov models (HMM) is applied to the problem of blind (without training sequences) channel estimation and data detection. Within a HMM framework, the Baum–Welch(BW) identification algorithm is frequently used to find out maximum-likelihood (ML) estimates of the corresponding model. However, such a procedure assumes the model (i.e., the channel response) to be static throughout the observation sequence. By means of introducing a parametric model for time-varying channel responses, a version of the algorithm, which is more appropriate for mobile channels [time-dependent Baum-Welch (TDBW)] is derived. Aiming to compare algorithm behavior, a set of computer simulations for a GSM scenario is provided. Results indicate that, in comparison to other Baum–Welch (BW) versions of the algorithm, the TDBW approach attains a remarkable enhancement in performance. For that purpose, only a moderate increase in computational complexity is needed.
CitationAntón Haro, C.; Rodríguez Fonollosa, J. A.; Fauli, C.; Rodríguez Fonollosa, J. On the inclusion of channel's time dependence in a hidden Markov model for blind channel estimation. IEEE Transactions on Vehicular Technology, 2001, vol. 50, núm. 3, p. 867-873.
Showing items related by title, author, creator and subject.
Mengual Pérez, Ester; García Villegas, Eduard; Vidal Ferré, Rafael (Institute of Electrical and Electronics Engineers (IEEE), 2013)
Restricted access - publisher's policyThe 2.4 GHz ISM band is a battlefield where an increasingly large number of devices compete for the scarce frequency resources. IEEE 802.11 WLANs suffer the consequences of this overcrowded spectrum, especially in dense ...
A rate-splitting approach to fading multiple-access channels with imperfect channel-state information Pastore, Adriano; Koch, Tobias; Rodríguez Fonollosa, Javier (2014)
Restricted access - publisher's policyAs shown by Medard, the capacity of fading channels with imperfect channel-state information (CSI) can be lowerbounded by assuming a Gaussian channel input and by treating the unknown portion of the channel multiplied ...
Pastore, Adriano; Koch, Tobias; Rodríguez Fonollosa, Javier (2014-07)
Restricted access - publisher's policyAs shown by Médard, the capacity of fading channels with imperfect channel-state information can be lower-bounded by assuming a Gaussian channel input X with power P and by upper-bounding the conditional entropy h(X|Y,H) ...