Next Article in Journal
Use of an Active Learning Strategy Based on Gaussian Process Regression for the Uncertainty Quantification of Electronic Devices
Previous Article in Journal
Novel and Compact Ultra-Wideband Wearable Band-Notch Antenna Design for Body Sensor Networks and Mobile Healthcare System
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Proceeding Paper

The Tap-Length Associated with the Blind Adaptive Equalization/Deconvolution Problem  †

Department of Electrical and Electronic Engineering, Ariel University, Ariel 40700, Israel
Presented at the 1st International Electronic Conference—Futuristic Applications on Electronics, 1–30 November 2020; Available online: https://iec2020.sciforum.net/.
Published: 30 October 2020

Abstract

:
The step-size parameter and the equalizer’s tap length are the system parameters in the blind adaptive equalization design. Choosing a large step-size parameter causes the equalizer to converge faster compared with applying a smaller value for the step size parameter. However, a higher step-size parameter leaves the system with a higher residual inter-symbol-interference (ISI) than does a lower step-size parameter. The equalizer’s tap length should be set large enough to compensate for the channel distortions. However, since the channel parameters are unknown, the required equalizer’s tap length is also unknown. The system parameters are usually designed via simulation trials, in such a way that the equalizer’s performance from the residual ISI point of view reaches a system desired residual ISI level. Recently, a closed-form approximated expression was derived for the residual ISI as a function of the system parameters, input sequence statistics and channel power. This expression was obtained under the assumption having a value for the equalizer’s tap length that is sufficient to compensate for the channel distortions. Based on this approximated expression, the outcome from the step-size parameter multiplied by the equalizer’s tap length can be derived when the residual ISI is given. By choosing a step-size parameter, we automatically have also the value for the equalizer’s tap length which might now not be large enough to compensate for the channel distortions and thus leaving the system with a higher residual ISI than the required one. In this work, we derive an expression that sets a condition on the equalizer’s tap length based on the input sequence statistics, on the chosen equalizer’s characteristics and required residual ISI. In addition, highlights are supplied on how to set the equalizer’s tap length for different channel cases based on this new derived expression. The findings are accompanied by simulation results.

1. Introduction

In this work we consider the blind adaptive equalization (blind adaptive deconvolution) problem [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19]. For a blind adaptive equalizer, the system designer needs to know how to choose correctly the step-size parameter and the equalizer’s tap length in order to obtain a system required residual inter-symbol-interference (ISI). According to [1], a higher value for the step-size parameter leads the equalizer entering the convergence state faster than for a lower step-size parameter. However, a higher value for the step-size parameter will leave the system with a higher residual ISI compared with a lower value for the step-size parameter [1]. A higher residual ISI may lead to a higher symbol error rate [20] which may no longer answer on the system’s requirements. In addition, a too high value for the step-size parameter may lead the equalizer to disconverge. The equalizer’s tap length should be set large enough to compensate for the channel distortions. Nevertheless, since the channel characteristics are practically unknown to the system designer, the required equalizer’s tap length is also unknown. It could be thought that choosing a very large value for the equalizer’s tap length is the right thing to do. However, according to [1], setting the value for the equalizer’s tap length too high, leads the system to a higher residual ISI than for setting the equalizer’s tap length with a lower value but with a value which still can compensate for the channel distortions. Usually, the step-size parameter and the equalizer’s tap length are obtained via simulation trials where the whole system with the equalizer is simulated. Obviously, the simulation trials waste a lot of time in the general system design. Recently [1,21], a closed-form approximated expression was derived for the achievable residual ISI case that depends on the step-size parameter, equalizer’s tap length, input signal statistics, signal-to-noise ratio (SNR), the chosen equalization method and channel power. This closed-form approximated expression for the residual ISI is applicable for blind adaptive equalizers where the error signal that participates in the update mechanism of the equalizer’s coefficients is a polynomial function of order up to three of the equalized sequence as it is in the case of Godard’s [2] algorithm. Based on this closed-form approximated expression for the residual ISI, the system designer has on hand the value for the step-size parameter multiplied by the equalizer’s tap length for a given residual ISI level. Both the closed-form approximated expressions for the residual ISI in [1,21] assumed to have a value for the equalizer’s tap length that is sufficient to compensate for the channel distortions. Thus, having the outcome of the step-size parameter multiplied by the equalizer’s tap length for a given residual ISI level is not enough for setting practical values for both the step-size parameter and equalizer’s tap length since by setting a high value for the step-size parameter for fast convergence might obtain to a value for the equalizer’s tap length that might not be able anymore to compensate for the channel distortions. In this work, we solve the problem of how to set correctly the equalizer’s tap length based on a new derived expression that sets a condition on the equalizer’s tap length. This new expression is based on the input sequence statistics, on the chosen equalizer’s characteristics and required residual ISI and is applicable for blind adaptive equalizer’s where the error signal that participates in the update mechanism of the equalizer’s coefficients is a polynomial function of order up to three of the equalized sequence. Simulation results confirm our findings.

2. Methods

