WO2000070835A1

WO2000070835A1 - Method for blindly estimating channel parameters

Info

Publication number: WO2000070835A1
Application number: PCT/DE2000/001482
Authority: WO
Inventors: Markus Doetsch; Peter Jung; Jörg PLECHINGER; Peter Schmidt
Original assignee: Infineon Technologies Ag
Priority date: 1999-05-12
Filing date: 2000-05-11
Publication date: 2000-11-23
Also published as: DE19922184A1

Abstract

The invention relates to a method for estimating channel parameters of a mobile radio telephone channel in which a subscriber-specific code is impressed upon a data signal to be transmitted. The data signal coded in such a subscriber-specific manner is transmitted over a radio channel and is received by a receiver. The receiver, using knowledge of the code, obtains a subscriber-separated data signal and delivers said signal to a channel estimator. The channel estimator determines the channel parameters of the radio channel and uses data symbols therefore whose corresponding transmitted data symbols are unknown to said channel estimator.

Description

description

METHOD FOR THE BLIND ESTIMATION OF CHANNEL PARAMETERS

The invention relates to a method for estimating channel parameters of a radio channel of a mobile radio system used for the transmission of a message according to the preamble of claim 1.

In the transmission of data via a mobile radio channel, particular difficulties arise which, on the one hand, are related to the fact that the transmission properties of the mobile radio channel change continuously over time and, on the other hand, are based on the fact that the mobile radio channel should be usable simultaneously for as large a number of subscribers as possible.

The constant change in the transmission properties of the mobile radio channel makes it necessary for a receiver (in addition to receiving the transmitted data signals) to continuously determine the current transmission properties of the mobile radio channel in order to enable detection of the received data signals. This applies both to the transmission link from a mobile station to a base station (uplink) and to the transmission link from a base station to a mobile station (downlink). The transmission properties of the mobile radio channel are determined using a channel estimator present in the receiver.

The shared use of a mobile radio channel by a plurality of subscribers is regulated by multiple access methods. In addition to the well-known TDMA (Time Division Multiple Access: time division multiplex) and FDMA (Frequency Division Multiple Access: frequency division multiplex) methods, in which the participants are separated into separate, participant-specific time intervals or

Frequency sub-bands have been referenced in recent years CDMA (Code Division Multiple Access: Code Division Multiplex) driving gained significantly in importance. In the CDMA method, a subscriber-specific code is embossed on each data symbol to be transmitted, which code makes the transmitted data symbol distinguishable (and thus detectable) from transmitted data symbols of other participants, as it were, in the manner of a fingerprint.

A first known method for channel estimation in CDMA transmission systems is in the book "Analysis and Design of Digital Mobile Radio Systems" by P. Jung, Stuttgart, B.G. Teubner, 1997 in chapter 6.3 and there described in particular on pages 253 (upward stretch) and 261 (downward stretch). The channel estimation is based on so-called learning or training sequences, which are integrated in the CDMA radio data block in addition to the message-carrying sequences as middle messages (i.e. in the middle of a data block). The symbol sequence of the training sequence is known to the channel estimator provided on the receiver side. Each time a ("disturbed") training sequence is received, the channel estimator determines the channel parameters in the form of the channel impulse responses on the basis of a comparison with the transmitted ("undisturbed") training sequence known to it. The determined channel impulse responses are then used to detect message-carrying data symbols adjacent to the training sequence. As a result, such an arrangement of a CDMA radio data block executes an alternating sequence of a channel measurement step and a message data detection step (based on the result of the channel measurement step).

Another known way of channel estimation in a CDMA transmission system is described in the book "CDMA" by AJ Viterbi, Edisonley Publishing Company, 1995 on pages 87-92 (for the downlink). Here the sending base station superimposes a subscriber-specific CDMA-encoded subscriber signals on a continuous pilot signal that is common to all mobile stations (ie subscribers). The common pilot signal has the constant data symbol value 1. A special pilot code, which is known to every participant, is stamped on the pilot signal. Each subscriber continuously receives the subscriber-specific coded subscriber signal as well as the common pilot signal and uses the pilot signal to determine the current values of the channel parameters (in the text given these are the relative values for the amplitude oti and the phase φi of the mobile radio channel transmission).

