Abstract:
A modulator ( 102 ) modulates a plurality of symbols to create a modulated signal. A transmitter is coupled to the modulator ( 102 ). The transmitter transmits the modulated signal if the modulated signal is above a threshold. A minima enlarger ( 104 ) is coupled to the modulator ( 102 ). The minima enlarger ( 104 ) computes an adjustment to the plurality of symbols if the modulated signal is below the threshold. A summer ( 106 ) is coupled to the modulator ( 102 ) and the minima enlarger ( 104 ). The summer ( 106 ) adds the adjustment to the plurality of symbols if the modulated signal is below the threshold.

Description:
FIELD OF THE INVENTION  
         [0001]    The present invention relates generally to a method and apparatus for minima enlargement.  
         BACKGROUND OF THE INVENTION  
         [0002]    Wireless telecommunication systems sometimes are divided into a series of cell areas covering a service area. Each cell area has a transmitting base station using an operating frequency set comprising a plurality of radio channels to communicate with mobile subscribers. Each channel represents an information signal at a particular frequency carrier or band.  
           [0003]    In many instances it is advantageous to combine these channels for transmission purposes. The channels can all be combined by a broadband signal combiner into a multi-subchannel signal at lower power levels and then amplified by a single linear amplifier (or its equivalent, a plurality of linear amplifiers in parallel, each amplifying a reduced power version of the same multi-carrier sub-channel signal) to raise the multi-subchannel signal to an appropriate transmit power level.  
           [0004]    As data rate requirements rise, the symbol rate necessary in forthcoming protocols will cause the modulation bandwidth to exceed the coherence bandwidth of the channel. This requires an expensive equalizer at the receiver to compensate for intersymbol interference created by the time dispersion in a multipath channel. Another application of multi-subchannel technology is to split the single, high symbol rate modulation into a plurality of lower rate sub-channels that each has a low enough modulation bandwidth to avoid the need for an adaptive equalizer.  
           [0005]    Highly linear multi-subchannel modulations have large dynamic ranges where the minimum voltage can approach −50 dB or lower from the signal mean. This will essentially take the linear amplifier used to increase the power of the signal prior to transmission down to idle bias current and cause a spike in the load impedance with unpredictable results. In addition, with recent supply modulation techniques used to increase the linear amplifier efficiency, if the supply voltage approaches zero, the linear amplifier could have problems with phase, noise and stability.  
           [0006]    In the past, floor clamp circuits have been employed to prevent the voltage from dropping below a specified threshold. This results in frequency domain splatter and a reduction in linearity of the signal. Furthermore, different types of signals can tolerate different amounts of distortion and thus different amounts of compression. Prior-art techniques have not attempted to tailor symbols on multiple subchannels, including empty subchannels, in a controlled, individualized manner to improve the minima to average power ratio.  
           [0007]    Clearly then, a need exists for an improved method and apparatus for minima enlargement. 
       
    
    
     BRIEF DESCRIPTION OF THE FIGURES  
       [0008]    A preferred embodiment of the invention is now described, by way of example only, with reference to the accompanying figures in which:  
         [0009]    [0009]FIG. 1 illustrates a block diagram of a transmit modem in accordance with the present invention; and  
         [0010]    [0010]FIG. 2 illustrates a pictorial representation of minima enlargement in accordance with the present invention. 
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT  
       [0011]    It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements are exaggerated relative to each other. Further, where considered appropriate, reference numerals have been repeated among the figures to indicate corresponding elements.  
         [0012]    The present invention discloses an improved method and apparatus for minima enlargement in a modulator. The present invention allows control of the compression in accordance with the type of information being sent and will tailor symbols on multiple subchannels, including empty subchannels, in a controlled, individualized manner to improve the minima to average power ratio.  
         [0013]    Turning to the figures, FIG. 1 illustrates a block diagram of the transmit modem with the iterative minima enlarger. As illustrated, the block diagram comprises an unmodulated symbols input  100 , a frequency division multiplexing (“FDM”) modulator  102 , a minima enlarger  104 , and a summation component  106 . The unmodulated symbols, X(k,m)  100 , is the complex baseband symbol matrix with k selecting the frequency axis, and m selecting the time axis. The FDM modulator  102  modulates symbols according to the following equation:  
               x        (   n   )       =       ∑     m   =   0         N   s     -   1                         g        [     mI   +       (   nD   )     I       ]              ∑     k   =   0       M   -   1                         X        (     k   ,       ⌊     nD   I     ⌋     -   m       )                 j          2      π     M            k        (   n   )       M                         (   1   )                               
 
         [0014]    where,  
         [0015]    x(n)=the nth sample of the modulated output;  
         [0016]    g=the pulse shaping filter;  
         [0017]    N s =the pulse shaping filter length (in units of symbol periods);  
         [0018]    I=the filter interpolation rate;  
         [0019]    D=the filter decimation rate; and  
         [0020]    M=the number of subchannels.  
         [0021]    The inner sum of equation (1) performs the mixing of the subchannels, and the outer sum of equation (1) performs the pulse shaping and rate change as described in greater detail in U.S. Pat. No. 6,134,268, titled “Apparatus for Performing a Non-Integer Sampling Rate Change in a Multichannel Polyphase Filter,” which is herein incorporated by reference. It is known in the art that equation (1) can be efficiently implemented using an inverse fast Fourier transform (“IFFT”) to perform the mixing as shown in equations (2) and (3) below:  
               x        (   n   )       =       ∑     m   =   0         N   s     -   1                         g        [     mI   +       (   nD   )     I       ]              x   r          (         (   n   )     M     ,       ⌊     nD   I     ⌋     -   m       )                   (   2   )                               
 
         [0022]    where x r (n,m) is given by:  
                 x   r          (     n   ,   m     )       =         M   ·       -   1              {     X        (     k   ,   m     )       }       =       M   ·     1   M              ∑     k   =   0       M   -   1                         X        (     k   ,   m     )                 j          2      π     M        kn                       (   3   )                               
 
         [0023]    It is important to note that the present invention is not limited to any particular method for performing FDM modulation, but rather, it should be obvious to those skilled in the art that the present invention can utilize any of the many available methods of performing FDM modulation and still remain within the spirit and scope of the present invention.  
         [0024]    The minima enlarger  104  detects signal minima and computes an adjustment matrix that when combined with the unmodulated symbols, X(k,m),  100  enlarges the signal above the minima threshold, M p . The signal minima is defined as any output sample whose magnitude is less than a specified minima threshold, M p . The minima threshold, M p , can either be predetermined or dynamically adjusted based on system needs. When the signal drops below the minima, the problems discussed in the background manifest themselves. The adjustment matrix of the present invention, however, brings the signal above the threshold and avoids the aforementioned problems.  
         [0025]    The summation component combines the unmodulated symbols, X(k,m),  100  with an adjustment computed by the minima enlarger component  104 .  
         [0026]    Let us now focus the discussion on the minima enlarger component  104 . When the minima enlarger component  104  detects a minima at output sample p with phase of φ p , as described by the following equation,  
         | x ( p )|&lt; M   p  with            x ( p )=φ p   (4)  
         [0027]    it computes an additive symbol adjustment to X(k,m) called Δ(k,m) such that passing X′(k,m)=X(k,m)+Δ(k,m) through the FDM modulator would result in x′(p)≧M p , where x′(p) is given by the following equation:  
                       x   ′          (   p   )       =              ∑     m   =   0         N   s     -   1                         g        [     mI   +       (   pD   )     I       ]              ∑     k   =   0       M   -   1                           X   ′          (     k   ,       ⌊     pD   I     ⌋     -   m       )                 j          2      π     M            k        (   p   )       M                             =              ∑     m   =   0         N   s     -   1                         g        [     mI   +       (   pD   )     I       ]              ∑     k   =   0       M   -   1              {       X        (     k   ,       ⌊     pD   I     ⌋     -   m       )       +     Δ        (     k   ,       ⌊     pD   I     ⌋     -   m       )         }               j          2      π     M            k        (   p   )       M                               (   5   )                               
 
         [0028]    Noting that the system is linear, the contribution of Δ(k,m) to x′(p) can be treated separately:  
                 x   Δ          (   p   )       =       ∑     m   =   0         N   s     -   1                         g        [     mI   +       (   pD   )     I       ]              ∑     k   =   0       M   -   1                         Δ        (     k   ,       ⌊     pD   I     ⌋     -   m       )                 j          2      π     M            k        (   p   )       M                         (   6   )                               
 
         [0029]    The minima enlarger  104  must find the Δ(k,m) such that:  
         | x ( p )+ x   Δ ( p )|≧ M   p   (7)  
         [0030]    In practice, this may be accomplished by adjusting the minima such that |x′(p)|=M p ·a, with a&gt;1. That is:  
         | x ( p )+ x   Δ ( p )= M   p   ·a   (8)  
         [0031]    [0031]FIG. 2 pictorially illustrates minima enlargement. First, it should be noted that the magnitude of x(p)  200  is close to the origin, and hence the output of the linear amplifier is no longer reliable. Second, it should also be noted that φ p    202 , the phase of x Δ (p)  204 , is the same as the phase of x(p) 200 . Making all contributions towards x Δ (p)  204  coherent in this direction minimizes the magnitude.  
         [0032]    Working from equation (6):  
               ∠                     x   Δ          (   p   )         =       ∠          ∑     m   =   0         N   s     -   1                         g        [     mI   +       (   pD   )     I       ]              ∑     k   =   0       M   -   1              Δ        (     k   ,       ⌊     pD   I     ⌋     -   m       )                 j          2      π     M            k        (   p   )       M                   =     φ   p               (   9   )                   φ   p     -         2      π     M            k        (   p   )       M         =       ∑     m   =   0         N   s     -   1                         ∑     k   =   0       M   -   1                       ∠Δ        (     k   ,                  ⌊     pD   I     ⌋     -   m       )                   (   10   )                               
 
         [0033]    The optimal solution to this is to require each component of the double summation to have the necessary phase:  
               ∠Δ        (     k   ,                  ⌊     pD   I     ⌋     -   m       )       =         φ   p     -         2      π     M            k        (   p   )       M                   for                 0       ≤   k   ≤     M   -     1                 and                 0       ≤   m   ≤       N   s     -   1               (   11   )                               
 
         [0034]    Now consider the magnitude x Δ (p)  204 . The total symbol error introduced is given by:  
               ∑     m   =   0         N   s     -   1                         ∑     k   =   0       M   -   1                            Δ        (     k   ,       ⌊     pD   I     ⌋     -   m       )                      (   12   )                               
 
         [0035]    In order to minimize this quantity, examine the magnitude of x Δ (p) from equation (1):  
                                 x   Δ          (   p   )            =            ∑     m   =   0         N   s     -   1                         g        [     mI   +       (   pD   )     I       ]              ∑     k   =   0       M   -   1              Δ        (     k   ,       ⌊     pD   I     ⌋     -   m       )                 j          2      π     M            k        (   p   )       M                              (   13   )               =       ∑     m   =   0         N   s     -   1                              g        [     mI   +       (   pD   )     I       ]                   ∑     k   =   0       M   -   1                 Δ        (     k   ,       ⌊     pD   I     ⌋     -   m       )                          (   14   )                               
 
         [0036]    The pulse-shaping filter is acting as a weighting function to the symbol adjustment matrix. Moving symbols that align with large filter coefficients have a greater impact on the magnitude than others. The pulse-shaping filter coefficients themselves can be used to weight the changes.  
         [0037]    As a final component to Δ(k,m), it is noted that the various symbol types have different importance. For example, in most applications pilot and synchronization symbols should be altered much less than data symbols. Define W(km) as a matrix the same dimension as X(k,m) that contains weights for each entry in X(k,m). The complete equation for Δ(km) is given by:  
               Δ        (     k   ,   m     )       =     C   ·     W        (     k   ,       ⌊     pD   I     ⌋     -   m       )       ·     g        [     mI   +       (   pD   )     I       ]       ·          j        (       φ   p     -         2      π     M            k        (   p   )       M         )                   (   15   )                               
 
         [0038]    The constant C is in place to ensure that the minima is sufficiently enlarged according to equation (8), after which, the linear amplifier will be operating in a region where the output is reliable:  
         | x   Δ ( p )+ x ( p )|= M   p   ·a         M   p   ·a−|x ( p )|= x   Δ ( p )  (16)                    M   p     ·   a     -          x        (   p   )              =            ∑     m   =   0         N   s     -   1                         g        (     mI   +       (   pD   )     I       )              ∑     k   =   0       M   -   1              Δ        (     k   ,       ⌊     pD   I     ⌋     -   m       )                 j          2      π     M        kn                            (   17   )               =            ∑     m   =   0         N   s     -   1                         g        (     mI   +       (   pD   )     I       )              ∑     k   =   0       M   -   1              C   ·     W        (     k   ,       ⌊     pD   I     ⌋     -   m       )       ·     g        (     mI   +       (   pD   )     I       )       ·          j        (       φ   p     -         2      π     M        k       )                     j          2      π     M        kn                            (   18   )               =            ∑     m   =   0         N   s     -   1                           g   2          (     mI   +       (   pD   )     I       )              ∑     k   =   0       M   -   1            C   ·     W        (     k   ,       ⌊     pD   I     ⌋     -   m       )                            (   19   )                                 
         [0039]    Pulling C to the front, noting that |g 2 |=g 2  and that W(k,m) is positive and real:  
                   M   p     ·   a     -          x        (   p   )              =     C          ∑     m   =   0         N   s     -   1                           g   2          (     mI   +       (   pD   )     I       )              ∑     k   =   0       M   -   1            W        (     k   ,       ⌊     pD   I     ⌋     -   m       )                       (   20   )               C   =           M   p     ·   a     -          x        (   p   )                  ∑     m   =   0         N   s     -   1                           g   2          [     mI   +       (   pD   )     I       ]              ∑     k   =   0       M   -   1            W        (     k   ,       ⌊     pD   I     ⌋     -   m       )                       (   21   )                               
 
         [0040]    Computing Δ(k,m) in this manner requires the re-computation of the IFFT for x r (n,m) in equations (2) and (3). It is more efficient to solve for x′ r (n,m), the IFFT of Δ(k,m). Since the system is linear, the component from the symbol adjustment matrix can be computed and summed with x r (n,m):  
           x   r   ′ ( n,m )= x   r ( n,m )+δ r ( n,m )  (22)  
         [0041]    where,  
                 δ   r          (     n   ,   m     )       =         M   ·       -   1              {     Δ        (     k   ,   m     )       }       =       M   ·     1   M              ∑     k   =   0       M   -   1                         Δ        (     k   ,   m     )                 j          2      π     M        kn                       (   23   )                               
 
         [0042]    Substituting for Δ(k,m) and using the pointer updates for k and m:  
                 δ   r          (     n   ,   m     )       =       ∑     k   =   0       M   -   1                         C   ·     W        (     k   ,       ⌊     nD   I     ⌋     -   m       )       ·     g        [     mI   +       (   nD   )     I       ]                   j        (       φ   p     -         2      π     M            k        (   p   )       M         )                   j          2      π     M        kn                   (   24   )               =       C   ·          j                   φ   p                  ∑     k   =   0       M   -   1                           W        (     k   ,       ⌊     nD   I     ⌋     -   m       )       ·     g        [     mI   +       (   nD   )     I       ]                   j        (         2      π     M            k        (     n   -   p     )       M       )                       (   25   )               =       C   ·          j                   φ   p         ·     g        [     mI   +       (   nD   )     I       ]                ∑     k   =   0       M   -   1              W        (     k   ,       ⌊     nD   I     ⌋     -   m       )                 j        (         2      π     M            k        (     n   -   p     )       M       )                       (   26   )                   δ   r          (     n   ,   m     )       =       C   ·          j                   φ   p         ·     g        [     mI   +       (   nD   )     I       ]                w   r          (         (     n   -   p     )     M     ,       ⌊     nD   I     ⌋     -   m       )                 (   27   )                               
 
         [0043]    Where w r (n,m) is defined as the one-dimensional IFFT of W(k,m) along the frequency axis:  
                 w   r          (     n   ,   m     )       =         M   ·       -   1              {     W        (     k   ,   m     )       }       =     M   ·       ∑     k   =   0       M   -   1                         W        (     k   ,   m     )                 j        (         2      π     M        kn     )                         (   28   )                               
 
         [0044]    Thus, in a first embodiment, the present invention provides a method and apparatus for receiving a plurality of symbols, and modulating the plurality of symbols to create a first modulated signal. The first modulated signal is then compared to a threshold. If the first modulated signal is above the threshold, the first modulated signal is transmitted. If the first modulated signal, however, is below the threshold, an adjustment to the received plurality of symbols is computed and added to the received plurality of symbols to create an adjusted plurality of symbols. The adjusted plurality of symbols is then modulated to create a second modulated signal. The second modulated signal is transmitted if it exceeds the threshold; otherwise, the steps of computing, adding and the second step of modulating are repeated until the modulated signal exceeds the threshold.  
         [0045]    In an alternative embodiment, the present invention provides a method and apparatus for receiving a plurality of symbols, mixing the plurality of symbols using an inverse fast Fourier transform to create a plurality of mixed symbols, and pulse shaping the plurality of mixed symbols to create a first modulated signal. The first modulated signal is then compared to a threshold. If the first modulated signal is above the threshold, the first modulated signal is transmitted. If the first modulated signal is below the threshold, an adjustment to the plurality of mixed symbols is computed and added to the plurality of mixed symbols to create an adjusted plurality of mixed symbols. Pulse shaping is performed on the adjusted plurality of mixed symbols to create a second modulated signal. As in the first embodiment, the second modulated signal is transmitted if the second modulated signal exceeds the threshold; otherwise, the steps of computing, adding and the second step of pulse shaping are repeated until the modulated signal exceeds the threshold.  
         [0046]    While the invention has been described in conjunction with specific embodiments thereof, additional advantages and modifications will readily occur to those skilled in the art. The invention, in its broader aspects, is therefore not limited to the specific details, representative apparatus, and illustrative examples shown and described. Various alterations, modifications and variations will be apparent to those skilled in the art in light of the foregoing description. Thus, it should be understood that the invention is not limited by the foregoing description, but embraces all such alterations, modifications and variations in accordance with the spirit and scope of the appended claims.