Concurrent Modified Constant Modulus Algorithm and Decision Directed Scheme With Barzilai-Borwein Method

At present, in robot technology, remote control of robot is realized by wireless communication technology, and data anti-interference in wireless channel becomes a very important part. Any wireless communication system has an inherent multi-path propagation problem, which leads to the expansion of generated symbols on a time scale, resulting in symbol overlap and Inter-symbol Interference (ISI). ISI in the signal must be removed and the signal restores to its original state at the time of transmission or becomes as close to it as possible. Blind equalization is a popular equalization method for recovering transmitted symbols of superimposed noise without any pilot signal. In this work, we propose a concurrent modified constant modulus algorithm (MCMA) and the decision-directed scheme (DDS) with the Barzilai-Borwein (BB) method for the purpose of blind equalization of wireless communications systems (WCS). The BB method, which is two-step gradient method, has been widely employed to solve multidimensional unconstrained optimization problems. Considering the similarity of equalization process and optimization process, the proposed algorithm combines existing blind equalization algorithm and Barzilai-Borwein method, and concurrently operates a MCMA equalizer and a DD equalizer. After that, it modifies the DD equalizer's step size (SS) by the BB method. Theoretical investigation was involved and it demonstrated rapid convergence and improved equalization performance of the proposed algorithm compared with the original one. Additionally, the simulation results were consistent with the proposed technique.

Introduction

As is known, inter-symbol interference (ISI) is a major impairment for improvement in capacity or data transmission rate in wireless communication systems (WCS), especially in the field of robot wireless control (Lewis et al., 2020; Ye et al., 2020). Over the past decades, a variety of equalization methods, as well as channel estimation algorithms (Macchi and Eweda, 1984; Johnson et al., 1998; Yang et al., 2002; Chen and Chng, 2004; Ashmawy et al., 2009; Liyi et al., 2009; Yuan and Lin, 2010; Kim et al., 2012; Bhotto and Bajić, 2015; Haykin, 2015; Shah et al., 2017), have been proposed to relieve the ISI effects, thus compensating for channel distortion. The essence of equalization is to filter the signal, and the adaptive filter can automatically adjust its tap system, so as to achieve the best channel compensation effect. As the adjustment strategy of tap coefficient of adaptive filter, adaptive algorithm plays a decisive role in the filtering effect. In general, the adaptive equalizer needs to send a known training sequence to adjust the adaptive equalizer before sending signals, so as to achieve the best equalization effect. However, in the actual communication, the receiver cannot obtain any known information. Blind equalization (BE) is a method widely used for recovery of transmitted symbols of superimposed noise without providing the desired response externally (Yang et al., 2002). The constant modulus algorithm (CMA) (Johnson et al., 1998) is regarded as the most classical BE algorithm, in virtue of its simple mechanism, good stability, and high efficiency. The approach, however, takes longer to converge and barely achieve reasonable mean square error (MSE). The result obtained may not be able to ensure good system performance, which is a serious weakness of consideration.

Researchers have put forward a number of interesting solutions (Macchi and Eweda, 1984; Chen and Chng, 2004; Ashmawy et al., 2009; Liyi et al., 2009; Yuan and Lin, 2010; Kim et al., 2012; Bhotto and Bajić, 2015; Elsidig and Babiker, 2018) to this problem. Liyi et al. (2009) proposed a variable step size (VSS) technique and applied it to CMA for 16 quadrature amplitude modulation (QAM) signals. It improves the performance of the equalizer to some extent. However, it fails to take the higher-order QAM signals into account, which is another problem of this approach. On this basis, the modified constant modulus algorithm (MCMA) (Liyi et al., 2009) was proposed, which could improve the CMA performance by achieving low steady-state (SS) MSE. Also, joint carrier phase recovery is no longer needed. An alternative solution is switching to a decision directed (DD) mode, which does not require a threshold level or estimating the state of convergence and can minimize the SSMSE of remaining CMA (Macchi and Eweda, 1984). However, to make the transfer successful, the SSMSE of the CMA must be sufficiently low (Chen and Chng, 2004). In fact, CMA may not be able to achieve MSE as expected, at such a low level. Another possible method is to combine the existing blind equalization algorithm with the optimization algorithm to obtain improved equalization performance.