A disadvantage of both known methods is that the use of training sequences or pilot signals reduces the maximum transmission rate of information (hereinafter referred to as the information rate) that can be achieved with CDMA data transmission.

In this context, “information” to be transmitted means all data symbols that are not specifically provided for the purpose of channel estimation in the transmitted signal. Accordingly, the information to be transmitted also includes in particular the message to be transmitted.

The invention has for its object to provide a method for estimating channel parameters of a radio channel, which enables a high information rate in CDMA multiple access systems.

The object is solved by the features of claim 1.

An essential advantage of the method according to the invention is that by using data symbols of the data signal to be transmitted that are unknown a priori for the channel estimation, the amount of special data symbols that must be inserted into the data signal to be transmitted specifically for the purpose of channel estimation is used ( training sequences, pilot signal), can be reduced or that no such special data is required at all. be done. The transmission capacity thus freed up can be used to increase the information rate.

In principle, the estimated channel parameters can be determined solely from the data symbols of the data signal to be transmitted that are unknown a priori to the receiver. Another possibility is to continue to use special data symbols (training sequences, pilot signal) provided for this purpose for the estimation of the channel parameters. In the case of such a “hybrid” channel estimation, an optimal compromise can be made between the inexpensive but inexpensive (conventional) channel estimation by means of special data symbols, and the channel estimation based on the invention, which is unknown to the receiver and may be more complex but allows a higher information rate Data symbols can be found. For example, a "hybrid" channel estimation according to the invention can be implemented in such a way that first a rough estimation of the channel parameters takes place in a conventional manner (using training sequences or a pilot signal) and the channel parameters are subsequently re-estimated to achieve higher accuracy using the channel estimation according to the invention.

A first embodiment of the method according to the invention is characterized in that the data symbols of the data signal to be transmitted which are unknown a priori to the receiver are data symbols carrying control information. An example of data symbols carrying control information are data symbols, the coding information (for example the code rate used in the channel coding for the channel coding or the spreading factor used in the spread coding), information relating to the cellular structure of the mobile radio network (for example the frequency ranges of the neighboring base stations), general Information about the available services or similar information intended to control or monitor the mobile radio system contain. This control information is a priori unknown to the recipient (which is why it is communicated to him), but is usually constant (at least over a longer period of time) and is emitted in constant repetition, so that it is known to the recipient after an initial detection . They can then be used according to the usual procedure for a channel estimation, ie the channel estimator determines the estimated channel parameters by correlating these data symbols carrying the control information of the received, subscriber-specific, separated data signal with the data symbols of the receiver to be transmitted which have become known to the receiver Data signal.

A second embodiment of the method according to the invention is characterized in that the data symbols of the data signal to be transmitted which are unknown a priori to the receiver are data symbols carrying messages.

Sequences of message-bearing data symbols usually have no special regularities or repetitions. A preferred procedure for channel estimation using message-bearing data symbols is characterized in that the channel estimator determines the estimated channel parameters by correlating message-bearing data symbols of the received, subscriber-specific, separated data signal with hypotheses of the corresponding message-bearing data symbols of the data signal to be transmitted, ascertained by data detection. In this embodiment, no knowledge of the data symbols to be transmitted is required on the receiver side. The channel parameters can be estimated in an iterative manner by using channel parameters which were determined when the channel was estimated earlier in order to determine the hypotheses of the message-carrying data symbols of the data signal to be transmitted. Since the channel estimation according to the invention takes place on the basis of subscriber-specific (ie CDMA) coded data symbols, the CDMA code used has a considerable influence on the effort required and the quality of the channel estimation. In the case of a complex-value CDMA code, a Frank Fadoff-Chu sequence, a Frank sequence or a polyphase sequence is preferably used as the CDMA code sequence. These sequences have an ideal pulse-shaped periodic autocorrelation function (PAKF) (and are therefore also referred to below as sequences with "perfect" PAKF).

