Iterative Methods and Applications 2014View this Special Issue
Research Article | Open Access
Blind Channel Estimation Based on Multilevel Lloyd-Max Iteration for Nonconstant Modulus Constellations
In wireless communications, knowledge of channel coefficients is required for coherent demodulation. Lloyd-Max iteration is an innovative blind channel estimation method for narrowband fading channels. In this paper, it is proved that blind channel estimation based on single-level Lloyd-Max (SL-LM) iteration is not reliable for nonconstant modulus constellations (NMC). Then, we introduce multilevel Lloyd-Max (ML-LM) iteration to solve this problem. Firstly, by dividing NMC into subsets, Lloyd-Max iteration is used in multilevel. Then, the estimation information is transmitted from one level to another. By doing this, accurate blind channel estimation for NMC is achieved. Moreover, when the number of received symbols is small, we propose the lacking constellations equalization algorithm to reduce the influence of lacking constellations. Finally, phase ambiguity of ML-LM iteration is also investigated in the paper. ML-LM iteration can be more robust to the phase of fading coefficient by dividing NMC into subsets properly. As the signal-to-noise ratio (SNR) increases, numerical results show that the proposed method’s mean-square error curve converges remarkably to the least squares (LS) bound with a small number of iterations.
In wireless communication systems, channel state information (CSI) is necessary for coherent demodulation or precoding, and channel estimation is required at the receiver. Data-aid (DA) estimation methods make use of pilot, which is known both at transmitter and at receiver. On the contrary, blind estimation (BE) methods do not use any symbols known priorly at the receiver, thus saving transmitting power and bandwidth.
In , Tong et al. firstly explored cyclostational properties of an oversampled communication signal and proposed a BE method based on second-order statistics (SOS) of received signal. After that a series of BE methods based on statistical characteristics of received signal was proposed, especially signal subspaces (SS) method [2–5], which is used widely in modern communication systems, such as MIMO and OFDM. However, methods based on statistical characteristics require estimator to calculate high-order statistics of received signal. They are reliable only when the number of received symbols is large. To solve this problem, researchers introduced deterministic methods, such as estimators based on least squares (LS) principle  and estimators based on finite-alphabet characteristics of constellations . LS method is widely used in wireless communication systems because of its reliability and simplicity. Our work focuses on it.
LS solution of DA estimation was introduced by Crozier et al. . With the accurate information of pilot symbols, DA-LS estimator is the optimum estimator which reaches Cramer-Rao bound (CRB) . Without pilot symbols, decision-directed (DD) LS estimator makes decision to receive symbols firstly and then uses results to estimate channel coefficients. For narrowband fading channels, Dizdar and Ylmaz  proposed Lloyd-Max iteration, which achieves reliable blind channel estimation for constant modulus constellations (CMC) with less received symbols. Lloyd-Max iteration is a method based on LS principle. But for nonconstant modulus constellations (NMC), it is unreliable to estimate channel blindly with single-level Lloyd-Max (SL-LM) iteration. This is due to the fact that nonconstant modulus of constellations will induce quantization errors in the first step of iterations.
For this problem, the paper proposes a BE method based on multilevel Lloyd-Max (ML-LM) iteration. By multilevel iteration and by transmitting estimation information from one level to another, the proposed method achieves accurate blind channel estimation for NMC with less received symbols. Moreover, when the number of received symbols is small, we introduce lacking constellations equalization (LCE) algorithm to reduce the influence of lacking constellations (LCs). As the signal-to-noise ratio (SNR) increases, the proposed method’s mean-square error curve converges remarkably to the LS bound with a small number of iterations.
The paper is organized as follows. Section 2 gives the system model, SL-LM iteration algorithm, and proves that SL-LM iteration is unreliable for NMC. In Section 3, we introduce ML-LM iteration algorithm, LCE algorithm, and analyze the phase ambiguity. Numerical results are shown in Section 4, and Section 5 concludes the paper.
The notation is defined as follows: . The notations , , , and stand for set, exponent, complex conjugation, and expectation, respectively. Specially, denotes the amplitude if the element is a complex number. If the element is a set, denotes the cardinality of the set, namely, the number of elements in the set.
2.1. System Model
When the coherence time of the channel is large enough, channel coefficients will change very slowly in time domain. Then fading coefficients are invariant in certain intervals. When the bandwidth of the channel is narrow, the channel is frequency-nonselective, namely, flat-fading. Under this condition, the system model is established as where : indices of received symbols in time domain; : transmitted constellation; : zero-mean circularly symmetric complex Gaussian (ZMCSCG) random variable with variance ; : number of received symbols; : fading coefficient, which is invariant in the interval of received symbols.
Suppose that , where is the fading amplitude, which satisfies Rayleigh distribution. is the offset phase, which satisfies uniform distribution.
2.2. Single-Level Lloyd-Max Iteration
Lloyd-Max iteration  is a quantization algorithm using a LS approximation. The algorithm is developed as a solution to the problem of minimizing the overall quantization noise when an analog signal is pulse code modulated. It was introduced into blind channel estimation in . Suppose that modulation mode is MPSK; the algorithm procedure is the following.(1)Suppose that the initial quanta are the MPSK constellation points: (2)Defining sets of received symbols , received symbols fall into the region based on the following criterion:
For every , the center of mass of the points in it is calculated by which is found as a set of new quanta.
By repeating steps and until a stopping criterion is met or for a desired number of iterations, final quanta can be obtained as follows:
Then, the estimator can be deduced as
It can be noted that Lloyd-Max algorithm is based on the principle of DD-LS. In step , the algorithm uses the distance between and as the decision criterion. If has a minimum distance to compared to other quanta, it falls into the region . It is the same as maximum likelihood (ML) decision. Furthermore, Lloyd-Max algorithm uses iteration to reduce the influence of noise and fading and has a better performance than DD-LS method.
Traditional Lloyd-Max iteration, which is called SL-LM iteration, is reliable for CMC. If the offset phase satisfies phase ambiguity  will be eliminated. Consequently it can be ensured that, in the first step of iterations, received symbols have a minimum distance to their transmitted constellations for any value of and then fall into the right region with (3), which ensure that the following iterations are correct.
On the conditions of SNR 30 dB, QPSK modulation with initial phase , received symbols with different fading coefficients are shown in Figure 1. In the figure arrows denote the constellations with minimum distance to the regions, and . It can be seen that when satisfies the restriction of no phase ambiguity, all received symbols fall into the right regions either with a large (2.2) or with a small (0.55) .
However, when the modulus of constellations is nonconstant, even if satisfies the restriction of no phase ambiguity, different also may induce the fact that the received symbols have a minimum distance to other constellations rather than their transmitted constellations, then fall into a wrong region with (3), and lead to the false estimation.
On the conditions of SNR 30 dB, square 16QAM constellations, received symbols with different fading coefficients are shown in Figure 2. In order to illuminate clearly, Figure 2 only shows the first quadrant. It is the same for other quadrants.
As we can see in Figure 2, quantization errors will be caused by a large (2.2) or small (0.55) in the first step of iterations. When , , received symbols whose transmitted constellations are and fall into the region ; received symbols whose transmitted constellations are and fall into the region . The center of and the center of are two new quanta. No symbol falls into and ; the new quanta are still and . Wrong iterations and false estimation will be caused by the four wrong quanta. It is the same for , .
It is proved that SL-LM iteration is unreliable for NMC. In order to solve this problem, we introduce ML-LM iteration in the following section.
3. Multilevel Lloyd-Max Iteration
3.1. Algorithm Procedure
In order to solve the problem above, we propose a BE method based on ML-LM iteration for NMC. For example, if the modulation mode is square 16QAM, the iteration process can be divided into two levels as follows.
Level 1 (L1). Divide 16QAM constellations into 4 subsets according to quadrants. Defining initial L1 quanta are the center of every subset. Received symbols fall into L1 regions with (3). We can calculate new L1 quanta and obtain the L1 estimator with (4) and (6).
Level 2 (L2). For every subset in L1, multiply constellations by the L1 estimator; the results are initial L2 quanta. For every L1 region, received symbols fall into L2 regions with (3). We can calculate new L2 quanta and obtain the L2 estimator with (4) and (6) in every L1 region. All the new L2 quanta are divided into new subsets according to L1 regions; then return to L1.
The two-level Lloyd-Max iteration consists of L1 and L2. By repeating L1 and L2 until a stopping criterion is met or for a desired number of iterations, the mean value of four L2 estimators is the final estimator.
Supposing that the NMC are and received symbols satisfy (1), the procedure of two-level Lloyd-Max algorithm can be concluded as the following.(1)Divide NMC into 4 subsets: which satisfy
The mean value of a set is the center of :
Then, the subsets satisfy (2)Define initial L1 quanta as (3)Define L1 regions of received symbols as
If is null set, then
Calculate the L1 estimator of fading coefficient as follows: (4)Initial L2 quanta are deduced as (5)Define L2 regions of received symbols for every as follows:
If is null set, then
Calculate the L2 estimator of fading coefficient as follows:
If a desired number of iterations are met, (20) is the final estimator. If not, then new L1 quanta are deduced as and return to step .
In practice, the number of iteration levels should be set properly. For some high-order modulation modes, such as 256QAM, we must increase the number of levels to guarantee the well performance of the algorithm.
3.2. Lacking Constellations Equalization
If the number of received symbols is small, it is a high probability event that transmitted constellations of all received symbols have not included all NMC. If a constellation has not been transmitted in the interval of received symbols, we call it lacking constellation (LC). If LCs exist, will be a biased estimator of fading L1 quantum in (16), and the L1 estimator will be biased. As shown in Figure 3, square 16QAM constellations in the first quadrant, is a LC, and the mean value of is biased from fading L1 quantum.
For this case, we introduce LCE algorithm. For square 16QAM constellations, the L1 quantum can be determined only by 3 constellations in an L1 region . If 1 LC exists only, the fading L1 quantum can still be determined. If over 2 LCs exist, is useless for L1 estimator. Then, we can delete it in (16) and eliminate the influence of biased fading L1 quantum. LCE can be used after (15). If not every L1 region has over 2 LCs, LCE can eliminate the influence of LCs.
For square 16QAM constellations, LCE algorithm can be concluded as follows.(1)For every , calculate the maximum distance between symbols as follows: (2)Define the number of transmitted constellations in every . As shown in Figure 3, if or , ; if , . Ignore or because of their low probability. So can be estimated as follows.
Initialize , , , and as null sets. For , falls into . For , calculate If , falls into ; if , for every , falls into null set . Finally, equals the number of nonnull sets. If the transmitted constellations of received symbols are the same, received symbols fall into same sets.(3)For every , if , define sets , which satisfy Calculate the fading L1 quantum as follows:
If a region satisfies or , it is useful. Suppose the number of useful regions is . If , LCE is false; L1 estimator of fading coefficient can still be calculated with (16). If , L1 estimator of fading coefficient can be deduced as
For other high-order modulations, the geometry of constellations is more complex. In an L1 region, how many constellations can determine an L1 quantum is not fixed. In practice, LCE should be modified based on the modulation mode.
3.3. Phase Ambiguity Analysis
Phase ambiguity is a classical problem in blind channel estimation. The reason can be concluded that we cannot determine the transmitted constellation of a received symbol. Some valuable ideas have been given to eliminate it, such as differential modulation and coding , few pilot symbols , which is called semiblind estimation (SBE). If we cannot make use of communication scheme, large distance between constellations can reduce the influence of phase ambiguity. For ML-LM iteration, we can make the distance between subsets maximum by dividing NMC into subsets properly. Then the restriction range of no phase ambiguity can be maximum.
For square 16QAM constellations, as shown in Figure 4, if we divide constellations into subsets according to quadrants, then the minimum phase difference between subsets is , and the 2 nearest constellations are and . In the first step of iteration, if we want to ensure that the received symbols fall into right regions, the restriction range of no phase ambiguity is
If we divide constellations into subsets according to Figure 4, then the minimum phase difference between subsets is , and the 2 nearest constellations are and . Then, the restriction range of no phase ambiguity is
Because , ML-LM iteration can be more robust to the offset phase by dividing NMC into subsets according to quadrants than according to Figure 4.
4. Numerical Results
In this section, we test the performance of ML-LM iteration through Monte Carlo simulation. The modulation mode is square 16QAM. Suppose that the fading coefficient is where and are zero-mean real Gaussian random variables with variance and independent of each other. In the simulation . The amplitude of is a Rayleigh-distributed random variable; its mean value and variance  are
The offset phase is a uniform-distributed random variable. Considering the phase ambiguity, we assume that satisfies (27).
The -axis shows the normalized mean-square error (NMSE) over 3000 Monte Carlo runs: where .
The number of iterations . Figures 5–8 show the NMSE comparisons of SL-LM and ML-LM iteration with different numbers of received symbols . As the figures show, with less received symbols, SL-LM iteration’s NMSE curves cannot converge to the LS bound as SNR increases. When , ML-LM iteration’s NMSE curves converge remarkably to the LS bound. Moreover, both with and without LCE, ML-LM iteration’s NMSE curves are the same. When , ML-LM iteration’s NMSE curves decrease as SNR increases but cannot converge. It is because LCs exist. When , ML-LM iteration with LCE has a better performance than without LCE. The smaller the is, the more obvious the performance improvement is.
When , NMSE comparisons of ML-LM iteration for different are shown in Figure 9. As we can see, ML-LM iteration’s NMSE curves converge remarkably to the LS bound only by 2 iterations. Comparing with SL-LM iteration, which needs 10 iterations , although in every iteration ML-LM has a higher complexity, the whole complexity of ML-LM iteration may lower.
Because of its high information rate, NMC are widely used in modern communication system. For blind channel estimation based on SL-LM iteration, NMC will result in quantization errors in the first step of iterations. The paper proposes a blind channel estimator based on ML-LM iteration for NMC. By dividing NMC into subsets, Lloyd-Max iteration is used in multilevel. Estimation information is transmitted from one level to another. Then quantization errors are eliminated. Moreover, when , LCE algorithm is introduced to reduce the influence of LCs and improves the performance of ML-LM iteration. When , the proposed method’s NMSE curve converges remarkably to the LS bound with a small number of iterations. Consequently it is suitable for some modern communication schemes which require high-speed estimation.
For multipath channels, which produce frequency selectivity, the proposed scheme can be combined with orthogonal frequency division multiplexing (OFDM) scheme to achieve blind channel estimation. For every subchannel in OFDM, the channel is flat-fading and still satisfies the model in (1). Then, ML-LM iteration can be used in every subchannel.
Phase ambiguity of ML-LM iteration is also analyzed in the paper. The restriction range of no phase ambiguity can be maximum by dividing NMC into subsets properly. How to eliminate the restriction of phase ambiguity will be researched in future work.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
The authors are grateful for reviewers for their conscientious reviewing. This work was supported by the National Natural Science Foundation of China with the no. 61372098 and Scientific Research Project of Hunan Education Department with the no. YB2012B004.
- L. Tong, G. Xu, and T. Kailath, “Blind identification and equalization based on second-order statistics: a time domain approach,” IEEE Transactions on Information Theory, vol. 40, no. 2, pp. 340–349, 1994.
- E. Moulines, P. Duhamel, J. Cardoso, and S. Mayrargue, “Subspace methods for the blind identification of multichannel FIR filters,” IEEE Transactions on Signal Processing, vol. 43, no. 2, pp. 516–525, 1995.
- W. Kang and B. Champagne, “Subspace-based blind channel estimation: generalization and performance analysis,” IEEE Transactions on Signal Processing, vol. 53, no. 3, pp. 1151–1162, 2005.
- R. C. de Lamare and R. Sampaio-Neto, “Blind adaptive MIMO receivers for space-time block-coded DS-CDMA systems in multipath channels using the constant modulus criterion,” IEEE Transactions on Communications, vol. 58, no. 1, pp. 21–27, 2010.
- J. L. Yu, B. L. Zhang, and P. T. Chen, “Blind and semi-blind channel estimation with fast convergence for MIMO-OFDM systems,” Signal Processing, vol. 95, pp. 1–9, 2014.
- S. N. Crozier, D. D. Falconer, and S. A. Mahmoud, “Least sum of squared errors (LSSE) channel estimation,” IEE Proceedings F: Radar and Signal Processing, vol. 138, no. 4, pp. 371–378, 1991.
- S. Zhou and G. B. Giannakis, “Finite-alphabet based channel estimation for OFDM and related multicarrier systems,” IEEE Transactions on Communications, vol. 49, no. 8, pp. 1402–1414, 2001.
- S. Kay, Fundamentals of Statistical Signal Processing: Estimation Theory, Prentice-Hall, Englewood Cliffs, NJ, USA, 1993.
- O. Dizdar and A. Ö. Ylmaz, “Blind channel estimation based on the lloyd-max algorithm in narrowband fading channels and partial-band jamming,” IEEE Transactions on Communications, vol. 60, no. 7, pp. 1986–1995, 2012.
- M. Noah, “Optimal Lloyd-Max quantization of LPC speech parameters,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '84), vol. 9, pp. 29–32, March 1984.
- J. G. Proakis and M. Salehi, Digital Communications, McGraw-Hill, New York, NY, USA, 5th edition, 2005.
Copyright © 2014 Xiaotian Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.