Generally, the optimization problem is to optimize the value of the variable x so as to minimize the objective function f(x). Non-linear optimization means that f(x) is essentially a non-linear one. There are many kinds of non-linear optimization algorithms, which can be divided into line search and trust region according to the different iterative methods, including the Newton method and the quasi Newton method, according to the different second-order approximation methods. For non-linear multidimensional unconstrained problems, gradient method is the simplest and the most basic. It has the advantages of simplicity and reliability, but its disadvantage is slow convergence. The selection of step size (SS) in gradient method has a great influence on the algorithm. After the Barzilai-Borwein (BB) method size is proposed, a new research upsurge of gradient method has arisen. Because there are many similarities between the optimization process of gradient method and the equalization process of blind equalization algorithm, the combination of the two methods can be considered to improve its performance based on the original equalization process.

In this study, we focus on the joint MCMA-DD equalization algorithm (Ashmawy et al., 2009) and propose a concurrent MCMA and DD with the Barzilai-Borwein (BB) method (Barzilai and Borwein, 1988) blind equalization algorithm for the WCSs using QAM signals. In the previous study (Macchi and Eweda, 1984), the authors have suggested concurrent operation of a DD equalizer and a CMA equalizer, instead of switching to a DD scheme after convergence of the CMA. The method is also applicable to MCMA. Concurrent MCMA and DD equalizers have significant improvements in equalization performance over MCMA. Based on the output error of blind equalizer (BE), the proposed method could adjust the SS of the weight with updating formula by using BB method. It could further enhance the convergence speed (CS), maintain the ISI and reduce the SSMSE.

Blind Equalization

System Model

For an adaptive blind channel equalization (BCE) system, the signal that is received for the interval of the kth symbol x(k) could be calculated by:

$\begin{array}{ll}x(k)={\displaystyle \sum _{i=0}^{L-1}}h(i)s(k-i)+v(k)& (1)\end{array}$

where h(k) refers to the impulse response. The transmitted sequence s(k) is determined based on the QAM signal set. v(k) is taken as additive white Gaussian noise (AWGN) with mean of 0 and variance of σ². Hence, the actual equalizer output may be written as

$\begin{array}{ll}\stackrel{\wedge }{s(k)}=w^T(k)x(k)& (2)\end{array}$

where $w(k)={\left[w_0(k),w_1(k),\cdots ,w_{N-1}(k)\right]}^T$ refers to the weight vector (WV) of the BE and x(k) = [x(k), x(k − 1), ⋯ , x(k − N + 1)]^T refers to the received sample vector.

Concurrent MCMA and DD

The MCMA changes the cost function of CMA (Shah et al., 2017) from real field to complex field, and its cost function is:

$\begin{array}{ll}{\psi }_{MCMA}(k)={\psi }_{MCMA,R}(k)+{\psi }_{MCMA,I}(k)& (3)\end{array}$

where ψ_MCMA,R(k) and ψ_MCMA,I(k) are the cost functions for real and imaginary parts, respectively.

The MCMA equalizer output $\stackrel{\wedge }{s(k)}$ could be calculated by

$\begin{array}{ll}\stackrel{\wedge }{s(k)}=w_{MCMA}^T(k)x(k)& (4)\end{array}$

The equalizer WV w_MCMA(k)can be updated by:

$\begin{array}{l}{w}_{MCMA}(k+1)=w_{MCMA}(k)-{\mu }_{MCMA}\nabla {\psi }_{MCMA}(k)\\ =w_{MCMA}(k)-{\mu }_{MCMA}{e}_{MCMA}(k)x^{*}(k)& (5)\end{array}$

where μ_MCMA is the step size.

The error signal e_MCMA(k) = e_{MCMA, R}(k)+je_{MCMA, I}(k) is given by

$\begin{array}{ll}{e}_{MCMA,R}(k)=\stackrel{\wedge }{s_R(k)}({\left|\stackrel{\wedge }{s_R(k)}\right|}^2-R_R)& (6)\end{array}$

$\begin{array}{ll}{e}_{MCMA,I}(k)=\stackrel{\wedge }{s_I(k)}({\left|\stackrel{\wedge }{s_I(k)}\right|}^2-R_I)& (7)\end{array}$

where R is a normal number.

