An Efficient Identification Algorithm in a Low SNR Channel

저 SNR을 갖는 채널에서 효율적인 인식 알고리즘

  • cc icon

    Identification of communication channels is a problem of important current theoretical and practical concerns. Recently proposed solutions for this problem exploit the diversity induced by antenna array or time oversampling. The method resorts to an adaptive filter with a linear constraint. In this paper, an approach is proposed that is based on decomposition. Indeed, the eigenvector corresponding to the minimum eigenvalue of the covariance matrix of the received signals contains the channel impulse response. And we present an adaptive algorithm to solve this problem. Proposed technique shows the better performance than one of existing algorithms.

    통신채널의 인식문제는 현재 이론적 부분과 실제 관점 부분의 문제점을 가지고 있다. 최근에 이 문제를 해결키 위해 제안된 기법들은 안테나 구조와 시간 오버샘플링에 의해 유도된 다이버시티를 이용하고 있다. 이 방법은 선형 제한조건을 가진 적응필터를 이용하고 있다. 본 논문에서는 값 분할에 근거한 기법이 제안되었다. 수신신호 상관행렬의 최소 단일값에 의한 단일벡터는 채널 임펄스 응답을 포함하며 상기 문제를 해결키 위한 적응 알고리즘을 보인다. 제안된 기법은 기존 기법의 성능보다 우수함을 알 수 있다.


    SNR , channel , identification , covariance


    In HOS-based methods, because the performance index as the optimization criterion is nonlinear with respect to estimation parameters and these methods require a large amount of data samples. These methods have the disadvantage that their computational complexity may be large. See, for example, [1] and references therein. Since the seminal work by Tong et al. the problem of estimating the channel response of multiple FIR channel driven by an unknown input symbol has interested many researchers in signal processing and communication fields. This is achieved by exploiting assumed cyclostationary properties, induced by oversampling or antenna array at the receiver part[1,2]. The basic blind channel identification problem involves a channel model where only the observation signal is available for processing in the identification channel. Earlier blind channel identification approaches mostly depend on higher order statistics (HOS), because the second order statistics (SOS) does not contain phase information for stationary signal[3-4]. Most communication channels are time-varying in practice. Therefore, the algorithms should be able to track the change of the channel impulse response. Moreover, in a fast fading channel, the multipath channels in wireless communications vary rapidly, and we only have a few data samples corresponding to the same channel characteristics. Blind channel identification technique has been developed in adaptive algorithm based on vector-correlation method [8,9,11]. But most algorithms neglected the effect of channel noise.

    Most notations are standard: vectors and matrices are boldface small and capital letters, respectively; the matrix transpose, the complex conjugate, the Hermitian, and convolution are denoted by (·)T, (·)*, (·)H and ⊗, respectively; IP is the P × P identity matrix; E(·) is the statistical expectation.

    This paper is organized as follows. In section II, we review the basic assumption and identification issues. And the existing adaptive algorithms of the block LS methods are described also. A novel blind channel identification technique based on eigenvlaue decomposition and adaptive implementation are proposed in section III. Simulation results with real measured channel are performed in section IV. Section V concludes our results.

    Ⅱ. Basic Assumption and Issues

    In this paper, consider a special case, when the channel output is two times oversampled or there are two antennas at the receiver, this is equivalent to two channel representation (M=2). From the Fig. 1, in the absence of noise, it is apparent that the output of each subchannel is


    Let 𝒳(t) be the signal at the output of a noisy channel

    where s(k) denotes the transmitted symbol at time kT , h(t) denotes the continuous-time channel impulse response, and v(t) is additive noise. As shown in [3], the single channel system can be considered as the multichannel system by the sampling the received signal at a rate faster than the input symbol rate. The source signal s(n) then passes through M equivalent symbol rate linear filters. And as shown in Fig. 2, xi(n) denotes the output from the ith channel with the noisy FIR channel impulse response {hi(n)}, which is driven by the same input s(n). Clearly, for linearly modulated communication signals, xi(n) , ai(n) , s(n) , vi(n) , and hi(n) are related as follows

    where L is the maximum order of the M channels.

    The blind identification problem can be stated as follows: Given the observation of channel output {xi(n) , i=1,⋯,M; n=L,⋯,N}, determine the channels and further recover the input signals {s(n) }. As in classical system identification problems, certain conditions about the channel and the source must be satisfied to ensured identifiability. We assume the following throughout in this paper about the channel and source conditions.

    A1) Subchannels do not share common zeros, or in other words, they are coprime.A2) The noise v(n) is zero mean, white with known covariance, no cochannel correlation, and uncorrelated with source signal.A3) The channel has known order L.

    The assumption that L is known may be practical. To address this problem, there are three approaches[5]. First, channel order detection and parameter estimation can be performed separately. Second, some statistical subspace methods require only upper bound of L. Third, channel order detection and parameter estimation can be performed jointly.

    Ⅲ. Proposed Scheme

    As described in [5], to avoid the trivial solution to minimization problem a proper condition must be selected. In this section, a new approach is proposed that is based on eigenvalue decomposition. Indeed, the eigenvector corresponding to the minimum eigenvalue of the covariance matrix of the received signals contains the channel impulse response. This approach is based on the unit norm constraint that is apart from the linear constraint introduced in the previous section[6].

      >  A. Concept of the Proposed Scheme

    Number equations consecutively with equation numbers in parentheses flush with the right margin, as in (1). We assume that the channel is linear and time invariant within small time interval; therefore, we have the following relation as described in (4)


    and the channel impulse response vector of length L are defined as

    The covariance matrix of the two received signals is given by

    Consider the 2L´1 vector as follows:

    From (5) and (8), it can be seen that Rxh=0, which means that the vector h is the eigenvector of the covariance matrix Rx corresponding to the eigenvalue 0.

    Moreover, if the two channel impulse response h1 and h2 have no common zeros and the autocorrelation matrix of the source signal s(n) is full rank, which is assumed in the rest of this paper, the covariance matrix Rx has one and only one eigenvalue equal to zero. Consider the noisy channel case as described in (2) and let M=2. It follows from (1) that

    where x(n)=[x1T(n)) x2T(n)]T and v(n)=[v1T(n)) v2T(n)]T .

    If the correlation matrix of the vector x(n) is denoted by Rx, a direct of conclusion of (10) will be

    We note from (11) that h is the eigenvector of the correlation matrix Rx and is the corresponding eigenvector of Rx. The knowledge of can be obtained as a by product if wanted.

      >  B. Adaptive Algorithm

    In practice, it is simple to estimate iteratively the eigenvector corresponding to the minimum eigenvalue of Rx, by using an algorithm similar to the Frost algorithm that is a simple constrained LMS algorithm [7].

    Minimizing the quantity hHRxh with respect to h and subject to ∥h2=hHh=1 will give us the optimum weight hopt.

    Let us define the error signal

    where x(n)=[x1T(n)x2T(n)]T . Note that minimizing the mean square value of e(n) is equivalent to solving the above eigenvalue problem. Taking the gradient of e(n) with respect to h(n) gives

    and we obtain the gradient-descent constrained LMS algorithm:

    where μ, the adaptation step-size, is a positive constant. Substituting (13) and (14) into (15) gives

    and taking statistical expectation after convergence, we get

    which is what is desired: the eigenvector h(∞) corresponding to the smallest eigenvalue E[|e(n)|2] of the covariance matrix Rx.

    In practice, it is advantageous to use the following adaptation scheme

    The algorithm (18) presented above is very general to find the eigenvector corresponding to the smallest eigenvalue of any matrix Rx. If the smallest eigenvalue is equal to zero, which is the case here, the algorithm can be simplified as follows:


    IV. Simulation Results

    Computer simulations were conducted to evaluate the performance of the proposed algorithm in comparison with existing algorithms. In all the simulations, two channel SIMO model is assumed. This means two times oversampling or two sensors at the receiver in real situation. The input signal is 4-QAM. For simplicity of comparison, we assumed that the channel order Lis known. The performance index is achieved by examination the root mean square error (RMSE) that is defined as [4].

    where Nt is number of Monte Carlo trials, and is the estimate of the channels from the ith trial.

    We used real-measured microwave channel. The shortened length-16 version of an empirically measured T/2-spaced digital microwave radio channel ( M=2) with 230 taps, which we truncated to obtain a channel with L=7. The Microwave channel chan1.mat is founded at microwave.html.

    The shortened version is derived by linear decimation of the FFT of the full-length T/2-spaced impulse response and taking the IFFT of the decimated version (see [10] for more details on this channel). The channel coefficients for both sets of channels are listed in Table 1. A total number of 50 independent trials were performed. All algorithms were initiated at h(0)=[1, 0, ..., 0, 1, 0, ..., 0]T with the step size μ=0.01.

    Fig. 3 shows the RMSE of the channel estimates from existing algorithms and the proposed algorithm. From these figures, we can see that the proposed algorithm always performs better than others. By inspection, we can observe that RMSE values of the proposed method are decreased more or less 6-10 dB, and 1-2 dB under 20 dB, and 10 dB, respectively. Clearly, we can observe the significant improvement of the proposed algorithm over existing algorithms.

    V . Conclusion

    In this paper, an approach to channel identification has been presented. The method is based on eigenvalue decomposition. The eigenvector corresponding to the minimum eigenvalue of the covariance matrix of the received signals contains the channel impulse response. And we use a simple constrained LMS algorithm to estimate iteratively the eigenvector corresponding to the minimum eigenvalue. In comparison with algorithms, the proposed one seems to be more efficient in a low SNR channel and much more accurate.

  • 1. Haykin S. 1996 Adaptive Filter Theory google
  • 2. Baccala L. A., Roy S. 1994 “A new blind time-domain channel identification method based on cyclostationarity,” [IEEE Signal Processing Letters] Vol.1 P.89-92 google doi
  • 3. Tong L., Xu G., Kailath T. 1994 “Blind identification and equalization based on second order statistics: A time domain approach,” [IEEE Trans. Inform. Theory] Vol.40 P.340-349 google doi
  • 4. Xu G., Liu H., Tong L., Kailath T. 1995 “A least-squares approach to blind channel identification,” [IEEE Trans. Signal Processing] Vol.43 P.2982-2983 google doi
  • 5. Tong L., Perreau S. 1998 “Multichannel blind identification: from subspace to maximum likelihood methods,” [Proc. IEEE] Vol.86 P.1951-1968 google
  • 6. Gesbert D., Duhamel P. 2000 “Unbiased blind adaptive channel identification and equalization,” [IEEE Trans. Signal Processing] Vol.48 google
  • 7. Frost III O. L. 1972 “A algorithm for linearly constrained adaptive arrays,” [Proc. IEEE] Vol.60 P.926-935 google
  • 8. Heath Jr. R. W., Halford S. D., Giannakis G. B. 1997 “Adaptive blind channel identification of FIR channels for viterbi decoding,” [Proc. 31th Asilomar Conf. Signals, Syst., and Comput] google
  • 9. Higa Y., Ochi H., Kinjo S., Yamaguchi H. 1999 “A gradient type algorithm for blind system identification and equalizer based on second order statistics,” [IEICE Trans. Fundamentals] Vol.E32-A P.1544-1551 google
  • 10. Endres T. J., Halford S. D., Johnson C. R., Giannakis G. B. 1998 “Simulated comparisions of blind equalization algorithms for cold startup applications,” [Int J. Adaptive Contr. Signal Process] Vol.12 P.283-301 google doi
  • 11. Goekel D. L., Hero A. O., Stark W. E. 1998 “Data-recursive algorithms for blind channel identification in oversampled communication systems,” [IEEE Trans. Signal Processing] P.2217-2220 google
  • [그림1] 두 서브채널간 상관관계
    두 서브채널간 상관관계
  • [그림2] M 서브채널을 갖는 등가 SIMO 모델
    M 서브채널을 갖는 등가 SIMO 모델
  • [표 1.] 채널 계수
    채널 계수
  • [그림 3.] 제안 알고리즘과 기존 알고리즘의 RMSE 비교 (a) SNR=20dB and (b) SNR=10dB
    제안 알고리즘과 기존 알고리즘의 RMSE 비교 (a) SNR=20dB and (b) SNR=10dB