Abstract:
A data transmission method includes transmitting an encoded data signal in form of a data stream of data bursts between a transmitter and a receiver, making a decision as a function of at least one data transmission parameter as to whether an interference treatment of the data signal to be transmitted will be performed in the transmitter or in the receiver, performing the interference treatment in terms of at least on code in the transmitter, and performing the interference treatment of the data to be transmitted in terms of at least one further code in the receiver.

Description:
CROSS REFERENCE TO RELATED APPLICATIONS 
     The present application is a continuation application of U.S. patent application Ser. No. 10/380,583, filed Mar. 14, 2003. The invention described and claimed herein is also described in PCT/DE00/03604, filed on Oct. 13, 2000 and DE 19950021.5, filed Oct. 16, 1999. This German Patent Application, whose subject matter is incorporated here by reference, provides a basis for a claim of priority of invention under 35 U.S.C. 119(a)-(d). 
    
    
     BACKGROUND OF THE INVENTION 
     The present invention relates to a data transmission method, in which an encoded data signal is transmitted in the form of a data stream of data bursts between a transmitter and a receiver, and to a corresponding data transmission apparatus. 
     Although in principle the present invention can be employed for arbitrary data transmissions, it will be explained along with the problems it seeks to solve with regard to a cellular CDMA (Code Division Multiple Access) data transmission system. 
     In particular, by means of CDMA, a plurality of data streams can be transmitted simultaneously over a joint frequency band, as known for instance from K. D. Kammeyer,  Nachrichtenübertragung  [Communications Transmission], 2nd Edition, in the series entitled  Informationstechnik , published by Teubner, Stuttgart, 1996. 
     In CDMA, a simultaneous transmission of multiple data is effected by encoding the data with codes that are as much as possible uncorrelated, and by superposition of the encoded signals. 
     In data transmission, among other things, data transmitted in succession or simultaneously interfere with one another; that is, troublesome interference typically occurs in the transmission, in particular intersymbol interference (ISI) from multi-path transmission, and multiple access interference (MAI) by correlated codes. 
     The following methods are known for interference treatment:
         a rake receiving device, located in the receiver, for treating the ISI, as known from John G. Proakis: “Digital Communications”, 3rd Edition, McGraw-Hill, New York, etc., 1995;   joint detection (JD) in the receiver for treating ISI and MAI, as known from A. Klein, G. K. Kaleh and P. W. Baier: Zero Forcing and Minimum Mean-Square-Error Equalization for Multiuser Detection in Code-Division Multiple Access Channels, IEEE Trans. Vehic. Tech., Vol. 45 (1996), 276-287;   pre-rake combining in the transmitter for treating ISI, as known from R. Esmailzadeh and M. Nakagawa: “Pre-Rake Diversity Combination for Direct Sequence Spread Spectrum Mobile Communications Systems”, IEICE Trans. Comm., Vol. E76-B (1993), 1008-1015; and   a joint preequalization in the transmitter for treating ISI and MAI.       

     In this type of data transmission, preequalization in the transmitter is an important interference treatment. Joint preequalization in the transmitter of data signals to be transmitted makes simple data detectors possible. In transmission channels that change quickly, however, preequalization in the transmitter leads to higher error rates than with interference treatment techniques in the receiver. For preequalization, the transmitter must know the pulse response of the transmission channel to be used. The TDD (Time Division Duplex) method makes it possible to achieve this knowledge. Accordingly, the channel is estimated before the data transmission. 
     The following have proved to be disadvantages of the prior art:
         the rake receiving device does not eliminate MAI;   JD is very complicated;   joint preequalization is usable only for channels that change slowly.       

     SUMMARY OF THE INVENTION 
     A concept fundamental to the present invention is that a combination of joint preequalization in the transmitter and interference treatment in the receiver is performed. The signals to be transmitted are accordingly jointly preequalized in such a way that for some of the data to be transmitted, interference can be eliminated in the transmitter, and the interference of the other data can be treated in the receiver. 
     This has the particular advantage of making joint preequalization and interference treatment in the receiver possible in a single system. As a result, a simple receiver with a channel that changes slowly is possible, and at the same time, transmission with a channel that changes quickly is possible. 
     Another concept fundamental to the present invention is that in an interference treatment in the transmitter, the channel estimate required for the preequalization is predicted from a plurality of prior channel estimates. 
     This has the particular advantage that the channel estimate better corresponds to the channel at the instant of transmission. This improves the transmission when the transmission channel is changing quickly. 
     Another concept fundamental to the present invention is that an estimate of the channel pulse response used by the transmitter is performed by the receiver, and the data are detected using this channel estimate. 
     This also has the particular advantage that the transmission when the transmission channel is changing quickly is improved. 
     Advantageous refinements of and improvements to the applicable subject of the invention are found in the dependent claims. 
     In a preferred refinement, the interference treatment is performed in terms of at least one code in the transmitter, and the interference treatment of the data to be transmitted is performed in terms of at least one further code in the receiver. 
     In a further preferred refinement, the data signal is CMDA-encoded. 
     In a further preferred refinement, the codes of the data signal to be transmitted are pre-distortion-suppressed jointly, and for some codes, the pulse function is used as a channel estimate. 
     In a further preferred refinement, the data with a channel estimate performed as a pulse function are detected in the receiver by a rake receiving device. 
     In a further preferred refinement, in an interference treatment in the transmitter, the channel estimate required for the preequalization is predicted from a plurality of prior channel estimates. 
     In a further preferred refinement, the channel estimate to be predicted is calculated from the prior channel estimates by linear extrapolation. 
     In a further preferred refinement, an estimate of the channel pulse response used by the transmitter is performed by the receiver, and the data are detected using this channel estimate. 
     In a further preferred refinement, the received signal is filtered in accordance with the estimated pulse response, and then the data are detected by means of a rake receiving device. 
     In a further preferred refinement, the estimated pulse response is used for pseudoinverse detection. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       One exemplary embodiment of the invention is shown in the drawing and will be explain in further detail in the ensuing description. 
       Shown are: 
         FIG. 1 , an illustration of a transmitter device for explaining a first embodiment of the invention; 
         FIG. 2 , an illustration of a transmitter device for explaining a second embodiment of the invention; 
         FIG. 3 , an illustration of a receiving device for explaining a third embodiment of the invention; and 
         FIG. 4 , an illustration of an estimating procedure for the channel estimate used for signal transmission, by means of the receiving device of  FIG. 3 . 
     
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     In the drawings, the same reference numerals identify components that are the same or functionally the same. 
       FIG. 1  illustrates a transmitter device for explaining a first embodiment of the invention. 
     In  FIG. 1 , the reference numerals, letters and characters have the following meanings:  1  is a transmitter; D stands for the data to be transmitted;  10  is a modulator;  20  is a preequalizer;  30  is a switch;  40  is a channel estimator; delta stands for pulse functions;  50  is an antenna; and  100  is a TDD radio connection. 
     In this first embodiment, a combination of joint preequalization and rake reception is employed. 
     By means of a decision making device in the transmitter, as a function of at least one data transmission parameter, a decision is made as to whether an interference treatment of the data signal to be transmitted is to be performed in the transmitter  1  or in the receiver. The data transmission parameter can for instance be the rate of change of the data channel, or a measure of it. 
     If for certain data codes the decision is that the interference treatment will be performed in the transmitter  1 , then a joint preequalization takes place. In it, channel estimates for connections with interference treatment in the receiver are selected as a pulse function (delta function—pulse response of an ideal channel). The detection of the data with pulse function channel estimate is done by means of a rake receiving device in the receiver. 
       FIG. 2  is an illustration of a transmitter device for explaining a second embodiment of the invention. 
     In  FIG. 2 , in addition to the reference numerals already listed,  45  designates an extrapolator. 
     For preequalization of the data signals to be transmitted, the pulse response of the current transmission channel in the transmitter  1  must be known. However, the channel can be estimated only a certain length of time before the transmission. The faster the channel changes, the more the estimate deviates from the current channel. This makes the data transmission highly erroneous, for instance when there are high relative speeds between the receiver and the transmitter. 
     In this second embodiment, the pulse response of the current channel is predicted from a plurality of prior channel estimates, or extrapolated linearly by the extrapolator  45 , for instance. This leads to a marked improvement in the transmission when the channel is changing quickly. 
     The estimation of the channel pulse responses by the preequalizing transmitter  1  is done during time segments when this station is receiving data. The linear extrapolation of the channel pulse responses estimated during the data reception is applied to the transmission time period. The preequalization of the transmitted signal is done in accordance with the extrapolated channel estimate. 
       FIG. 3  shows a receiving device for explaining a third embodiment of the invention, and  FIG. 4  shows an estimation procedure, for the channel estimate used for transmitting signals, performed by the receiving device of  FIG. 3 . 
     In  FIGS. 3 and 4 , in addition to the reference numerals already listed,  2  is a receiver;  60  is a filter;  70  is a rake receiving device;  80  is a channel estimator;  90  is a device for estimating the channel estimate used in the transmission; D′ stands for received data; SZ is a transmission time segment; EZ is a reception time segment; K, K′ are channel estimates; M is an averaging operation; KS is a channel estimate for the transmitting time segment, and t is the time. 
     The channel pulse response used for the preequalization is estimated in the receiver  2 , in this embodiment. Using this estimate, the preequalization is taken into account in the receiver, and the data are detected by interference-treating methods. 
     In a first example of this embodiment, there is one point for multi-point preequalization with rake reception, as illustrated in  FIG. 3 . 
     This is a TDD mode, with regularly alternating reception and transmission time segments EZ/SZ, with code division multiple access (CDMA). 
     In it, an estimate of the channel pulse response used by the transmitter (the preequalizing station) is made by the receiver (rake station). This estimate of the channel is performed during time segments that surround the time segment that is used in the preequalizing transmitting station for the channel estimate (transmitting time segment of the rake station=receiving time segment of the preequalizing station). Next, averaging of the two channel estimates is done. 
     The filter  60  is used on the received signal, using this estimated pulse response. 
     Finally, data detection takes place by means of the rake receiving device  70 . 
     In a second example of this embodiment, there is one point for multi-point preequalization with pseudoinverse detection, using the averaged channel estimate instead of the rake detection. 
     A discrete-time CDMA transmission system with block transmission is assumed. Let d (k) =(d (k)   1 , . . . , d (k)   M ), where k=1, . . . , K is the vector of the M data symbols to be transmitted of the k th  user. CDMA encoding and preequalization are linear projections of the data vectors d (k)  onto the signal vectors s (k)  to be transmitted. These vectors are added together to make the total signal s and are broadcast by the transmitter: 
                 S   _     T     =       ∑     k   =   1     K     ⁢           ⁢       B     (   k   )       ·       d   _         (   k   )     T                 