For CMA algorithm, when e(k) = 0, ${\left|\stackrel{\wedge }{s(k)}\right|}^2-R=0$, it is proved that the algorithm tends to make the equalized signal fall on the circle with $\sqrt{R}$ as the radius. In the MCMA algorithm, the real part and the imaginary part of the signal are handled separately. When e(k) = 0, ${\left|\stackrel{\wedge }{s_R(k)}\right|}^2-R_R=0$ and ${\left|\stackrel{\wedge }{s_I(k)}\right|}^2-R_I=0$ are both valid. After equalization, the real part of the signal will fall on the real axis $\pm \sqrt{R_R}$, and the imaginary part will attempt to fall on the virtual axis $\pm \sqrt{R_I}$. The error signal tracks of both are shown in Figure 1. After comparing the convergence of error signal e(k) between CMA and MCMA, it is not difficult to see that the MCMA comprehensively considers the amplitude and phase equalization, which can correct the phase deflection during transmission to a certain extent and achieve a better equalization effect. The concurrent MCMA and DD algorithm involves a MCMA equalizer and a DD equalizer, which concurrently operate. Explicitly, let w = w_MCMA + w_DD, where w_DD refers to the WV of the DD equalizer.

FIGURE 1

Figure 1. Error signal track of CMA and MCMA.

Figure 2 shows the baseband model of the concurrent MCMA and DD blind channel equalization system.

FIGURE 2

Figure 2. The baseband model of the concurrent MCMA and DD BCE system.

The cost function of the DD equalizer is:

$\begin{array}{ll}{\psi }_{DD}(k)=E[{|\mathbb{Q}[\stackrel{\wedge }{s(k)}]-\stackrel{\wedge }{s(k)}|}^2]& (8)\end{array}$

where $\mathbb{Q}\left[\stackrel{\wedge }{s(k)}\right]$ is the equalizer output of the quantized MCMA:

$\begin{array}{ll}\mathbb{Q}\left[\stackrel{\wedge }{s(k)}\right]=arg{\displaystyle \underset{s(k)\in S}{min}}{|\stackrel{\wedge }{s(k)}-s(k)|}^2& (9)\end{array}$

The DD adaptation is performed immediately after MCMA adaptation. The equalizer output could be calculated by:

$\begin{array}{ll}\stackrel{\wedge }{s(k)}=w_{MCMA}^T(k+1)x(k)+w_{DD}^T(k)x(k)& (10)\end{array}$

The DD equalizer updated coefficient is expressed as

$\begin{array}{l}{w}_{DD}(k+1)=w_{DD}(k)-{\mu }_{DD}\nabla {\psi }_{DD}(k)\\ =w_{DD}(k)-2{\mu }_{DD}{e}_{DD}(k)x^{*}(k)& (11)\end{array}$

where μ_DD denotes the SS of the DD equalizer and $e_{DD}(k)=\stackrel{\wedge }{s(k)}-\mathbb{Q}\left[(\stackrel{\wedge }{s(k)})\right]$ is the value of the estimated error.

It could be seen that the updated w_DD occurs after the CMA equalization and before the equalizer hard decision. Compared to pure MCMA, concurrent MCMA and DD adaptation exhibits improved CS and reduced SSMSE. The μ_DD chosen can be significantly larger than μ_MCMA.

The Proposed Concurrent MCMA and DD With BB Method

The BB Method

For multidimensional unconstrained optimization problems, i.e., ${\displaystyle \underset{x\in {\Re }_n}{min}}f(x)$, the gradient method is the simplest solution, which employs the negative gradient direction as the search direction. The iteration formula for this method is

$\begin{array}{ll}{x}_{k+1}=x_k-{\lambda }_k{g}_k& (12)\end{array}$

where λ_k is the iteration step and g_k = ∇f(x_k) is the search direction.

The BB method, also known as the two-step gradient method, was initially proposed by Barzilai and Borwein (1988). It was applied to solve various unconstrained optimization problems (Dai et al., 2006; Nesterov, 2013; Tan et al., 2016) later. The method has an improved convergence rate compared with the gradient method. The proposal of Barzilai and Borwein SS factor has raised the upsurge of studying gradient method, and some new methods have also emerged (Li et al., 2019).

The fundamental concept of the BB method is to use the information of the current point and the previous point to determine the step factor and convert Equation (12) to

