Abstract:
This invention teaches to the details of an interference suppressing receiver for suppressing intra-cell and inter-cell interference in coded, multiple-access, spread spectrum transmissions that propagate through frequency selective communication channels to a multiplicity of receive antennas. The receiver is designed or adapted through the repeated use of symbol-estimate weighting, subtractive suppression with a stabilizing step-size, and mixed-decision symbol estimates. Receiver embodiments may be designed, adapted, and implemented explicitly in software or programmed hardware, or implicitly in standard RAKE-based hardware either within the RAKE (i.e., at the finger level) or outside the RAKE (i.e., at the user or subchannel symbol level). Embodiments may be employed in user equipment on the forward link or in a base station on the reverse link. It may be adapted to general signal processing applications where a signal is to be extracted from interference.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS  
       [0001]    This application is a continuation of U.S. patent application Ser. No. 13/372,483, entitled “Iterative Interference Suppressor for Wireless Multiple-Access Systems with Multiple Receive Antennas,” filed Feb. 13, 2012, which is a continuation of U.S. patent application Ser. No. 12/916,389, entitled “Iterative Interference Canceler for Wireless Multiple-Access Systems with Multiple Receive Antennas,” filed Oct. 29, 2010, now U.S. Pat. No. 8,121,176, which is a continuation of U.S. patent application Ser. No. 11/491,674, entitled “An Iterative Interference Canceller for Wireless Multiple-Access Systems with Multiple Receive Antennas,” filed Jul. 24, 2006, now U.S. Pat. No. 7,826,516; which (1) is a Continuation in Part of U.S. patent application Ser. No. 11/451,932, filed Jun. 13, 2006, and entitled “Iterative Interference Cancellation Using Mixed Feedback Weights and Stabilizing Step Sizes,” now U.S. Pat. No. 7,711,075; and (2) claims priority to U.S. Patent Application Ser. No. 60/736,204, filed Nov. 15, 2005, and entitled “Iterative Interference Cancellation Using Mixed Feedback Weights and Stabilizing Step Sizes,” which incorporates by reference (a) U.S. patent application Ser. No. 11/100,935, filed Apr. 7, 2005, entitled “Construction of Projection Operators for Interference Cancellation,” published as U.S. Patent Application Publication Number US 2005/0180364 A1, (b) U.S. patent application Ser. No. 11/233,636, filed Sep. 23, 2005, entitled “Optimal Feedback Weighting for Soft-Decision Cancellers,” published as U.S. Patent Application Publication Number US 2006/0227909 A1, and (c) U.S. patent application Ser. No. 11/266,928, filed Nov. 4, 2005, entitled “Soft Weighted Subtractive Cancellation for CDMA Systems,” now U.S. Pat. No. 7,876,810. The entirety of each of the foregoing patents, published patent applications and patent applications is incorporated by reference herein in its entirety. 
     
    
     BACKGROUND  
       [0002]    1. Field of the Invention 
         [0003]    The present invention relates generally to suppression of intra-channel and inter-channel interference in coded spread spectrum wireless communication systems with multiple receive antennas. More specifically, the invention takes advantage of the receive diversity afforded by multiple receive antennas in combination with multiple uses of an interference-suppression unit consisting of symbol-estimate weighting, subtractive suppression with a stabilizing step-size, and a mixed-decision symbol estimator. 
         [0004]    2. Discussion of the Related Art 
         [0005]    In an exemplary wireless multiple-access system, a communication resource is divided into code-space subchannels allocated to different users. A plurality of subchannel signals received by a wireless terminal (e.g., a subscriber unit or a base station) may correspond to different users and/or different subchannels allocated to a particular user. 
         [0006]    If a single transmitter broadcasts different messages to different receivers, such as a base station in a wireless communication system serving a plurality of mobile terminals, the channel resource is subdivided in order to distinguish between messages intended for each mobile. Thus, each mobile terminal, by knowing its allocated subchannel(s), may decode messages intended for it from the superposition of received signals. Similarly, a base station typically separates signals it receives into subchannels in order to differentiate between users. 
         [0007]    In a multipath environment, received signals are superpositions of time-delayed and complex-scaled versions of the transmitted signals. Multipath can cause several types of interference. Intra-channel interference occurs when the multipath time-spreading causes subchannels to leak into other subchannels. For example, forward-link subchannels that are orthogonal at the transmitter may not be orthogonal at the receiver. When multiple base stations (or sectors or cells) are active, inter-channel interference may result from unwanted signals received from other base stations. These types of interference can degrade communications by causing a receiver to incorrectly decode received transmissions, thus increasing a receiver&#39;s error floor. Interference may degrade communications in other ways. For example, interference may diminish the capacity of a communication system, decrease the region of coverage, and/or decrease maximum data rates. For these reasons, a reduction in interference can improve reception of selected signals while addressing the aforementioned limitations due to interference. Multiple receive antennas enable the receiver to process more information, allowing greater interference-reduction than can be accomplished with a single receive antenna. 
         [0008]    In code division multiple access (such as used in CDMA 2000, WCDMA, EV-DO (in conjunction with time-division multiple access), and related standards), a set of symbols is sent across a common time-frequency slot of the physical channel and separated by the use of a set of distinct code waveforms, which are usually chosen to be orthogonal (or pseudo-orthogonal for reverse-link transmissions). The code waveforms typically vary in time, with variations introduced by a pseudo-random spreading code (PN sequence). The wireless transmission medium is characterized by a time-varying multi path profile that causes multiple time-delayed replicas of the transmitted waveform to be received, each replica having a distinct amplitude and phase due to path loss, absorption, and other propagation effects. As a result, the received code set is no longer orthogonal. Rather, it suffers from intra-channel interference within a base station and inter-channel interference arising from transmissions in adjacent cells. 
       SUMMARY OF THE INVENTION 
       [0009]    In view of the foregoing background, embodiments of the present invention may provide a generalized interference-suppressing receiver for suppressing intra-channel and inter-channel interference in multiple-access coded-waveform transmissions that propagate through frequency-selective communication channels and are received by a plurality of receive antennas. Receiver embodiments may be designed, adapted, and implemented explicitly in software or programmed hardware, or implicitly in standard RAKE-based hardware. Embodiments may be employed in user equipment on the downlink or in a base station on the uplink. 
         [0010]    An interference-suppression system configured for suppressing at least one of inter-cell and intra-cell interference in multiple-access communication signals received from a plurality of antennas comprises a front-end processing means coupled to an iterative interference-suppression means. 
         [0011]    A front-end processing means is configured for generating initial symbol estimates to be coupled to an iterative interference-suppression means. The front-end processing means may include, by way of example, but without limitation, a combiner configured for combining received signals from each of a plurality of transmission sources across a plurality of antennas for producing combined signals, a despreader configured for resolving the combined signals onto a signal basis for the plurality of transmission sources to produce soft symbol estimates from the plurality of transmission sources, and a symbol estimator configured for performing a mixed decision on each of the soft symbol estimates to generate the initial symbol estimates. 
         [0012]    In one embodiment, the front-end processing means may further comprise a synthesizer configured for synthesizing estimated Rake finger signals for each antenna that would be received if weighted symbol decisions were employed at the plurality of transmission sources, and a subtraction module configured for performing per-antenna subtraction of a sum of synthesized Rake finger signals from that antenna&#39;s received signal to produce an error signal. 
         [0013]    In another embodiment, the front-end processing means may further comprise a despreader configured for resolving each of a plurality of error signals corresponding to each of a plurality of antennas onto a signal basis for the plurality of transmission sources for producing a plurality of resolved error signals, a first combiner configured for combining the resolved error signals across antennas for producing a combined signal, a stabilizing step-size module configured to scale the combined signal by a stabilizing step size for producing a scaled signal, and a second combiner configured for combining the combined signal with a weighted input vector. 
         [0014]    An iterative interference-suppression means may include, by way of example, but without limitation, a sequence of interference-suppression units. In one embodiment, each interference-suppression unit is configured for processing signals received by each of the plurality of antennas, whereby constituent signals for each of a plurality of antennas are added back to corresponding scaled error signals to produce error signals for a plurality of transmission sources, followed by resolving the error signals for the plurality of transmission sources across the plurality of antennas onto a signal basis for the plurality of transmission sources. 
         [0015]    In one embodiment, each interference-suppression unit may comprise a soft-weighting module configured to apply weights to a plurality of input symbol decisions to produce weighted symbol decisions, a synthesizer corresponding to each antenna of the plurality of antennas and configured for synthesizing constituent signals, a subtractive suppressor configured to perform a per-antenna subtraction of the synthesized signal from the received signal to produce a plurality of per-antenna error signals, a stabilizing step size module configured for scaling the plurality of antenna error signals by a stabilizing step size for producing a plurality of scaled error signals, a combiner configured for combining each of the constituent signals with its corresponding scaled error signal to produce a plurality of interference-suppressed constituents, a resolving module configured for resolving each of the interference-suppressed constituent signals onto a signal basis for a plurality of transmit sources to produce the interference-suppressed input symbol decisions, and a mixed-decision module configured for processing the interference-suppressed symbol decisions to produce the updated symbol decisions. 
         [0016]    Embodiments of the invention may be employed in any receiver configured to support the standard offered by the 3rd-Generation Partnership Project 2 (3GPP2) consortium and embodied in a set of documents, including “TR-45.5 Physical Layer Standard for cdma2000 Spread Spectrum Systems,” “C.S0005-A Upper Layer (Layer 3) Signaling Standard for cdma2000 Spread Spectrum Systems,” and “C.S0024 CDMA2000 High Rate Packet Data Air Interface Specification” (i.e., the CDMA2000 standard). 
         [0017]    Receivers and suppression systems described herein may be employed in subscriber-side devices (e.g., cellular handsets, wireless modems, and consumer premises equipment) and/or server-side devices (e.g., cellular base stations, wireless access points, wireless routers, wireless relays, and repeaters). Chipsets for subscriber-side and/or server-side devices may be configured to perform at least some of the receiver and/or suppression functionality of the embodiments described herein. 
         [0018]    Various functional elements, separately or in combination as depicted in the figures, may take the form of a microprocessor, digital signal processor, application specific integrated circuit, field programmable gate array, or other logic circuitry programmed or otherwise configured to operate as described herein. Accordingly, embodiments may take the form of programmable features executed by a common processor or a discrete hardware unit. 
         [0019]    These and other embodiments of the invention are described with respect to the figures and the following description of the preferred embodiments. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS  
         [0020]    Embodiments according to the present invention are understood with reference to the following figures. 
           [0021]      FIG. 1  is a general schematic illustrating an iterative interference suppressor for multiple receive antennas. 
           [0022]      FIG. 2  is a block diagram illustrating a per-antenna front-end RAKE and combiner. 
           [0023]      FIG. 3  is a block diagram illustrating a per base-station front-end combiner configured for combining like base-station signals across antennas, a de-spreading module, and an initial symbol decision module. 
           [0024]      FIG. 4  is a general schematic of an ICU configured to process signals from multiple receive antennas. 
           [0025]      FIG. 5   a  is a per-antenna block diagram illustrating part of an interference-suppression unit that synthesizes constituent finger signals. 
           [0026]      FIG. 5   b  is a per-antenna block diagram illustrating part of an interference-suppression unit that synthesizes constituent subchannel signals. 
           [0027]      FIG. 6  is a block diagram of a subtractive suppressor in which suppression is performed prior to signal despreading. 
           [0028]      FIG. 7   a  is a block diagram illustrating per-antenna RAKE processing and combining on interference-suppressed finger signals. 
           [0029]      FIG. 7   b  is a block diagram illustrating per-antenna RAKE processing and combining on interference-suppressed subchannel constituent signals. 
           [0030]      FIG. 8  is a block diagram illustrating antenna combining, de-spreading, and symbol estimation in an ICU. 
           [0031]      FIG. 9   a  is a block diagram illustrating an ICU wherein subtractive suppression is performed after signal de-spreading. 
           [0032]      FIG. 9   b  shows an alternative embodiment of an ICU configured for performing subtractive suppression after signal de-spreading. 
           [0033]      FIG. 9   c  shows another embodiment of an ICU. 
           [0034]      FIG. 10  is a block diagram of an ICU configured for an explicit implementation. 
           [0035]      FIG. 11   a  is a block diagram illustrating a method for evaluating a stabilizing step size implicitly in hardware. 
           [0036]      FIG. 11   b  is a block diagram depicting calculation of a difference signal in accordance with an embodiment of the present invention. 
           [0037]      FIG. 11   c  is a block diagram depicting implicit evaluation of step size in accordance with an embodiment of the present invention. 
       
    
    
       [0038]    Various functional elements or steps, separately or in combination, depicted in the figures may take the form of a microprocessor, digital signal processor, application specific integrated circuit, field programmable gate array, or other logic circuitry programmed or otherwise configured to operate as described herein. Accordingly, embodiments may take the form of programmable features executed by a common processor or discrete hardware unit. 
       DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0039]    The present invention will now be described more fully hereinafter with reference to the accompanying drawings, in which preferred embodiments of the invention are shown. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. 
         [0040]    The following formula represents an analog baseband signal received from multiple base stations by antenna a of a receiver, 
         [0000]        y   a ( t )=Σ s=1   B Σ l=1   L     a,s   α a,s,l Σ k=1   K     s     b   s,k   u   s,k ( t−τ   a,s,l )+ w   a ( t ),  t ∈(0 ,T )  Equation 1
 
         [0000]    with the following definitions
       a represents an a th  antenna of a mobile and ranges from 1 to A;   (0, T) is a symbol interval;   B is a number of modeled base stations, which are indexed by subscript s, which ranges from 1 to B. The term “base station” may be used herein to convey cells or sectors;   L a,s  is the number of resolvable (or modeled) paths from base station s to antenna a of the mobile, and is indexed from 1 to L a,s ;   α a,s,l  and τ a,s,l  are, respectively, the complex gain and delay associated with an l th  path from base station s to antenna a of the mobile;   K s  represents a number of active subchannels in base station s that employ code division multiplexing to share the channel. The subchannels are indexed from 1 to K s ;   u s,k (t) is a code waveform (e.g., spreading waveform) used to carry a k th  subchannel&#39;s symbol for an s th  base station (e.g., a chip waveform modulated by a subchannel-specific Walsh code and covered with a base-station specific PN cover);   b s,k  is a complex symbol being transmitted for the k th  subchannel of base station s; and   w a (t) denotes zero-mean complex additive noise on the a th  antenna. The term w a (t) may include thermal noise and any interference whose structure is not explicitly modeled (e.g., inter-channel interference from unmodeled base stations, and/or intra-channel interference from unmodeled paths).       
 
         [0050]      FIG. 1  illustrates an iterative interference suppressor in accordance with one embodiment of the invention. Received signals from each of a plurality of antennas  100 . 1 - 100 .A are processed by corresponding RAKE receivers  101 . 1 - 101 .A. Each RAKE receiver  101 . 1 - 101 .A may comprise a maximal ratio combiner (not shown). 
         [0051]    Multipath components received by each RAKE receiver  101 . 1 - 101 .A are separated with respect to their originating base stations and processed by a plurality B of constituent-signal analyzers  102 . 1 - 102 .B. Each constituent-signal analyzer  102 . 1 - 102 .B comprises a combiner, a despreader, and a symbol estimator, such as combiner  111 . s , despreader  112 . s , and symbol estimator  113 . s  in constituent-signal analyzer  102 . s.    
         [0052]    Signals received from different antennas  100 . 1 - 100 .A corresponding to an s th  originating base station are synchronized, and then combined (e.g., maximal ratio combined) by combiner  111 . s  to produce an s th  diversity-combined signal. The despreader  112 . s  resolves the s th  diversity-combined signal onto subchannel code waveforms, and the symbol estimator  113 . s  produces initial symbol estimates, which are input to a first interference suppression unit (ICU)  104 . 1  of a sequence of ICUs  104 . 1 - 104 .M. 
         [0053]    ICU  104 . 1  mitigates intra-channel and/or inter-channel interference in the estimates in order to produce improved symbol estimates. Successive use of ICUs  104 . 2 - 104 .M further improves the symbol estimates. The ICUs  104 . 1 - 104 .M may comprise distinct units, or a single unit configured to perform each iteration. 
         [0054]      FIG. 2  is a block diagram of a Rake receiver, such as RAKE receiver  101 . a . One of a plurality of processors  201 . 1 - 201 .B is associated with each base station. For example, processor  201 . s  associated with an s th  base station comprises a plurality L of time-advance modules  202 . 1 - 202 .L configured to advance the received signal in accordance with L multipath time offsets. Weighting modules  203 . 1 - 203 .L provide corresponding maximal-ratio combining weights α a,s,l  to the time-advanced signals, and a combiner  204  combines the weighted signals to produce an output for the a th  antenna 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         y 
                         
                           a 
                           , 
                           s 
                         
                         mrc 
                       
                        
                       
                         ( 
                         t 
                         ) 
                       
                     
                     = 
                     
                       
                         1 
                         
                           
                             E 
                             s 
                           
                         
                       
                        
                       
                         
                           ∑ 
                           
                             l 
                             = 
                             1 
                           
                           
                             L 
                             
                               a 
                               , 
                               s 
                             
                           
                         
                          
                         
                           
                             α 
                             
                               a 
                               , 
                               s 
                               , 
                               l 
                             
                             * 
                           
                            
                           
                             
                               y 
                               a 
                             
                              
                             
                               ( 
                               
                                 t 
                                 - 
                                 
                                   τ 
                                   
                                     a 
                                     , 
                                     s 
                                     , 
                                     l 
                                   
                                 
                               
                               ) 
                             
                           
                         
                       
                     
                   
                   , 
                   
                     
 
                   
                    
                   
                     
                       where 
                        
                       
                           
                       
                        
                       
                         E 
                         s 
                       
                     
                     = 
                     
                       
                         ∑ 
                         
                           l 
                           = 
                           1 
                         
                         
                           L 
                           
                             a 
                             , 
                             s 
                           
                         
                       
                        
                       
                         
                           
                              
                             
                               α 
                               
                                 a 
                                 , 
                                 s 
                                 , 
                                 l 
                               
                             
                              
                           
                           2 
                         
                         . 
                       
                     
                   
                 
               
               
                 
                   Equation 
                    
                   
                       
                   
                    
                   2 
                 
               
             
           
         
       
     
         [0055]      FIG. 3  is a block diagram of an exemplary constituent-signal analyzer, such as constituent-signal analyzer  102 . s  shown in  FIG. 1 . A combiner  301  for a given base station sums the signals over the plurality A of antennas to produce a combined signal for base station s over all paths and all antennas 
         [0000]        y   s   mrc ( t )=Σ a=1   A   y   a,s   mrc ( t ).  Equation 3
 
         [0056]    The combined signal is resolved onto subchannel code waveforms by a plurality K of despreading modules, comprising K code-waveform multipliers  302 . 1 - 302 .K and integrators  303 . 1 - 303 .K, to give 
         [0000]    
       
         
           
             
               
                 
                   
                     q 
                     
                       s 
                       , 
                       k 
                     
                   
                   ≡ 
                   
                     
                       1 
                       
                         E 
                         s 
                       
                     
                      
                     
                       
                         ∫ 
                         0 
                         T 
                       
                        
                       
                         
                           
                             u 
                             
                               s 
                               , 
                               k 
                             
                             * 
                           
                            
                           
                             ( 
                             t 
                             ) 
                           
                         
                          
                         
                           
                             y 
                             s 
                             mrc 
                           
                            
                           
                             ( 
                             t 
                             ) 
                           
                         
                          
                         
                            
                           t 
                         
                       
                     
                   
                 
               
               
                 
                   Equation 
                    
                   
                       
                   
                    
                   4 
                 
               
             
           
         
       
     
         [0000]    as a RAKE/Combine/De-Spread output for the k th  subchannel of base station s. A column vector of these outputs is denoted 
         [0000]        q   s =[q s,1  q s,2  . . . q s,K     s   ] T   Equation 5
 
         [0000]    for base station s, where the superscript T denotes matrix transpose. Each q s,k  is processed by one of a plurality of symbol estimators  304 . 1 - 304 .K to produce 
         [0000]      {circumflex over (b)} s,k   [0] =Estimate Symbol {q s,k },  Equation 6
 
         [0000]    where the superscript [0] indicates the initial symbol estimate produced by front-end processing. Symbol estimators  304 . 1 - 304 .K may include mixed-decision symbol estimators described in U.S. Patent Application Ser. No. 60/736,204, or other types of symbol estimators. An output vector of symbol estimates for base station s may be formed as 
         [0000]        {circumflex over (b)}   s,k   [0] =[{circumflex over (b)} s,1   [0]  {circumflex over (b)} s,2   [0]  . . . {circumflex over (b)} s,K     s     [0] ] T .
 
         [0057]    It should be appreciated that one or more of the functions described with respect to  FIG. 3  may be implemented on discrete-time sequences generated by sampling (or filtering and sampling) continuous waveforms. More specifically, time advances (or delays) of waveforms become shifts by an integer number of samples in discrete-time sequences, and integration becomes summation. 
         [0058]      FIG. 4  is a flow chart illustrating a functional embodiment of an ICU, such as one of the ICUs  104 . 1 - 104 .M. Similar ICU embodiments are described in U.S. Patent Application Ser. No. 60/736,204 for a system with a single receive antenna. However, the embodiment shown in  FIG. 4  conditions a plurality of received antenna signals for a parallel bank of ICUs and conditions ICU outputs prior to making symbol estimates. Symbol estimates for a plurality of sources are input to the ICU and weighted  401 . 1 - 401 .B according to perceived merits of the symbol estimates. Any of the soft-weighting methods described in U.S. Patent Application Ser. No. 60/736,204 may be employed. The weighting of a k th  subchannel of base station s is expressed by 
         [0000]      γ s,k   [i] {circumflex over (b)} s,k   [i]   Equation 7
 
         [0000]    where {circumflex over (b)} s,k   [i]  is the input symbol estimate, γ s,k   [i]  is its weighting factor, and superscript [i] represents the output of the i th  ICU. The superscript [0] represents the output of front-end processing prior to the first ICU. The symbol estimates may be multiplexed (e.g., concatenated)  402  into a single column vector 
         [0000]          {circumflex over (b)}     [i] =[(   {circumflex over (b)}     1   [i] ) T (   {circumflex over (b)}     2   [i] ) T  . . . (   {circumflex over (b)}     B   [i] ) T ] T    
         [0000]    such that the weighted symbol estimates are given by Γ [i]   {circumflex over (b)}   [i] , where Γ [i]  is a diagonal matrix containing the weighting factors along its main diagonal. The weighted symbol estimates are processed by a synthesizer used to synthesize  403 . 1 - 403 .A constituent signals for each antenna. For each antenna, a synthesized signal represents a noise-free signal that would have been observed at antennas a with the base stations transmitting the weighted symbol estimates Γ [i]   {circumflex over (b)}   [i]  over the multipath channels between base stations  1  through B and the mobile receiver. 
         [0059]    For each antenna, a subtraction module performs interference suppression  404 . 1 - 404 .A on the constituent signals to reduce the amount of intra-channel and inter-channel interference. The interference-suppressed constituents are processed via per-antenna RAKE processing and combining  405 . 1 - 405 .A to produce combined signals. The combined signals are organized by base station, combined across antennas, resolved onto the subchannel code waveforms, and processed by symbol estimators  406 . 1 - 406 .B. The terms denote the estimated symbol for the k th  subchannel of base station s after processing by the (i+1) th  ICU. 
         [0060]      FIG. 5   a  illustrates an apparatus configured for generating multipath finger constituent signals and  FIG. 5   b  shows an apparatus configured for generating subchannel constituents. A plurality of processors  501 . 1 - 501 .B is configured for processing signals received from each base station. For an s th  base station, a plurality K s  of multipliers  502 . 1 - 502 .K scales each code waveform with a corresponding weighted symbol estimate to produce a plurality of estimated transmit signals, which are combined by combiner  503  to produce a superposition signal 
         [0000]      Σ k=0   K     s     −1 γ s,k   [i] {circumflex over (b)} s,k   [i] u s,k (t)  Equation 8
 
         [0061]    A multipath channel emulator comprising path-delay modules  504 . 1 - 504 .L and path-gain modules  505 . 1 - 505 .L produces multipath finger constituent signals expressed by 
         [0000]        {tilde over (y)}   a,s,l   [i] ( t )=α a,s,l Σ k=0   K     s     −1 γ s,k   [i]   {circumflex over (b)}   s,k   [i]   u   s,k ( t−τ   a,s,l ),  Equation 9
 
         [0000]    where {tilde over (y)} a,s,l   [i] (t) is the l th  finger constituent for the channel between base station s and antenna a. 
         [0062]      FIG. 5   b  shows an apparatus configured for generating subchannel constituents. For a particular antenna a, a processor  510 . 1 - 510 .B is configured for processing signals received from each base station. Within each base station processor  510 . 1 - 510 .B, a plurality of processors  511 . 1 - 511 .K are configured for processing each subchannel. Each subchannel processor  511 . 1 - 511 .K comprises a multiplier  512  that scales a k th  code waveform with a corresponding weighted symbol estimate to produce an estimated transmit signal, which is processed by a multipath channel emulator comprising path delay modules  513 . 1 - 513 .L path-gain modules  514 . 1 - 514 .L, and a combiner of the multiple paths  515  to produce 
         [0000]        {tilde over (y)}   a,s,l   [i] ( t )≡γ s,k   [i]   {circumflex over (b)}   s,k   [i] Σ l=0   L     a,s   α a,s,l   u   s,k ( t−τ   a,s,l ),   Equation 10
 
         [0000]    which is the synthesized constituent signal for the k th  subchannel of base station s at the a th  antenna of the mobile. Note that while Equation 9 and Equation 10 both show a signal with a three-parameter subscript for their left-hand sides, they are different signals; the subscript l (as in Equation 9) will be reserved for a finger constituent and the subscript k (as in Equation 10) will be reserved for a subchannel constituent. 
         [0063]      FIG. 6  is a block diagram showing an apparatus configured for performing interference suppression on synthesized constituent signals for each antenna. Since, the constituent signals for each antenna a may comprise multipath finger constituents or subchannel constituents. The index j∈{1, . . . J a,s } is introduced, where 
         [0000]    
       
         
           
             
               J 
               
                 a 
                 , 
                 s 
               
             
             = 
             
               { 
               
                 
                   
                     
                       L 
                       
                         a 
                         , 
                         s 
                       
                     
                   
                   
                     
                       for 
                        
                       
                           
                       
                        
                       finger 
                        
                       
                           
                       
                        
                       constituents 
                     
                   
                 
                 
                   
                     
                       K 
                       s 
                     
                   
                   
                     
                       for 
                        
                       
                           
                       
                        
                       subchannel 
                        
                       
                           
                       
                        
                       constituents 
                     
                   
                 
               
             
           
         
       
     
         [0064]    A first processor  600  comprises a plurality B of subtractive suppressors  601 . 1 - 601 .B configured for processing constituent signals relative to each of a plurality B of base stations. 
         [0065]    Suppressor  601 . s  is illustrated with details that may be common to the other suppressors  601 . 1 - 601 .B. A combiner  602  sums the constituent signals to produce a synthesized received signal associated with base station s, {tilde over (y)} a,s   [i] (t)≡Σ j=0   J     a,s     {tilde over (y)}   a,s,j   [i] , where {tilde over (y)} a,s,j   [i]  is the j th  constituent finger or subchannel signal on the a th  antenna for base station s. 
         [0066]    A second processor  610  comprises a combiner  611  configured for combining the synthesized received signals across base stations to produce a combined synthesized receive signal {tilde over (y)} a   [i] (t)=Σ s=1   B   {tilde over (y)}   a,s   [i]  corresponding to the a th  antenna. A subtraction module  612  produces a signal from the difference between the combined synthesized receive signal and the actual received signal to create a residual signal y a (t)−{tilde over (y)} a   [i] (t). A step size scaling module  613  scales the residual signal with a complex stabilizing step size μ a   [i]   613  to give a scaled residual signal μ a   [i] (y a (t)−{tilde over (y)} a   [i] (t)). The scaled residual signal is returned to the suppressors  601 . 1 - 601 .B in the first processor  601  where combiners, such as combiners  603 . 1 - 603 .J in the suppressor  601 . s  add the scaled residual signal to the constituent signals to produce a set of interference-suppressed constituents expressed by 
         [0000]        z   a,s,j   [i] ( t )≡ {tilde over (y)}   a,s,l   [i] ( t )+μ a   [i] (y a ( t )−{tilde over (y)} a   [i] ( t ))  Equation 11
 
         [0000]    for an interference-suppressed j th  constituent finger or subchannel signal on the a th  antenna for base station s. The term may be evaluated as shown in U.S. patent application Ser. No. 11/451,932, which describes calculating a step size for a single receive antenna. In one embodiment the same step size may be employed for all antennas, meaning μ a   [i] =μ [i]  for all a. 
         [0067]      FIG. 7   a  is a block diagram of an apparatus configured for performing RAKE processing and combining  405 . 1 - 405 .A on the interference-suppressed constituent signals for each antenna. Each of a plurality B of Rake processors  701 . 1 - 701 .B is configured for processing finger constituents for each base station. Processor  701 . s  shows components that are common to all of the processors  701 . 1 - 701 .B. A plurality L of time-advance modules  702 . 1 - 702 .L advance finger signal inputs by multipath time shifts. Scaling modules  703 . 1 - 703 .L scale the time-shifted inputs by complex channel gains, and the resulting scaled signals are summed  704  to yield the maximal ratio combined (MRC) output 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       z 
                       
                         a 
                         , 
                         s 
                       
                       
                         mrc 
                          
                         
                           [ 
                           i 
                           ] 
                         
                       
                     
                      
                     
                       ( 
                       t 
                       ) 
                     
                   
                   = 
                   
                     
                       1 
                       
                         
                           E 
                           s 
                         
                       
                     
                      
                     
                       
                         ∑ 
                         
                           l 
                           = 
                           1 
                         
                         
                           L 
                           
                             a 
                             , 
                             s 
                           
                         
                       
                        
                       
                         
                           α 
                           
                             a 
                             , 
                             s 
                             , 
                             l 
                           
                           * 
                         
                          
                         
                           
                             z 
                             
                               a 
                               , 
                               s 
                               , 
                               l 
                             
                           
                            
                           
                             ( 
                             
                               t 
                               - 
                               
                                 τ 
                                 
                                   a 
                                   , 
                                   s 
                                   , 
                                   l 
                                 
                               
                             
                             ) 
                           
                         
                       
                     
                   
                 
               
               
                 
                   Equation 
                    
                   
                       
                   
                    
                   12 
                 
               
             
           
         
       
     
         [0000]    associated with antenna a and base station s, 
         [0068]    In  FIG. 7   b , Rake processors  710 . 1 - 710 .B may each comprise a combiner  711  configured for summing the subchannel constituent signals, a plurality L of time-advance modules  712 . 1 - 712 .L configured for advancing the sum by multipath time offsets, scaling modules  713 . 1 - 713 .L configured for scaling the sum by corresponding multipath channel gains, and a combiner  714  configured for summing the scaled signals to produce the MRC output 
         [0000]    
       
         
           
             
               
                 
                   
                     z 
                     
                       a 
                       , 
                       s 
                     
                     
                       mrc 
                        
                       
                         [ 
                         i 
                         ] 
                       
                     
                   
                   = 
                   
                     
                       1 
                       
                         
                           E 
                           s 
                         
                       
                     
                      
                     
                       
                         ∑ 
                         
                           l 
                           = 
                           1 
                         
                         
                           L 
                           
                             a 
                             , 
                             s 
                           
                         
                       
                        
                       
                         
                           α 
                           
                             a 
                             , 
                             s 
                             , 
                             l 
                           
                           * 
                         
                          
                         
                           
                             ∑ 
                             
                               k 
                               = 
                               1 
                             
                             
                               K 
                               s 
                             
                           
                            
                           
                             
                               z 
                               
                                 a 
                                 , 
                                 s 
                                 , 
                                 k 
                               
                             
                              
                             
                               ( 
                               
                                 t 
                                 - 
                                 
                                   τ 
                                   
                                     a 
                                     , 
                                     s 
                                     , 
                                     l 
                                   
                                 
                               
                               ) 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   Equation 
                    
                   
                       
                   
                    
                   13 
                 
               
             
           
         
       
     
         [0000]    associated with antenna a and base station s. 
         [0069]      FIG. 8  shows an apparatus configured for performing the steps  406 . 1 - 406 .B shown in  FIG. 4  to produce the updated symbol estimates. Each of a plurality B of processors  801 . 1 - 801 .B is configured for processing the MRC outputs. Processor  801 . s  shows details that are common to all of the processors  801 . 1 - 801 .B. 
         [0070]    For each base station, the MRC signals for all antennas are summed  802  to form the overall MRC signal 
         [0000]        z   s   mrc,[i] ( t )≡Σ a=1   A   z   a,s   mrc,[i] ( t ),  Equation 14
 
         [0000]    which is resolved by code multipliers  803 . 1 - 803 .K and integrators  804 . 1 - 804 .K onto the subchannel code waveforms. Symbol estimators  805 . 1 - 805 .K are employed for producing symbol estimates, such as mixed-decision symbol estimates as described in U.S. patent application Ser. No. 11/451,932. 
         [0071]    Because of the linear nature of many of the ICU components, alternative embodiments of the invention may comprise similar components employed in a different order of operation without affecting the overall functionality. In one embodiment, antenna combining and de-spreading may be performed prior to interference suppression, such as illustrated in  FIG. 9 . 
         [0072]      FIG. 9   a  illustrates a plurality of processing blocks  901 . 1 - 901 .B configured for processing constituent finger or sub-channel signals received from each of a plurality of base stations. The constituent signals are subtracted from the received signal on antenna a by a subtraction module  902  to produce a residual signal. The residual signal is processed by a RAKE  903 . 1 - 903 .L and maximal ratio combiner (comprising weighting modules  904 . 1 - 904 .L and an adder  905 ) to produce an error signal e a,s   [i] (t) for antenna a and base station s. 
         [0073]    In  FIG. 9   b , each of a plurality of processing blocks  911 . 1 - 911 .B is configured to combine the error signals produced by the apparatus shown in  FIG. 9   a . In processing block  911 . s , a combiner  912  combines the error signals corresponding to the s th  base station across the antennas to produce e s   [i] (t), the error signal for base station s. Despreaders comprising code multipliers  913 . 1 - 913 .K and integrators  914 . 1 - 914 .K resolve the error signal e s   [i] (t) onto code waveforms of subchannels associated with the s th  base station. 
         [0074]    The output for the k th  subchannel of base station s is ∫ 0   T u k *(t)e s   [i] (t)dt, which is equal to q s,k −{tilde over (q)} s,k   [i] , where q s,k  is defined in Equation 4, and 
         [0000]    
       
         
           
             
               
                 q 
                 ~ 
               
               
                 s 
                 , 
                 k 
               
               
                 [ 
                 i 
                 ] 
               
             
             = 
             
               
                 1 
                 
                   E 
                   s 
                 
               
                
               
                 
                   ∑ 
                   
                     a 
                     = 
                     1 
                   
                   A 
                 
                  
                 
                   
                     ∫ 
                     0 
                     T 
                   
                    
                   
                     
                       
                         u 
                         k 
                         * 
                       
                        
                       
                         ( 
                         t 
                         ) 
                       
                     
                      
                     
                       
                         ∑ 
                         
                           l 
                           = 
                           1 
                         
                         
                           L 
                           
                             a 
                             , 
                             s 
                           
                         
                       
                        
                       
                         
                           α 
                           
                             a 
                             , 
                             s 
                             , 
                             l 
                           
                           * 
                         
                          
                         
                           
                             ∑ 
                             
                               j 
                               = 
                               1 
                             
                             
                               J 
                               
                                 a 
                                 , 
                                 s 
                               
                             
                           
                            
                           
                             
                               
                                 
                                   y 
                                   ~ 
                                 
                                 
                                   a 
                                   , 
                                   s 
                                   , 
                                   j 
                                 
                               
                                
                               
                                 ( 
                                 
                                   t 
                                   - 
                                   
                                     τ 
                                     
                                       a 
                                       , 
                                       s 
                                       , 
                                       l 
                                     
                                   
                                 
                                 ) 
                               
                             
                              
                             
                                
                               t 
                             
                           
                         
                       
                     
                   
                 
               
             
           
         
       
     
         [0000]    For each base station, the values q s,k  and {tilde over (q)} s,k   [i]  may be stacked into a vector over the subchannel index k to form  q   s − {tilde over (q)}   s   [i] . These likewise may be stacked into a single vector over the base station index s to give  q − {tilde over (q)}   [i] . This quantity may also be determined explicitly using a matrix multiplication. 
         [0075]      FIG. 9   c  illustrates a final step of an interference-suppression process. A stabilizing step size module  921  scales the difference  q − {tilde over (q)}   [i]  by a stabilizing step size μ [i] , and the result is added  923  to the weighted input vector Γ [i]   {circumflex over (b)}   [i]  after being multiplied  922  by implementation matrix F to produce a vector sum. The value of the implementation matrix F depends on whether finger or subchannel constituents are used. A symbol estimator  924  produces symbol estimates for each element of the vector sum. 
         [0076]    An explicit implementation of an ICU is illustrated in  FIG. 10 . The input symbol estimates are weighted  1000  and multiplied by a matrix R  1001 . The resulting product is subtracted  1002  from front-end vector  q  and scaled with the stabilizing step size μ [i]  by a stabilizing step size module  1003 . The resulting scaled signal is summed  1004  with weighted symbol estimates multiplied  1005  by the implementation matrix F to produce a vector sum. A symbol estimator  1006  makes decisions on the vector sum. 
         [0077]    Matrix R is the correlation matrix for all subchannels at the receiver after combining across antennas. It may be evaluated by 
         [0000]      R=Σ a=1   A R a   Equation 15
 
         [0000]    where R a  is the correlation matrix for all subchannels at the a th  antenna, and it may be determined as described in U.S. patent application Ser. No. 11/451,932 for a single antenna receiver. The matrix F is either the identity matrix when subchannel constituent signals are employed or the correlation matrix for all subchannels at the transmitter(s) when finger constituent signals are used, such as described in U.S. patent application Ser. No. 11/451,932. This functionality may be represented by the one-step matrix-update equation 
         [0000]          {circumflex over (b)}     [i+1] =Ψ(μ [i] (   q −RΓ   [i]     {circumflex over (b)}     [i] )+ FΓ   [i]     {circumflex over (b)}     [i] ),  Equation 16
 
         [0000]    where Ψ(·) represents any function that returns a symbol estimate for each element of its argument (including, for example, any of the mixed-decision symbol estimation functions described in U.S. patent application Ser. No. 11/451,932) and all other quantities as previously described. 
         [0078]    The stabilizing step size μ [i]  may take any of the forms described in U.S. patent application Ser. No. 11/451,932 that depend on the correlation matrix R, the implementation matrix F, and the weighting matrix Γ [i] . Two of these forms of μ [i]  are implicitly calculable, such as described in U.S. patent application Ser. No. 11/451,932 for a single receive antenna. 
         [0079]      FIG. 11   a  illustrates a method for calculating a stabilizing step size when multiple receive antennas are employed. Preliminary processing  1101 . 1 - 1101 .A for each antenna provides for RAKE processing, combining, and de-spreading  1102  on the received signal, and RAKE processing, combining, and de-spreading  1103  on the synthesized received signal and produces  1113  a difference signal. In an alternative embodiment for the preliminary processing  1101 . 1 - 1101 .A shown in  FIG. 11   b , a difference signal calculated from the received signal and the synthesized received signal undergoes RAKE processing, combining, and de-spreading  1110 . a.    
         [0080]    The difference-signal vector corresponding to the a th  antenna is denoted by  β   a   [i] . The difference-signal vectors for all of the antennas are summed to produce a sum vector  β   [i] . A sum of the square magnitudes  1105  of the elements of the sum vector (i.e., || β   [i] || 2 ) provides a numerator of a ratio from which the stabilizing step size is evaluated. The elements of  β   [i]  are used as transmit symbols in order to synthesize  1106  received signals for each antenna. Synthesized received signals are expressed as 
         [0000]    
       
         
           
             
               ∑ 
               
                 s 
                 = 
                 1 
               
               B 
             
              
             
               
                 ∑ 
                 
                   l 
                   = 
                   1 
                 
                 
                   L 
                   
                     a 
                     , 
                     s 
                   
                 
               
                
               
                 
                   α 
                   
                     a 
                     , 
                     s 
                     , 
                     l 
                   
                   * 
                 
                  
                 
                   
                     ∑ 
                     
                       k 
                       = 
                       1 
                     
                     
                       K 
                       s 
                     
                   
                    
                   
                     
                       β 
                       
                         s 
                         , 
                         k 
                       
                       
                         [ 
                         i 
                         ] 
                       
                     
                      
                     
                       
                         u 
                         
                           s 
                           , 
                           k 
                         
                       
                        
                       
                         ( 
                         
                           t 
                           - 
                           
                             τ 
                             
                               a 
                               , 
                               s 
                               , 
                               l 
                             
                           
                         
                         ) 
                       
                     
                   
                 
               
             
           
         
       
     
         [0000]    for antenna a, where β s,k   [i]  is the k th  element of  β   [i] . An integral of the square magnitude of each synthesized signal is calculated  1108 . 1 - 1108 .A and summed  1109  to produce the denominator of the ratio. The ratio of the numerator and the denominator gives the first version of the step size μ [i] . 
         [0081]      FIG. 11   c  shows an implicit evaluation of the step size in accordance with another embodiment of the invention. The denominator of the ratio used to calculate the stabilizing step size is determined by weighting  1150  the vector  β   [i]  by soft weights (such as contained in the diagonal matrix Γ [i] ). The elements of the resulting weighted vector are used to produce  1151  synthesized received signals for all of the antennas. Integrals of the square magnitudes of the synthesized received signals are calculated  1152 . 1 - 1152 .A and summed  1153  to provide the denominator. 
         [0082]    The corresponding numerator is calculated by scaling  1154  symbol estimates produced at the i th  iteration by the square of the soft weights (as contained in the diagonal matrix (Γ [i] ) 2 ). The resulting scaled vector is used to synthesize  1155  received signals for all of the antennas. The synthesized signals and the received signals are processed by a parallel bank of processors  1156 . 1 - 1156 .A, each corresponding to a particular antenna. The functionality of each processor  1156 . 1 - 1156 .A may be equivalent to the processor  1101 . a  shown in  FIG. 11   a . The vector outputs of the processors  1156 . 1 - 1156 .A are summed  1157 , and the numerator is produced from the inner product  1158  of the sum vector with the weighted vector. 
         [0083]    Explicit versions of both versions of the step size are given, respectively, by 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       μ 
                       
                         [ 
                         i 
                         ] 
                       
                     
                     = 
                     
                       
                         
                           
                             ( 
                             
                               
                                 q 
                                 _ 
                               
                               - 
                               
                                 R 
                                  
                                 
                                     
                                 
                                  
                                 F 
                                  
                                 
                                     
                                 
                                  
                                 
                                   Γ 
                                   
                                     [ 
                                     i 
                                     ] 
                                   
                                 
                                  
                                 
                                   
                                     
                                       b 
                                       _ 
                                     
                                     ^ 
                                   
                                   
                                     [ 
                                     i 
                                     ] 
                                   
                                 
                               
                             
                             ) 
                           
                           H 
                         
                          
                         
                           ( 
                           
                             
                               q 
                               _ 
                             
                             - 
                             
                               R 
                                
                               
                                   
                               
                                
                               F 
                                
                               
                                   
                               
                                
                               
                                 Γ 
                                 
                                   [ 
                                   i 
                                   ] 
                                 
                               
                                
                               
                                 
                                   
                                     b 
                                     ^ 
                                   
                                   _ 
                                 
                                 
                                   [ 
                                   i 
                                   ] 
                                 
                               
                             
                           
                           ) 
                         
                       
                       
                         
                           
                             ( 
                             
                               
                                 q 
                                 _ 
                               
                               - 
                               
                                 R 
                                  
                                 
                                     
                                 
                                  
                                 
                                   Γ 
                                   
                                     [ 
                                     i 
                                     ] 
                                   
                                 
                                  
                                 
                                   
                                     
                                       b 
                                       ^ 
                                     
                                     _ 
                                   
                                   
                                     [ 
                                     i 
                                     ] 
                                   
                                 
                               
                             
                             ) 
                           
                           H 
                         
                          
                         
                           R 
                            
                           
                             ( 
                             
                               
                                 q 
                                 _ 
                               
                               - 
                               
                                 R 
                                  
                                 
                                     
                                 
                                  
                                 
                                   Γ 
                                   
                                     [ 
                                     i 
                                     ] 
                                   
                                 
                                  
                                 
                                   
                                     
                                       b 
                                       _ 
                                     
                                     ^ 
                                   
                                   
                                     [ 
                                     i 
                                     ] 
                                   
                                 
                               
                             
                             ) 
                           
                         
                       
                     
                   
                    
                   
                     
 
                   
                    
                   and 
                 
               
               
                 
                   Equation 
                    
                   
                       
                   
                    
                   17 
                 
               
             
             
               
                 
                   
                     μ 
                     
                       [ 
                       i 
                       ] 
                     
                   
                   = 
                   
                     
                       
                         
                           ( 
                           
                             
                               q 
                               _ 
                             
                             - 
                             
                               R 
                                
                               
                                   
                               
                                
                               
                                 Γ 
                                 
                                   [ 
                                   i 
                                   ] 
                                 
                               
                                
                               F 
                                
                               
                                   
                               
                                
                               
                                 Γ 
                                 
                                   [ 
                                   i 
                                   ] 
                                 
                               
                                
                               
                                 
                                   
                                     b 
                                     _ 
                                   
                                   ^ 
                                 
                                 
                                   [ 
                                   i 
                                   ] 
                                 
                               
                             
                           
                           ) 
                         
                         H 
                       
                        
                       
                         
                           Γ 
                           
                             [ 
                             i 
                             ] 
                           
                         
                          
                         
                           ( 
                           
                             
                               q 
                               _ 
                             
                             - 
                             
                               R 
                                
                               
                                   
                               
                                
                               
                                 Γ 
                                 
                                   [ 
                                   i 
                                   ] 
                                 
                               
                                
                               
                                 
                                   
                                     b 
                                     _ 
                                   
                                   ^ 
                                 
                                 
                                   [ 
                                   i 
                                   ] 
                                 
                               
                             
                           
                           ) 
                         
                       
                     
                     
                       
                         
                           ( 
                           
                             
                               q 
                               _ 
                             
                             - 
                             
                               R 
                                
                               
                                   
                               
                                
                               
                                 Γ 
                                 
                                   [ 
                                   i 
                                   ] 
                                 
                               
                                
                               
                                 
                                   
                                     b 
                                     _ 
                                   
                                   ^ 
                                 
                                 
                                   [ 
                                   i 
                                   ] 
                                 
                               
                             
                           
                           ) 
                         
                         H 
                       
                        
                       
                         
                           ( 
                           
                             Γ 
                             
                               [ 
                               i 
                               ] 
                             
                           
                           ) 
                         
                         H 
                       
                        
                       R 
                        
                       
                           
                       
                        
                       
                         
                           Γ 
                           
                             [ 
                             i 
                             ] 
                           
                         
                          
                         
                           ( 
                           
                             
                               q 
                               _ 
                             
                             - 
                             
                               R 
                                
                               
                                   
                               
                                
                               
                                 Γ 
                                 
                                   [ 
                                   i 
                                   ] 
                                 
                               
                                
                               
                                 
                                   
                                     b 
                                     _ 
                                   
                                   ^ 
                                 
                                 
                                   [ 
                                   i 
                                   ] 
                                 
                               
                             
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   Equation 
                    
                   
                       
                   
                    
                   18 
                 
               
             
           
         
       
     
         [0000]    wherein all quantities shown are as previously defined. 
         [0084]    Another form of the step size in U.S. patent application Ser. No. 11/451,932 depends only on the path gains, and may be generalized to multiple receive antennas according to 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       μ 
                       
                         [ 
                         i 
                         ] 
                       
                     
                     = 
                     
                       μ 
                       = 
                       
                         max 
                          
                         
                           { 
                           
                             C 
                             , 
                             
                               
                                 
                                   max 
                                   
                                     s 
                                     , 
                                     l 
                                   
                                 
                                  
                                 
                                   
                                     ∑ 
                                     
                                       a 
                                       = 
                                       1 
                                     
                                     A 
                                   
                                    
                                   
                                     
                                        
                                       
                                         α 
                                         
                                           a 
                                           , 
                                           s 
                                           , 
                                           l 
                                         
                                       
                                        
                                     
                                     p 
                                   
                                 
                               
                               
                                 
                                   ∑ 
                                   
                                     a 
                                     = 
                                     1 
                                   
                                   A 
                                 
                                  
                                 
                                   
                                     ∑ 
                                     
                                       s 
                                       = 
                                       1 
                                     
                                     B 
                                   
                                    
                                   
                                     
                                       ∑ 
                                       
                                         l 
                                         = 
                                         1 
                                       
                                       
                                         L 
                                         
                                           a 
                                           , 
                                           s 
                                         
                                       
                                     
                                      
                                     
                                       
                                          
                                         
                                           α 
                                           
                                             a 
                                             , 
                                             s 
                                             , 
                                             l 
                                           
                                         
                                          
                                       
                                       p 
                                     
                                   
                                 
                               
                             
                           
                           } 
                         
                       
                     
                   
                   , 
                 
               
               
                 
                   Equation 
                    
                   
                       
                   
                    
                   19 
                 
               
             
           
         
       
     
         [0000]    where μ [i]  is fixed for every ICU and C and p are non-negative constants. 
         [0085]    Embodiments of the invention are also applicable to the reverse-link, such as described for the single receive antenna in U.S. patent application Ser. No. 11/451,932. The primary difference (when compared to the forward-link) is that subchannels from distinct transmitters experience different multipath channels and, thus, the receiver must accommodate each subchannel with its own RAKE/Combiner/De-Spreader, and channel emulation must take into account that, in general, every subchannel sees its own channel. Such modifications are apparent to those knowledgeable in the art. 
         [0086]    Embodiments of the invention may be realized in hardware or software and there are several modifications that can be made to the order of operations and structural flow of the processing. Those skilled in the art should recognize that method and apparatus embodiments described herein may be implemented in a variety of ways, including implementations in hardware, software, firmware, or various combinations thereof. Examples of such hardware may include Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs), general-purpose processors, Digital Signal Processors (DSPs), and/or other circuitry. Software and/or firmware implementations of the invention may be implemented via any combination of programming languages, including Java, C, C++, Matlab™, Verilog, VHDL, and/or processor specific machine and assembly languages. 
         [0087]    Computer programs (i.e., software and/or firmware) implementing the method of this invention may be distributed to users on a distribution medium such as a SIM card, a USB memory interface, or other computer-readable memory adapted for interfacing with a consumer wireless terminal. Similarly, computer programs may be distributed to users via wired or wireless network interfaces. From there, they will often be copied to a hard disk or a similar intermediate storage medium. When the programs are to be run, they may be loaded either from their distribution medium or their intermediate storage medium into the execution memory of a wireless terminal, configuring an onboard digital computer system (e.g. a microprocessor) to act in accordance with the method of this invention. All these operations are well known to those skilled in the art of computer systems. 
         [0088]    The functions of the various elements shown in the drawings, including functional blocks labeled as “modules” may be provided through the use of dedicated hardware, as well as hardware capable of executing software in association with appropriate software. When provided by a processor, the functions may be performed by a single dedicated processor, by a shared processor, or by a plurality of individual processors, some of which may be shared. Moreover, explicit use of the term “processor” or “module” should not be construed to refer exclusively to hardware capable of executing software, and may implicitly include, without limitation, digital signal processor OSP hardware, read-only memory (ROM) for storing software, random access memory (RAM), and non-volatile storage. Other hardware, conventional and/or custom, may also be included. Similarly, the function of any component or device described herein may be carried out through the operation of program logic, through dedicated logic, through the interaction of program control and dedicated logic, or even manually, the particular technique being selectable by the implementer as more specifically understood from the context. 
         [0089]    The method and system embodiments described herein merely illustrate particular embodiments of the invention. It should be appreciated that those skilled in the art will be able to devise various arrangements, which, although not explicitly described or shown herein, embody the principles of the invention and are included within its spirit and scope. Furthermore, all examples and conditional language recited herein are intended to be only for pedagogical purposes to aid the reader in understanding the principles of the invention. This disclosure and its associated references are to be construed as applying without limitation to such specifically recited examples and conditions. Moreover, all statements herein reciting principles, aspects, and embodiments of the invention, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future, i.e., any elements developed that perform the same function, regardless of structure.