In this section, we present the condition on the equalizer’s tap-length for the noiseless case.
Let us consider the following system (Figure 1 recalled from [22]), where we make the following assumptions according to [22]:
  • The input sequence x [ n ] can be written as x [ n ] = x r [ n ] + j x i [ n ] where x r [ n ] and x i [ n ] are the real and imaginary parts of x [ n ] respectively. x r [ n ] and x i [ n ] are independent, E [ x [ n ] x * [ n ] ] = σ x 2 and E [ x [ n ] ] = 0 (where E [ ( · ) ] stands for the expectation operator on ( · ) and ( ) * is the conjugate operation on ()). In addition: E [ x i 2 [ n ] ] = σ x i 2 , E [ x r 2 [ n ] ] = σ x r 2 , E [ x i G [ n ] ] = E [ x r G [ n ] ] where G is a positive and even integer.
  • The unknown channel h [ n ] is a possibly nonminimum phase linear time-invariant filter in which the transfer function has no “deep zeros”; namely, the zeros lie sufficiently far from the unit circle.
  • The filter c [ n ] is a tap-delay line.
  • w [ n ] = 0
The equalized output sequence can be written as:
z [ n ] = y [ n ] c [ n ] = x [ n ] h [ n ] c [ n ] = x [ n ] δ n + ξ n = x [ n ] + x [ n ] ξ n = x [ n ] + p [ n ]
with
p [ n ] = x [ n ] ξ n ; h [ n ] c [ n ] = δ n + ξ n
where “∗” stands for the convolutional operation, ξ [ n ] stands for the difference (error) between the ideal and the used value for c [ n ] following (3) and δ is the Kronecker delta function. The equalizer’s coefficients are updated according to [23]:
c ̲ [ n + 1 ] = c ̲ [ n ] μ F [ n ] z [ n ] y ̲ * [ n ]
where μ is the step-size parameter, F [ n ] is the cost function and c ̲ [ n ] is the equalizer vector where the input vector is y ̲ [ n ] = [ y [ n ] . . . y [ n N + 1 ] ] T . The operator ( ) T denotes for transpose of the function () and N is the equalizer’s tap length. In [1], a closed-form approximated expression was derived for the residual inter-symbol-interference (ISI) applicable for a blind adaptive equalizer where the cost function F [ n ] is a polynomial function of the equalized output sequence of order up to three:
I S I = 10 log 10 m p 10 log 10 σ x r 2
where E [ p r 2 [ n ] ] = m p , ( p [ n ] = p r [ n ] + j p i [ n ] ) and m p is obtained by:
m p = m i n S o l 1 m p 1 , S o l 2 m p 1 f o r S o l 1 m p 1 > 0 a n d S o l 2 m p 1 > 0 o r m p = m a x S o l 1 m p 1 , S o l 2 m p 1 f o r S o l 1 m p 1 · S o l 2 m p 1 < 0 w h e r e S o l 1 m p 1 = B 1 + B 1 2 4 A 1 C 1 B 2 A 1 ; S o l 2 m p 1 = B 1 B 1 2 4 A 1 C 1 B 2 A 1
A 1 = B 45 σ x r 2 a 3 2 + 18 σ x r 2 a 3 a 12 + 6 a 1 a 3 + 9 σ x r 2 a 12 2 + 2 a 1 a 12 2 3 a 3 + a 12 B 1 = B 12 σ x r 2 2 a 3 a 12 + 6 σ x r 2 2 a 12 2 + 12 σ x r 2 a 1 a 3 + 4 σ x r 2 a 1 a 12 + a 1 2 + 15 E x r 4 a 3 2 + 2 E x r 4 a 3 a 12 + E x r 4 a 12 2 2 a 1 + 3 σ x r 2 a 3 + σ x r 2 a 12 C 1 = 2 σ x r 2 2 a 1 a 12 + σ x r 2 a 1 2 + 2 E x r 4 σ x r 2 a 3 a 12 + E x r 4 σ x r 2 a 12 2 + 2 E x r 4 a 1 a 3 + E x r 6 a 3 2 B = μ N σ x 2 k = 0 k = R 1 h k n 2
R is the channel length, x r = x r [ n ] and a 1 , a 12 , a 3 are properties of the chosen equalizer and found by:
R e F n z n = a 1 z r + a 3 z r 3 + a 12 z r z i 2
where R e ( · ) is the real part of ( · ) and z r , z i are the real and imaginary parts of the equalized output z [ n ] respectively. In this paper we use Godard’s algorithm [2]. Thus we have:
F [ n ] z [ n ] = z [ n ] 2 E x [ n ] 4 E x [ n ] 2 z [ n ]
where | ( ) | stands for the absolute value of (). Please note that for Godard’s algorithm [2] we have that:
a 3 = a 12 = 1 ; a 3 = E x [ n ] 4 E x [ n ] 2
According to [1], when the convolutional noise power m p is a very small value, the solution for m p may be given by: m p C 1 B B 1 . Obviously, this solution for m p is less accurate compared to the solution derived from (5). It should be pointed out that the step-size parameter μ and the equalizer’s tap length N are associated with the function B (6). Thus, if the desired residual ISI is set in (5), we may derive the expected value for B (6) and thus design the system parameters ( μ and N). However, via the function B (6), we have only the outcome of μ N . Thus, if we set a value for the step-size parameter, we also have set automatically a value for the equalizer’s tap length via μ N . Nevertheless, this value N, may not be large enough to compensate for the channel distortions. For example, Figure 2 describes the equalizer’s performance from the residual ISI point of view as a function of the iteration number for Godard’s [2] algorithm, for μ = 0.00003 and for N = 13 . Figure 3 describes the equalized constellation output for the 16QAM (Quadrature Amplitude Modulation) input source (a modulation using ± {1,3} levels for in-phase and quadrature components) for μ = 0.00003 and N = 13 . According to Figure 2, the residual ISI at the convergence state is approximately 22 [dB]. The calculated value for B is B = 0.0039 where the channel is defined as:
CH1 (initial ISI = 0.88): The channel parameters are determined according to [1]:
h [ n ] = [ 0.4851, 0.72765, 0.4851] w h e r e k = 0 k = R 1 h k n 2 1 .
Next, according to (6), μ N = B / σ x 2 k = 0 k = R 1 h k n 2 = 0.00039 since σ x 2 = 10 for the 16QAM input sequence. Now, the value of 0.00039 for μ N can also be obtained approximately by using μ = 0.000056 with N = 7 or by using μ = 0.000078 with N = 5 . Figure 4 and Figure 5 describe the equalizer’s performance from the residual ISI point of view as a function of the iteration number for Godard’s [2] algorithm, for μ = 0.000056 with N = 7 and for μ = 0.000078 with N = 5 respectively. Figure 6 describes the equalized constellation output for the 16QAM input source for μ = 0.000078 and N = 5 . Please note that for the three cases: case1 where μ = 0.00003 with N = 13 , case2 where μ = 0.000056 with N = 7 and case3 where μ = 0.000078 with N = 5 , the value for B is approximately the same. Thus, the equalizer’s performance should have been the same for the three cases. However, this is not what we received. According to Figure 4 and Figure 5, the residual ISI at the convergence state is higher than 22 [dB] which implies having some degradation in the equalization performance from the residual ISI point of view. In addition, according to Figure 6, the equalized constellation output is not clear as it is in Figure 3. As a matter of fact, Figure 6 implies that the system suffers from a higher symbol error rate compared to the results from Figure 3. The explanation for not having the same equalization performance for the three cases may be due to the fact that the equalizer’s tap length is not long enough to compensate for the channel distortions. Thus, it is important to have an additional tool that can indicate something on the required equalizer’s tap length that has to be used in the system.
Theorem 1.
The equalizer’s tap length should be set according to:
N > > V 2 V 1 w i t h V 1 = 6 a 3 m p 2 2 a 12 m p 2 2 a 1 m p 6 σ x r 2 a 3 m p 2 σ x i 2 a 12 m p V 2 = 3 σ x r 2 a 3 m p 3 E x r 4 σ x r 2 a 3 m p
Proof of Theorem 1.
The expression for m p was obtained in [1] via the following expression [1]:
E Δ p r 2 2 a 3 3 m p 2 + a 12 m p 2 + a 12 m p σ x i 2 + 3 a 3 E p r 2 x r 2 + a 1 m p B + B 2 B ˜ B ˜ = 15 m p 3 a 3 2 + 2 a 3 a 12 3 m p 3 + 2 a 1 a 3 3 m p 2 + 15 a 3 2 E x r 2 p r 4 + 2 a 3 a 12 3 m p 2 σ x i 2 + a 12 2 3 m p 3 + 2 a 1 a 12 m p 2 + 12 a 3 a 12 E x r 2 p r 2 m p + 6 a 12 2 m p E x i 2 p i 2 + a 1 2 m p + 12 a 1 a 3 E x r 2 p r 2 + 2 a 1 a 12 m p σ x i 2 + 15 a 3 2 E x r 4 p r 2 + 12 a 3 a 12 E x r 2 p r 2 σ x i 2 + a 12 2 m p E x i 4 + a 12 2 3 m p 2 σ x r 2 + 2 a 1 a 12 m p σ x r 2 + 2 a 3 a 12 m p E x r 4 + 6 a 12 2 E x i 2 p i 2 σ x r 2 + a 1 2 σ x r 2 + 2 a 1 a 3 E x r 4 + 2 a 1 a 12 σ x i 2 σ x r 2 + a 3 2 E x r 6 + 2 a 3 a 12 σ x i 2 E x r 4 + a 12 2 E x i 4 σ x r 2
where E Δ p r 2 = E p r 2 n + 1 E p r 2 n . Please note that E Δ p r 2 was set to zero in [1] since at the convergence state, the variance of the convolutional noise at time index n and n + 1 are approximately the same. In addition, the following approximations were done in [1]:
E [ p r 2 x r 2 ] = E [ p i 2 x i 2 ] m p σ x r 2 E [ x r 2 p r 4 ] 3 σ x r 2 m p 2 E [ x r 4 p r 2 ] E x r 4 m p
Still, according to (2), x r and p r are related. Thus, more accurate expressions for (12) can be obtained. In this work, we also use (11) with E Δ p r 2 = 0 . Unlike the author in [1], we do not use the assumptions of (12). In this work, we derive new expressions for E [ p r 2 x r 2 ] , E [ x r 2 p r 4 ] and E [ x r 4 p r 2 ] . In order to do this, we need first to see the connection between m p and E [ ξ r 2 [ n ] ] where ξ r [ n ] is the real part of ξ [ n ] . In the following we denote ξ [ n ] as ξ . Based on (2), we may write:
p r [ n ] = R e k x r n k + j x i n k ξ r k + j ξ i k = k x r n k ξ r k k x i n k ξ i k
where ξ n = ξ r n + j ξ i n . By using (13) we may write:
E p r 2 = E k , r k , i m , r m , i = E k , r m , r + k , i m , i = N σ x r 2 E ξ r 2 + N σ x i 2 E ξ i 2 = 2 N σ x r 2 E ξ r 2 = m p where k , r = k x r n k ξ r k ; k , i = k x i n k ξ i k E k , r m , r = k m x r n k x r n m ξ r k ξ r m = k x r 2 n k ξ r 2 k = N σ x r 2 E ξ r 2 E k , i m , i = k m x i n k x i n m ξ i k ξ i m = k x i 2 n k ξ i 2 k = N σ x i 2 E ξ i 2 E ξ r 2 = E ξ i 2
Based on (14) we have:
E ξ r 2 = m p 2 N σ x r 2
Next, we turn to derive the expression for E x r 4 p r 2 :
E x r 4 p r 2 = E x r 4 k , r m , r + k , i m , i = E x r 4 k , r m , r + E x r 4 E k , i m , i = N 1 σ x r 2 E x r 4 E ξ r 2 + E x r 6 E ξ r 2 + E x r 4 N σ x i 2 E ξ i 2 where E x r 4 k , r m , r = E k m x r 4 n x r n k x r n m ξ r k ξ r m = E k = m k 0 + E k = m = 0 E k = m k 0 = N 1 σ x r 2 E x r 4 E ξ r 2 E k = m = 0 = E x r 6 E ξ r 2 E x r 4 E k , i m , i = E x r 4 N σ x i 2 E ξ i 2
Based on (15) and (16) we have:
E x r 4 p r 2 = E x r 4 m p E x r 4 m p 2 N + E x r 6 m p 2 N σ x r 2
Now, in order to derive the expression for E x r 2 p r 4 , we need first to get the relationship between E p r 4 and E ξ r 4 . By using (13) and (15), we may write:
E p r 4 = E k , r m , r s , r t , r + E k , i m , i s , i t , i + E k , r m , r s , i t , i + E k , i m , i s , r t , r + E k , r s , r m , i t , i + E k , i s , i m , r t , r + E k , r t , r m , i s , i + E k , i t , i m , r s , r = 2 N E ξ r 4 E x r 4 + 3 N 1 m p 2 2 N + 6 m p 2 4 = 3 m p 2 where E k , i m , i s , i t , i = E k , r m , r s , r t , r = E k m t s x r n k x r n m x r n t x r n s ξ r k ξ r m ξ r t ξ r s = E k = m = t = s + E k = m t = s k t + E k = t m = s k s + E k = s m = t k m = N E ξ r 4 E x r 4 + 3 N 1 N σ x r 2 σ x r 2 E ξ r 2 E ξ r 2 = N E ξ r 4 E x r 4 + 3 N 1 m p 2 4 N and E k = m = t = s = N E ξ r 4 E x r 4 E k = m t = s k t = E k = t m = s k s = E k = s m = t k m = N 1 N σ x r 2 σ x r 2 E ξ r 2 E ξ r 2 and where E k , r m , r s , i t , i = E k , r m , r E s , i t , i = N σ x r 2 E ξ r 2 N σ x i 2 E ξ i 2 = N σ x r 2 m p 2 N σ x r 2 N σ x i 2 m p 2 N σ x r 2 = m p 2 4 E k , r m , r s , i t , i = E k , i m , i s , r t , r = E k , r s , r m , i t , i = E k , i s , i m , r t , r = E k , r t , r m , i s , i = E k , i t , i m , r s , r
Now by using (17) we may write:
E ξ r 4 = 3 m p 2 4 N 2 E x r 4
Next we turn to derive the expression for E x r 2 p r 4 . By using (13), (15) and (19) we have:
E x r 2 p r 4 = E x r 2 k , r m , r s , r t , r + E x r 2 k , i m , i s , i t , i + E x r 2 k , r m , r s , i t , i + E x r 2 k , i m , i s , r t , r + E x r 2 k , r s , r m , i t , i + E x r 2 k , i s , i m , r t , r + E x r 2 k , r t , r m , i s , i + E x r 2 k , i t , i m , r s , r = E x r 6 3 m p 2 4 N 2 E x r 4 + σ x r 2 3 m p 2 + 3 E x r 4 m p 2 N σ x r 2 3 E x r 4 m p 2 2 N 2 σ x r 2 3 N σ x r 2 m p 2 + 3 4 N 2 σ x r 2 m p 2 where E x r 2 k , r m , r s , r t , r = E k m t s x r n k x r n m x r n t x r n s x r 2 n ξ r k ξ r m ξ r t ξ r s = E k = m = t = s + E k = m t = s k t + E k = t m = s k s + E k = s m = t k m = N 1 E x r 4 σ x r 2 E ξ r 4 + E x r 6 E ξ r 4 + 3 N 2 N 1 σ x r 2 σ x r 2 σ x r 2 E ξ r 2 E ξ r 2 + 3 2 N 1 σ x r 2 E x r 4 E ξ r 2 E ξ r 2 and E k = m = t = s = N 1 E x r 4 σ x r 2 E ξ r 4 + E x r 6 E ξ r 4 E k = m t = s k t = N 2 N 1 σ x r 2 σ x r 2 σ x r 2 E ξ r 2 E ξ r 2 + 2 N 1 σ x r 2 E x r 4 E ξ r 2 E ξ r 2 E k = m t = s k t = E k = t m = s k s = E k = s m = t k m and where E x r 2 k , i m , i s , i t , i = E x r 2 E k , i m , i s , i t , i = E x r 2 N E ξ i 4 E x i 4 + 3 N 1 m p 2 4 N = E x r 2 N 3 m p 2 4 N 2 E x r 4 E x i 4 + 3 N 1 m p 2 4 N = E x r 2 3 m p 2 4 N + 3 N 1 m p 2 4 N = σ x r 2 3 m p 2 4 E x r 2 k , r m , r s , i t , i = E x r 2 k , r m , r E s , i t , i = N σ x i 2 E ξ i 2 N 1 σ x r 2 σ x r 2 E ξ r 2 + E x r 4 E ξ r 2 = N σ x i 2 m p 2 N σ x r 2 N 1 σ x r 2 σ x r 2 m p 2 N σ x r 2 + E x r 4 m p 2 N σ x r 2 = m p 2 N 1 σ x r 2 m p 2 N + E x r 4 m p 2 N σ x r 2 where E x r 2 k , r m , r = E k m x r 2 n x r n k x r n m ξ r k ξ r m = E k = m k 0 + E k = m = 0 E k = m k 0 = N 1 σ x r 2 σ x r 2 E ξ r 2 ; E k = m = 0 = E x r 4 E ξ r 2 ; E s , i t , i = N σ x i 2 E ξ i 2 and E x r 2 k , r m , r s , i t , i = E x r 2 k , i m , i s , r t , r = E x r 2 k , r s , r m , i t , i = E x r 2 k , i s , i m , r t , r = E x r 2 k , r t , r m , i s , i = E x r 2 k , i t , i m , r s , r
Next we turn to derive the expression for E x r 2 p r 2 . By using (13)–(15) we may write:
E x r 2 p r 2 = E x r 2 k , r m , r + E x r 2 E k , i m , i = σ x r 2 m p σ x r 2 m p 2 N + E x r 4 m p 2 N σ x r 2 where E x r 2 E k , i m , i = σ x r 2 N σ x i 2 E ξ i 2 = σ x r 2 N σ x i 2 m p 2 N σ x r 2 = σ x i 2 m p 2 E x r 2 k , r m , r = E k m x r 2 n x r n k x r n m ξ r k ξ r m = E k = m k 0 + E k = m = 0 = N 1 σ x r 2 σ x r 2 E ξ r 2 + E x r 4 E ξ r 2 = N 1 σ x r 2 m p 2 N + E x r 4 m p 2 N σ x r 2 and E k = m k 0 = N 1 σ x r 2 σ x r 2 E ξ r 2 ; E k = m = 0 = E x r 4 E ξ r 2
Now we substitute the expressions for E p r 2 x r 2 (21), E x r 2 p r 4 (20), E x r 4 p r 2 (17) and E p i 2 x i 2 ( E p i 2 x i 2 = E p r 2 x r 2 ) into (11) and obtain:
E Δ p r 2 V b + b 2 S where V = V 1 N + V 2 V 1 = 6 a 3 m p 2 2 a 12 m p 2 2 a 1 m p 6 σ x r 2 a 3 m p 2 σ x i 2 a 12 m p V 2 = 3 σ x r 2 a 3 m p 3 E x r 4 σ x r 2 a 3 m p S = A 1 N 2 + A 2 N + A 3 A 1 = 2 σ x i 2 σ x r 2 a 1 a 12 + 12 σ x i 2 σ x r 2 a 3 a 12 m p + 2 σ x i 2 a 1 a 12 m p + 6 σ x i 2 a 3 a 12 m p 2 + 2 E x r 4 σ x i 2 a 3 a 12 + 6 σ x r 4 a 12 2 m p + σ x r 2 a 1 2 + 12 σ x r 2 a 1 a 3 m p + 2 σ x r 2 a 1 a 12 m p + 45 σ x r 2 a 3 2 m p 2 + 12 σ x r 2 a 3 a 12 m p 2 + 9 σ x r 2 a 12 2 m p 2 + E x r 4 σ x r 2 a 12 2 + a 1 2 m p + 6 a 1 a 3 m p 2 + 2 E x r 4 a 1 a 3 + 2 a 1 a 12 m p 2 + 15 a 3 2 m p 3 + 15 E x r 4 a 3 2 m p + E x r 6 a 3 2 + 6 a 3 a 12 m p 3 + 2 E x r 4 a 3 a 12 m p + 3 a 12 2 m p 3 + E x r 4 a 12 2 m p A 2 = 3 E x r 4 a 12 2 m p 15 2 E x r 4 a 3 2 m p 45 σ x r 2 a 3 2 m p 2 3 σ x r 2 a 12 2 m p 2 3 σ x r 4 a 12 2 m p 6 σ x r 2 a 3 a 12 m p 2 + 45 E x r 4 σ x r 2 a 3 2 m p 2 + 3 E x r 4 σ x r 2 a 12 2 m p 2 6 σ x r 2 a 1 a 3 m p + 15 2 E x r 6 σ x r 2 a 3 2 m p + 6 E x r 4 σ x r 2 a 3 a 12 m p 2 6 σ x i 2 σ x r 2 a 3 a 12 m p + 6 E x r 4 σ x r 2 a 1 a 3 m p + 6 E x r 4 σ x i 2 σ x r 2 a 3 a 12 m p A 3 = 45 4 σ x r 2 a 3 2 m p 2 45 2 E x r 4 σ x r 2 a 3 2 m p 2 + 45 4 E x r 6 E x r 4 a 3 2 m p 2 b = μ σ x 2 k = 0 k = R 1 h k n 2
Next we set E Δ p r 2 = 0 and with the help of (22) we obtain for b 0 :
b = V S = V 1 N + V 2 A 1 N 2 + A 2 N + A 3
Now, according to B (6), we have a linear relation between the step-size parameter μ and the equalizer’s tap length N which was obtained in [1] under the assumption that the equalizer reaches a relative low residual ISI with the selected equalizer’s tap length N. Therefore, if we have that:
A 1 > A 2 ; A 1 > A 3 V 1 N > > V 2 N > > V 2 V 1
We obtain a linear relation between the step-size parameter μ and the equalizer’s tap length N and obtain a condition on the parameter N. Please note that for m p 0 , the inequalities A 1 > A 2 and A 1 > A 3 are always true. Figure 7 describes the step-size parameter μ calculated via (23) for the 16QAM input case, valid for CH1 and for Godard’s algorithm, as a function of the equalizer’s tap length N for three levels of residual ISI. It should be pointed out that when the equalizer leaves the system with a residual ISI of 15.6 dB, the system will suffer from a relative high symbol error rate compared to the case where the residual ISI is 23.6 dB or 22.5 dB. According to Figure 7, there is a range of values for N, where the relation between the step-size parameter μ and the equalizer’s tap length N is approximately linear.
Now, let us examine the expression of V 2 V 1 (24) for three cases of residual ISI (three cases of m p ), for the 16QAM input case, CH1 and for Godard’s algorithm:
case1: ISI = 22.5 dB ( m p = 0.027992 ):
N > > V 2 V 1 = 0.694 45 20 V 2 V 1 14
case2: ISI = 23.6 dB ( m p = 0.0218233 ):
N > > V 2 V 1 = 0.696 94 20 V 2 V 1 14
case3: ISI = 15.6 dB ( m p = 0.1378045 ):
N > > V 2 V 1 = 0.652 95 20 V 2 V 1 13
According to Figure 7, a tap length of N = 13 or N = 14 is lying approximately on the linear curve of the step-size parameter μ as a function of the equalizer’s tap length N. □