$\begin{array}{ll}{x}_{k+1}=x_k-D_k{g}_k& (13)\end{array}$

where D_k = λ_kI, I is the unit matrix. In order to make D_k own “quasi-Newton” properties, calculate λ_k to satisfy the formula

$\begin{array}{ll}min{\Vert d_{k-1}-D_k{\tilde{g}}_{k-1}\Vert }_2& (14)\end{array}$

or

$\begin{array}{ll}min{\Vert {\displaystyle D_k^{\text{-}1}}{d}_{k-1}-{\tilde{g}}_{k-1}\Vert }_2& (15)\end{array}$

where d_k−1 = x_k − x_k−1 and ${\tilde{g}}_{k-1}=g_k-g_{k-1}$.

From Equations (13, 14), the formulas

$\begin{array}{ll}{\lambda }_k=d_{k-1}^T{\tilde{g}}_{k-1}/{\Vert {\tilde{g}}_{k-1}\Vert }_2^2& (16)\end{array}$

and

$\begin{array}{ll}{\lambda }_k={\Vert d_{k-1}\Vert }_2^2/d_{k-1}^T{\tilde{g}}_{k-1}& (17)\end{array}$

can be obtained.

Barzilai and Borwein have proved that the algorithm, whose SS is determined by Equations (16, 17), is linearly convergent in R domain, and the convergence order is $\sqrt{2}$. The result is true for almost initial values.

The algorithm flow of BB method is shown in Algorithm 1.

ALGORITHM 1

Algorithm 1. Barzilai and Borwein method.

The Concurrent MCMA and DD With BB Method

We considered applying Equation (17) to update the value of μ_DD in concurrent MCMA and DD algorithm, which could improve the CS. Thus μ_DD(k) may be expressed as

$\begin{array}{ll}{\mu }_{DD}(k)={\Vert d(k)\Vert }_2^2/d^T(k)\tilde{g}(k)& (18)\end{array}$

where

$\begin{array}{ll}d(k)=x(k+1)-x(k)& (19)\end{array}$

and

$\begin{array}{l}\tilde{g}(k)=\nabla {\psi }_{DD}(k+1)-\nabla {\psi }_{DD}(k)\\ =2e_{DD}(k+1)x^{*}(k+1)-2e_{DD}(k)x^{*}(k)& (20)\end{array}$

Equation (11) can be changed to

$\begin{array}{l}{w}_{DD}(k+1)=w_{DD}(k)-{\mu }_{DD}(k)\nabla {\psi }_{DD}(k)\\ =w_{DD}(k)-2{\mu }_{DD}(k)e_{DD}(k)x^{*}(k)& (21)\end{array}$

The entire BE process is summarized in Algorithm 2.

ALGORITHM 2

Algorithm 2. The proposed algorithm.

From what has been discussed above, it is obvious that the value of μ_DD is mainly related to $\tilde{g}(k)$. MCMA has performed better in the initial stage of the equalization iteration and plays a leading role at this stage. The difference of the estimation error decreases gradually but the μ_DD gradually increases with the progress of the equalization iteration process, which makes DD take the dominant position. Hence, the convergence has been accelerated and the SSMSE has been further reduced.

Performance Analysis and Simulation Results

Performance of the proposed concurrent MCMA and DD with BB algorithm was demonstrated by means of simulations. Generally, the performance of BE algorithm is mainly evaluated using convergence rate, average stability error, ISI residual, computational complexity, algorithm implementation difficulty and other indicators. Convergence rate, MSE and ISI are the three most important indicators. The CS is indeed closely related to the applicability of the real-time systems. MSE and ISI are closely related to the error correction ability after the algorithm converges, which directly affects its performance. Therefore, the equalizer should shorten the convergence time as much as possible and improve the CS without sacrificing the average error. The MSE was defined as

$\begin{array}{ll}MSE=\frac{1}{N}{\displaystyle \sum _{k=1}^N}{|\mathbb{Q}[\stackrel{\wedge }{s(k)}]-\stackrel{\wedge }{s(k)}|}^2& (22)\end{array}$

The residual ISI defined by

$\begin{array}{ll}ISI=\frac{{\displaystyle \sum _{k=1}^N}\left(|h(k)*w^{*}(k)|\right)-{|h(k)*w^{*}(k)|}_{max}}{{|h(k)*w^{*}(k)|}_{max}}& (23)\end{array}$