When using a binary subscriber-specific CDMA code, it is advantageous to use a Kasami sequence as a CDMA code sequence. Kasami sequences are characterized by a PAKF and PKKF (periodic cross-correlation function) with good (but not perfect) correlation properties.

The algorithm of the signal-matched filtering (so-called matched filter: MF) is preferably used for the channel estimation. The MF channel estimation is extremely cost-effective and has the advantage that it has a maximum signal-to-noise ratio at its output. However, it is only free from systematic estimation errors if the sequences on which the estimation is based of message-carrying (CDMA-decoded) data symbols of the received data signal have ideal correlation properties. Since the above-mentioned complex CDMA code sequences have a perfect PAKF, they are particularly suitable for MF channel estimation.

When using a Gaussian estimate, an ML estimate or a MAP estimate as the algorithm for the channel estimate, systematic estimation errors are avoided even if not ideally correlated sequences of CDMA-decoded data symbols (such as, for example, by spreading coding the data to be transmitted Data signal are generated with a Kasami CDMA code sequence) on which the channel estimation is based. A mean channel parameter can expediently be calculated from a plurality of (N) channel parameters. This is particularly favorable when the transmission properties of the mobile radio channel change only comparatively slowly, which is the case, for example, with a stationary mobile station in an obstacle-free (rural) radio wave propagation area.

Another preferred possibility is that interpolated M interpolated channel parameters are determined between two successive channel estimates. The determination of interpolated channel parameters can be advantageous, for example, in the case of a rapidly moving mobile station in areas which are unfavorable for wave propagation (e.g. cities), since under these conditions the transmission properties of the mobile radio channel change quickly and additional channel parameter values are required which are cost-effective due to interpolation (without implementation) a channel estimate) can be generated.

Further preferred embodiments of the invention are specified in the subclaims.

The invention is explained below using an exemplary embodiment with reference to the drawing; in this shows:

Figure 1 is a schematic representation of the air interface of a mobile radio system.

2 shows a block diagram of a transmission device;

3 shows a block diagram of a CDMA spreading code encoder and an example of a spread-coded data symbol generated therewith; 4 shows a schematic representation of the structure of a CDMA message data block;

Fig. 5 is a block diagram of a receiver device; and

FIG. 6 shows a structural representation of the channel estimator shown in FIG. 5.

1 shows a schematic representation of the air interface of a cellular mobile radio system. Bidirectional communication connections can be set up between three mobile stations MSI, MS2, MS3 assigned to individual subscribers and a common base station BS. The respective transmission behavior of the air interface is described by the three radio channels K1, K2, K3.

The communication connections between the base station BS (connected to a long-distance communication network) and the mobile stations MSI, MS2, MS3 are subject to a multipath propagation, which is caused by reflections, for example, on buildings or

Plantings in addition to the direct path of propagation. If one assumes a movement of the mobile stations MSI, MS2, MS3 (relative to the fixed base station BS), the multipath propagation together with further disturbances leads to the fact that the receiving station MSI, MS2,

MS3 or BS overlap the signal components of the different propagation paths of a subscriber signal as a function of time. As a result, the transmission properties of the radio channels K1, K2, K3 change continuously.

Furthermore, a superposition of several subscriber signals occurs both in the uplink and in the downlink. The subscriber separation carried out in the receiver devices of the mobile stations MSI, MS2, MS3 or the base station BS is carried out by one of the known CDMA

Methods, for example FH (Frequency Hopping: Frequency jump-) CDMA, MC- (multicarrier code: multi-carrier-) CDMA or DS- (direct sequencing-) CDMA.

2 shows a block diagram of a transmission device BSS, for example arranged in the base station BS, for carrying out the method according to the invention. The transmission device BSS contains control means SES with a storage device PLC, modulation means MOD and a high-frequency transmission stage HFS.

The modulation means MOD are supplied with data symbols x which are intended for a specific mobile station MSI or MS2 or MS3 of a specific subscriber. The message-carrying data symbols x contain the voice message to be transmitted.

