Method and arrangement for iteratively improving a channel estimate
The invention concerns generally the technology of generating a channel estimate for the purposes of signal equalization in a radio receiver. Especially the invention concerns the use of iterative updating in association with channel estimation and signal equalization.
In many TDMA (Time Division Multiple Access) based radio receivers there is used a functional block known as the signal equalizer for recovering transmitted data from a received signal which has been corrupted by noise and intersymbol interference. The task of recovering the transmitted data is usually denoted as either equalizing or detecting for short. Typical radio receivers that use a signal equalize " are the receiver parts in mobile stations and base stations of cellular radio systems. A signal equalizer needs to know the impulse response of the radio channel to a certain extent for the equalization to be successful.
Fig. 1 illustrates a known arrangement where an analog oscillating signal on a radio frequency is received through an antenna 101, downconverted onto a baseband frequency in a radio receiver 102 and converted into a series of digital samples in an A/D converter 103. The samples are led both into a channel estimator block 104 and a signal equalizer block 105. The former uses a certain part of the received signal (usually known as the framing sequence) to estimate the impulse response of the radio channel, and provides the impulse response estimate to the signal equalizer block 105. The signal equalizer block 105 performs the equalization and gives at its output both the recovered data (the so-called hard decision output) and some reliability information (soft decision output) associated with the recovered data. These are passed on to a channel decoder 106 which removes all channel
(if any) from the original information symbol sequence which was subjected to transmission. The channel decoding operation may comprise additional operations like de-interleaving, and the reconstructed information symbols may be conveyed further e.g. to an audio or video decoder, to a data storage device or to some control circuitry.
In a TDMA system the received signal consists of discrete transmission blocks, each of which is received in a certain time slot. The conventional way of performing channel estimation and signal equalization is to use a fraining sequence with known contents within the transmission block to generate an estimate of the radio channel's
impulse response (also known as the channel estimate for short), to fix the equalization function on the basis of the obtained channel estimate and to equalize the whole received transmission block by using the same equalization function. The drawback of the traditional scheme is that it requires a relatively long training sequence for the channel estimation to succeed, so that for a remarkable percentage of time the radio channel is reserved for the transmission of fixed training symbol values instead of useful data. Even then the performance of the channel estimation and signal equalization operations may not always be best possible.
There has been proposed a so-called iterative equalization or turbo equalization approach which means that the channel decoder 106 provides the signal equalizer 105 with information concerning the results of the channel decoding process, and the signal equalizer performs a new equalization round on the basis of the provided information. The feedback connection that is needed for performing iterative equalization is shown as a dashed line in Fig. 1. Basically the iteration rounds, i.e. the consecutive times of equalizing, decoding and providing updated information from the decoder to the signal equalizer, may be repeated for an arbitrary number of times. However, that approach has not been found to remarkably improve the performance of a receiver in all cases.
An article "Iterative channel estimation using soft decision feedback" by M. Sandell. C. Luschi, P. Strauch and R. Yan. GLOBECOM'98, pp. 3728-3733, Dec. 1998, presents an iterative channel estimation scheme with either hard or soft decision feedback from a the channel decoding stage to the channel estimator. In the proposed arrangement the channel estimator calculates a new channel estimate from a sequence of symbol decisions it receives from either the signal equalizer or the channel decoder or both. The authors claim that an iteratively refined channel estimate results in enhanced bit error ratios.
It is an object of the invention to provide a method and an arrangement for enhancing the performance of a radio receiver that relies on signal equalization. It is an additional object of the invention to provide a method and an arrangement of the mentioned kind which would not add prohibitively much to the complexity of the receiver.
The objects of the invention are achieved by both iteratively updating the channel estimate and iteratively refining the signal equalization.
The method according to the invention comprises the steps of
- generating an initial estimate of the impulse response of a radio channel,
- equalizing a signal by using the initial estimate and
- decoding the equalized signal; it is characterized in that it comprises the steps of
- obtaining feedback information from the decoded signal,
- generating an updated estimate of the impulse response of the radio channel by using said feedback information and
- equalizing the signal by using said updated estimate.
The invention applies also to a receiver arrangement which comprises
- a channel estimator for generating an initial estimate of the impulse response of a radio channel.
- a signal equalizer for equalizing a signal, the signal equalizer being coupled to the channel estimator so as to receive the estimate generated by the channel estimator and
- a signal decoding unit coupled to the signal equalizer for decoding the equalized signal; it is characterized in that it comprises means for coupling feedback information from the decoded signal into the channel estimator, and the channel estimator is arranged to generate an updated estimate of the impulse response of the radio channel by using said feedback information.
In the research which led to the present invention it was found that the inadequate performance of known iterative signal equalization schemes comes at least partly from the fact that the known arrangements expect the impulse response of the radio channel to be more or less perfectly known. However, all known ways of estimating the impulse response of a radio channel are approximate, meaning that the channel estimate provided by the channel estimator to the signal equalizer is more or less distorted. According to the present invention it is possible to increase the accuracy of the channel estimate by feeding back information from the channel decoder to the channel estimator.
The iterative calculation of a channel estimate requires that the receiver is able to produce a certain initial channel estimate without any prior knowledge from the decoding decisions. There are many known conventional "one-shot" channel estimation methods which the receiver may use, including but not being limited to the LMS (Least Mean Squares) method. Only the training sequence is available for
the initial channel estimation, because no decoding decisions have yet been taken regarding the rest of the symbols in the transmission block.
The aim of iteratively refining the channel estimate is to use the result thereof as a part of an iterative signal equalization and channel decoding arrangement. A certain passage of a received signal is taken through the channel decoder more than once, so that at a certain later round of channel decoding the version of the received signal that goes into the channel decoder has been equalized by usmg a more reliable channel estimate than on a certain previous round. The later channel decoding round is likely to yield a reconstructed sequence of information symbols with fewer erroneous symbols than the previous one. Ultimately the effect of iterative channel estimation is seen as a lower bit error ratio as a function of E / 0 (me relation of received mformation bit energy to noise density).
The basic principle of iteratively updating a channel estimate is known from the article referred to in the description of prior art. However, the effectiveness of iteration in enhancing the quality of the channel estimate depends heavily on the quality of the symbol decisions which are fed back from the channel decoder to the channel estimator. If the decisions are reliable, i.e. a relatively high number of information symbols have aheady been reconstructed successfully, iteration will probably improve the quality of the channel estimate and result in even fewer number of erroneous symbol decisions. If there are lots of decoding errors to start with, the new channel estimate may become very unreliable, which may cause even more erroneous symbol decisions and lead the whole process towards divergence. In accordance with the invention it is possible to suppress such disadvantageous effects either by requiring that the signal must have been received with a C/I (carrier to interference) or S N (signal to noise) ratio or other quality-indicating quantity which is above a certain threshold or by weighting the symbol decisions fed back from the channel decoder according to their estimated reliability.
The novel features which are considered as characteristic of the invention are set forth in particular in the appended claims. The invention itself, however, both as to its construction and its method of operation, together with additional objects and advantages thereof, will be best understood from the following description of specific embodiments when read in connection with the accompanying drawings.
Fig. 1 illustrates a known receiving and decoding arrangement,
Fig. 2 illustrates an arrangement according to an embodiment of the invention.
Fig. 3 illustrates a receiving and decoding arrangement according to an embodiment of the invention.
Fig. 4 illustrates a method according to an embodiment of the invention,
Figs. 5a to 5d illustrate alternative ways of obtaining feedback information from channel decoding,
Fig. 6 illustrates a communication arrangement according to an embodiment of the invention and
Fig. 7 illustrates a pair of digital bursts which may be used in the arrangemeni of Fig. 6.
Fig. 1 has been described in the previous parts of the specification.
Fig. 2 illustrates an iterative channel estimation and signal equalization arrangement according to an advantageous embodiment of the invention. From the left in the figure comes an input line 201 through which there come samples that represent a received (and downcoverted and A/D-converted) signal. Since we are dealing with digital communication where signals are transmitted and received in certain discrete transmission blocks, we may use the designation y for a vector that contains the samples representing one received transmission block. The vector y contains both unknown information symbols and known symbols that belong to a training sequence.
The input line 201 is coupled both to a channel estimator 202 and a signal equalizer 203. From the former to the latter there is a connection for providing a channel estimate to the purposes of signal equalization in a manner known as such. The output of the signal equalizer 203 is coupled to a block 204 which represents any arbitrary signal processing which is done on the equalized signal before channel decoding. This signal processing is described in general with the operator π"1 and it typically involves e.g. de-interleaving. The output of the signal processing block
204 is coupled to the input of a channel decoder 205, the output of which 206 is shown at the right in Fig. 2.
From the channel decoder 205 there are couplings also to the other two signal processing blocks 206 and 207 which essentially perform the inverse of the operations represented by operator π"1 in block 204. For example, if block 204 implements de-interleaving, the inverting blocks 206 and 207 implement re- interleaving. The output of the first inverting signal processing block 206 is coupled to the channel estimator 202 and the output of the second inverting signal processmg block 207 is coupled to the signal equalizer 203. This arrangement is naturally shown only for conceptual clarity: it is more likely that in a practical arrangement there would be only one inverting signal processing block coupled to the channel decoder so that the output of the single inverting signal processing block would be coupled both to the channel estimator and the signal equalizer. From the viewpoint of the invention the blocks 204. 206 and 207 have only the task of showing that direct connections between the other blocks are not required.
The arrangement of Fig. 2 operates as follows. When a sample vector y is received through the input line 201, the channel estimator 202 uses those samples thereof that represent the symbols belonging to the training sequence to generate an initial channel estimate, i.e. an imtial estimate of the impulse response of the rad,( channel. The invention does not limit the selection of method(s) which the channel estimator block 202 uses to generate the initial channel estimate, which in the following is denoted by hk . The signal equalizer 203 receives the imtial channel estimate hk from the channel estimator 202 through their mutual coupling and uses it to equalize the sample vector y. Again the invention does not limit the selection of method(s) which the signal equalizer 203 uses in equalizing the signal.
The equalized sample vector y is taken through the signal processing block 204 to the channel decoder 205 which performs channel decoding. The result of channel decoding is a sequence of decoding decisions which represent the channel decoder's best possible estimate of the original symbols which a transmitter used to construct the transmission block. The channel decoder may apply either hard or soft decisions, meaning that the reconstructed symbols may either have fixed values with no explicit reference to their reliability (hard decisions) or they may have associated with probability values that indicate the estimated reliability of each symbol.
We assume first that hard decisions are applied. The symbol decisions are fed back from the channel decoder 205 through the first inverting block 206 to the channel estimator 202 and through the second inverting block 207 to the signal equalizer 203. The inverting blocks cancel the effect of block 204, so the symbol decision sequences received from the channel decoder 205 by the channel estimator 202 and the signal equalizer 203 are compatible with the original sample vector y.
According to the invention, the channel estimator 202 uses the feedback information it has received from the channel decoder to generate an updated channel estimate. The process is comparable to the generation of a channel estimate on the basis of a sample sequence with more known symbols than they were in the training sequence of the transmission block. However, we must note that the feedback information does not contain all the correct original information symbols with 100% reliability. The process of generating the updated channel estimate must therefore be selected so that the feedback information does not completely replace the original sample vector y but comes as additional information to the process of generating the channel estimate. The invention does not limit the selection of method(s) which the channel estimator 202 uses to generate the updated channel estimate, as long as the feedback information is taken into account (subject to the limitations explained later). One advantageous possibility is to use a formula for adaptive LMS adaptation
where hλ+1 is a (k+l):th channel estimate vector, hk is a k:th channel estimate vector, μ is a real constant that determines a step size for the iterative algorithm, M*. is a matrix that contains the symbol decisions given by the channel decoder as i result of decoding the signal the equalization of which was based on the k:th channel estimate, and y is the original sample vector.
The signal equalizer 203 receives the updated channel estimate, designated above as k+l , from the channel estimator and uses it for equalizing the signal vector y again.
In the process of re-equalizing the signal equalizer 203 may additionally use the feedback information obtained from the channel decoder 205 through block 207. The technology of using such feedback information in the process of re-equalizing is known as such from the field of iterative signal equalization referred to in the description of prior art. The difference between prior art and the arrangement of Fig. 2 is the fact that the signal equalizer 203 uses the updated channel estimate and not
the original, training sequence based channel estimate in performing the re- equalization.
In principle the re-equalization could be based on the original sample vector y alone by applying just the updated channel estimate This is the case in one of the prior art publications described previously. However, it is easy to show that the best performance is obtained by combining the iterative channel estimation with iterative signal equalization.
The maximum number of iteration rounds m the arrangement of Fig. 2 is not limited by the invention but merely by the computational capacity of the receiver. The higher the number of iteration rounds, the higher should become the reliability of the decoding result, although a certain saturation effects stipulates that after a certain number of iterations there is no improvement any more. The iterations on channel estimation and signal equalization need not be synchronized: it is possible e.g. to first iterate a first number of times just to improve the quality of the channel estimate and then fix the channel estimate and continue iterating on the signal equalization.
The success of the iterative channel estimation depends on the quality of the symbol decisions provided by the channel decoder. If the symbol decisions contain many errors, the iteration rounds are likely to degrade the quality of the channel estimate instead of improving it. Therefore it may be advantageous to make the receiver monitor the signal to noise ratio, the carrier to interference ratio or some other quantity of the received signal that gives an indication of the chances of making correct decoding decisions. The receiver usually performs such monitoring anyway, because the results are useful also in relation to other functionalities of the receiver than iterative channel estimation. In an advantageous embodiment of the invention there exists a threshold so that the monitored quantity must be at least as good as the threshold in order for the iterative channel estimation to be allowed.
There exists an alternative way of counteracting the effects of low reliability associated with the decoding decisions. In the foregoing we have assumed that the decoder makes hard decisions. If we now depart from this assumption, we have also the probability value(s) available which the channel decoder uses to describe the reliability of the decoding decisions. There are either a number of stored transition probabilities that describe the probabilities of certain state transitions made during the decoding process, or a metric value that concentratedly represents the estimated
reliability of a selected decoding path. The reliability of the decoding may be taken into account by weighting the feedback information according to reliability. In the exemplary adaptive LMS case above, this means that either the elements of the matrix M are set to represent the individual transition probabilities associated with decoding decisions, or the real iteration step factor μ is a function of the average reliability of the decoding round.
Fig. 3 illustrates a radio receiver which is arranged to utilize a process of iterative channel estimation according to an advantageous embodiment of the invention. An analog oscillating signal on a radio frequency is received through an antenna 301, downconverted onto a baseband frequency m a radio receiver 302 and converted into a series of digital samples m an A/D converter 303. The samples are led both into an iterative channel estimator block 304 and an iterative signal equalizer block 305. The latter performs signal equalization and passes on the resulting output information to a channel decoder 306 which removes the effects of channel coding from the symbol sequence which was subjected to transmission. Here additional processing operations like de-interleaving and corresponding inverse operations like re-interleaving (cf. blocks 204, 206 and 207 in Fig. 2) are considered to be parts of the channel decoding process in block 306. The reconstructed information symbols may be conveyed further e.g. to an audio or video decoder, to a data storage device or to some control circuitry.
The arrangement of Fig. 3 includes also a monitoring block 307 which is arranged to receive an estimate of the current signal to noise ratio or carrier to interference ratio from the radio receiver 302 and to switch the iterative channel estimation either on or off according to the current value of the monitored quantity. There is also shown, as a dashed arrow, a way of obtaining additional control information to the monitoring block 307 from the channel decoder 306. The use of such a connection is explained later.
Fig. 4 is a flow diagram of a method according to an advantageous embodiment of the invention. At step 401 a receiver receives and downconverts a transmission block. In association with the reception the receiver estimates the signal to noise ratio or other quality-indicating quantity at step 402. The estimated quality of the received signal has a central role in setting the maximum number of iterations at step 403. In Fig. 4 we assume that the number of iterations for iterative channϊT estimation and iterative signal equalization may be set separately. Typically, if the estimated quality of the received signal is below a certain threshold, the optimal
value of which may be set through experimenting and simulation, at step 403 the maximum number(s) of iteration are set so that no actual iteration will be performed. Additionally we assume that certain other factors, described in more detail below, may affect the determination of the maximum number of iterations.
At step 404 the received and downconverted analog signal is converted into digital samples. The steps of reception, downconversion and sampling are as such of no importance to the invention, but they are shown here as exemplary ways of obtaining a sequence of samples which is the basis for channel estimation, signal equalizanon and decoding.
At step 405 the receiver identifies those samples which are associated with a training sequence or a corresponding known part of the received transmission block. At step 406 the receiver uses the selected samples to generate an initial channel estimate. The first round of equalization at step 407 uses the initial channel estimate, because no detection decisions or corresponding updated channel estimates are available yet.
The next step in Fig. 4 is channel decoding at step 409. Channel decoding itself may be based on e.g. known forms of Niterbi decoding, if the transmitter used a convolutional encoder for channel encoding the signal to be transmitted. Viterbi decoding in its basic form gives only hard decision outputs. Instead, in Fig. 4 we have assumed that channel decoding relies on the SISO (Soft In - Soft Out) principle so that at step 409 there is stored at least one realibility value which describes the estimated reliability of the current decoding result. The invention does not limit the selection of the channel decoding method.
The dashed line from step 409 to step 403 corresponds to the additional control connection from block 306 to block 307 in Fig. 3 and indicates that the estimated reliability of the current channel decoding result may have an effect on the maximum number of iterations for either channel estimation or symbol equalization or both. For example a very high estimated reliability might be interpreted so that further iteration rounds are not necessary, in which case all maximum numbers of iterations are set to a value that will lead to the termination of iterations. A reliability value which is between a certain upper and lower limits, possibly together with a SΝR value which is similarly between certain limits, may cause the maximum number(s) of iteration to be set so that still some more iteration rounds will be performed, whereas a very low reliability value, potentially together with a
l ϊ relatively low SNR value might again lead to instant termination of iteration because iterative channel estimation (and/or signal equalization) would only make things worse. Termination of iteration through the interaction of steps 409 and 403 could also result from a discovery showing that the latest iteration did not improve the obtained reliability value from the previous decoding round. In setting the maximum number(s) of iterations one must remember that the allocatable calculational capacity of the receiver must not be exceeded.
The existense of step 403 is not required at all, if we are satisfied with the fact that under certain circumstances performing a constant number of iterations may not improve performance at all, or may even degrade it. Typical examples of situations where SNR suddenly drops, causing potential divergence in iterative channel estimation, are the so-called fading dips where fading due to disadvantageous local interference and/or signal propagation conditions suddenly weaken the carrier frequency which the receiver is listening to
At step 410 the receiver checks, whether the maximum number of iterations for the iterative channel estimation has been reached. The necessary control information in the form of the currently valid maximum number of iterations comes from step 403, as is indicated by the dashed arrow. A negative finding at step 410 causes a transition to step 411, where the channel decoding results are fed back to the channel estimator and the signal equalizer. At step 412 the receiver generates an updated channel estimate by utilizing the feedback information. It may also take into account the reliability value(s) associated with the feedback information, as indicated by the dashed arrow between steps 409 and 412. After step 412 the receiver returns to step 407 where the recently generated updated channel estimate now replaces the previous channel estimate, and the signal equalization takes into account the decoding results fed back at step 411. It should be noted that replacing the previous channel estimate with an updated one does not mean that al! information from the previous channel estimation round is erased: some information is carried on within the updated channel estimate, because its generation took into account both the previous channel estimate and the feedback information.
A positive finding at step 410 causes a transition to step 413 where the receiver checks, whether the maximum number of iterations for the signal equalization has been reached. The necessary control information in the form of the currently valid maximum number of iterations comes from step 403, as is indicated by the dashed arrow. A negative finding causes a transition to step 414, where the the decoding
results are fed back to the signal equalizer but not to the channel estimator any more, because iterative channel estimation has been terminated and only iterative signal equalization remains. From step 414 there comes a transition back to sten 407, where the signal equalization takes into account the decoding results fed back at step 414 but the channel estimate is the same which was used at the immediately previous time of gomg through step 407. A positive finding at step 413 indicates that the channel estimation, signal equalization and channel decoding phase is complete and the decoded results is given at the output of the channel decoder.
Some modifications to the flow diagram of Fig. 4 arise if the channel decoding process itself is based on iterative decoding. The iterations on channel decoding may conceptually cause several iterative rounds within step 409; alternatively or additionally the receiver may apply iterative decoding between steps 413 and 415 when the channel estimate and signal equalization have already been fixed.
Figs. 5a, 5b, 5c and 5d illustrate some alternative arrangements for obtaining the feedback information from the block which in Fig. 3 was generally designated as the channel decoder. In Figs. 5a,5b and 5c a channel decoding arrangement 306 contains a series connection of a de-interleaver 501, a first SISO decoder 502 (or more generally: a first decoding stage) and a second SISO decoder 503 (or more generally: a second decoding stage). The structure and operation of these blocks is known to the person skilled in the art. Iterative channel decodmg is possible, even if not shown, by setting up an inner feedback loop between the decodmg stages. In the embodiment of Fig. 5a the feedback information to channel estimation and signal equalization is taken from the output of the second SISO decoder 503 through a re- interleaver 504. In the embodiment of Fig. 5b it is taken from the output of the first SISO decoder 502 again through a re-interleaver 505. Fig. 5c illustrates a combined arrangement where both above-mentioned feedback couplings are available. The invention does not require the use of two or more serially coupled decoding stages: as a generalization we may note that any one of the decoding stages 502 and 503 may be a "nul decoder" which does not affect the signal going therethrough in any way.
The de- and re-interleaver blocks 501. 504 and 505 represent any signal processing operations which are made before the point from which the feedback information is taken and which therefore must be compensated for in order to make the feedback information compatible with the received signal at the stage when it enters the iterative channel estimator. Fig. 5d shows how the feedback information to the
iterative channel estimation step may be taken even directly from the output of the signal equalizer before channel decoding at all. The approach of Fig. 5d can be combined to any of the other approaches shown in Figs. 5a to 5c in order to get channel decoded feedback information to the signal equalizer and even as an additional input to the channel estimator.
Simulation shows that the invention provides a remarkable improvement in receiver performance especially if the radio channel has a relatively long delay spread, because in such channels conventional one-shot channel estimation methods fail to give a reliable channel estimate due to the limited length of the training sequence.
In a patent application which is filed simultaneously at the priority date of this application by the same applicant there is presented a method and an arrangement for multiplexing several users to the communication channels of a TDMA system. The solution presented therein is based on allowing two simultaneous connections to use a same time slot, and by using coding and decoding arrangements to separate the transmissions related to the different connections. Especially in the uplink direction the solution calls for two mobile stations to transmit in a common time slot allocated for uplink transmission. A framing sequence is transmitted exactly in the middle of the time slot and each mobile station uses its own form of the framing sequence and only transmits meaningful information on its own side of the framing sequence: the first mobile station transmits meaningful information in the first half of the time slot before the framing sequence, and the second mobile station transmits meaningful information in the second half of the time slot after the training sequence.
The present invention is especially applicable to the joint channel estimation which a base station must perform m order to separate the two uplink transmissions from each other, because the simultaneous appearance of the two mutually different training sequences tends to impair conventional channel estimation based on the framing sequence alone. When the base station has decoded for the first time the meaningful information part sent by one mobile station, it has much more reliable symbol information at its disposal than just a partly corrupted training sequence. Already after feeding back the information from the channel decoding stage for the first time it can generate a much more reliable channel estimate for the signal of the mobile station in question.
Fig. 6 illustrates a first mobile teπninal 601 and a second mobile terminal 602 (or generally: first and second transmitting arrangements) which both have a communication connection to a base station subsystem 603 (or generally, a receiving arrangement). The transmission chain in both mobile terminals is a similar serial connection of a data source 610 (620). a parity encoding unit 611 (621), an optional scrambler 612 (622). a channel encoder 613 (623), an interleaver 614 (624), a burst formatter 615 (625), a modulator 616 (626). a transmitter 617 (627 and a fransmitting antenna 618 (628 ). In the base station subsystem a receiving antenna 630 is coupled through a receiver 631 to a joint channel estimator 632, from which there are connections to two parallel reception subchains. Each reception subchain is a serial connection of an equalizer 640 (650), a burst decomposer 641 (651), a deinterleaver 642 (652). a channel decoder 643 (653). an optional descrambler 644 (654), a parity check unit 645 (655) and a data sink 646 (656).
In the arrangement of Fig. 6 the operation of the mobile stations is known to the person skilled in the art except for the way m which the burst formatting units 615 and 625 take interleaved symbols from the corresponding interleavers 614 and 624 as constituents for digital bursts. Fig. 7 illustrates an exemplary pair of digital bursts which generally correspond to the known GSM and EDGE specifications. The first digital burst 700 consists, in this order, of three front tail symbols 701, a (first) data field 702 with 57 data symbols, a (first) stealing flag symbol 703, a framing sequence 704 with 26 framing symbols, a dummy stealing flag symbol 705, a dummy data field 706 with 57 dummy symbols and three back tail symbols 707. The second digital burst 710 consists, in this order, of three front tail symbols 711. a dummy data field 712 with 57 dummy symbols, a dummy stealing flag symbol 713, a framing sequence 714 with 26 training symbols, a (second) stealing flag symbol 715, a (second) data field 716 with 57 data symbols and three back tail symbols 717. In other words, the modification with respect to the known GSM and EDGE specifications consists of replacmg the second stealing flag symbol and second data field in the first digital burst 700 and the first data field and first stealing fla^ symbol in the second digital data burst 710 with dummy symbols. Additionally each mobile terminal uses its own training sequence in the fields 704 and 714.
The dummy symbols may be some predefined constant symbols or they may mean instants of no transmission of symbols at all (cf. the tail symbols which mean no transmission of symbols at all). It is probably most advantageous to use the latter alternative, because not transmitting at all for the duration of dummy "symbols" means that less interference is generated and transmission power is not used in vain.
Keepmg the general interference level low is advantageous because it directly improves the overall achievable capacity of a cellular radio system. Savings in transmission power are especially important in portable radio terminals where they help to extend the interval between two successive battery rechargrngs. For the si.κe of consistency we will use, throughout this patent application, the designation "dummy symbols" even in association with those embodiments of the invention where nothing is actually transmitted in place of the dummy fields of a transmission burst.
The association of non-dummy fields with certain mobile stations is emphasized by hatching. The modulator 616 (626) converts the digital burst into a transmission burst according to known methods, and the transmitter 617 (627) transmits it through the transmitting antenna 618 (628).
When the base station subsystem receives the simultaneously transmitted transmission bursts produced from the digital bursts 700 and 710 through the receiving antenna 630 and receiver 631, it uses the joint channel estimator 632 to obtain imtial channel estimates for the two different framing sequences 704 and 714. The invention does not limit the selection of technology for joint channel estimation, but an advantageous method is for example that described in the publication "Co-channel Interference Cancelling Receiver for TDMA Mobile Systems" by P.A Ranta, A. Hottinen and Z.-C. Honkasalo, Proc. ICC'95, pp. 17-21, 1995, which is incorporated herein by reference. When the base station subsystem has obtained initial channel estimates for the propagation channels between it and both mobile teπninals, it is able to equalize and decode the data fields from both transmission bursts in the parallel equalizers 640 and 650 and the parallel decoders 643 and 653. Feedback for iterative channel estimation and equalization is provided through the re-interleaving blocks 647 and 657. Note that the use of dummy symbols ensures that the base station subsystem does not receive temporally overlapping data symbols, which should make the improvement obtained through iterative channel estimation considerable.
The above-described examplary embodiments of the invention should not be construed as placing limitations to the scope of applicability of the appended clain: Especially the certain additional features that are disclosed as further developments of the basic invention are not mutually exclusive but can be combined in a multitude of ways.