3. Discussion

In the previous section we have shown that by multiplying the expression of V 2 V 1 by twenty gives a value for N that is lying approximately on the linear curve of μ as a function of N. Now, let us choose N = 13 for the three cases of the desired residual ISI from the previous section ( I S I = 22.5 dB, I S I = 23.6 dB, I S I = 15.6 dB) and calculate the step-size parameter μ via (4)–(6) for the 16QAM input case, CH1 and Godard’s [2] algorithm. According to (4)–(6):
  • case1: ISI = 22.5 dB ( m p = 0.027992 ): B = 3 . 291 3 × 10 3 μ = 2 . 531 8 × 10 5
  • case2: ISI = 23.6 dB ( m p = 0.0218233 ): B = 2 . 600 3 × 10 3 μ = 2 . 000 2 × 10 5
  • case3: ISI = 15.6 dB ( m p = 0.1378045 ): B = 1 . 300 2 × 10 2 μ = 1 . 000 2 × 10 4
Next, we will show that the obtained values for μ via (4)–(6) for N = 13 really achieve the desired residual ISI. Figure 8 shows the simulated equalization performance from the residual ISI point of view for the 16QAM input case, CH1, N = 13 and for Godard’s [2] algorithm. According to Figure 8, the obtained values for μ via (4)–(6) really achieve the desired residual ISI for N = 13 .
Now, let us compare the values for the step-size parameter μ obtained via (4)–(6) with those obtained via Figure 7 for N = 13 . Figure 9 and Figure 10 are zoomed in versions of Figure 7.
According to Figure 9 and Figure 10, there is a high correlation between the obtained values for μ via (4)–(6) with those obtained from Figure 9 and Figure 10 for N = 13 . Thus, multiplying the expression of V 2 V 1 (24) by twenty gives a good working value for N for CH1. However, since CH1 is considered as an easy channel, the expression of V 2 V 1 (24) should be multiplied by a factor greater than twenty (maybe thirty or more) for harder channels.
Please note that for small values for m p , the expression of V 2 V 1 is approximately independent with m p . The equalizer’s tap length should be set large enough such that it can compensate for the channel distortions regardless of the desired residual ISI. Thus, the equalizer’s tap length N should be derived for the low valued m p case.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Pinchas, M. A Closed Approximated Formed Expression for the Achievable Residual Intersymbol Interference Obtained by Blind Equalizers. Signal Process. 2010, 90, 1940–1962. [Google Scholar] [CrossRef]
  2. Godard, D.N. Self recovering equalization and carrier tracking in two-dimenional data communication system. IEEE Trans. Commun. 1980, 28, 1867–1875. [Google Scholar] [CrossRef]
  3. Nikias, C.L.; Petropulu, A.P. (Eds.) Higher-Order Spectra Analysis a Nonlinear Signal Processing Framework; Prentice-Hall: Enlewood Cliffs, NJ, USA, 1993; Chapter 9; pp. 419–425. [Google Scholar]
  4. Haykin, S. Adaptive Filter Theory. In Blind deconvolution; Haykin, S., Ed.; Prentice-Hall: Englewood Cliffs, NJ, USA, 1991; Chapter 20. [Google Scholar]
  5. Pinchas, M. A novel expression for the achievable MSE performance obtained by blind adaptive equalizers. Signal Image Video Process. 2013, 7, 67–74. [Google Scholar] [CrossRef]
  6. Shalvi, O.; Weinstein, E. New criteria for blind deconvolution of nonminimum phase systems (channels). IEEE Trans. Inf. Theory 1990, 36, 312–321. [Google Scholar] [CrossRef]
  7. Gul, M.M.U.; Sheikh, S.A. Design and implementation of a blind adaptive equalizer using Frequency Domain Square Contour Algorithm. Digit. Signal. Process. 2010, 20, 1697–1710. [Google Scholar]
  8. Sheikh, S.A.; Fan, P. New Blind Equalization techniques based on improved square contour algorithm. Digit. Signal. Process. 2008, 18, 680–693. [Google Scholar] [CrossRef]
  9. Thaiupathump, T.; He, L.; Kassam, S.A. Square contour algorithm for blind equalization of QAM signals. Signal Process. 2006, 86, 3357–3370. [Google Scholar] [CrossRef]
  10. Sharma, V.; Raj, V.N. Convergence and performance analysis of Godard family and multimodulus algorithms for blind equalization. IEEE Trans. Signal Process. 2005, 53, 1520–1533. [Google Scholar] [CrossRef]
  11. Yuan, J.T.; Lin, T.C. Equalization and Carrier Phase Recovery of CMA and MMA in BlindAdaptive Receivers. IEEE Trans. Signal Process. 2010, 58, 3206–3217. [Google Scholar] [CrossRef]
  12. Yuan, J.T.; Tsai, K.D. Analysis of the multimodulus blind equalization algorithm in QAM communication systems. IEEE Trans. Commun. 2005, 53, 1427–1431. [Google Scholar] [CrossRef]
  13. Wu, H.C.; Wu, Y.; Principe, J.C.; Wang, X. Robust switching blind equalizer for wireless cognitive receivers. IEEE Trans. Wirel. Commun. 2008, 7, 1461–1465. [Google Scholar]
  14. Pinchas, M.; Bobrovsky, B.Z. A Maximum Entropy approach for blind deconvolution. Signal Process. 2006, 86, 2913–2931. [Google Scholar] [CrossRef]
  15. Abrar, S.; Nandi, A.S. Blind Equalization of Square-QAM Signals: A Multimodulus Approach. IEEE Trans. Commun. 2010, 58, 1674–1685. [Google Scholar] [CrossRef]
  16. Vanka, R.N.; Murty, S.B.; Mouli, B.C. Performance comparison of supervised and unsupervised/blind equalization algorithms for QAM transmitted constellations. In Proceedings of the 2014 International Conference on Signal Processing and Integrated Networks (SPIN), Noida, India, 20–21 February 2014; pp. 316–321. [Google Scholar]
  17. Ram Babu, T.; Kumar, P.R. Blind Channel Equalization Using CMA Algorithm. In Proceedings of the 2009 International Conference on Advances in Recent Technologies in Communication and Computing, Kottayam, Kerala, India, 27–28 October 2009; pp. 680–683. [Google Scholar]
  18. Qin, Q.; Huahua, L.; Tingyao, J. A new study on VCMA-based blind equalization for underwater acoustic communications. In Proceedings of the Proceedings 2013 International Conference on Mechatronic Sciences, Electric Engineering and Computer (MEC), Shengyang, China, 20–22 December 2013; pp. 3526–3529. [Google Scholar]
  19. Miranda, M.D.; Silva, M.T.M.; Nascimento, V.H. Avoiding Divergence in the Shalvi Weinstein Algorithm. IEEE Trans. Signal Process. 2008, 56, 5403–5413. [Google Scholar] [CrossRef]
  20. Pinchas, M. Symbol Error Rate as a Function of the Residual ISI Obtained by Blind Adaptive Equalizers for the SIMO and Fractional Gaussian Noise Case. Math. Probl. Eng. 2013, 2013, 860389. [Google Scholar] [CrossRef]
  21. Pinchas, M. Residual ISI Obtained by Blind Adaptive Equalizers and Fractional Noise. Math. Probl. Eng. 2013, 2013, 972174. [Google Scholar] [CrossRef]
  22. Goldberg, H.; Pinchas, M. A Novel Technique for Achieving the Approximated ISI at the Receiver for a 16QAM Signal sent via a FIR Channel based only on the Received Information and Statistical Techniques. Entropy 2020, 22, 708. [Google Scholar] [CrossRef] [PubMed]
  23. Nandi, A.K. (Ed.) Blind Estimation Using Higher-Order Statistics; Kluwer Academic: Boston, MA, USA, 1999; Chapter 2. [Google Scholar]