In a first (optional) data processing device DATS of the modulation means MOD, the message-carrying data symbols x are brought into a data structure suitable for radio transmission. This step includes, for example, error protection by channel coding (i.e. adding redundancy) and interleaving (i.e. deliberately changing the data symbol sequence) of the message-carrying data symbols x. Furthermore, data symbols s carrying control information can be generated and added to the data symbols carrying messages.

The data symbols x which may be channel-coded and interleaved are referred to as d below.

A data block is subsequently formed in a block former BS of the modulation means MOD. Different types of data blocks are usually used.

To form a message data block, for example, the sequence of data symbols d is first divided into sequences with because NS divides data symbols d. The number NS is communicated to the block builder BS by the control means SES. Then a training sequence of data symbols z known a priori by the receiver and optionally further data symbols are added to the sequences of data symbols d carrying messages. The resulting block structure will be explained later in connection with FIG. 4.

For the transmission of control information, other data blocks, possibly constructed in a similar manner, can be formed which contain the data symbols s carrying control information.

Data symbols d, s which carry messages and carry control information can also be present together in one data block.

At least the message-carrying data symbols d (usually also the control information-carrying data symbols s and other data symbols such as z) are subjected to a subscriber-specific spreading coding in a spreading code encoder SPRZCOD of the modulation means MOD. The spreading code sequence C used for this purpose is also stored in the memory device SPS and is communicated by this to the spreading code encoder SPRZCOD.

FIG. 3 shows a block diagram of the CDMA spreading code encoder SPRZCOD, as can be used in the modulation means MOD in the case of DS-CDMA coding. The spreading coding is explained here using the example of a data symbol d carrying messages. This is effected by multiplication by the periodic code sequence C of the elements c (i), i = 1, 2, ..., L representing the spreading code. The elements c (i) are also referred to below as chips c (i) of the code sequence C and L is referred to as the length of the code sequence C. It is assumed that the duration of a chip c (i) is shorter than the duration of a data symbol d (or s or z). An example of the subscriber-specific DS-CDMA- based on binary, bipolar, message-carrying data symbols d of the values d = {-1, 1} and binary, bipolar chips c (i) of the values c (i) - {-1, 1} Coding is in the lower part of FIG. 3 on the basis of a data symbol d with the value d = 1 and a section of the code sequence C occurring at the same time (with the chip values 1, 1, -1, 1, -1, -1, -1 , 1). The number Q of chips c (i) per data symbol d is 8.

With regard to the message-carrying data symbol d = 1 shown, the values d _c (i) = dc (i) = c (i) result for the coded (“spread”) data symbol. With respect to d = -1 (not shown), the values d _c (i) = dc (i) = - c (i) result. The same applies to a data symbol s carrying control information or a data symbol z of the training sequence. The CDMA-coded message-carrying data symbol d _c (i) is also referred to in the following in simplified form as d _c . Analogously, s _c or z _c denotes a spread-coded data symbol carrying control information or a spread-coded data symbol of the training sequence.

The spread-coded data symbols available at the output of the modulation means MOD (including d _c , s _c and possibly z _c ) are fed to the high-frequency transmission stage HFS, where they are converted into an analog signal, modulated onto a carrier and emitted as a radio wave.

4 uses the example of a message data block to illustrate the structure of a data block occurring at the output of the modulation means MOD. A message data block used in the method according to the invention can, but need not, be different from CDMA message data blocks, as are already used in conventional methods for channel estimation. The structure of the message data block shown here as an example is practically identical to that of a conventional CDMA transmission used data block, ie it consists of a first sequence SI of NS message-carrying data symbols d _c , a training sequence TR from the receiver known a priori data symbols z _c , a second sequence S2 of NS message-carrying data symbols d _c and one ending the data block Protection sequence GP.

The explained spreading of the individual message-carrying data symbols d _c , each with Q chips c (i) of the spreading code sequence C, is illustrated in the lower left part of FIG. 4.

