Abstract:
A ZF joint detection apparatus for a downlink receiver, the apparatus comprising: a channel estimator for estimating a channel impulse response of a multipath fading channel of a received signal; a channel equalizer for estimating a transmission signal by performing channel compensation and removing multipath interference by a deconvolution technique based on the estimated channel impulse response; and a user detector for detecting a symbol-level data sequence transmitted by a specific user by despreading the transmission signal estimated by the channel equalizer with a spreading code for the specific user and a scrambling code.

Description:
PRIORITY  
         [0001]    This application claims priority to an application entitled “Method and Apparatus for Downlink Joint Detection in a Communication System” filed in the Korean Industrial Property Office on Jun. 1, 2001 and assigned Serial No. 2001-30676, the contents of which are hereby incorporated by reference.  
         BACKGROUND OF THE INVENTION  
         [0002]    1. Field of the Invention  
           [0003]    The present invention relates generally to a communication system, and in particular, to a joint detection apparatus and method used for a downlink receiver in a CDMA (Code Division Multiple Access) communication system.  
           [0004]    2. Description of the Related Art  
           [0005]    A CDMA communication system simultaneously receives/transmits a plurality of user signals in the same frequency band and time period, after separating the user signals with associated spreading codes previously assigned to the respective users. A radio channel undergoes an attenuation of waves and a change in fading according to circumstances. A transmission signal from a transmitter arrives at a receiver through multiple paths. The receiver for the CDMA communication system receives inter-symbol interference (ISI) and multiple access interference (MAI) along with the transmission signal due to the radio channel environments. Here, the ISI refers to an interference caused by multipath components of the same user signal, while the MAI refers to an interference caused by a single-path component and multi-path components of different user signals. The existing receiver for the CDMA communication system restores (demodulates) only the transmission signal to its user, using a matched filter, while regarding such interferences as noises.  
           [0006]    In the communication system, a base station exchanges signals with a plurality of mobile stations, and reception power at the base station and the mobile station depends upon a distance and a channel condition between the base station and the mobile station. That is, a decrease in the distance between the base station and the mobile station leads to an increase in power of a received signal, whereas an increase in the distance between the base station and the mobile station brings about a decrease in power of the received signal. Therefore, a signal from a user at a long distance undergoes interference with a signal from a user at a short distance, so the system using the matched filter cannot correctly restore user signals. Such a phenomenon is called a “near-far problem”, and the system using the matched filter employs power control in order to solve this problem. That is, the system decreases transmission power of a signal to the user at a short distance, and increases transmission power of a signal to the user at a long distance. Here, for correct power control, the system requires accurate reception power measurement and a feedback signal channel.  
           [0007]    Unlike the matched filter-based receiver that regards the interferences as noises, a device designed to remove an influence of the interferences between the users by processing user interference signals as separate signals is referred to as a “joint detector (JD)” or “multi-user detector”. An optimal joint detector, such as an ML (Maximum Likelihood) joint detector using an ML algorithm, has high complexity, so it is not possible to realize the ML joint detector at the current state of the art. Accordingly, various quasi-optimal joint detectors have been proposed. The quasi-optimal joint detectors have lower complexity than the optimal joint detector, and show better performance than the existing matched filter-based receiver.  
           [0008]    Typically, the proposed quasi-optimal joint detector includes a ZF (Zero Forcing) joint detector using a ZF algorithm, and an MMSE (Minimum Mean Square Error) joint detector using an MMSE algorithm. The ZF joint detector and the MMSE joint detector should completely remove both the inter-symbol interference and the multiple access interference by removing a cross-correlation between multipath signals and a cross-correlation between different user signals. There is a strong possibility that the ZF joint detector and the MMSE joint detector can be realized. Further, these joint detectors have been proposed as a candidate for a receiver for an IMT-2000 system, an advanced mobile communication system. Meanwhile, unlike the joint detector, a device aimed to remove the inter-symbol interference is referred to as an equalizer. An equalizer using the ZF algorithm is called a “ZF equalizer”, while an equalizer using the MMSE algorithm is called an “MMSE equalizer”.  
           [0009]    A description will now be made of a joint detector in a communication system according to the prior art. Herein, the description will be given based on the 3GPP (3 rd  Generation Partnership Project) TDD (Time Division Duplex) specification, one of the IMT-2000 specifications. In the 3GPP/TDD scheme, spreading codes and scrambling codes have a short length. As a result, a great deal of research is being carried out on the application of the joint detector. The joint detector will be described with reference to the ZF joint detector, a typical linear joint detector.  
           [0010]    [0010]FIG. 1 illustrates structures of an uplink transmitter, a channel and a receiver with a joint detector in a 3GPP/TDD CDMA communication system according to the prior art. Herein, an encoder and an interleaver in the transceiver structure will not be described, and only a joint detector-related part in a baseband device will be described. Although a downlink and an uplink can be both considered, the description will be made with reference to the uplink supporting K users, since the downlink can be regarded as a specific case of the uplink. In the uplink, the transmitter serves as the mobile station and the receiver serves as the base station. On the contrary, in the downlink, the transmitter serves as the base station and the receiver serves as the mobile station.  
           [0011]    Referring to FIG. 1, a first user&#39;s data sequence is modulated into a QPSK (Quadature Phase Shift Keying) signal by a QPSK modulator  101 , and then spread with a spreading code assigned to the first user by a CDMA spreader  102 . The signal spread by the CDMA spreader  102  is scrambled with a scrambling code by a scrambler  103 . The scrambled signal is filtered by an RRC (Root Raised Cosine) filter  104  before being transmitted. The signal transmitted by the RRC filter  104  is added to other user signals and AWGN (Additive White Gaussian Noise)  116 , while passing a multipath fading channel  105 . Meanwhile, a K th  user&#39;s data sequence is modulated into a QPSK signal by a QPSK modulator  111 , and then spread with a spreading code assigned to the K th  user by a CDMA spreader  112 . The spread signal is scrambled with a scrambling code by a scrambler  113 . The scrambled signal is filtered by an RRC filter  114  before being transmitted. The transmitted signal is added to other user signals and AWGN  116  through a multipath fading channel  115 .  
           [0012]    Therefore, the receiver receives a signal obtained by adding the user signals received through the multiple paths to the AWGN, and the received signal is provided to a channel estimator  118  and a joint detector  132  through an RRC filter  117 . The channel estimator  118  performs channel estimation on a channel impulse response of the multipath fading channel, and provides the channel-estimated results to the joint detector  132 . A multiplier  121  multiplies a first user&#39;s spreading code Code#1 by a scrambling code, and provides its output to the joint detector  132 . The receiver performs the above process even on the other users. Therefore, a multiplier  131  multiplies a K th  user&#39;s spreading code Code#K by the scrambling code, and provides its output to the joint detector  132 . The joint detector  132  performs detection on the user data sequences using the results obtained by multiplying the user spreading sequences by the scrambling code. An operation of the joint detector  132  will be described in detail herein below.  
           [0013]    An operating principle of the uplink joint detector in the CDMA communication system will be described herein below in accordance with the following equations. For example, in the CDMA communication system supporting (servicing) K users, a k th  user&#39;s data sequence with a length N is defined as  
                 d     (   k   )       =           (       d   1     (   k   )       ,     d   2     (   k   )       ,                .           .           .                ,     d   N     (   k   )         )     T                   for                 k     =   1       ,   2   ,                .           .           .                ,   K           (   1   )                               
 
           [0014]    Here, a k th  user&#39;s spreading sequence with a spreading gain Q is defined as  
                   c     (   k   )       =           (       c   1     (   k   )       ,     c   2     (   k   )       ,                .           .           .                ,     c   Q     (   k   )         )     T                   for                 k     =   1       ,   2   ,                .           .           .                ,   K                        (   2   )                               
 
           [0015]    Here, a channel impulse response with a length W for the k th  user is defined as  
                 h     (   k   )       =           (       h   1     (   k   )       ,     h   2     (   k   )       ,                .           .           .                ,     h   W     (   k   )         )     T                   for                 k     =   1       ,   2   ,                .           .           .                ,   K           (   3   )                               
 
           [0016]    A combined channel impulse response obtained by combining the spreading sequence with the channel impulse response is defined as  
                 b     (   k   )       =         (       b   1     (   k   )       ,     b   2     (   k   )       ,                .           .           .                ,     b     Q   +   W   -   1       (   k   )         )     T     =         c     (   k   )       *     h     (   k   )                     for                 k     =   1         ,   2   ,                .           .           .     ,   K           (   4   )                               
 
           [0017]    If the data sequence of Equation (1) passes through the combined channel impulse response of Equation (4), a length of the sequence becomes NQ+W−1, and a noise sequence also has the same length and is expressed as 
             n= ( n   1   , n   2   , . . . , n   Q+W−1 ) T   (5) 
           [0018]    An average of respective elements of the noise sequence is ‘0’, and a covariance matrix based on white Gaussian distribution with a variance σ 2  is expressed as R n =E[n·n H ], where E[X] means the expectation of variable X and n H  represents a Hermitian, that is, the conjugation of a transposition for the matrix n.  
           [0019]    From Equation (1), a data sequence of K users for the connected users&#39; data sequences is calculated by 
             d   (k) =( d   (1)     T     , d   (2)     T     , . . . , d   (K)     T   ) T =( d   1   , d   2   , . . . , d   KN ) T   (6) 
           [0020]    From Equation (4), respective combined channel impulse responses for K users&#39; data sequences with a length N can be expressed in a matrix as follows.  
                   A   =     (     A   ij     )       ;     i   =   1       ,   2   ,                .           .           .                ,     NQ   +   W   -   1     ,     j   =   1     ,   2   ,                .           .           .                ,   KN          
            A         Q        (     n   -   1     )       +   l     ,     n   +     N        (     k   -   1     )             =     {             b   i       (   k   )                              0                                                for                 k     =   1     ,                .           .           .                ,   K   ,     n   =   1     ,                .           .           .                ,   N             else                                  (   7   )                               
 
           [0021]    From Equations (1) to (7), a sequence received at the receiver is expressed as 
             r= ( r   1   , r   2   , . . . , r   Q+W− 1) T   =Ad+n   (8) 
           [0022]    For the received sequence, the ZF joint detector estimates a sequence minimizing a value represented by Equation (9) as a data sequence. 
           ( r−A{circumflex over (d)}   ZF ) H    R   n   −1 ( r−A{circumflex over (d)}   ZF )  (9) 
           [0023]    A data sequence satisfying Equation (9) is calculated by 
             {circumflex over (d)}   ZF =( A   H    R   n   −1    A ) −1    A   H    R   n   −1   r =d+ ( A   H    R   n   −1    A ) −1    A   H    R   n   −1   n   (10) 
           (User Data Sequence)+(Noise) 
           [0024]    If a correlation coefficient in each term of the noise sequence in Equation (5) is ‘0’, a covariance matrix of the noise is expressed as R n =σ 2 I, and Equation (10) is rewritten as 
             {circumflex over (d)}   ZF =( A   H    A ) −1    A   H   r   (11) 
           [0025]    Matrix calculation of Equation (11) is expressed as follows by Cholesky Decomposition for inverse matrix calculation. 
           A H  A=LDL H   (12) 
           [0026]    In Equation (12), D represents a diagonal matrix and L represents a lower triangular matrix.  
           [0027]    Since the ZF joint detector performs matrix calculation on the combined channel impulse response matrix, its output becomes a value estimated for the respective symbols of a data sequence. The ZF joint detector outputting the above symbol estimated value will be called a “symbol-level detector”, in order to distinguish it from a chip-level ZF joint detector, which will be described below in relation to the downlink.  
           [0028]    The symbol-level ZF joint detector is simpler in complexity than the optimal joint detector, but it still has a high complexity and requires accurate channel estimation and many calculations. Most of the calculations are concentrated on multiplication of an A matrix related to the combined channel impulse response and inverse matrix calculation. The A matrix has a row with a length of NQ+W−1 and a column with a length of KN, wherein the row length is in proportion to a length of the data sequence and a spreading gain, and the column length is proportion to the number of users and a length of the data sequence. Therefore, an increase in the length of the data sequence or an increase in the number of users causes a considerable increase in calculations of the A matrix and the inverse matrix so that the joint detector cannot be realized.  
           [0029]    When the ZF joint detector is applied to the downlink of the CDMA communication system, its complexity may be partially decreased in light of the downlink characteristic. In the downlink, the base station serves as the transmitter and the mobile station serves as the receiver, so the mobile stations of the respective users are not required to estimate other users&#39; data sequences in addition to its own data sequence, and channel impulse responses of all of the users have the same value. Like the uplink, the downlink can also use the ZF joint detector algorithm. Herein, however, the description will be made of a downlink ZF joint detector algorithm, the complexity of which is reduced using the downlink characteristic. In this algorithm, the ZF joint detector is comprised of a ZF block channel equalizer and a single-user detector.  
           [0030]    [0030]FIG. 2 illustrates structures of a downlink transmitter, a channel and a receiver with a joint detector in a 3GPP/TDD CDMA communication system according to the prior art. Referring to FIG. 2, a first user&#39;s data sequence is modulated into a QPSK signal by a QPSK modulator  201 , and then spread with a spreading code assigned to the first user by a CDMA spreader  202 . Likewise, a K th  user&#39;s data sequence is modulated into a QPSK signal by a QPSK modulator  211 , and then spread with a spreading code assigned to the K th  user by a CDMA spreader  212 . The spread signals of the respective users are summed (or XORed) on a chip level by a summer  213 , and then scrambled with a unique scrambling code of the base station by a scrambler  214 . The scrambled signal is filtered by an RRC filter  215  before being transmitted. The transmitted signal, to which AWGN  217  is added while it passes a multipath fading channel  216 , is received at the receiver.  
           [0031]    The receiver provides the received signal to a channel estimator  219  and a channel equalizer  220  through an RRC filter  218 . The channel estimator  219  performs channel estimation on a channel impulse response of the multipath fading channel, and provides the channel-estimated results to the channel equalizer  220 . The channel equalizer  220  compensates for multipath channel fading of the received signal using the estimated channel impulse response, thereby to remove multipath interference from the received signal. The signal output from the channel equalizer  220  is provided to a single-user detector  222 . The single-user detector  222  despreads the signal output from the channel equalizer  220  with an i th  user&#39;s spreading code and a scrambling code output from a multiplier  221 , thereby to detect an i th  user&#39;s data sequence.  
           [0032]    An operating principle of the downlink ZF joint detector will be described herein below in accordance with the following equations. From Equation (2), a spreading sequence for the respective user data sequences is expressed in a matrix as follows.  
                   C   =     (     C   ij     )       ;     i   =   1       ,   2   ,                .           .           .                ,   NQ   ,     j   =   1     ,   2   ,                .           .           .                ,   KN          
            C         Q        (     n   -   1     )       +   q     ,       N        (     k   -   1     )       +   n         =     {             c   q     (   k   )               0                          for                 q     =   1     ,                .           .           .                ,   Q   ,     n   =   1     ,                .           .           .                ,   N   ,     k   =   1     ,                .           .           .                ,   K                          else                       (   13   )                               
 
           [0033]    Further, from Equation (3), a channel impulse response for the respective user spreading sequences is expressed in a matrix as follows.  
                         H     (   k   )       =     (     H   ij     (   k   )       )       ;     i   =   1       ,   2   ,                .           .           .     ,     NQ   +   W   -   1     ,     j   =   1     ,   2   ,                .           .           .                ,   NQ                 H   y     =     {             h     i   -   j   +   1       (   k   )               0                      if                 1     ≤     i   -   j   +   1     ≤   W             else                           (   14   )                               
 
           [0034]    Further, a reception noise of a specific user, i.e., a k th  user, for Equation (5) is represented by  
               n     (   k   )       =       (       n   1     (   k   )       ,     n   2     (   k   )       ,                .           .           .                ,     n     Q   +   W   -   1       (   k   )         )     T             (   15   )                               
 
           [0035]    From Equations (6), (13), (14) and (15), a received sequence of the k th  user is expressed as  
               r     (   k   )       =         (       r   1     (   k   )       ,     r   2     (   k   )       ,                .           .           .                ,     r     Q   +   W   -   1       (   k   )         )     T     =         H     (   k   )          Cd     +     n     (   k   )                   (   16   )                               
 
           [0036]    For the received sequence, the downlink ZF joint detector, i.e., a chip-level ZF joint detector, unlike the symbol-level ZF joint detector described above in relation to the uplink, acquires a received chip-level spreading sequence by passing the received sequence through the ZF block channel equalizer using the channel impulse response matrix. Further, the chip-level ZF joint detector searches an estimation value for the respective symbols of the data sequence by passing again the received chip-level spreading sequence through the single-user detector  222 . In this manner, unlike the symbol-level ZF joint detector, the chip-level ZF joint detector performs chip-level detection. The chip-level ZF joint detector, the complexity of which is reduced using the characteristic of the downlink, can be used in the downlink. A chip-level output s ZF   (k)  from the channel equalizer  220  for the received sequence is represented by  
                 s   ZF     (   k   )       =         (       H       (   k   )     H            H     (   k   )         )       -   1            H       (   k   )     H            e     (   k   )                
            e        (   k   )       -&gt;       r   ⋀          (   k   )                 (   17   )                               
 
           [0037]    By passing the output of the ZF block channel equalizer  220  through the single-user detector  222 , it is possible to estimate a desired user data sequence given below.  
                                    d   ^     ZF     (   k   )       =         (     diag        (       C       (   k   )     H            C     (   k   )         )       )       -   1            C       (   k   )     H            s   ZF     (   k   )                     =     (     diag   (       C       (   k   )     H          C              (                   (   k   )       )     )     )       -   1              C       (   k   )     H       ·     (       H       (   k   )     H          H              (                 (   k   )       )     )       -   1            H       (   k   )     H            e     (   k   )                                                    e        (   k   )       -&gt;       r   ⋀          (   k   )                     (   18   )                                 
 
           [0038]    For a comparison between the chip-level ZF joint detector and the symbol-level ZF joint detector, Equations (8) and (16) can be generalized as follows. 
             r=HCd+n   (19) 
           [0039]    In Equation (19), r indicates a received sequence, H indicates a channel impulse response sequence, C indicates a spreading sequence, and n indicates a noise sequence.  
           [0040]    If A=HC, Equation (19) is expressed as Ad+n=r. In this case, the symbol-level ZF joint detector personally estimates a symbol-level data sequence by calculating Ad+n=r for d. However, if s=Cd, Equation (19) is expressed as Hs+n=r. In this case, the chip-level ZF joint detector estimates a chip-level data sequence by calculating Hs+n=r for s, and then estimates a symbol-level data sequence by applying the single-user detector  222  to the estimated chip-level data sequence.  
           [0041]    A calculation order and major calculations of the symbol-level ZF joint detector will be described herein below on a step-by-step basis. Here, calculations of the symbol-level ZF joint detector will be expressed in terms of the number of multiplications that cause an increase in complexity in actual implementation.  
           [0042]    Step 1: Matrix Multiplication for Calculating A H A and A H r in Equation (11)  
           [0043]    Calculations for A H A and A H r are (Q+W−1) *(NK) 2  times of multiplication and (Q+W−1)*KN times of multiplication, respectively.  
           [0044]    Step 2: Cholesky Decomposition for Calculating A H A=LDL H    
           [0045]    Calculations are in proportion to N 3  times of multiplication.  
           [0046]    Step 3: Forward and Reverse Replacement and Elimination for Estimating d in LDL H d=A H r  
           [0047]    Next, a calculation order and major calculations of the chip-level ZF joint detector will be described herein below on a step-by-step basis.  
           [0048]    Step 1: Matrix Multiplication for Calculating H H H and H H r in Equation (17)  
           [0049]    Calculations for H H H and H H r are W*(NQ) 2  times of multiplication and W*KQ times of multiplication, respectively.  
           [0050]    Step 2: Cholesky Decomposition for Calculating H H H=LDL H    
           [0051]    Calculations are in proportion to (NQ) 3  times of multiplication, but the calculations are in proportion to W 2 *NQ times of multiplication in a band diagonal matrix H H H.  
           [0052]    Step 3: Forward and Reverse Replacement and Elimination for Estimating s in LDL H s=A H r  
           [0053]    Step 4: Spreading Code Multiplication for Despreading s Calculated in Step 3  
           [0054]    Both the symbol-level and chip-level ZF joint detectors require the maximum amount of calculations in the Cholesky Decomposition process of Step 2. In Step 2, the symbol-level and chip-level ZF joint detectors require calculations in proportion to N 3  and W 2 *NQ, respectively, and a length N of the data sequence is much greater than a spreading gain Q and a channel impulse response length W. Therefore, the chip-level ZF joint detector has less complexity and calculations in realization as compared with the symbol-level ZF joint detector. However, the chip-level ZF joint detector requires calculations of the same order for N, Q and W, so it still requires considerably high complexity. Accordingly, it is not possible to reduce the calculations and complexity to a desirable level, causing a problem in realization.  
         SUMMARY OF THE INVENTION  
         [0055]    It is, therefore, an object of the present invention to provide an apparatus and method for reducing implementation complexity of a ZF joint detector used for a downlink receiver in a CDMA communication system.  
           [0056]    It is another object of the present invention to provide an apparatus and method for calculating a low initial complexity value of a ZF joint detector used for a downlink receiver in a CDMA communication system.  
           [0057]    To achieve the above and other objects, the present invention provides a ZF joint detection apparatus used for a downlink receiver. The apparatus comprises a channel estimator for estimating a channel impulse response of a multipath fading channel of a received signal; a channel equalizer for estimating a transmission signal by performing channel compensation and removing multipath interference by a deconvolution technique based on the estimated channel impulse response; and a user detector for detecting a symbol-level data sequence transmitted by a specific user by despreading the transmission signal estimated by the channel equalizer with a spreading code for the specific user and a scrambling code.  
           [0058]    To achieve the above and other objects, the present invention provides a ZF joint detection method used for a downlink receiver. The method comprises estimating a channel impulse response of a multipath fading channel of a received signal; and estimating a transmission signal by performing channel compensation and removing multipath interference by a deconvolution technique based on the estimated channel impulse response. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0059]    The above and other objects, features and advantages of the present invention will become more apparent from the following detailed description when taken in conjunction with the accompanying drawings in which:  
         [0060]    [0060]FIG. 1 illustrates structures of an uplink transmitter, a channel and a receiver with a joint detector in a 3GPP/TDD CDMA communication system according to the prior art;  
         [0061]    [0061]FIG. 2 illustrates structures of a downlink transmitter, a channel and a receiver with a joint detector in a 3GPP/TDD CDMA communication system according to the prior art; and  
         [0062]    [0062]FIG. 3 illustrates structures of a downlink transmitter, a channel and a receiver with a joint detector in a 3GPP/TDD CDMA communication system according to an embodiment of the present invention. 
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT  
       [0063]    A preferred embodiment of the present invention will be described herein below with reference to the accompanying drawings. In the following description, well-known functions or constructions are not described in detail since they would obscure the invention in unnecessary detail.  
         [0064]    [0064]FIG. 3 illustrates structures of a downlink transmitter, a channel and a receiver with a joint detector in a 3GPP/TDD CDMA communication system according to an embodiment of the present invention. Here, in the downlink, a transmitter serves as a base station and a receiver serves as a mobile station. Further, the transmitter has the same structure as the transmitter illustrated in FIG. 2.  
         [0065]    Referring to FIG. 3, a first user&#39;s data sequence is modulated into a QPSK signal by a QPSK modulator  301 , and then spread with a spreading code assigned to the first user by a CDMA spreader  302 . Likewise, a K th  user&#39;s data sequence is modulated into a QPSK signal by a QPSK modulator  311 , and then spread with a spreading code assigned to the K th  user by a CDMA spreader  312 . The spread signals of the respective users are summed (or XORed) on a chip level by a summer  313 , and then scrambled with a unique scrambling code of the base station by a scrambler  314 . The scrambled signal is filtered by an RRC filter  315  before being transmitted. The transmitted signal, to which AWGN  317  is added while it passes a multipath fading channel  316 , is received at the receiver.  
         [0066]    The receiver provides the received signal to a channel estimator  319  and a deconvolution channel equalizer  320 , after passing through an RRC filter  318 . The channel estimator  319  performs channel estimation on a channel impulse response of the multipath fading channel, and provides the channel-estimated results to the deconvolution channel equalizer  320 . The deconvolution channel equalizer  320  compensates for multipath channel fading of the received signal using the estimated channel impulse response, thereby to remove multipath interference from the received signal. A detailed description of the deconvolution channel equalizer  320  will be given later. The signal output from the deconvolution channel equalizer  320  is provided to a single-user detector  322 . The single-user detector  322  detects an i th  user&#39;s data sequence using an i th  user&#39;s spreading code and a scrambling code output from a multiplier  321 .  
         [0067]    A detailed description of the deconvolution channel equalizer  320  will be made herein below. The deconvolution channel equalizer  320  reduces matrix calculations performed in a channel equalizer by a deconvolution technique. The conventional channel equalizer  220  performs inverse matrix calculations using the Cholesky Decomposition technique and the forward and reverse replacement and elimination technique in order to implement Equation (17). The matrix calculation and inverse matrix calculation processes require considerable calculations as demonstrated above. However, the deconvolution channel equalizer  320  according to the present invention searches a value satisfying Equation (20) below in order to calculate a chip-level output s ZF   (k)  with multipath interference removed.  
                 H     (   k   )       ·     s   ZF     (   k   )         =           r     (   k   )            
     [           h   1         0       ⋯       0             h   2           h   1         ⋯       ⋮             h   W           h   2         ⋯       0           0         h   W         ⋯         h   1             ⋮       ⋮       ⋮         h   2             0       0       ⋯         h   W           ]          [             s   ^     1                 s   ^     2             ⋮               s   ^     NQ           ]       =     [           r   1               r   2             ⋮             r     NQ   +   W   -   1             ]               (   20   )                               
 
         [0068]    By using the deconvolution technique, it is possible to calculate  
       s   ZF     (   k   )                           
 
         [0069]    satisfying Equation (20) as follows.  
                     s   ^     j     =       r   J       h   1         ,                  for                 j     =   1                          (     21a)                       s   ^     j     =       1     h   1            {       r   j     -       ∑     i   =   2     J                       h   i            s   ^       j   -   i   +   1             }         ,       for                 j     =   2     ,   3   ,                .           .           .                ,   W           (     21b     )                     s   ^     j     =       1     h   1            {       r   j     -       ∑     i   =   2     W                       h   i            s   ^       j   -   i   +   1             }         ,       for                 j     =     W   +   1       ,     W   +   2     ,                .           .           .                ,   NQ           (     21        c       )                               
 
         [0070]    In this manner, it is possible to calculate a multipath interference-removed chip-level output  
       s   ZF     (   k   )                           
 
         [0071]    like Equation (17), if there is no noise. As for calculations of the deconvolution channel equalizer  320  in terms of the number of multiplications and divisions, Equation (21a) requires a one time calculation, Equation (21b) requires 2+3+. . . W=W·(W+1)/2−1 times of multiplications, and Equation (21c) requires W·(NQ−W)=NQW+(W−W 2 )/2 times of multiplications.  
         [0072]    That is, calculations of the deconvolution channel equalizer  320  are in proportion to NQW, so it is possible to remarkably reduce calculations as compared with the symbol-level and chip-level ZF joint detectors. A comparison between the above-stated three joint detectors will be made in terms of calculations with reference to Table 1. Table 1 shows calculations in a step where calculations are most dominant, in terms of the order of the system variables.  
                           TABLE 1                                   Downlink JD Algorithm   Calculations                           Symbol-level ZF JD   (KN) 2             Chip-level ZF JD   W 2 QN           Chip-level Deconvolution ZF JD   WQN                      
 
         [0073]    As illustrated in Table 1, compared with other algorithms, the chip-level deconvolution ZF joint detector reduces as many calculations as at least a first order of the system variable. That is, since the deconvolution channel equalizer  320  can remarkably reduce calculations and complexity, it can be used as a scheme for calculating an initial value not only in the ZF joint detector algorithm but also in the MMSE joint detector algorithm and another joint detector algorithm combined with the ZF or MMSE joint detector.  
         [0074]    As described above, the joint detector used in the downlink receiver reduces inverse matrix calculations that comprise almost all of the calculations of the joint detector, contributing to a reduction in the overall complexity of the receiver. The reduction in complexity of the joint detector results in an improvement of downlink performance. Further, the reduction in calculations and complexity of the joint detector contributes to a reduction in power consumption of the downlink receiver, i.e., the mobile station. In addition, the joint detection algorithm of the chip-level ZF joint detector according to the present invention enables other joint detector algorithms to calculate an initial value with fewer calculations, so it can be applied to various joint detector algorithms.  
         [0075]    While the invention has been shown and described with reference to a certain preferred embodiment thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.