Abstract:
A remote radio head unit (RRU) system is disclosed. The present invention is based on the method of adaptive digital predistortion to linearize a power amplifier inside the RRU. The power amplifier characteristics such as variation of linearity and asymmetric distortion of the amplifier output signal are monitored by a wideband feedback path and controlled by the adaptation algorithm in a digital module. Therefore, embodiments of the present invention can compensate for the nonlinearities as well as memory effects of the power amplifier systems and also improve performance, in terms of power added efficiency, adjacent channel leakage ratio and peak-to-average power ratio. The present disclosure enables a power amplifier system to be field reconfigurable and support multi-modulation schemes (modulation agnostic), multi-carriers, multi-frequency bands and multi-channels. Consequentially, the remote radio head system is particularly suitable for wireless transmission systems, such as base-stations, repeaters, and indoor signal coverage systems.

Description:
RELATED APPLICATIONS 
       [0001]    This application is a continuation of U.S. patent application Ser. No. 14/020,425, filed Sep. 6, 2013 which is a continuation of: U.S. patent application Ser. No. 12/928,943, filed Dec. 21, 2010, now U.S. Pat. No. 8,542,768, issued Sep. 24, 2013, which claims the benefit of U.S. Patent Application Ser. No. 61/288,847, filed Dec. 21, 2009. Each of these applications is hereby incorporated by reference in its entirety for all purposes. 
     
    
     FIELD OF THE INVENTION 
       [0002]    The present invention generally relates to wireless communication systems using power amplifiers and remote radio head units (RRU or RRH). More specifically, the present invention relates to RRU which are part of a distributed base station in which all radio-related functions are contained in a small single unit that can be deployed in a location remote from the main unit. Multi-mode radios capable of operating according to GSM, HSPA, LTE, and WiMAX standards and advanced software configurability are key features in the deployment of more flexible and energy-efficient radio networks. The present invention can also serve multi-frequency bands within a single RRU to economize the cost of radio network deployment. 
       BACKGROUND OF THE INVENTION 
       [0003]    Wireless and mobile network operators face the continuing challenge of building networks that effectively manage high data-traffic growth rates. Mobility and an increased level of multimedia content for end users require end-to-end network adaptations that support both new services and the increased demand for broadband and flat-rate Internet access. In addition, network operators must consider the most cost-effective evolution of the networks towards  4 G. Wireless and mobile technology standards are evolving towards higher bandwidth requirements for both peak rates and cell throughput growth. The latest standards supporting this are HSPA+, WiMAX, TD-SCDMA and LTE. The network upgrades required to deploy networks based on these standards must balance the limited availability of new spectrum, leverage existing spectrum, and ensure operation of all desired standards. This all must take place at the same time during the transition phase, which usually spans many years. Distributed open base station architecture concepts have evolved in parallel with the evolution of the standards to provide a flexible, cheaper, and more scalable modular environment for managing the radio access evolution,  FIG. 6 . For example, the Open Base Station Architecture Initiative (OBSAI), the Common Public Radio Interface (CPRI), and the IR Interface standards introduced standardized interfaces separating the Base Station server and the remote radio head part of a base station by an optical fiber. 
         [0004]    The RRU concept constitutes a fundamental part of a state-of-the-art base station architecture. However, RRUs to-date are power inefficient, costly and inflexible. Their poor DC to RF power conversion insures that they will have a large mechanical housing. The RRU demands from the service providers are also for greater flexibility in the RRU platform. As standards evolve, there is a need for a software upgradable RRU. Today RRUs lack the flexibility and performance that is required by service providers. The RRU performance limitations are driven in part by the poor power efficiency of the RF amplifiers. Thus there has been a need for an efficient, flexible RRU architecture that is field reconfigurable. 
       SUMMARY OF THE INVENTION 
       [0005]    Accordingly, the present invention has been made in view of the above problems in the prior art, and it is an object of the present invention to provide a high performance and cost effective method of multi-frequency bands RRU systems enabled by high linearity and high efficiency power amplifiers for wideband communication system applications. The present disclosure enables a RRU to be field reconfigurable, and supports multi-modulation schemes (modulation agnostic), multi-carriers, multi-frequency bands, and multi-channels. 
         [0006]    To achieve the above objects, according to the present invention, the technique is generally based on the method of adaptive digital predistortion to linearize RF power amplifiers. Various embodiments of the invention are disclosed, including single band, dual band, and multi-band RRU&#39;s. Another embodiment is a multi-band multi-channel RRU. In an embodiment, the combination of crest factor reduction, PD, power efficiency boosting techniques as well as coefficient adaptive algorithms are utilized within a PA system. In another embodiment, analog quadrature modulator compensation structure is also utilized to enhance performance. 
         [0007]    Some embodiments of the present invention are able to monitor the fluctuation of the power amplifier characteristics and to self-adjust by means of a self-adaptation algorithm. One such self-adaptation algorithm presently disclosed is called a digital predistortion algorithm, which is implemented in the digital domain. 
         [0008]    Applications of the present invention are suitable for use with all wireless base-stations, remote radio heads, distributed base stations, distributed antenna systems, access points, mobile equipment and wireless terminals, portable wireless devices, and other wireless communication systems such as microwave and satellite communications. The present invention is also field upgradable through a link such as an Ethernet connection to a remote computing center. 
     
    
     
       THE FIGURES 
         [0009]    Further objects and advantages of the present invention can be more fully understood from the following detailed description taken in conjunction with the accompanying drawings in which: 
           [0010]      FIG. 1  is a block diagram showing the basic form of a Remote Radio head unit system. 
           [0011]      FIG. 2  is a block diagram showing a multi-channel Remote Radio Head Unit according to one embodiment of the present invention. 
           [0012]      FIG. 3  is a block diagram showing polynomial based predistortion in a Remote Radio head system of the present invention. 
           [0013]      FIG. 4  is a block diagram of the digital predistortion algorithm applied for self-adaptation in a remote radio head unit system of the present invention. 
           [0014]      FIG. 5  illustrates an analog modulator compensation block. 
           [0015]      FIG. 6  depicts schematically a variety of potential installation schemes for an RRU-based system architecture. 
           [0016]      FIG. 7  depicts a three-sector arrangement of an RRU system architecture comprising optical links to a base station server. 
           [0017]      FIG. 8  shows in block diagram form various DSP-based functions including crest factor reduction and digital predistortion. 
           [0018]      FIG. 9  is a Digital Hybrid Module with either an RF input signal or a baseband modulated signal or an optical interface according to another embodiment of the present invention. 
           [0019]      FIG. 10  is a Dual Channel Remote Radio head block diagram showing a digital hybrid module with an optical interface according to another embodiment of the present invention. 
           [0020]      FIG. 11  is an alternative Dual Channel Remote Radio Head block diagram showing a digital hybrid module with an optical interface according to another embodiment of the present invention. 
           [0021]      FIG. 12  is an 8 channel Dual Band Remote Radio Head block diagram showing a digital hybrid module with an optical interface, and further comprises a calibration algorithm for insuring that each power amplifier output is time-aligned, phase-aligned and amplitude-aligned with respect to each other. 
       
    
    
     GLOSSARY 
       [0022]    Acronyms used herein have the following meanings:
   ACLR Adjacent Channel Leakage Ratio   ACPR Adjacent Channel Power Ratio   ADC Analog to Digital Converter   AQDM Analog Quadrature Demodulator   AQM Analog Quadrature Modulator   AQDMC Analog Quadrature Demodulator Corrector   AQMC Analog Quadrature Modulator Corrector   BPF Bandpass Filter   COMA Code Division Multiple Access   CFR Crest Factor Reduction   DAC Digital to Analog Converter   DET Detector   DHMPA Digital Hybrid Mode Power Amplifier   DDC Digital Down Converter   DNC Down Converter   DPA Doherty Power Amplifier   DQDM Digital Quadrature Demodulator   DQM Digital Quadrature Modulator   DSP Digital Signal Processing   DUC Digital Up Converter   EER Envelope Elimination and Restoration   EF Envelope Following   ET Envelope Tracking   EVM Error Vector Magnitude   FFLPA Feedforward Linear Power Amplifier   FIR Finite Impulse Response   FPGA Field-Programmable Gate Array   GSM Global System for Mobile communications   I-Q In-phase/Quadrature   IF Intermediate Frequency   LINC Linear Amplification using Nonlinear Components   LO Local Oscillator   LPF Low Pass Filter   MCPA Multi-Carrier Power Amplifier   MDS Multi-Directional Search   OFDM Orthogonal Frequency Division Multiplexing   PA Power Amplifier   PAPR Peak-to-Average Power Ratio   PD Digital Baseband Predistortion   PLL Phase Locked Loop   QAM Quadrature Amplitude Modulation   QPSK Quadrature Phase Shift Keying   RF Radio Frequency   RRU Remote Radio Head Unit   SAW Surface Acoustic Wave Filter   SERDES Serializer/Deserializer   UMTS Universal Mobile Telecommunications System   UPC Up Converter   WCDMA Wideband Code Division Multiple Access   WLAN Wireless Local Area Network.   
 
       DETAILED DESCRIPTION OF THE INVENTION 
       [0073]    The present invention is a novel RRU system that utilizes an adaptive digital predistortion algorithm. The present invention is a hybrid system of digital and analog modules. The interplay of the digital and analog modules of the hybrid system both linearize the spectral regrowth and enhance the power efficiency of the PA while maintaining or increasing the wide bandwidth. The present invention, therefore, achieves higher efficiency and higher linearity for wideband complex modulation carriers. 
         [0074]      FIG. 1  is a high level block diagram showing the basic system architecture of what is sometimes referred to as a Remote Radio Head Unit, or RRU, which can be thought of, at least for some embodiments, as comprising digital and analog modules and a feedback path. The digital module is the digital predistortion controller  101  which comprises the PD algorithm, other auxiliary DSP algorithms, and related digital circuitries. The analog module is the main power amplifier  102 , other auxiliary analog circuitries such as DPA, and related peripheral analog circuitries of the overall system. The present invention operates as a “blackbox”, plug and•play type system because it accepts RF modulated signal  100  as its input, and provides a substantially identical but amplified RF signal  103  as its output, therefore, it is RF-in/RF-out. Baseband input signals can be applied directly to the Digital Predistorter Controller according to one embodiment of the present invention. An Optical input signal can be applied directly to the Digital Predistorter Controller according to one embodiment of the present invention. The feedback path essentially provides a representation of the output signal to the predistortion controller  101 . The present invention is sometimes referred to as a Remote Radio head Unit (RRU) hereinafter. 
         [0075]      FIG. 2  illustrates in schematic block diagram form an embodiment of an eight channel (or n channel) RRU in which an input signal  200  is provided. Depending on the implementation, the input signal can take the form of an RF modulated signal, a baseband signal, or an optical signal. The input signal  200  is fed to a plurality of channels, where each channel includes a digital predistortion (DPD) controller, indicated at  201 ,  211  and  271 , respectively. The DPD can be implemented in an FPGA in at least some embodiments. For each channel, the DPD outputs are fed to associated PA&#39;s  202 ,  212  and  272 , respectively, and the PA outputs  203 ,  213  and  273  are fed back to that channel&#39;s DPD&#39;s. 
         [0076]      FIG. 3  illustrates a polynomial-based digital predistorter function in the RRU system of the present invention. The PD in the present invention generally utilizes an adaptive LUT-based digital predistortion system. More specifically, the PD illustrated in  FIG. 3 , and in embodiments disclosed from  FIGS. 9-12  discussed hereinafter, are processed in the digital processor by an adaptive algorithm, presented in U.S. patent application Ser. No. 11/961,969, entitled A Method for Baseband Predistortion Linearization in Multi-Channel Wideband Communication Systems. The PD for the RRU system in  FIG. 3 . has multiple finite impulse response (FIR) filters, that is, FIR1  301 , FIR2  303 , FIR3  305 , and FIR4  307 . The PD also contains the third order product generation block  302 , the fifth order product generation block  304 , and the seventh order product generation block  306 . The output signals from FIR filters are combined in the summation block  308 . Coefficients for multiple FIR filters are updated by the digital predistorter algorithm based on the error between the reference input signal and the amplified power output signal. 
         [0077]      FIG. 4  shows in block diagram form additional details of an embodiment including a DPD in accordance with the present invention and is discussed in greater detail hereinafter. In general, the input  400  is provided to the DPD  401 . The output of the DPD is fed to a DAC  402  and thence to the PA  403 . A feedback signal from the output of the PA is received by ADC  406 , and the digital form is supplied to alignment logic  405 , after which the aligned signal is provided to DPD estimator logic  404 , which also receives an input from the output of the DPD  401 . The output of the DPD estimator is then fed back to the DPD  401 . 
         [0078]      FIG. 5  illustrates an analog modulator compensation block. The input signal is separated into an in-phase component X I  and a quadrature component X Q . The analog quadrature modulator compensation structure comprises four real filters {g11, g12, g21, g22} and two DC offset compensation parameters c1, c2. The DC offsets in the AQM will be compensated by the parameters c1, c2. The frequency dependence of the AQM will be compensated by the filters {g11, g12, g21, g22}. The order of the real filters is dependent on the level of compensation required. The output signals Y I  and Y Q  will be presented to an AQM&#39;s in-phase and quadrature ports, discussed hereinafter in connection with  FIG. 9 . 
         [0079]      FIG. 6  illustrates a plurality of possible implementations of an RRU-based system architecture, in with a base station server  600  is connected to, for example, a tower-mounted RRU  605 , a rooftop-mounted RRU  610 , and/or a wallmounted RRU  615 . 
         [0080]      FIG. 7  illustrates an embodiment of a three-sector implementation of an RRU-based system architecture, in which a base station server  700  is optically linked to a plurality of RRU&#39;s  710  to provide adequate coverage for a site. 
         [0081]      FIG. 8  illustrates in simplified form an embodiment of the DSP functionality of some implementations of the present invention. An input signal is fed to an interface  800 , which can take several forms including OBSAI, CPRI or IR. The incoming signal is fed to a digital up-converter (DUO)  805  and then to CFR/DPD logic  810 , such as an FPGA. The output of the CFR/DPD logic  810  is then supplied to a DAC  815 . The DAC provides an output signal to the analog RF portion  820  of the system, which in turn provides a feedback signal to a ADC  825 , and back through the DSP block in the form of inputs to the CFR/DPD and a DOC  830 . The DOC outputs a signal to the interface  800 , which in turn can provide an output. 
         [0082]      FIG. 9  is a block diagram showing a more sophisticated embodiment of a RRU system, where like elements are indicated with like numerals. The embodiment of  FIG. 9  applies crest factor reduction (CFR) prior to the PD with an adaptation algorithm in one digital processor, so as to reduce the PAPR, EVM and ACPR and compensate the memory effects and variation of the linearity due to the temperature changing of the PA. The digital processor can take nearly any form; for convenience, an FPGA implementation is shown as an example, but a general purpose processor is also acceptable in many embodiments. The CFR implemented in the digital module of the embodiments is based on the scaled iterative pulse cancellation presented in U.S. patent application Ser. No. 61/041,164, filed Mar. 31, 2008, entitled An Efficient Peak Cancellation Method For Reducing The Peak-To Average Power Ratio In Wideband Communication Systems, incorporated herein by reference. The CFR is included to enhance performance and hence optional. The CFR can be removed from the embodiments without-affecting the overall functionality. 
         [0083]      FIG. 9  is a block diagram showing a RRU system according to one embodiment of the present invention. RRU systems typically comprise three primary blocks: power amplifiers, baseband processing and an optical interface. The optical interface contains an optical to electrical interface for the transmit/receive mode. The optical interface  901 , shown in  FIG. 9 , is coupled to a FPGA. The FPGA  902  performs the functions of SERDES/Framer/DeFramer/Control and Management. This FPGA  902  interfaces with another FPGA  903  that performs the following Digital Signal Processing tasks: Crest Factor Reduction/Digital Upconversion/Digital Downconversion and Digital Predistortion. Another embodiment will be to integrate  902  with  903  in a single FPGA. The Serializer/De-serializer (SERDES) module converts the high speed serial bit stream from the optical to electrical receiver to a parallel bit stream. The De-Framer decodes the parallel bit stream and extracts the In-phase and Quadrature (I/Q) modulation and delivers this to the digital signal processing module  903 . The Control and Management module extracts the control signals from the parallel bit stream and performs tasks based on the requested information. The received I/Q data from the optical interface is frequency translated to an Intermediate Frequency in the Digital Upconverter Module (DUC). This composite signal then undergoes Crest Factor Reduction (CFR) in order to reduce the peak to average power ratio. The resultant signal is then applied to a Digital Predistorter in order to compensate for the distortion in the Power Amplifier module  905 . The RRU operates in a receive mode as well as a transmit mode. The RRU receives the signal from the output duplexer and passes this signal to the Rx path or paths, depending on the number of channels. The received signal is frequency translated to an Intermediate Frequency (IF) in the receiver (Rx1 and Rx2 in  FIG. 10 ). The IF signal is further downconverted using a Digital Downconverter (DDC) module and demodulated into the In-phase and quadrature components. The recovered I/Q signal is then sent to the Framer module/SERDES and prepared for transmission over the optical interface. 
         [0084]    The system of  FIG. 9  has a multi-mode of RF or multi-carrier digital signal, which can be optical, at the input, and an RF signal at the output  910 . The multi-mode of the signal input allows maximum flexibility: RF-in (the “RF•in Mode”) or baseband digital-in (the “Baseband-in Mode”) or optical input (the “Optical-in Mode”). The system shown in  FIG. 9  comprises three key portions: a reconfigurable digital (hereinafter referred as “FPGA-based Digital”) module  915 , a power amplifier module  960 , a receiver  965  and a feedback path  925 . 
         [0085]    The FPGA•based Digital part comprises either one of two digital processors  902 ,  903  (e.g. FPGA), digital-to-analog converters  935  (DACs), analog-to-digital converters  940  (ADCs), and a phase-locked loop (PLL)  945 . Since the system shown in  FIG. 9  has a multi-input mode, the digital processor has three paths of signal processing. For the baseband signal input path, the digital processor has implemented a digital up-converter (DUO), CFR, and a PD. For the optical input path, SERDES, Framer/Deframer, digital up-converter (DUC), CFR, and PD are implemented. For the RF input path, analog downconverter, DUC, CFR and PD are implemented. 
         [0086]    The Baseband-in Mode of  FIG. 9  contains the I-Q signals. Digital data streams from multi-channels as I-Q signals are coming to the FPGA-based Digital module and are digitally up-converted to digital IF signals by the DUO. These IF signals are then passed through the CFR block so as to reduce the signal&#39;s PAPR. This PAPR suppressed signal is digitally predistorted in order to pre-compensate for nonlinear distortions of the power amplifier. 
         [0087]    In either input mode, the memory effects due to self-heating, bias networks, and frequency dependencies of the active device are compensated by the adaptation algorithm in the PD, as well. The coefficients of the PD are adapted by a wideband feedback which requires a very high speed ADC. The predistorted signal is passed through a DQM in order to generate the real signal and then converted to an IF analog signal by the DACs. As disclosed above, the DQM is not required to be implemented in the FPGA, or at all, in all embodiments. If the DQM is not used in the FPGA, then the AQM Implementation can be implemented with two DACs to generate real and imaginary signals  935 , respectively. The gate bias voltage  950  of the power amplifier is determined by the adaptation algorithm and then adjusted through the DACs  935  in order to stabilize the linearity fluctuations due to the temperature changes in the power amplifier. The PLL  945  sweeps the local oscillation signal for the feedback part in order to translate the RF output signal to baseband, for processing in the Digital Module. 
         [0088]    The power amplifier part comprises an AQM for receiving real and complex signals (such as depicted in the embodiments shown in  FIG. 9 ) from the FPGA-based Digital module, a high power amplifier with multi-stage drive amplifiers, and a temperature sensor. In order to improve the efficiency performance of the DHMPA system, efficiency boosting techniques such as Doherty, Envelope Elimination and Restoration (EER), Envelope Tracking (ET), Envelope Following (EF), and Linear amplification using Nonlinear Components (LINC) can be used, depending upon the embodiment. These power efficiency techniques can be mixed and matched and are optional features to the fundamental RRU system. One such Doherty power amplifier technique is presented in commonly assigned U.S. Provisional Patent Application Ser. No. 60/925,577, filed Apr. 23, 2007, entitled N-Way Doherty Distributed Power Amplifier, incorporated herein by reference. To stabilize the linearity performance of the amplifier, the temperature of the amplifier is monitored by the temperature sensor and then the gate bias of the amplifier is controlled by the FPGA-based Digital part. 
         [0089]    The feedback portion comprises a directional coupler, a mixer, a low pass filter (LPF), gain amplifiers and, and a band pass filter (BPF). Depending upon the embodiment, these analog components can be mixed and matched with other analog components. Part of the RF output signal of the amplifier is sampled by the directional coupler and then down converted to an IF analog signal by the local oscillation signal in the mixer. The IF analog signal is passing through the LPF, the gain amplifier, and the BPF which can capture the out-of-band distortions. The output of the BPF is provided to the ADC of the FPGA-based Digital module in order to determine the dynamic parameters of the PD depending on output power levels and asymmetrical distortions due to the memory effects. In addition, temperature is also detected by the DET  970  to calculate the variation of linearity and then adjust gate bias voltage of the PA. More details of the PD algorithm and self-adaptation feedback algorithm can be appreciated from  FIG. 3 , which shows a polynomial based predistortion algorithm and from  FIG. 4 , which shows the primary adaptive predistorter blocks which can be used in some embodiments of the invention. 
         [0090]    In the case of a strict EVM requirement for broadband wireless access such as WiMAX or other OFDM based schemes (EVM &lt;2.5%), the CFR in the FPGA-based Digital part is only able to achieve a small reduction of the PAPR in order to meet the strict EVM specification. In general circumstances, this means the CFR&#39;s power efficiency enhancement capability is limited. In some embodiments of the present invention, a novel technique is included to compensate the in-band distortions from CFR by use of a “Clipping Error Restoration Path”  907 , hence maximizing the RRU system power efficiency in those strict EVM environments. As noted above, the Clipping Error Restoration Path has an additional DAC in the FPGA-based Digital portion and an extra UPC in the power amplifier part. The Clipping Error Restoration Path can allow compensation of in-band distortions resulting from the CFR at the output of the power amplifier. Further, any delay mismatch between the main path and the Clipping Error Restoration Path can be aligned using digital delay in the FPGA. 
         [0091]    While  FIG. 9  illustrates a RRU system implemented with AQM, according to another embodiment of the present invention, the system of  FIG. 9  can also comprise a digital processor which has implemented therein CFR, PD, and an analog quadrature modulator corrector (AQMC). 
         [0092]    Still further, the system of  FIG. 9  can alternatively be configured to be implemented with AQM and an AQM-based Clipping Error Restoration Path. In such an arrangement, the Clipping Error Restoration Path can be configured to have two DACs in the FPGA-based Digital part and an AQM in lieu of the UPC in the power amplifier part. 
         [0093]      FIG. 10  is a block diagram showing a dual channel RRU implemented with two power amplifiers  1000  and  1005 , respectively, for two distinct bands provided from AQM1  1010  and AQM2  1015 . A duplexer  1020  is used to combine the two power amplifier outputs and provide the combined output to the antenna [not shown]. Switches  1025  and  1030  are used to isolate the transmit signals from the received signals as occurs in a Time Division Synchronous Code Division Multiple Access (TD-SCDMA) modulation. Feedback signals  1035  and  1040 , derived from the output of PA&#39;s  1000  and  1005 , are each provided to an additional switch  1045 , which is toggled at appropriate times to permit feedback calibration of each PA with only a single FPGA  1050 . In the embodiment shown, the FPGA  1050  comprises two blocks: SERDES Framer/Deframer and CMA, indicated at  1055 , and a block  1060  comprising DDC1/CFR1/PDC1/DUC1 as well as DDC2/CFR2/PDC2/DUC2, with block  1060  controlling the switching timing of the associated switches. The feedback signals  1035  and  1040  are fed back to the block  1060  first through adder  1065 , where they are combined with phase-locked-loop signal  1070 , and then through band pass filter  1075 , low pass filter  1080  and ADC  1085 . In addition, temperature sensor signals from PA&#39;s  1000  and  1005  are fed back to the block  1060  through toggle switch  1090  and detector  1095  so that the predistortion coefficients can include temperature compensation. The toggling of the switches  1045  and  1090  is synchronized to ensure that the output and temperature signals of each PA are provided to block  1060  at the appropriate times. Another embodiment of the RRU extends its application to multi-frequency bands. In another embodiment, a multi-frequency band (i.e., two or more bands) implementation comprises adding additional channelized power amplifiers in parallel. The output of the additional power amplifiers is combined in an N by 1 duplexer and fed to a single antenna, although multiple antennae can also be utilized in some embodiments. Another embodiment of the multi-frequency band RRU combines two or more frequency bands in one or more of the power amplifiers. 
         [0094]      FIG. 11  is a block diagram showing another embodiment of the dual channel RRU. In this embodiment the Rx switches  1105  and  1110  are placed on the third port of circulators  1115  and  1120 , thereby reducing the insertion loss between the PA output and the duplexer  1020 . The remainder of  FIG. 11  is substantially identical to  FIG. 10  and is not described further. 
         [0095]      FIG. 12  is a block diagram showing an embodiment of an 8 channel dual-band RRU. In this embodiment, the feedback path for each PA  1000 A-H and  1005 A-H comprises a receiver chain plus a wideband capture chain, indicated at  1200 A-H and  1205 A-H, respectively, receiving feedback signals from the array of associated PA&#39;s through associated circulators  1210 A-H and  1215 A-H. The receiver chain is utilized when the RRU is switched to a receive mode and corresponds to the receive (Rx) paths shown in  FIG. 11 . The wideband capture chain is utilized for capturing the wideband distortion of the power amplifier, and corresponds to the Feedback Calibration path shown in  FIG. 11 . In an embodiment a channel calibration algorithm is implemented to insure that each power amplifier output is time, phase and amplitude aligned to each other. 
         [0096]    Digital Predistorter Algorithm 
         [0097]    Digital Predistortion (DPD) is a technique to linearize a power amplifier (PA).  FIG. 1  shows the block diagram of linear digitally predistorted PA. In the DPD block, a memory polynomial model is used as the predistortion function ( FIG. 3 ). 
         [0000]    
       
         
           
             
               z 
                
               
                 ( 
                 n 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   i 
                   = 
                   0 
                 
                 
                   n 
                   - 
                   1 
                 
               
                
               
                 
                   
                     x 
                     i 
                   
                    
                   
                     ( 
                     
                       n 
                       - 
                       i 
                     
                     ) 
                   
                 
                  
                 
                   ( 
                   
                     
                       ∑ 
                       
                         j 
                         = 
                         0 
                       
                       
                         k 
                         - 
                         1 
                       
                     
                      
                     
                       
                         a 
                         ij 
                       
                        
                       
                          
                         
                           
                             
                               x 
                               i 
                             
                              
                             
                               ( 
                               
                                 n 
                                 - 
                                 i 
                               
                               ) 
                             
                           
                           j 
                         
                          
                       
                     
                   
                   ) 
                 
               
             
           
         
       
       
         
           
             where a ii  are the DPD coefficients. 
           
         
       
     
         [0099]    In the DPD estimator block, a least square algorithm is utilized to find the DPD coefficients a ij , and then transfer them to DPD block. The primary DPD blocks are shown in  FIG. 4 . 
         [0100]    Delay Estimation Algorithm: 
         [0101]    The DPD estimator compares x(n) and its corresponding feedback signal y(n−Δd) to find the DPD coefficients, where Δd is the delay of the feedback path. As the feedback path delay is different for each PA, this delay should be identified before the signal arrives at the coefficient estimation. In this design, the amplitude difference correlation function of the transmission, x(n), and feedback data, y(n), is applied to find the feedback path delay. The correlation is given by 
         [0000]    
       
         
           
             
               C 
                
               
                 ( 
                 m 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   i 
                   = 
                   0 
                 
                 
                   N 
                   - 
                   1 
                 
               
                
               
                 
                   sign 
                    
                   
                     ( 
                     
                       
                         x 
                          
                         
                           ( 
                           
                             i 
                             + 
                             1 
                           
                           ) 
                         
                       
                       - 
                       
                         x 
                          
                         
                           ( 
                           i 
                           ) 
                         
                       
                     
                     ) 
                   
                 
                  
                 
                   sign 
                    
                   
                     ( 
                     
                       
                         y 
                          
                         
                           ( 
                           
                             i 
                             + 
                             m 
                             + 
                             1 
                           
                           ) 
                         
                       
                       - 
                       
                         y 
                          
                         
                           ( 
                           
                             i 
                             + 
                             m 
                           
                           ) 
                         
                       
                     
                     ) 
                   
                 
               
             
           
         
       
       
         
           
             
               n 
                
               
                 ( 
                 delay 
                 ) 
               
             
             = 
             
               Max 
                
               
                 ( 
                 
                   C 
                    
                   
                     ( 
                     m 
                     ) 
                   
                 
                 ) 
               
             
           
         
       
     
         [0000]    The delay n that maximizes the correlation C(m) is the feedback path delay. 
         [0102]    Since the feedback path goes through analog circuitry, the delay between the transmission and feedback path could be a fractional sample delay. To synchronize the signals more accurately, fractional delay estimation is necessary. To simplify the design, only a half-sample delay is considered in this design, although smaller fractional delays can also be utilized. 
         [0103]    To get the half-sample delay data, an upsampling approach is the common choice, but in this design, in order to avoid a very high sampling frequency in the FPGA, an interpolation method is used to get the half-sample delay data. The data with integer delay and fractional delay are transferred in parallel. The interpolation function for fractional delay is 
         [0000]    
       
         
           
             
               y 
                
               
                 ( 
                 n 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   i 
                   = 
                   0 
                 
                 3 
               
                
               
                 
                   c 
                   i 
                 
                  
                 
                   x 
                    
                   
                     ( 
                     
                       n 
                       + 
                       i 
                     
                     ) 
                   
                 
               
             
           
         
       
     
         [0000]    in which c i  is the weight coefficient. 
         [0104]    Whether the fractional delay path or the integer delay path will be chosen is decided by the result of the amplitude difference correlator. If the correlation result is odd, the integer path will be chosen, otherwise the fractional delay path will be chosen. 
         [0105]    Phase Offset Estimation and Correction Algorithm: 
         [0106]    Phase offset between the transmission signal and the feedback signal exists in the circuit. For a better and faster convergence of the DPD coefficient estimation, this phase offset should be removed. 
         [0107]    The transmission signal x(n) and feedback signal y(n) can be expressed as 
         [0000]        x ( n )=| x ( n )| e   jθ     x    and  y ( n )=| y ( n )| e   jθ     y   , 
         [0108]    The phase offset e j(θ     x     −θ     y     )  can be calculated through 
         [0000]    
       
         
           
             
                
               
                 j 
                  
                 
                   ( 
                   
                     
                       θ 
                       x 
                     
                     - 
                     
                       θ 
                       y 
                     
                   
                   ) 
                 
               
             
             = 
             
               
                 
                   x 
                    
                   
                     ( 
                     n 
                     ) 
                   
                 
                  
                 
                   
                     y 
                      
                     
                       ( 
                       n 
                       ) 
                     
                   
                   * 
                 
               
               
                 
                    
                   
                     x 
                      
                     
                       ( 
                       n 
                       ) 
                     
                   
                    
                 
                  
                 
                    
                   
                     y 
                      
                     
                       ( 
                       n 
                       ) 
                     
                   
                    
                 
               
             
           
         
       
     
         [0109]    So, the phase o et between the transmission and feedback paths is 
         [0000]    
       
         
           
             
                
               
                 
                   j 
                    
                   
                       
                   
                    
                   o 
                 
                 , 
               
             
             = 
             
               mean 
                
               
                 ( 
                 
                   
                     
                       x 
                        
                       
                         ( 
                         n 
                         ) 
                       
                     
                      
                     
                       
                         y 
                          
                         
                           ( 
                           n 
                           ) 
                         
                       
                       * 
                     
                   
                   
                     
                        
                       
                         x 
                          
                         
                           ( 
                           n 
                           ) 
                         
                       
                        
                     
                      
                     
                        
                       
                         y 
                          
                         
                           ( 
                           n 
                           ) 
                         
                       
                        
                     
                   
                 
                 ) 
               
             
           
         
       
     
         [0110]    The feedback signal with the phase offset removed can be calculated by 
         [0000]          y   ( n )= y ( n ) e   jhe    
         [0111]    Magnitude Correction: 
         [0112]    As the gain of the PA may change slightly, the feedback gain should be corrected to avoid the error from the gain mismatch. The feedback signal is corrected according to the function 
         [0000]    
       
         
           
             
               
                 y 
                 _ 
               
                
               
                 ( 
                 n 
                 ) 
               
             
             = 
             
               
                 y 
                  
                 
                   ( 
                   n 
                   ) 
                 
               
                
               
                 
                   
                     ∑ 
                     
                       i 
                       = 
                       1 
                     
                     N 
                   
                    
                   
                      
                     
                       x 
                        
                       
                         ( 
                         i 
                         ) 
                       
                     
                      
                   
                 
                 
                   
                     ∑ 
                     
                       i 
                       = 
                       1 
                     
                     N 
                   
                    
                   
                      
                     
                       y 
                        
                       
                         ( 
                         i 
                         ) 
                       
                     
                      
                   
                 
               
             
           
         
       
     
         [0000]    The choice of N will depend on the accuracy desired. 
         [0113]    QR_RLS Adaptive Algorithm: 
         [0114]    The least square solution for DPD coefficient estimation is formulated as 
         [0000]    
       
         
           
             
               F 
                
               
                 ( 
                 
                   x 
                    
                   
                     ( 
                     n 
                     ) 
                   
                 
                 ) 
               
             
             = 
             
               y 
                
               
                 ( 
                 n 
                 ) 
               
             
           
         
       
       
         
           
             
               F 
                
               
                 ( 
                 
                   x 
                    
                   
                     ( 
                     n 
                     ) 
                   
                 
                 ) 
               
             
             = 
             
               
                 ∑ 
                 
                   i 
                   = 
                   1 
                 
                 N 
               
                
               
                 
                   ∑ 
                   
                     j 
                     = 
                     0 
                   
                   K 
                 
                  
                 
                   
                     a 
                     ij 
                   
                    
                   
                     x 
                      
                     
                       ( 
                       
                         n 
                         - 
                         i 
                       
                       ) 
                     
                   
                    
                   
                     
                        
                       
                         x 
                          
                         
                           ( 
                           
                             n 
                             - 
                             i 
                           
                           ) 
                         
                       
                        
                     
                     j 
                   
                 
               
             
           
         
       
       
         
           
             Define h k =x(n−i)|x(n−i)| j , w k =a ij , where k=(i−1)N+j. The least square formulation can be expressed as: 
           
         
       
     
         [0000]    
       
         
           
             
               
                 ∑ 
                 
                   k 
                   = 
                   1 
                 
                 
                   N 
                   × 
                   K 
                 
               
                
               
                 
                   w 
                   k 
                 
                  
                 
                   h 
                   k 
                 
               
             
             = 
             
               y 
                
               
                 ( 
                 n 
                 ) 
               
             
           
         
       
     
         [0000]    In this design, QR-RLS algorithm (Haykin, 1996) is implemented to solve this problem. The formulas of QR_RLS algorithm are 
         [0000]    
       
         
           
             { 
             
               
                 
                   
                     
                       d 
                        
                       
                         ( 
                         i 
                         ) 
                       
                     
                      
                     
                       = 
                       Δ 
                     
                      
                     
                       
                         y 
                          
                         
                           ( 
                           i 
                           ) 
                         
                       
                       - 
                       
                         
                           h 
                           i 
                         
                          
                         
                           w 
                           _ 
                         
                       
                     
                   
                 
               
               
                 
                   
                     
                       
                         w 
                         _ 
                       
                       i 
                     
                      
                     
                       = 
                       Δ 
                     
                      
                     
                       
                         w 
                         i 
                       
                       - 
                       
                         w 
                         _ 
                       
                     
                   
                 
               
               
                 
                   
                     
                       q 
                       i 
                     
                      
                     
                       = 
                       Δ 
                     
                      
                     
                       
                         φ 
                         i 
                         
                           * 
                           2 
                         
                       
                        
                       
                         [ 
                         
                           
                             w 
                             i 
                           
                           - 
                           
                             w 
                             _ 
                           
                         
                         ] 
                       
                     
                   
                 
               
             
               
           
         
       
     
         [0000]    where φ i  is a diagonal matrix, and q i  is a vector. 
         [0116]    The QR_RLS algorithm gets the ith moment φ i  and q i  from its (i−1)th moment through a unitary transformation: 
         [0000]    
       
         
           
             A 
             = 
             
               
                 [ 
                 
                   
                     
                       
                         φ 
                         i 
                         
                           1 
                           2 
                         
                       
                     
                     
                       0 
                     
                   
                   
                     
                       
                         q 
                         i 
                         * 
                       
                     
                     
                       
                         
                           
                             e 
                             a 
                             * 
                           
                            
                           
                             ( 
                             i 
                             ) 
                           
                         
                          
                         
                           
                             γ 
                             
                               1 
                               2 
                             
                           
                            
                           
                             ( 
                             i 
                             ) 
                           
                         
                       
                     
                   
                   
                     
                       
                         
                           h 
                           i 
                         
                          
                         
                           Φ 
                           i 
                           
                             - 
                             
                               * 
                               2 
                             
                           
                         
                       
                     
                     
                       
                         
                           γ 
                           
                             1 
                             2 
                           
                         
                          
                         
                           ( 
                           i 
                           ) 
                         
                       
                     
                   
                 
                 ] 
               
               = 
               
                 
                   [ 
                   
                     
                       
                         
                           λ 
                            
                           
                             φ 
                             
                               i 
                               - 
                               1 
                             
                             
                               * 
                               2 
                             
                               
                               
                             
                               1 
                               2 
                             
                           
                         
                       
                       
                         
                           h 
                           i 
                           * 
                         
                       
                     
                     
                       
                         
                           λ 
                            
                           
                             q 
                             
                               i 
                               - 
                               1 
                             
                             * 
                               
                               
                             
                               1 
                               2 
                             
                           
                         
                       
                       
                         
                           
                             d 
                              
                             
                               ( 
                               i 
                               ) 
                             
                           
                           * 
                         
                       
                     
                     
                       
                         0 
                       
                       
                         1 
                       
                     
                   
                   ] 
                 
                  
                 
                   θ 
                   i 
                 
               
             
           
         
       
     
         [0117]    θ i  is a unitary matrix for unitary transformation. 
         [0118]    To apply QR_RLS algorithm more efficiently in FPGA, a squared-root-free Givens rotation is applied for the unitary transformation process (E. N. Frantzeskakis, 1994) 
         [0000]    
       
         
           
             
               [ 
               
                 
                   
                     
                       a 
                       1 
                     
                   
                   
                     
                       a 
                       2 
                     
                   
                   
                     ⋯ 
                   
                   
                     
                       a 
                       n 
                     
                   
                 
                 
                   
                     
                       b 
                       1 
                     
                   
                   
                     
                       b 
                       2 
                     
                   
                   
                     ⋯ 
                   
                   
                     
                       b 
                       n 
                     
                   
                 
               
               ] 
             
             = 
             
               
                 
                   
                     
                       [ 
                       
                         
                           
                             
                               
                                 k 
                                 a 
                               
                             
                           
                           
                             0 
                           
                         
                         
                           
                             0 
                           
                           
                             
                               
                                 k 
                                 b 
                               
                             
                           
                         
                       
                       ] 
                     
                      
                     
                       [ 
                       
                         
                           
                             
                               a 
                               1 
                               ′ 
                             
                           
                           
                             
                               a 
                               2 
                               ′ 
                             
                           
                           
                             ⋯ 
                           
                           
                             
                               a 
                               n 
                               ′ 
                             
                           
                         
                         
                           
                             
                               b 
                               1 
                               ′ 
                             
                           
                           
                             
                               b 
                               2 
                               ′ 
                             
                           
                           
                             ⋯ 
                           
                           
                             
                               b 
                               n 
                               ′ 
                             
                           
                         
                       
                       ] 
                     
                   
                    
                   
                     
 
                   
                   [ 
                   
                     
                       
                         
                           a 
                           1 
                           ′ 
                         
                       
                       
                         
                           a 
                           2 
                           ′ 
                         
                       
                       
                         ⋯ 
                       
                       
                         
                           a 
                           n 
                           ′ 
                         
                       
                     
                     
                       
                         
                           b 
                           1 
                           ′ 
                         
                       
                       
                         
                           b 
                           2 
                           ′ 
                         
                       
                       
                         ⋯ 
                       
                       
                         
                           b 
                           n 
                           ′ 
                         
                       
                     
                   
                   ] 
                 
                  
                 θ 
               
               = 
               
                 
                   [ 
                   
                     
                       
                         
                           
                             k 
                             a 
                             ′ 
                           
                         
                       
                       
                         0 
                       
                     
                     
                       
                         0 
                       
                       
                         
                           
                             k 
                             b 
                             ′ 
                           
                         
                       
                     
                   
                   ] 
                 
                  
                 
                   [ 
                   
                     
                       
                         1 
                       
                       
                         
                           a 
                           2 
                           ″ 
                         
                       
                       
                         ⋯ 
                       
                       
                         
                           a 
                           n 
                           ″ 
                         
                       
                     
                     
                       
                         0 
                       
                       
                         
                           b 
                           2 
                           ″ 
                         
                       
                       
                         ⋯ 
                       
                       
                         
                           b 
                           n 
                           ″ 
                         
                       
                     
                   
                   ] 
                 
               
             
           
         
       
       
         
           
             
               k 
               a 
               ′ 
             
             = 
             
               
                 
                   k 
                   a 
                 
                  
                 
                   a 
                   1 
                   2 
                 
               
               + 
               
                 
                   k 
                   b 
                 
                  
                 
                   b 
                   1 
                   2 
                 
               
             
           
         
       
       
         
           
             
               k 
               b 
               ′ 
             
             = 
             
               
                 
                   k 
                   a 
                 
                  
                 
                   k 
                   b 
                 
               
               
                 k 
                 a 
                 ′ 
               
             
           
         
       
       
         
           
             
               a 
               j 
               ′ 
             
             = 
             
               
                 ( 
                 
                   
                     
                       k 
                       a 
                     
                      
                     
                       a 
                       1 
                     
                      
                     
                       a 
                       j 
                     
                   
                   + 
                   
                     
                       k 
                       b 
                     
                      
                     
                       b 
                       1 
                     
                      
                     
                       b 
                       j 
                     
                   
                 
                 ) 
               
               / 
               
                 k 
                 a 
                 ′ 
               
             
           
         
       
       
         
           
             
               b 
               j 
               ′ 
             
             = 
             
               
                 
                   - 
                   
                     b 
                     1 
                   
                 
                  
                 
                   a 
                   j 
                 
               
               + 
               
                 
                   a 
                   1 
                 
                  
                 
                   b 
                   j 
                 
               
             
           
         
       
     
         [0119]    For RLS algorithm, the i th  moment is achieved as below: 
         [0000]    
       
         
           
             
               
                 [ 
                 
                   
                     
                       
                         λ 
                          
                         
                           φ 
                           
                             i 
                             - 
                             1 
                           
                           
                             * 
                             2 
                           
                             
                             
                           
                             1 
                             2 
                           
                         
                       
                     
                     
                       
                         h 
                         i 
                         * 
                       
                     
                   
                   
                     
                       
                         λ 
                          
                         
                           q 
                           
                             i 
                             - 
                             1 
                           
                           * 
                             
                             
                           
                             1 
                             2 
                           
                         
                       
                     
                     
                       
                         
                           
                             d 
                              
                             
                               ( 
                               i 
                               ) 
                             
                           
                           * 
                         
                         _ 
                       
                     
                   
                   
                     
                       0 
                     
                     
                       1 
                     
                   
                 
                 ] 
               
                
               
                 θ 
                 i 
               
             
             = 
             
               
                 [ 
                 
                   
                     
                       
                         
                           φ 
                           i 
                           
                             1 
                             2 
                           
                         
                         _ 
                       
                     
                     
                       0 
                     
                   
                   
                     
                       
                         
                           q 
                           i 
                           * 
                         
                         _ 
                       
                     
                     
                       
                         
                           
                             
                               e 
                               a 
                               * 
                             
                              
                             
                               ( 
                               i 
                               ) 
                             
                           
                            
                           
                             
                               γ 
                               
                                 1 
                                 2 
                               
                             
                              
                             
                               ( 
                               i 
                               ) 
                             
                           
                         
                         _ 
                       
                     
                   
                   
                     
                       
                         
                           
                             h 
                             i 
                           
                            
                           
                             Φ 
                             i 
                             
                               - 
                               
                                 * 
                                 2 
                               
                             
                           
                         
                         _ 
                       
                     
                     
                       
                         
                           
                             γ 
                             
                               1 
                               2 
                             
                           
                            
                           
                             ( 
                             i 
                             ) 
                           
                         
                         _ 
                       
                     
                   
                 
                 ] 
               
                
               
                 [ 
                 
                   
                     
                       
                         
                           k 
                           a 
                         
                       
                     
                     
                       0 
                     
                   
                   
                     
                       0 
                     
                     
                       
                         
                           k 
                           b 
                         
                       
                     
                   
                 
                 ] 
               
             
           
         
       
       
         
           
             
               w 
               i 
             
              
             
                 
             
              
             can 
              
             
                 
             
              
             be 
              
             
                 
             
              
             obtained 
              
             
                 
             
              
             by 
              
             
                 
             
              
             solving 
           
         
       
       
         
           
             
               
                 
                   Φ 
                   
                     * 
                     2 
                   
                 
                 _ 
               
                
               
                 [ 
                 
                   
                     w 
                     i 
                   
                   - 
                   
                     w 
                     _ 
                   
                 
                 ] 
               
             
             = 
             
               
                 q 
                 i 
               
               _ 
             
           
         
       
     
         [0120]    In the iterative process, a block of data (in this design, there are 4096 data in one block) is stored in memory, and the algorithm uses all the data in memory s to estimate the DPD coefficient. In order to make the DPD performance more stable, the DPD coefficients are only updated after one block of data are processed. The matrix A will be used for the next iteration process, which will make the convergence faster. 
         [0121]    To make sure the performance of the DPD is stable, a weighting factor f is used when updating the DPD coefficient as 
         [0000]        w   i   =f×w   i −1+(1 −f ) w   1  
 
         [0000]    The DPD coefficient estimator calculates coefficients w i  by using QR_RLS algorithm. These w i  are copied to the DPD block to linearize the PA. 
         [0122]    Channel Calibration Algorithm 
         [0123]    The 8 channel RRU in  FIG. 12  has 16 distinct power amplifiers, indicated at PA&#39;s  1000 A-H and  1005 A-H. Half the power amplifiers are designed for one band and the other for a second band. The bands are hereafter referred to as band A and band B, and occupy two distinct frequencies. The 8 channel RRU uses eight antennas  1220 A-H and both bands will coexist on each antenna. In order to maximize performance, each power amplifier&#39;s output signal needs to be time, phase and amplitude aligned with respect to each other. The antenna calibration algorithms comprise three distinct approaches: 1) A Pilot Tone is injected into each PA; 2) a Reference Modulated signal is transmit through each PA; or 3) the Real Time I/Q data is used as the reference signal. The Pilot Tone approach injects a single carrier IF tone that is tracked in either the feedback calibration path or the individual PA&#39;s receiver. Each transmitter path for band A is time, phase and amplitude aligned with respect to each other, similarly for band B. The Reference Modulated approach utilizes a stored complex modulated signal which is transmitted through each of the band A PA&#39;s, similarly for the band B PA&#39;s. The transmitters are then time, phase and amplitude aligned with respect to each other. Either the feedback calibration path or the individual receivers can be used for obtaining the PA output signals. The Real Time approach operates on the real-time transmitted signals. This approach utilizes the DPD time alignment, phase and magnitude offset information to synchronize each PA output with respect to each other. 
         [0124]    In summary, the RRU system of the present invention enhances the performance in terms of both the efficiency and the linearity more effectively since the RRU system is able to implement CFR, DPD and adaptation algorithm in one digital processor, which subsequently saves hardware resources and processing time. The high power efficiency of RF power amplifiers inside the RRU means that less thermal dissipation mechanism such as heat sinks is needed; therefore, significantly reducing the size and volume of the mechanical housing. This smaller RRU can then enable service providers to deploy the RRU in areas where heavy or large RRU&#39;s could not be deployed, such as pole tops, top of street lights, etc. due to lack of real estate, or weight limitation, wind factor, and other safety issues. The RRU system of the present invention is also reconfigurable and field-programmable since the algorithms and power efficiency enhancing features which are embedded in firmware can be adjusted similarly to a software upgrade in the digital processor at anytime. 
         [0125]    Moreover, the RRU system is agnostic to modulation schemes such as QPSK, QAM, OFDM, etc. in CDMA, TD-SCDMA, GSM, WCDMA, CDMA2000, and wireless LAN systems. This means that the RRU system is capable of supporting multi-modulation schemes, multi-carriers and multichannels. The multi-frequency bands benefits mean that mobile operators can deploy fewer RRUs to cover more frequency bands for more mobile subscribers; hence significantly reducing CAPEX and OPEX. Other benefits of the RRU system include correction of PA non-linearities in repeater or indoor coverage systems that do not have the necessary baseband signals information readily available. 
         [0126]    Although the present invention has been described with reference to the preferred embodiments, it will be understood that the invention is not limited to the details described thereof. Various substitutions and modifications have been suggested in the foregoing description, and others will occur to those of ordinary skill in the art. Therefore, all such substitutions and modifications are intended to be embraced within the scope of the invention as defined in the appended claims.