The performance simulations of MCMA, concurrent MCMA-DD and concurrent MCMA-DD with BB were executed in 30-dB SNR with 64-QAM. The channel impulse response was set to be h = [0.005, 0.009, −0.0024, 0.854, −0.218, 0.049, −0.016] T, and then the channel was normalized.

The SS of the MCMA had to be defined as ${\mu }_{MCMA}=2\times {10}^{-6}$. The two step sizes of the concurrent MCMA-DD equalizer were defined to be ${\mu }_{MCMA}=2\times {10}^{-6}$ and ${\mu }_{DD}={10}^{-4}$, respectively. For the concurrent MCMA-DD with BB equalizer, the two step sizes were set to ${\mu }_{MCMA}=2\times {10}^{-6}$ and the initial${\mu }_{DD}={10}^{-3}$.

Figure 3 shows the equalizer input signal diagram and the output constellation diagrams of the three algorithms. It could be intuitively seen that the proposed concurrent MCMA-DD with BB algorithm compensates the channel distortion more effectively comparing with other algorithms.

FIGURE 3

Figure 3. The equalizer input signal diagram and the output constellations of all algorithms. (A) The equalizer input signal diagram and the output constellation diagram of (B) MCMA, (C) Concurrent MCMA-DD, and (D) Concurrent MCMA-DD with BB.

The learning curves for the three equalizers are shown in Figures 4, 5 based on the estimated MSE and ISI measurements. The results indicated that the CS and the SS equalization performance of the concurrent MCMA-DD with BB algorithm is better than the MCMA and the concurrent MCMA-DD algorithm. Specifically, compared to the concurrent MCMA-DD algorithm, the convergence rate of the proposed algorithm was ~100 symbols faster, and the SS error was reduced by 5 dB.

FIGURE 4

Figure 4. The MSE performance of the three equalizers.

FIGURE 5

Figure 5. The ISI performance of the three equalizers.

Conclusions

In this paper, a concurrent MCMA and DD with BB algorithm has been proposed. The proposed algorithm could operate a DD equalizer concurrently with MCMA equalizer and adjust the SS by using BB method. Compared with MCMA and concurrent MCMA-DD, the proposed algorithm exhibits robust equalization performance and rapid CS. The proposed algorithm could be applied to some more complex wireless channel environments, which are of great significance for improving remote control of robot and all wireless communication control system.

There are still some problems to be further studied in this paper:

1. The BB algorithm is applied to the BE algorithm. Although it can reduce SS error and accelerate the CS, the calculation of the algorithm is large, and the complexity is high. Further research is needed to simplify the algorithm and improve its performance.

2. The blind equalization algorithm proposed in this paper also needs to further optimize and analyze the higher-order QAM signal and the more complex digital modulation signal.

3. The proposed blind equalization algorithm is verified by software simulation. On the basis of software simulation, developing and building more practical hardware system is still a subject worthy of further study.

Data Availability Statement

The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.

Author Contributions

TX and ZX is the main writer of this paper, proposed the main idea, analyzed the feasibility and of the algorithm, and completed the simulation. HY, YC, JL, and YZ gave some important suggestions for algorithm idea. All authors read and approved the final manuscript.

Funding

The authors acknowledged the natural science basic research plan in Shaanxi Province of China (Program No. 2019JQ-383).

Conflict of Interest

HY, YC, JL, and YZ are employed by Guangdong Shenglu Telecommunication Tech. Co., Ltd. The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

References

Ashmawy, D., Banovic, K., Abdel-Raheem, E., Youssif, M., Mansour, H., and Mohanna, M. (2009). “Joint MCMA and DD blind equalization algorithm with variable-step size,” in 2009 IEEE International Conference on Electro/Information Technology (Windsor, ON), 174–177.

Google Scholar

Barzilai, J., and Borwein, J. M. (1988). Two-point step size gradient methods. IMA J. Numer. Anal. 8, 141–148. doi: 10.1093/imanum/8.1.141

CrossRef Full Text | Google Scholar

Bhotto, M. Z. A., and Bajić, V. I. (2015). Constant modulus blind adaptive beamforming based on unscented kalman filtering. IEEE Signal Process. Lett. 22, 474–478. doi: 10.1109/LSP.2014.2362932

