Title

Multiscale Iterative LBG Clustering for SIMO Channel Identification

Publication Date

2002

Document Type

Conference Proceeding

Abstract

This paper deals with the problem of channel identification for single input multiple output (SIMO) slow fading channels using clustering algorithms. The received data vectors of the SIMO model are spread in clusters because of the AWGN. Each cluster is centered around the ideal channel output labels without noise. Starting from the Markov SIMO channel model, simultaneous maximum-likelihood estimation of the input vector and the channel coefficients reduces to one of obtaining the values of this pair that minimizes the sum of the Euclidean norms between the received and the estimated output vectors. The Viterbi algorithm can be used for this purpose provided the trellis diagram of the Markov model can be labeled with the noiseless channel outputs. The problem of identification of the ideal channel outputs, which is the focus of this paper, is then equivalent to designing a vector quantizer (VQ) from a training set corresponding to the observed noisy channel outputs. The Linde-Buzo-Gray (1980) type clustering algorithms could be used to obtain the noiseless channel output labels from the noisy received vectors. This paper looks at two critical issues with regards to the use of VQ for channel identification. The first has to deal with the applicability of this technique in general. We present theoretical results showing the conditions under which the technique may be applicable. The second aims at overcoming the codebook initialization problem by proposing a novel approach which attempts to make the first phase of the channel estimation faster than the classical codebook initialization methods

Publication Title

2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333)

Volume

1

First Page

84

Last Page

88

DOI

10.1109/ICC.2002.996822

Version

no SHERPA/RoMEO policy available

This document is currently not available here.

Share

COinS