Figure 1. Block diagram of the system.
Figure 1. Block diagram of the system.
Engproc 03 00002 g001
Figure 2. Equalizer’s performance from the residual inter-symbol-interference (ISI) point of view for μ = 0.00003 and N = 13 .
Figure 2. Equalizer’s performance from the residual inter-symbol-interference (ISI) point of view for μ = 0.00003 and N = 13 .
Engproc 03 00002 g002
Figure 3. Equalized Constellation output for μ = 0.00003 and N = 13 .
Figure 3. Equalized Constellation output for μ = 0.00003 and N = 13 .
Engproc 03 00002 g003
Figure 4. Equalizer’s performance from the residual ISI point of view for μ = 0.000056 and N = 7 .
Figure 4. Equalizer’s performance from the residual ISI point of view for μ = 0.000056 and N = 7 .
Engproc 03 00002 g004
Figure 5. Equalizer’s performance from the residual ISI point of view for μ = 0.000078 and N = 5 .
Figure 5. Equalizer’s performance from the residual ISI point of view for μ = 0.000078 and N = 5 .
Engproc 03 00002 g005
Figure 6. Equalized Constellation output for μ = 0.000078 and N = 5 .
Figure 6. Equalized Constellation output for μ = 0.000078 and N = 5 .
Engproc 03 00002 g006
Figure 7. The step-size parameter calculated via (23) for the 16QAM input case, valid for CH1 and for Godard’s algorithm, as a function of the equalizer’s tap length for three levels of residual ISI.
Figure 7. The step-size parameter calculated via (23) for the 16QAM input case, valid for CH1 and for Godard’s algorithm, as a function of the equalizer’s tap length for three levels of residual ISI.
Engproc 03 00002 g007
Figure 8. Equalizer’s performance from the residual ISI point of view for N = 13 .
Figure 8. Equalizer’s performance from the residual ISI point of view for N = 13 .
Engproc 03 00002 g008
Figure 9. The step-size parameter calculated via (23) for the 16QAM input case, valid for CH1 and for Godard’s algorithm, as a function of the equalizer’s tap length for three levels of residual ISI.
Figure 9. The step-size parameter calculated via (23) for the 16QAM input case, valid for CH1 and for Godard’s algorithm, as a function of the equalizer’s tap length for three levels of residual ISI.
Engproc 03 00002 g009
Figure 10. The step-size parameter calculated via (23) for the 16QAM input case, valid for CH1 and for Godard’s algorithm, as a function of the equalizer’s tap length for three levels of residual ISI.
Figure 10. The step-size parameter calculated via (23) for the 16QAM input case, valid for CH1 and for Godard’s algorithm, as a function of the equalizer’s tap length for three levels of residual ISI.
Engproc 03 00002 g010
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Pinchas, M. The Tap-Length Associated with the Blind Adaptive Equalization/Deconvolution Problem . Eng. Proc. 2020, 3, 2. https://0-doi-org.brum.beds.ac.uk/10.3390/IEC2020-06968

AMA Style

Pinchas M. The Tap-Length Associated with the Blind Adaptive Equalization/Deconvolution Problem . Engineering Proceedings. 2020; 3(1):2. https://0-doi-org.brum.beds.ac.uk/10.3390/IEC2020-06968

Chicago/Turabian Style

Pinchas, Monika. 2020. "The Tap-Length Associated with the Blind Adaptive Equalization/Deconvolution Problem " Engineering Proceedings 3, no. 1: 2. https://0-doi-org.brum.beds.ac.uk/10.3390/IEC2020-06968

Article Metrics

Back to TopTop