in which d (k)T  stands for the transposed vector d (k) . B (k)  is the (M·Q+W−1)×M projection matrix, containing encoding and preequalization, with the spread factor Q of the CDMA codes and having the length W for the channel estimates used in the preequalization.
 
     The signal s is transmitted to the k th  user via the k th  transmission channel. Let h (k) =(h l   (k) , . . . h w   (k) ) be the pulse response of this channel, and let 
               H     (   k   )       =             (           h       (   k   )     t           0       0           ⋮       ⋱       0             h       (   k   )     W           ⋮         h       (   k   )     1               0       ⋱       ⋮           0       0         h       (   k   )     W             )     }       ︸       M   ·   Q     +   W   -   1         ⁢     M   ·   Q       +   W   -   1   +   W   -   1           
be the corresponding convolution matrix. If there is additive noise n (k)  of the channel, the k th  user then receives the signal
 
     
       
         
           
             
               
                 r 
                 _ 
               
               
                 
                   ( 
                   k 
                   ) 
                 
                 T 
               
             
             = 
             
               
                 
                   ∑ 
                   
                     l 
                     = 
                     1 
                   
                   K 
                 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 
                   
                     H 
                     
                       ( 
                       k 
                       ) 
                     
                   
                   · 
                   
                     B 
                     
                       ( 
                       l 
                       ) 
                     
                   
                   · 
                   
                     
                       d 
                       _ 
                     
                     
                       
                         ( 
                         l 
                         ) 
                       
                       T 
                     
                   
                 
               
               + 
               
                 
                   n 
                   _ 
                 
                 
                   ( 
                   k 
                   ) 
                 
               
             
           
         
       
     
     With the reception matrix R (k) =(B (k)H ·H (k)H ·H (k) ·B (k) ) −1 ·B (k)H ·H (k)H , the receiver obtains from the estimates d^ of the transmitted data in accordance with the equation
 
 {circumflex over (d)}   (k)     T     =R   (k)   ·r   (k)     T    
 
in which H (k)H  stands for the conjugated complex, transposed matrix H (k) .
 
     Although the present invention has been described above in terms of preferred exemplary embodiments, it is not limited to them but instead can be modified in manifold ways. 
     The invention can be employed wherever signals to be transmitted have to be preequalized and at the same time connections over quickly changing channels are required, especially in TDD radio transmission systems with preequalization.