When using such a message data block for channel estimation, the method according to the invention is based on the fact that the message-carrying data symbols d _{c of} the sequences SI, S2 are at least partially used for the channel estimation on the receiver side. As a result, in the method according to the invention, message data blocks with a significantly smaller number of data symbols z _c specially provided for the channel estimation can be used in the training sequence TR than in the case of conventionally used message data blocks. The training sequence TR (or a pilot signal or the like) can even be dispensed with entirely. As a result, the number 2NS of message-carrying data symbols d _{c can be} increased and a comparatively high information rate can thus be achieved.

The total time period of a data block can be approximately 0.5 ms. A data block can contain a total of approximately 150 data symbols, for example.

5 shows a block diagram of a receiver device MSE (used for example in a mobile station). The receiver device MSE contains control means SEE with a storage device SPE, demodulation means DMOD with a spreading code decoder SPRZDECOD, a channel estimator KS, a data detector DD and a data processing device DATE as well as a high frequency reception stage HFE. The high-frequency receiving stage HFE receives the radio wave emitted by the transmitting device BSS via an antenna and converts it into an analog received signal in the usual way by down-watching.

The analog received signal is digitized in a manner not shown by an analog / digital converter with a sufficiently high sampling rate, at least corresponding to the chip rate, and bandwidth-limited by means of a downstream digital filter.

The digital, spread-coded received signal obtained in this way is supplied to the spread-code decoder SPRZDECOD of the demodulator means DMOD. The spreading code decoder SPRZDECOD separates the subscriber signals, which requires knowledge of the spreading code sequence C used on the transmitter side as well as synchronization with the spreading code encoder SPRZCOD on the transmitter side. The spreading code sequence C used by the transmitter (i.e. the subscriber-specific CDMA code) is stored in the storage device SPE on the receiving side. It is either predefined or is negotiated every time the call is started between the base station BS and the mobile station MSI, MS2, MS3, i.e. selected from a plurality of code sequences C stored in the storage device SPE.

The spreading code decoder SPRZDECOD can be identical to this in the case of the spreading code encoder SPRZCOD shown in FIG. it can also consist of a multiplier that multiplies the incoming digital, spread-coded received signal by the associated spread code sequence C.

The spread code sequence C used for the spread coding / decoding is discussed below. In principle, all possible spread code sequences C, in particular binary (c (i) = {0, 1} or c (i) = {-1, 1}) and complex-value (c (i) = complex number) code sequences C can be used . Particularly suitable code sequences C have good correlation properties. Such code sequences C are described in book "Correlation Signals" by HD Luke, Springer-Verlag, 1992 in chapters 4 (sequences with good periodic correlation behavior) and 5 (families of periodic correlation sequences) on pages 69-111 (see in particular: Chap 5.3.3: Kasami sequences; Chapter 4.7.1: Frank and Frank Fadoff-Chu sequences; Chapter 4.7.2-5: polyphase sequences) and are made the subject of the present application by reference.

A subscriber-separated digital reception signal is available at the output of the spreading code decoder SPRZDECOD. This contains, among other things, the disturbed versions d, s and z of the data symbols d carrying messages, data symbols s carrying control information and data symbols z of the training sequence TR.

The subscriber-separated digital reception signal is fed to a data detector DD. In the case of a channel estimation using message-carrying data symbols, at least some of the data symbols d are supplied, and in the case of a channel estimation using data symbols carrying control information, at least some of the data symbols s are supplied to the channel estimator KS. If available, the data symbols z of the training sequence TR, which are provided specifically for a channel estimation, are also supplied to the channel estimator KS.

6 shows the basic structure of the channel estimator KS. At an input E, the channel estimator KS accepts the data symbols d and / or s and, where appropriate, z provided for the channel estimation. At another input K, the channel estimator KS has a knowledge of the supplied part of the (“disturbed”) data symbols d and / or s and possibly z nis ready via the associated ("undisturbed") data symbols d, s, z. By correlating this knowledge of d, s, z with the received data symbols d, s, z, the channel estimator uses a computing algorithm to calculate current channel parameters h1, h2, ... of the mobile radio channel K1 or K2 or K3. With each channel estimation, the determined current channel parameters h1, h2, ... are output at an output A of the channel estimator KS.

The knowledge at the input K about the data symbols d, s, z to be transmitted is of a different nature.