CrossRef Full Text | Google Scholar

Chen, S., and Chng, S. E. (2004). “Concurrent constant modulus algorithm and soft decision directed scheme for fractionally-spaced blind equalization,” in 2004 IEEE International Conference on Communications (Paris), 2342–2346.

Google Scholar

Dai, Y. H., Hager, W. W., Schittkowski, K., and Zhang, H. (2006). The cyclic Barzilai—Borwein method for unconstrained optimization. IMA J. Numer. Anal. 26, 604–627. doi: 10.1093/imanum/drl006

CrossRef Full Text | Google Scholar

Elsidig, A., and Babiker, S. F. (2018). “Rayleigh fading channel equalization using neural networks,” 2018 International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE) (Khartoum), 1–5.

Google Scholar

Haykin, S. (2015). The Least-Mean-Square (LMS) Algorithm, Adaptive Filter Theory, 5th Edn.Cranbury, NJ: Pearson Education, 248–308.

Johnson, R., Schniter, P., Endres, T. J., Behm, J. D., Brown, D. R., and Casas, A. R. (1998). Blind equalization using the constant modulus criterion: a review. Proc. IEEE 86, 1927–1950. doi: 10.1109/5.720246

CrossRef Full Text | Google Scholar

Kim, N., Byun, H., You, Y., and Kwon, K. (2012). Blind signal processing for impulsive noise channels. J. Commun. Netw. 14, 27–33. doi: 10.1109/JCN.2012.6184548

CrossRef Full Text | Google Scholar

Lewis, F. W., Jagannathan, S., and Yesildirak, A. (2020). Neural Network Control of Robot Manipulators and Non-linear Systems.Boca Raton, FL: CRC Press.

Google Scholar

Li, Z., Shi, W., and Yan, M. (2019). A decentralized proximal-gradient method with network independent step-sizes and separated convergence rates. IEEE Trans. Signal Process. 67, 4494–4506. doi: 10.1109/TSP.2019.2926022

CrossRef Full Text | Google Scholar

Liyi, Z., Lei, C., and Yunshan, S. (2009). “Variable step-size CMA blind equalization based on non-linear function of error signal,” in 2009 WRI International Conference on Communications and Mobile Computing (Kunming), 396–399.

Google Scholar

Macchi, O., and Eweda, E. (1984). Convergence analysis of self-adaptive equalizers. IEEE Trans. Inf. Theory 30, 161–176. doi: 10.1109/TIT.1984.1056896

CrossRef Full Text | Google Scholar

Nesterov, Y. (2013). Gradient methods for minimizing composite functions. Math. Program. 140, 125–161. doi: 10.1007/s10107-012-0629-5

CrossRef Full Text | Google Scholar

Shah, S. M., Samar, R., Khan, N. M., and Raja, M. A. Z. (2017). Design of fractional-order variants of complex LMS and NLMS algorithms for adaptive channel equalization. Nonlinear Dyn. 88, 839–858. doi: 10.1007/s11071-016-3279-y

CrossRef Full Text | Google Scholar

Tan, C., Ma, S., Dai, Y. H., and Qian, Y. (2016). “Barzilai-Borwein step size for stochastic gradient descent,” in Proceedings of the 30th International Conference on Neural Information Processing Systems (Barcelona), 685–693.

Google Scholar

Yang, J., Werner, J.-J., and Dumont, G. A. (2002). The multimodulus blind equalization and its generalized algorithms. IEEE J. Sel. Areas Commun. 20, 997–1015. doi: 10.1109/JSAC.2002.1007381

CrossRef Full Text | Google Scholar

Ye, T., Luo, Z., and Wang, G. (2020). Adaptive sliding mode control of robot based on fuzzy neural network. J. Ambient Intell. Humaniz. Comput. 11, 6235–6247. doi: 10.1007/s12652-020-01809-2

CrossRef Full Text | Google Scholar

Yuan, J., and Lin, T. (2010). Equalization and carrier phase recovery of CMA and MMA in blind adaptive receivers. IEEE Trans. Signal Process. 58, 3206–3217. doi: 10.1109/TSP.2010.2044255

CrossRef Full Text | Google Scholar