GB2364621A - Adaptive blind equaliser using reliable symbols - Google Patents

Adaptive blind equaliser using reliable symbols Download PDF

Info

Publication number
GB2364621A
GB2364621A GB0016938A GB0016938A GB2364621A GB 2364621 A GB2364621 A GB 2364621A GB 0016938 A GB0016938 A GB 0016938A GB 0016938 A GB0016938 A GB 0016938A GB 2364621 A GB2364621 A GB 2364621A
Authority
GB
United Kingdom
Prior art keywords
isi
equaliser
symbols
symbol
reliable
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
GB0016938A
Other versions
GB0016938D0 (en
Inventor
Eilon Riess
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Verticalband Ltd
Original Assignee
Verticalband Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Verticalband Ltd filed Critical Verticalband Ltd
Priority to GB0016938A priority Critical patent/GB2364621A/en
Publication of GB0016938D0 publication Critical patent/GB0016938D0/en
Priority to US09/836,281 priority patent/US7143013B2/en
Priority to US09/899,843 priority patent/US7110923B2/en
Priority to US09/899,852 priority patent/US7085691B2/en
Publication of GB2364621A publication Critical patent/GB2364621A/en
Withdrawn legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/06Dc level restoring means; Bias distortion correction ; Decision circuits providing symbol by symbol detection
    • H04L25/067Dc level restoring means; Bias distortion correction ; Decision circuits providing symbol by symbol detection providing soft decisions, i.e. decisions together with an estimate of reliability
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/0202Channel estimation
    • H04L25/0238Channel estimation using blind estimation

Abstract

An adaptive trellis equaliser for receiving high order constellation signals, e.g. 256 QAM, 1024 QAM, subject to intersymbol interference (ISI) comprises a "mis-match" equaliser and an adaptive estimator as shown in figure 1. An initial "reliable symbol" is identified, with "reliable symbols" defined as those closer to their received constellation points, that is their transmitted constellation points scaled by the channel gain but free from ISI noise effects, than to any other constellation points. Initial values for the ISI coefficients are set on the basis of the reliable symbol and a sequence of prior symbols equal in length to a selected channel window is estimated. The most likely branch or branches of the trellis following the reliable symbol are identified and used to determine the next symbol and to refine the estimated ISI coefficients (see figure 2). The channel window is then moved forward and the process repeated with a new sequence of symbols and the refined ISI coefficients.

Description

2364621 "Adaptive Blind Equaliser" This invention relates to communication
channel equalisers, and in particular, to an eqUaliser which is particularly adapted for use when receiving high-order constellation 5 signals over an ISI channel.
When a signal is transmitted over a communication channel of a normal type which produces ISF (Intersymbol interference) or multi-path interference, the effect of the interference is increased considerably, for high order constellations. In our copendin(y British patent application no. 9926167.9, we have described a method of enabling high 10 order constellation communication, without lowering the symbol rate, by evaluating the channel characteristics without the use of any training sequence.
The method of hicli order constellation si-nal transmission through an ISI channel, according to the above mentioned prior applicati6n, involves identifying "reliable symbbls", that is to say, symbols which are closer to their received constellation point 15 free from ISI noise effect, than to any other received constellation point.
In order to implement efficiently, a signal communication system of the kind described above, it is.appropriate to provide an equaliser and an adaptive estimator for the ISI coefficients. Accordingly, one aspect of the present invention provides a receiver system for an ISI channel, comprising a "mismatch equaliser" having two main inputs, 20 one of which is supplied with the received signal, whilst the other is supplied with ID ISI/multipath coefficients comprising the output of an adaptive estimator, having one input which is supplied with the received signal and another input which is supplied with output decisions from the equaliser.
By the term "mismatch equaliser" we mean an equaliser which can work even 25 without knowledge of the ISI/multi-path coefficients.
Preferably, the adaptive estimator operates in a similar way to that described in our above mentioned copending application no. 9926167.9, in which reliable symbols are extracted and utilised in order the derive the ISI channel characteristics. This is preferably done by rneans of a weighting matrix which attaches a high weight for each 30 reliable symbol, and a low weight for a non-reliable symbol.
The invention also extends to a method of process of trellis equalisation, for ail ISI/multipath channel when high order constellation communication is used, which comprises the steps of:
1) Identifying ail initial "reliable symbol" in the received signal; 5 2) Setting an initial value for the ISI coefficients; 3) Estimating the sequence of at least N length prior symbols, where N is the selected length of the ISI channel window; 4) Identifying the most likely branch or set of branches of the trellis followin- the reliable symbol; 10 5) Using, the branch or set of branches to determine the next individual symbol or symbol path and to provide a refined estimate of the ISI coefficients; 6) Moving the channel window forward so as to include a new sequence of N symbols and repeating the process with the new sequence of symbols and the refined estimate of the ISI.
15 Although a training sequence is not required for the method to work, there are cases in which a single training symbol can be used as a reliable symbol, purely to initiallse the trellis.
Typically the initial value is a guess of the ISI coefficients which may for example simply comprise an all zero vector of length N.
20 In an ideal realisation of the process, which would involve "soft detection", considerable computation power would be required, because multiple integrations, involving multiple summations, have to be carried out for each branch of the trellis.
Accordingly the branch weight calculation may be replaced with a "hard detection" approach by finding the branch closest to the average of the rescattered received signal, 25 as will be described in more detail below.
The present invention also extends to a mismatch equaliser using the above method of trellis equalisation, and to a receiver system incorporating such a mismatch equaliser, the equaliser having two main inputs, one of which is supplied with the received signal, whilst the other is supplied with ISI/multipath coefficients comprising the output of an 30 adaptive estimator, whose input is supplied with output decisions from the equaliser as well as the received signal.
Thus in a practical embodiment the mismatch equaliser is located in the receiver, for example just after a matched filter, after transforming the analogue signal into its base-band digital form. The input is connected to the output of the matched filter and produces at its output the decision on the transmitted symbols and/or the transmitted bits, which can then be further processed by the other receiver components such as the decoder or can be used as the final output of the receiver. Although the equaliser and the 5 estimator can be used as individual components since they do not depend on each other, they are preferably used together so as to provide maximum performance with minimal complexity.
The present invention accordingly provides the following advantages:
L Fast and precise equalisation and estimation for up to severe ISI/multipath channel, 10 even beyond the "binary open eye" lin-iit, when high order constellation is used, 2. There is no theoretical limit to the size of the constellation. Simulation results confirril successful operation of up to and including, 4096 QAM, 600% higher than QPSK (4 QAM).
3 ery low SNR. Simulation results confirm 3. The system operates successfully even for v 15 successftil operation for SNR as low as 4dB difference between constellation points.
4. The number of symbols that is required depends mainly on the constellation size, but also on the initial guess of the coefficients, the SNR and the level of ISI/multipath Typical numbers for severe ISI/multipath channel with relative low SNR when 64 QAM is used is around 2000-3000 symbols. Under the same conditions but using, 20 1024 QAM requires about 7000 symbols. In the case of DTV and 3G mobile phone channels this represents a short delay of up-to the order of several milliseconds (only just for the first symbols, the remainder will not be subject to any delay).
5. The system successfully operates even for very fast moving channel, up to changes within 100 symbols, which represent for a 3G mobile phone, channel variation in the 25 order of few dozen of microseconds, i.e. is an extremely fast moving channel.
Contrary to the case in which the channel is constant the initial processed received data (e.g. the first couple of milliseconds) cannot be recovered.
The system can be describe by the schematic shown in Figure 1.
The equaliser has two main inputs, the received data stream and the range of each coefficient of the ISI/multipath channel that is being fed by the adaptive estimator. The adaptive estimator has for its inputs the decisions that are based on the equaliser as well as the received signal.
5 Estimator:
The operation of the adaptive estimator is preferably similar to the one that is presented in our copending British patent application no. 9926167. 9. In the present case the number of reliable symbols that are used in the estimation process is much larger compared with the number that was considered in that application because of the use of 10 trellis tree. The weighting matrix attaches a high weight for a reliable symbol and a low weight for a non-reliable symbol.
Equaliser:
The equaliser may be reallsed in two versions "optimal" ("soft detection") and a 64close to optimal" ("hard detection") practical equaliser. The difference between the two 15 versions is in the number of calculations for each branch in the trellis. For the vast majority of communication applications the practical close to optimal equaliser will be adequate.
The schematic of Figure 2 presents the equalisation and decision making process for both versions.
t, 4 1 . I t (The symbols in the schematic and the equations mentioned in this summary are explained in the detailed technical description which follows).
First an initial reliable symbol has to be identified using the method presented in our above mentioned copending application. Then its N length prior symbols sequence 5 has to be estimated, where N is the assumed length of the ISI/multipath channel window. In the present case the symbols are simply chosen according to their nearest constellation points. After this stage the two versions of the equaliser follow two different paths:
Practical close to optimal equaliser: (Hard Detection) After establishing the reliable symbol and the prior symbols the system decides on 10 the next symbol according to Eq. 14 & 15 (below), based on an expected ISI coefficient range. Then, the prior symbols window moves one step forwards, thus dropping the first symbol and adding the newly decided symbol, and thereafter by using the next received signal and the new prior symbols sequence in Eq. 14 & 15 the next symbol can be determined, and so on and so forth. After gathering "enough" data points, in which 15 "enough" depends on the actual application requirement, the decision based on the equaliser are fed into the adaptive estimator that produce then its new estimation / the new range for each coefficient. In fact, if required, the estimation can be perfort-ned after each step of the symbol detection.
- 6 Optimal equaliser (Soft Detection):
After establishing the reliable symbol and the prior symbols the equaliser decides first which of the branches are participating as candidates for the next need to be decided symbol, by using Eq. 12 & 13 i.e. taking into account the expected ISI range. Then for 5 each chosen branch the probability is calculated by using Eq. 10 or I I (depending whether the channel gain is known (Eq. 11) or not (Eq. 10)). Thereafter the process continues as a regular trellis equalisation, where for each step in time the participating branches are deten-nined according to Eq. 12 & 13 and their probabilities are calculated according to Eq. 10 or 11. The decision on the symbols requires a delay of N, the length of the 10 ISI/multipath channel (typical numbers are 2-10 symbols which practically means zero time delay for the vast majority of communication applications).
It will therefore be appreciated that this invention provides a number of signi icant improvements over prior systems, because of I. The whole concept and the mechanism of the use of the trellis and the reliable 15 symbols for equalisation, and requiring 'List a range for each coefficient.
t, j 11 2. The combination of the equaliser and the estimator.
3. The two metrics/probabilities calculation (optimal and sub-optimal).
4. The participating branches determination.
5. The convergence of the range of ISI which produces a progressively greater nurnber 20 of reliable symbols.
6. The system of the present invention is suitable for a wide variety of communication technologies, including various different types of networks including:
7. (a) x-DSL (DMT) and x-DSL (CAP) 8. (b) Mobile telephone (wireless) networks: 2G and 3G, that is to say:
25 GSM, 2000CDMA, W-CDMA (UMTS), EDGE It may of course be employed both in handsets and base stations.
(c) Digital TV: COFDM (DVB) It may also be used in a variety of transmission media including fibre optics.
Some embodiments of the invention are described in more detail, by way of 30 example, in the attached technical paper.
VerticalBand Equalisation and adaptive estimation under mismatch channel parameters condition when hi.6-order constellation is used, based on "Reliable Symbols method" 5 Ellon Riess 1. Introduction:
Bandwidth constraints motivate the use Of high-order constellation transmission, where higher bit-rate transmission is achieved when using the same limited bandwidth. As is shown in [1], the use of high-order constellation accentuates the Intersymbol Interference 10 (ISI) / multipath effect, with the constellation order acting, in effect, as an an-iplifier on the ISI / multipath level.
Blind equalisation therefore becomes a very difficult, if not impossible, task when a highorder constellation is used [2],[3]. Even more, various existing and future data Communication channels are time varying (e.g mobile phone, terrestrial DTV) and/or 15 produce poor signal reception in which in turn results in a low SNR.
In [1] an overview on the existing blind equalisation techniques is provided and a new method, which is called the 'Reliable Symbols method', is presented. This method makes possible successful parameter estimation, adaptive parameter estimation and equalisation when using high-order constellation communication in the presence of high 20 levels of ISI.
In this paper we present a mismatch-able equalisation technique when highorder constellation is used, based on the 'Reliable Symbols method'. Mismatch equalisation refers to the situation in which the equaliser do not have as an input the exact value of the ISI/multipath coefficients, but rather, the equaliser is provided only with a range for each 25 parameter. As an example this situation exists in a time varying channel and in the case in which low SNR results with poor estimation of the ISI/multipath coefficients.
In addition we present an adaptive estimation technique, when high-order constellation is used, based on the 'Reliable Symbols method' and on the decisions made by the mismatch-able equaliser. Finally we discuss a receiver system that is a 30 combination of the adaptive estimator and the mismatch-able equaliser. It is shown that this system provides reliable high-order constellation communication under the condition: a) high level of ISI/multipath, greater than the binary open eye limit [1,2], b) up-to a long ISI/multipath window and c) for fast tirne varying channels and/or for low SNR situation.
The system does not require extensive computation nor long received data length for its processing, which makes it applicable for most communication applications and systems.
Simulation results demonstrate the perforinance of the equaliser, the adaptive estimator and the combined receiver system.
5 The paper is divided into six sections: In Section 2 the mismatch-able equaliser is presented according to its different features. Section 3 presents the combined receiver system, adaptive estimation and equalisation.
2. Equaliser:
Successful signal detection requires the use of an equaliser when the data passes 10 through an ISI/multipath channel. As shown in [1] high-order constellation Communication when the signal passes through a given ISI/multipath channel results in a very high level of noise, dozens or even hundreds of times higher compared to low-order constellation communication. Since the equalisation process is based on the knowledge of the channel parameters, the ISI/multipath coefficients, even a minor distance from the 15 correct coefficients results With unreliable data communication for existing communication system. The error, the distance from the correct ISI/multipath coefficients, can be the result of one or more of the following situations:
a. The ISI/multipath coefficients were known to the equaliser in some point of time, but had drifted away because of the time variation characteristics of the channel (e.g.
20 mobile phone).
b. The ISI/multipath coefficients are not known to the equaliser, and the estimation of them is not sufficient, as a result of a low SNR (e.g. poor reception of a received signal, low-power communication) and/or a short received data sequence that is required in real time systems.
25 c. The average value of the ISI/multipath coefficients are known to the receiver, but rather than being steady the coefficients themselves are noisy (e.g. hardware channels such as routers, copper lines).
We present an equaliser that enables the use of high-order constellation transmission when the signal passes through an ISI/multipath channel that is based on the following: 1) 30 The reliable symbols that are hidden inside the received data stream; 2) trellis demodulation; 3) a new metric calculation method.
2.1 The components:
The proposed equaliser is based on trellis demodulation. First of all the starting point in the trellis, the anchor, needs to be found. After receiving, a predetermined number 5 of data points a reliable symbol is identified, using the method described in [1]. The necessary number of data points is determined according to the minimum number of received data points that is required to secure at least one reliable symbol, which is detern-iined according to the probability to find a reliable symbols [1]. Then, each Surrounding symbol is chosen according to the minimum distance from the received signal. After this two stages the equaliser has as an anchor the first correct symbol and in addition the equaliser has a good idea about the surrounding symbols. To proceed with I the equalisation process the trellis equalisation requires calculating the weight of each branch in the trellis. We use the maximum likelihood detection, thus, XA4L = X: max P,.(Y / X 15 where X contains all possible symbol-paths in the trellis, Y the re- scattered received signal according, to X and the channel ISI/multipath coefficients, Y i tX11-i ' ISI (2) the previous N symbols in the assumed path where y', is the n received signal, X'1-i 111=1 and M the length of the trellis. We assume here, without the losing generality, a one side 20 ISI/multipath channel, since a two side ISI/multipath channel can be described as a one side by introducing a delay mechanism.
In our case the ISI/multipath coefficients are not known and for the purpose of generality let us assume that the channel gain is not known as well (in [2] a fast and sufficient way to recover the channel gain is presented). However, an integration on the joint 25 probability, Pl? (Y, ISI / X), provides, P,-(Y/X)= fpR(Y"S'/X) (3) Isl', where f represents an N+l, the length of the ISI/multipath window plus one, multiple Isi", integrations according to the N+ I coefficients, and ISI = (ISIO, ISII,... , ISI'V) where ISIO is the channel gain coefficient.
Using Baye's Rule, it is obtained that, - P,-(Y/X)= fpR(Y/'S"X).p8('Sl) (4) is[,,, The maximum likelihood detection for a general ISI/multipath mismatch situation can now be carried out based on Eq.4.
In the situation in which there is no knowledge about the probability distribution of the 5 ISI/multipath coefficients, P,(ISI), we assume a uniforrn probability distribution over a predeten-nined range. In addition let us assume that the received signal is not statistical correlated in time, thus:
P'. (Y / ISI, X) = fj P'. (Y" / ISI, X) (5) since the assumption is a one side ISI/MLIltipath channel and taking account the length, N, of the ISI/multipath window, Eq.5 becomes, p .(y / X) fj p ISI, X N) (6) X where X " 11 WO -N; X Involving Eq.6 into Eq.4 and using the uniform probability distribution over a C> I'D predetermined range of PR (ISI), provides the following expression, 15 PR(Y/X)= f F1 _po,"/ISI,XN) (7) 1SIN,1 /1 i SIR /I where V1 ISIR I is the probability of the ISI/multipath coefficients, IC is easy to show that the order of integration and the multiplication can be switched, therefore it is obtained that, PR(Y/X) fl I f f..fpRty"I(ISIO,ISII,..,ISIV),XN (8) isi R R isi R isi R n ISIO I N 20 where IS, i R is the predetermined range for each ISI/multipath coefficient and I isiiR I is the range size of each coefficients respectively. Since I isi i R I does not depend on the assumed symbol sequence it can be dropped for the Maximum likelihood calculation. Therefore, the complete maximum likelihood expression of Eq. 8 becomes, N X,_j-jSjj)2/2Cr2 XML=,X:maxlrl f f.. f -I e j=0 dIsi dIsi (9) R R 72 0 A' /S/,)/s/11 1,51" 2o I where o-2 is the STD of the AWGN.
it is easy to see that the weight which in is the assumed transmitted symbol path, depends on the prior N-symbol-length path and it is expressed by, N ISI-)2120-2 N j=O 11 -.j.1 5 w,,,,,, f f.. fT= dIsi dIsi (10) IS/6, /S/111 is/f 2,,,e 0 N j Since the channel gain recovery can be achieved using the method of [2] Eq.] 0 can be simplified, therefore, N y ISI - C,, 2/20-2 N j=) f f e dIsi dIsi IS, I R 1,5/ AR! T2 0772 1 N where the ISI/multipath coefficients are now normallsed according to the channel gain 10 coefficient.
The number of calculations that is involved in each branch weight, Vv N I /;I'll, increases by an order of magnitude for longer ISI/multipath windows, which for sorne I Z:1 application is too high. In Section 2.2 a sub-optimal hard-decision practical branch weight with very few calculations is presented.
15 After having the first point in the trellis and knowing how to calculate the branch metrics, we will now describe the way the trellis tree is used according to the Maximum likelihood approach of Eq.8 for successful equalisation and detection.
2.2 The equaliser:
For a given branch in the trellis, in which the anchor, the reliable symbol is the first branch, a re-scattering range for the next received signal, yI, is defined as follows, _ N 111 (71, N IX;,,, I I. 1 R.)." 11 XII-i isil + Y_ - - 1,- 11 (12) i=1 2 where ISI"' is the expectation of ISII' and lisiiR I is the size of the range of ISI i R Let LIS examine the range in Eq. 10. When there is no mismatch the range size, IR. ," I is nil and it is an increasing function of the size range, I isi i R and the absolute level of the prior assumed symbols, jXn-NI,... 1jXn-ijj. As described in [1] even in the situation in which high-order constellation is used and the signal passes through an ISI/multipath channel, there is a considerable number of symbols that are reliable, thus they are closer to their associated received constellation points than to any other received constellation point. III 5 this case, in effect, the trellis-based equalisation provides the use of the whole set of the reliable symbols when the correct path is considered and the majority of reliable symbols when a path that is "close" to the correct one is considered. In the case in which there is no knowledge about the ISI/multipath coefficients, so that logical starting point is the all zero length N vector guess, the number of detectable reliable symbols is the same as tile 10 case where the reliable symbols are detected through the received signal energies [1,2].
However, on the other hand, when the ISI/multipath coefficients are known every symbol is a reliable symbol. Notice that III Our case, in which the trellis tree is used, the reliable symbols are a function of the uncertainty size, the difference of the existing coefficients from the guessed ones, and not the absolute uncertainty. As a result there are more 15 detected reliable symbols for smaller difference between the estimate and existinc, ISI/MLIltipath coefficients. Since the uncertainty in the IS1/multipath coefficients is according to the range, R the nolse after the re-scattering of the received signal is I I'll' equal or less to the situation in which there is no "a priori" knowledge about the ISI/multipath range. Based on [1] it is easy to show that the number of reliable symbols 20 among the set of received data points is actually a function of I 11R,, , 1. The total effect is thus: since the adaptive estimation reduces the range R.Y,, each further estimation step is more accurate and converges faster as a result of the double effect of 1) the difference between the assumed and true ISI/multipath being smaller and 2) the number of reliable symbols increasing as well.
25 We will now describe how this property of the range is used in the equalisation process.
After defining the range the branches that are inside or close to the range borders are considered as possible received symbol candidates, thus [R.'11 - e (SNR), R.1 11 + e (SNR)] (13) 30 The exact number of candidate symbols that are outside R,',, borders is a function of the SNR, for high SNR fewer points are taken into account and vice versa. Up to 2 symbols in each direction was found to be sufficient even for very low SNRs. Although, the failure to consider all possible branches results in a sub-optimal detection in tile presence of AWGN, the decrease in the number of calculations and memory storage for most practical use, outweighs the very small degree of sub-optimality. However, if it Is 5 required there is no restriction on the number of candidate branches that can participate.
Since a considerable fraction of the data points are actually reliable symbols, and since a smaller range means a higher number of reliable symbols, it is easy to see, according to Eq. 12, that the size of R,", R. is small for a considerable amount of I I r"I, symbols. This results with a smaller bank of symbols to chose from, thus less calculation 10 and smaller memory size is required. In the same manner as in any trellis demodUlation/decoding, each symbol candidate branch weight is calculated and the overall path probability for each path is kept in memory. Since the ISI/multipath influences up to N symbols, a decision call, be. made after N steps in the trellis, which a) impose an extremely short delay of just N symbols, and b) result in a small number of 15 branch calculations and path memory storage.
2.3 Practical equaliser:
The multiple integration, which is carried out by Multiple summations, requires a large number of calculations for each branch. The number of calculations growth Z exponentially along with the number of ISI/multipath coefficients that are involved. It is 20 shown (see Appendix. 1) that the branch weight calculation (Eqs. 10, 11) can be replaced with a hard decision approach by finding the branch,, that is closest to the average of the re-scattered received signal, hence, min hY (14) iE=111( 11 where in(n), the possible indexes of the paths that determinate at time n and, N 25 E - Y ISI (15) Y/1 _X17_i' i=1 I therefore, executing hard decision detection. It is shown by simulation that the degradation in perforillance is minimal, however the amount of calculation and memory storage size is exponentially slashed.
The equaliser characteristics:
14 - Since the eqUaliser requires to have just the range of each of the ISI/multipath coefficients, even a wrong output by the trellis equallser has a smaller error I the sense that while it decides oil wrong symbols, these symbols are closer to the transmitted symbols. This characteristic is shown in detail in the simulation.
5 3. Combined receiver system, adaptive estimation and equalisation In [2] we presented an ISI/multipath estimator when high-order constellation is used. That estimator uses identified Reliable symbols, and bases its decisions solely oil the demodulated data. We present here an adaptive estimator that produces its estimation based on: 1) Initial calculated guess of the ISI/rnultipath coefficient; 2) The decisioll 10 made through the equaliser; 3) the reliable symbols inside the received stream data. The estimator uses the LS matrix form for the estimation, similar to the estimator that is presented in [2]. It is important to notice that there are several possible estimation vehicles that can be used, and one does not necessary need to use the LS vehicle, although the LS technique allows achieving optimality in the presence of AWGN.
15 The estimator feeds the equallser an initial guess of the ISI/coefficients. Tile initial guess can be based on: 1) some sort of "a priori" knowledge; or 2) the output of the received constellation point location estimator that produces, as a by- product, the sum of the absolute of the ISI/multipath coefficients, therefore the coefficients can be this SLIM divided by the length of the ISI/multipath channel; or 3) can be just the all zero N length 20 guess. Based on this guess the equaliser produces its decisions. Unless luckily it guesses the ri-ht coefficients, which is not reasonable to expect the equaliser produces mainly wrong decisions on the transmitted symbols. However, since the equaliser has thecharacteristic, that it decreases the distance between the actual decided symbol and the correct symbol, the output of the equaliser has a smaller error in the sense of the metric 25 distance from the correct symbols. The selected symbol path that the equaliser provides is fed back into the adaptive estimator. The adaptive estimator processes this data through the use of the weighting matrix that increases the weight of the reliable symbols and decreases the weight of the non-reliable symbols. Note that contrary to the estimator which is described in [2], this adaptive estimator uses all available reliable symbols, when 30 it processes the correct path and most of the reliable symbols when processing close to the correct path, and not just those that can be identified by the way that is described in [2]. Thus the number of reliable symbols that are being used in this case is exponentially higher. The second important point, is that the estimator uses the output path of the equaliser, which becomes closer and closer to the real coefficients, therefore the nUmber of reliable symbols becomes progressively greater and greater. The estimator feeds into the equaliser the new coefficient estimates and thereafter the equaliser new decisions are produced, which are fed back into the adaptive estimator, and so on until the 5 ISI/multipath coefficients are getting steady on the final levels. References: [1] E.Riess and L. F. Turner, "The use of 'Reliable Symbols' for Channel Parameter Estimation when using high-order constellations," [2] E.Riess and L. F. Turner, "Charinel Parameter Estimations Based on the 'Reliable 10 Symbols Method' when High-Order Constellations are used," (both included in copending British Patent Application No. 9926167.9)