If data symbols z for channel estimation are available, they are known a priori to the channel estimator.

If data symbols carrying control information s are to contribute to the channel estimation, they are initially not known to the channel estimator KS (ie a priori), but can be determined quickly (also due to a frequently small supply of values) and are then until they change sent out repeatedly, known at least for a while. Precise knowledge is therefore available after a short time with regard to the data symbols s. This is thus made up of the received data signal and possibly additional

Knowledge of the tax information (for example, its stock of values) gained.

If (also a priori unknown) message-carrying data symbols d are to be used for channel estimation, the channel estimator KS is provided with hypothetical knowledge H (d) of the message-carrying data symbols d to be transmitted, which is essentially generated solely from the received data signal. H (d) can be generated by an iterative channel estimation and data detection process. First, on the basis of channel parameters hl previously estimated in the channel estimator KS, h2, ... is calculated by means of the data detector DD with regard to data symbols d that are currently running ^{¬ and} hypotheses of the data symbols d to be transmitted that are the basis of the data symbols d that are currently arriving, and then these hypotheses of d the channel estimator KS as (hypothetical)

Knowledge H (d) of d supplied. It should be noted that to calculate a good hypothesis H (d) of d, the channel parameters hl, h2, ... used must not be too "old" (more precisely: obtained with respect to the time of the data detection step within the coherence time of the mobile radio channel) must have been), because otherwise the iterative sub-steps channel estimation and data detection are decoupled due to the time variance of the mobile radio channel.

At inputs KOI, K02, the channel estimator KS can optionally have a priori knowledge, for example, of known properties E (h) of the channel impulse response h or of known properties E (n) of the interference n occurring in the mobile radio channel for the estimation of the channel parameters hl, h2,. .. to provide.

In summary, it can be said that the received data signal for estimating the channel parameters according to the invention is subjected to a double correlation (once with the code sequence C for subscriber separation and once with the knowledge regarding d and / or s and possibly z).

The algorithms described in the book by P. Jung mentioned in chapter 5.2.3 on pages 201-206 can be used to estimate the channel parameters hl, h2, ... (ie the channel impulse response h). These algorithms are the subject of the present application by reference. These are the algorithms for signal-adapted filtering, the Gaussian estimate, the ML estimate and the MAP estimate. The estimated channel parameters h1, h2, ... (channel impulse response h) are fed to the data detector DD. This determines by folding the received disturbed versions d (possibly s, z) with the current channel impulse response h (parameterized by the channel parameters hl, h2, ...)

Estimated data symbols d (possibly s, z) for the data symbols d to be transmitted (possibly s, z).

At the latest during data detection, the block structure (see FIG. 4) must also be taken into account, i.e. A distinction must be made as to which of the estimated data symbols d relate to data symbols d carrying messages and which of the estimated data symbols relate to other information. For this purpose, corresponding data about the block structure used (including the sequence length NS) are stored in the storage means SPE and are communicated to the demodulator DMOD.

The estimated data symbols d for the message-carrying data symbols d are fed to the (optional) data processing device DATE. In the data processing device DATE, the processing steps carried out in the transmitting data processing device DATS are essentially reversed, i.e. deinterleaving and channel decoding take place. The data symbols which have been deinterleaved and decoded in DATE are designated by x and are the estimates of the data symbols x in Fig. 2 (i.e. the detection result of the receiving device MSE).

The channel estimation can be carried out continuously (ie without a break) or at discrete times. The time period between two successive channel estimates and also the time period of the individual channel estimates can be adapted to the current circumstances. In the case of a slowly changing mobile radio channel, a comparatively long period of time (approximately 3 ms) can be set between two successive channel estimates, while in the case of a fast one variable mobile radio channel a short period of time (about 0.3 ms) between two successive channel estimates can be set. The duration of a single channel estimate can be, for example, 50 to 80 times a chip duration (it does not have to be a multiple of the symbol duration). Furthermore, intermediate values for the channel parameters hl, h2, ... can be obtained by interpolation and / or mean values of the channel parameters hl, h2, ... can be calculated in each case. The latter can be advantageous, for example, if instead of a long-lasting channel estimate with high accuracy, many short-term channel estimates are carried out with a correspondingly lower accuracy, then by choosing a suitable number of channel estimates for the averaging (for example 2 to 5), channel-optimized optimization is always carried out between the accuracy of the estimation result (ie the result of the averaging) and the repetition rate of the averaging can be realized.