Claims (13)

  1. I A method of trellis eqUalisation, for an ISI/multipath channel when high order constellation communication is used, which comprises the steps of., 1) Identifying an initial "reliable symbol" in the received signal; 5 2) Setting, an initial value for the ISI coefficients; 3) Estimating the sequence of at least N length prior symbols, where N Is the selected length of the ISI channel window; 4) Identifying, the most likely branch or set of branches of the trellis following the reliable symbol; 10 5) Using the branch or set of branches to determine the next individual symbol or symbol path and to provide a refined estimate of the ISI coefficients; 6) Movin- the channel window forward so as to include a new sequence of N symbols and repeating the process with the new sequence of symbols and the refined estimate of the ISI.
  2. 2. A method according to claim I in which the initial reliable symbol is identified from a predetermined transmitted training signal.
  3. A method according to claim I or claim 2 in which a probability weightirla 0 20 for each of a set of branches is calculated from N Y111 lslj)212o-2 -(Y/I- I I-i N j=0 f f - f e dIsi dISI N (10) IS11 /si" isl," V2;o 0 1 in which M is the assumed transmitted symbol path.
  4. 4. A method according to claim I or claim 2 in which the most likely branch 25 is identified as the one which is closest to the average of the rescattered received signal and using that branch to determine the next individual symbol.
    17 -
  5. 5. A method according to claim 4 in which the branch is identified from in in (14) IE111(n) and 5 Ey 1v V 'ISI (15)
  6. 6. A mismatch equaliser using the method of any preceding claim.
  7. 7. A receiver system for an ISI channel comprising a mismatch eqUaliser 10 accordin(y to claim 6 and having two inputs, one of which is supplied with the signal from the channel, whilst the other is supplied with ISI/multipath coefficients comprising, the Output of an adaptive estimator, the input of the adaptive estimator being Supplied with Output decisions from the eqUaliser as well as the received signal.
    15
  8. 8. A signal communication system including a receiver according to claim 7.
    4D 11)
  9. 9. A wireless communication system having handsets and/or base stations including a receiver system according to claim 7.
    1.
    20
  10. 10. A wired communication system including digital subscriber lines (X- DSL) and incorporating receivers according to claim 7.
  11. 11. A digital radio/television broadcasting system including receivers according to claim 7.
  12. 12. A communication system in which the signal is propagated via coaxial cable and incorporating a receiver system according to claim 7.
  13. 13. A communication system in which the signal is propagated via fibre optic 30 link and incorporating a receiver system according to claim 7.
GB0016938A 1999-11-04 2000-07-10 Adaptive blind equaliser using reliable symbols Withdrawn GB2364621A (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
GB0016938A GB2364621A (en) 2000-07-10 2000-07-10 Adaptive blind equaliser using reliable symbols
US09/836,281 US7143013B2 (en) 1999-11-04 2001-04-18 Reliable symbols as a means of improving the performance of information transmission systems
US09/899,843 US7110923B2 (en) 1999-11-04 2001-07-09 Fast, blind equalization techniques using reliable symbols
US09/899,852 US7085691B2 (en) 1999-11-04 2001-07-09 Reliable symbols as a means of improving the performance of information transmission systems

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GB0016938A GB2364621A (en) 2000-07-10 2000-07-10 Adaptive blind equaliser using reliable symbols

Publications (2)

Publication Number Publication Date
GB0016938D0 GB0016938D0 (en) 2000-08-30
GB2364621A true GB2364621A (en) 2002-01-30

Family

ID=9895387

Family Applications (1)

Application Number Title Priority Date Filing Date
GB0016938A Withdrawn GB2364621A (en) 1999-11-04 2000-07-10 Adaptive blind equaliser using reliable symbols

Country Status (1)

Country Link
GB (1) GB2364621A (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0845891A2 (en) * 1996-11-27 1998-06-03 Lucent Technologies Inc. A windowing technique for blind equalisation
WO1999023795A1 (en) * 1997-10-31 1999-05-14 Ericsson, Inc. Method for joint equalization and detection of multiple user signals

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0845891A2 (en) * 1996-11-27 1998-06-03 Lucent Technologies Inc. A windowing technique for blind equalisation
WO1999023795A1 (en) * 1997-10-31 1999-05-14 Ericsson, Inc. Method for joint equalization and detection of multiple user signals

Also Published As

Publication number Publication date
GB0016938D0 (en) 2000-08-30

Similar Documents

Publication Publication Date Title
US5353307A (en) Automatic simulcast alignment
US7580455B2 (en) Decision feedback equalization with fractionally-spaced feedback data
EP0771494B1 (en) Generalized direct update viterbi equalizer
EP1042889B1 (en) Computationally efficient sequence estimation
US6275525B1 (en) Enhanced method for adaptive equalization technique in mobile wireless systems
EP1195033A2 (en) Equalization with dc-offset compensation
EP0801772A1 (en) Device and method for adaptive narrowband interference suppresson in multiple-access communication
US6754294B1 (en) Dual equalizer for use in an receiver and method of operation
JP4469724B2 (en) Decoder and decoding method in 2 × 2 wireless local area network, COFDM-MIMO system
US20040171364A1 (en) Method and apparatus for switching on and off interference cancellation in a receiver
EP1080566B1 (en) Apparatus and method for variable delay channel tracking
US6724841B2 (en) Equalizer with a cost function taking into account noise energy
Demir et al. A Novel Variable Step Size Adjustment Method Based on Autocorrelation of Error Signal for the Constant Modulus Blind Equalization Algorithm.
US6782046B1 (en) Decision-directed adaptation for coded modulation
CN117040976A (en) Blind equalizer under non-cooperative communication condition and dual-mode joint blind equalization method
KR100813661B1 (en) Fast adaptive time domain hybrid equalizers for time reversal-space time block code systems
GB2364621A (en) Adaptive blind equaliser using reliable symbols
US7269226B2 (en) Data processing method
WO2002005502A1 (en) Adaptive blind equaliser and corresponding equalisation method
AU718488B2 (en) Method of digital demodulation
EP2871812B1 (en) Signal correction method and receiver
EP1233586A2 (en) A method for channel equalization, a receiver, a channel equalizer, and a wireless communication device
Mak et al. Detection of trellis-coded modulation on time-dispersive channels
KR101799849B1 (en) Method for calculating soft decision value for qam signals
Koca et al. Broadband beamforming for joint interference cancellation and low-complexity turbo equalization

Legal Events

Date Code Title Description
WAP Application withdrawn, taken to be withdrawn or refused ** after publication under section 16(1)