Claims

claims

1. A method for estimating channel parameters of a radio channel (Kl, K2, K3) used for transmitting a message in a receiver of a mobile radio system (MSI, MS2, MS3; BS), wherein

- there is a data signal to be transmitted containing data symbols (d, s, z) in a transmitter (BBS) of the mobile radio system (MSI, MS2, MS3; BS), - the data signal to be transmitted has a subscriber-specific code (c (i), .. ., c (Q)) is impressed,

the data signal coded in such a subscriber-specific manner is transmitted via the radio channel (K1, K2, K3),

- In the receiver (MSE) from a data signal received at the output of the radio channel (K1, K2, K3) with knowledge of the subscriber-specific code (c (i), ..., c (Q)), a received separate from received data signals from other subscribers Data signal is obtained, and

- This received, subscriber-separated data signal is fed to a channel estimator (KS), which repeatedly determines estimated channel parameters (hl, h2, ...) of the radio channel (Kl, K2, K3) and provides them at its output, characterized in that the channel estimator (KS ) the estimated channel parameters (hl, h2, ...) are determined using data symbols (d, s) of the received, subscriber-separated data signal, the corresponding data symbols (d, s) of the data signal to be transmitted are unknown a priori to the receiver.

2. The method of claim 1, d a d u r c h g e k e n n z e i c h n e t that it is the a priori unknown data symbols of the data signal to be transmitted to control information-carrying data symbols (s).

3. The method according to claim 1, characterized in that the a priori unknown data symbols of the data signal to be transmitted are message-carrying data symbols (d).

4. The method according to claim 3, characterized in that the channel estimator (KS) the estimated channel parameters (hl, h2, ...) by correlating the message-carrying data symbols (d) of the received, subscriber-separated data signal with hypotheses determined by data detection (H ( d)) the corresponding message-carrying data symbols (d) of the data signal to be transmitted are determined.

5. The method of claim 4, d a d u r c h g e k e n n z e i c h n e t that channel parameters (hl, h.2, ...) are used to determine the hypotheses (H (d)) of the data signal to be transmitted, which were determined in a channel estimate made earlier.

6. The method according to any one of the preceding claims, characterized in that the subscriber-specific code (c (i), ..., c (Q)) is generated by a complex-valued Frank Fadoff-Chu sequence, Frank sequence or polyphase sequence .

7. The method according to any one of claims 1 to 5, so that the subscriber-specific code (c (i), ..., c (Q)) is generated by a binary Kasami sequence.

8. The method according to any one of the preceding claims, d a d u r c h g e k e n n z e i c h n e t that a signal-adapted filtering is used as the algorithm for the channel estimation.

9. The method according to any one of claims 1 to 7, characterized in that a Gaussian estimate, an ML estimate or a MAP estimate is used as the algorithm for the channel estimate.

10. The method according to any one of the preceding claims, characterized in that the time duration of an individual channel estimate is 50 to 80 times the time duration of an element (c (i)) of a subscriber-specific code (c (i), ..., c (Q)) generating code sequence (C).

11. The method according to any one of the preceding claims, d a d u r c h g e k e n n z e i c h n e t that an average channel parameter is calculated from N channel parameters, which were estimated in N channel estimates.

12. The method of claim 11, d a d u r c h g e k e n n z e i c h n e t that N is 2 or 3.

13. The method according to any one of the preceding claims, d a d u r c h g e k e n n z e i c h n e t that between two successive channel estimates by interpolation M interpolated channel parameters are determined.

14. The method of claim 13, d a d u r c h g e k e n n z e i c h n e t that M is between 10 and 30.

15. The method according to any one of the preceding claims, characterized in that the time periods between successive channel estimates depending on a relative speed between see the transmitter (BBS) and the receiver (MSE) can be selected.