Filter

Information

  • Patent Grant
  • 9042434
  • Patent Number
    9,042,434
  • Date Filed
    Wednesday, April 4, 2012
    12 years ago
  • Date Issued
    Tuesday, May 26, 2015
    9 years ago
Abstract
Method and filter for filtering a signal, in which the signal is applied to a delay line having a plurality of taps. Respective weighting coefficients of a windowing function are applied to outputs from the plurality of taps to thereby generate a plurality of weighted outputs. The method comprises repeatedly selecting, for output, whichever of the weighted outputs has the highest value.
Description
PRIORITY CLAIM

This application claims priority to and the benefit of Great Britain Application No. 1105768.4 filed on Apr. 5, 2011.


FIELD OF THE INVENTION

The present invention relates to a filter, particularly but not exclusively for use in crest factor reduction.


RELATED ART

When a transmit signal is to be transmitted from a transmitter in a wireless network then the signal is amplified by a power amplifier. If the power of an input signal to the power amplifier is below a maximum power level, then the power amplifier operates in a linear manner where an increase in input power is matched by a proportional increase in the power of the output signal from the power amplifier, (i.e. the power amplifier operates in a linear region). However, if the power of the input signal exceeds the maximum power level, then the power amplifier operates in a nonlinear manner such that an increase in the power of the input signal is not matched by a proportional increase in the power of the output signal. The power of the output signal is less than ideal in the power amplifier's nonlinear operating range resulting in an increased Error Vector Magnitude (EVM). It may therefore be advantageous to operate the power amplifier in the linear region.


Crest factor reduction (CFR) may be performed on a transmit signal prior to power amplification by a power amplifier. CFR reduces the peak to average power ratio (PAPR) of the transmit signal, thereby reducing the likelihood that peaks in the transmit signal will result in the power amplifier operating in a non-linear region. Crest factor reduction reduces the PAPR of the transmit signal by clipping the transmit signal at a maximum level. This clipping can introduce errors and/or distortion into the transmit signal and as such a filter is used to smooth out the clipping of the transmit signal. Filters can spread out variations in a signal over time. This allows filters to be used to remove discontinuities in a signal.


One example of a filter is a Finite Impulse Response (FIR) filter which can be implemented in discrete time intervals and may be described as a weighted sum of delayed inputs. FIG. 1 shows a schematic circuit diagram of an FIR filter 100 which can be implemented to filter an input signal (in) to generate an output signal (out). The FIR filter 100 comprises a delay line which includes N−1 delay elements 1021 to 102N-1. N taps are shown in the delay line wherein the output from each of the delay elements 102 is provided by a respective tap. The output on each of the N taps is applied to a respective weighting element 1040 to 104N-1, wherein the weighting elements 104 apply filter coefficients, w0 . . . wN-1, (or “tap weights”) to the outputs on the taps. The weighted outputs are then summed together, e.g. in a summation block 106 and the output of the summation block 106 provides the filtered output signal (out). The FIR filter 100 may be known as a windowing filter, wherein the coefficients w0 . . . wN-1 are defined by a windowing function, such as a Hamming window function or a Kaiser window function. Other window functions may be used as would be apparent to one skilled in the art.


The input signal is a sequence of samples (x(n)) which are passed through the delay line of the FIR filter 100 to generate the output signal as a sequence of output samples (y(n)). The output samples are given by the equation:

y(n)=Σi=0N-1wix[n−i].  (1)

The weighting coefficients (w0 . . . wN-1) are chosen to apply a particular window function to the input signal in order to filter the input signal.


The effect of filtering an input signal having two pulses is shown in FIG. 2. FIG. 2 shows the input signal having a first pulse 2021 and a second pulse 2022 at a later point in time. The two pulses have a short duration relative to the time taken for the input signal to pass though of the delay elements 102 of the delay line of the FIR filter 100. Apart from the two pulses in the input signal, the value of the input signal 202 (i.e. the signal strength) shown in FIG. 2 is zero. This is to provide a simple example of how the FIR filter 100 operates. The output signal from the FIR filter 100 is shown by line 204. The output signal has two peaks (2041 and 2042) corresponding to the two pulses of the input signal, but the duration of the peaks 2041 and 2042 is longer than the duration of the pulses of the input signal (2021 and 2022) due to the filtering of the FIR filter 100. The timings of the input and output signals in the graph of FIG. 2 have been shifted relative to each other to more clearly represent how the peaks of the output signal (204) relate to the pulses of the input signal (202). However, it should be appreciated that a peak on the output signal (e.g. peak 2041) will not begin until the pulse on the input signal (e.g. pulse 2021) has been received at the FIR filter 100. Therefore the pulses on the input signal 202 will actually occur before the corresponding peaks on the output signal 204, contrary to what is suggested by the graph shown in FIG. 2. This would be apparent to a person skilled in the art.


It can be appreciated from FIG. 2 that the effect of the filtering performed by the FIR filter 100 is to smooth out sudden variations in the input signal into a smooth windowed output. This is because the output of the FIR filter 100 is based on the value of the input signal over the recent history (i.e. over the amount of time equal to the total time taken for a signal sample to pass through the delay line of the FIR filter 100), rather than being based solely on the instantaneous value of the input signal.


SUMMARY

The inventor has realised that with the FIR filter 100 of the prior art there can be a problem if the input signal has multiple pulses within the duration of the window of the filter 100, or if a single pulse of the input signal lasts for longer than a single sample. For example, this can be a problem for a filter used in crest factor reduction. In these cases the gain of the FIR filter 100 will be greater than unity and so the magnitude of the windowed output will be increased beyond the maximum level of the input signal. This can be appreciated by considering FIG. 2 and equation (1) above. If the pulses 2021 and 2022 were closer together in time such that the windowed outputs (2041 and 2042) of the pulses overlapped with each other then the summation block 106 would add the windowed output peaks together and it is therefore possible for the signal strength of the output signal to extend beyond the maximum signal strength of the input pulses 2021 and 2022. For some input signals this may not be a problem, but the inventor has realised that for some other input signals it may be problematic for the output signal to have a magnitude which extends beyond the maximum magnitude of the input signal.


One example of a wireless network in which signals may be transmitted is a femtocell which provides network coverage to small areas. Femtocells are small, low-power, indoor cellular base stations designed for residential deployment. They provide better network coverage and capacity than that available in such environments from the overlying macrocellular network. In addition, femtocells use a broadband connection to receive data from and send data back to the operator's network (known as “backhaul”). However, embodiments of the invention may be implemented in any type of wireless network and is not limited to use in a femtocell.


In order to address the above-mentioned problem with the FIR filter 100, a modification to the FIR filter 100 is described herein.


According to a first aspect of the invention there is provided a method of filtering a signal comprising applying the signal to a delay line having a plurality of taps. Applying respective weighting coefficients of a windowing function to outputs from the plurality of taps to thereby generate a plurality of weighted outputs. Then, repeatedly selecting, for output, whichever of weighted outputs has the highest value. The method may also include filtering the selected outputs over time to thereby generate a filtered signal.


According to a second aspect of the invention there is provided a filter for filtering a signal. This filter includes a delay line having a plurality of taps, the delay line being arranged to receive the signal. The filter also includes weighting means for applying respective weighting coefficients of a windowing function to outputs from the plurality of taps to thereby generate a plurality of weighted outputs. Also part of this filter is selecting means for repeatedly selecting, for output, whichever of the weighted outputs has the highest value. The filter may also comprise filtering means for filtering the selected outputs over time to thereby generate a filtered signal.


Advantageously, by filtering a signal using the filter as described above the signal strength of filtered signal will not extend beyond the maximum signal strength of the signal prior to filtering. For some signals, this can be particularly advantageous, for example, when the signal is a scaling factor which has been generated for a transmit signal as described in more detail below.


In preferred embodiments, the step of filtering the selected outputs over time comprises passing the selected outputs to a further delay line having a further plurality of taps and determining an average of outputs from the further plurality of taps, wherein the average of the outputs from the further plurality of taps is used as the filtered signal. In this way, the filtering of the selected outputs over time may smooth out discontinuities in the selected outputs.


The step of selecting whichever of the weighted outputs has the highest value may be repeated for each sample of the input signal.


In some embodiments there is provided a method and processing block for processing a transmit signal for transmission from a transmitter, wherein a scaling factor is generated from the transmit signal using a function which is dependent upon the value of the transmit signal and a threshold value, the threshold value indicating a maximum value to which the transmit signal is to be limited. The scaling factor is filtered using the filter described above, and the filtered scaling factor is applied to the transmit signal such that the transmit signal does not exceed the maximum value indicated by the threshold value. The transmitter may be arranged to transmit the transmit signal in a WCDMA femtocell. Alternatively, the transmitter may be arranged to transmit the transmit signal in other types of cell, such as a WiMAX (Worldwide Interoperability for Microwave Access) cell or a cell using the LTE (Long Term Evolution) standard.


The processing block may be a crest factor reduction (CFR) block which is used to reduce the Peak-to-Average Power Ratio (PAPR) of the transmit signal, e.g. prior to power amplification of the transmit signal in the transmit chain of the transmitter. Implementing crest factor reduction on the transmit signal means that the transmit back-off level of a power amplifier to which the transmit signal is supplied can be reduced, resulting in higher radio frequency (RF) power, without moving into the non-linear region of the power amplifier.


By filtering the scaling factor the effect of clipping across the rise and fall of peaks in the scaling factor can be smoothed, rather than just truncating the magnitude of the transmit signal at its maximum value. This smoothing reduces the spectral re-growth in the transmit signal.


Using the FIR filter 100 of the prior art in the crest factor reduction block can cause excessive clipping of the transmitted signal, leading to an increased Error Vector Magnitude (EVM), and a failure to reduce the magnitude of the largest peaks in the transmit signal to prevent them exceeding the maximum value for the transmit signal. However, using a filter according to the preferred embodiments of the invention in the crest factor reduction block will prevent the gain applied to the scaling factor by the filter from exceeding unity. In turn this will reduce the EVM associated with over-clipping of sustained or multiple peaks in the transmit signal, without introducing significant spectral re-growth.


Also disclosed is a transmitter for transmitting a transmit signal. The transmitter comprising a processing block having generating means for generating a scaling factor from the transmit signal using a function which is dependent upon a value of the transmit signal and a threshold value, the threshold value indicating a maximum value to which the transmit signal is to be limited. Also part of this embodiment is a filter for filtering a scaling factor to thereby generate a filtered scaling factor. Also provided are applying means for applying the filtered scaling factor to the transmit signal such that the transmit signal does not exceed a maximum value indicated by the threshold value, and a power amplifier for performing power amplification on the transmit signal. In one configuration the transmitter is arranged to transmit the transmit signal in a WCDMA femtocell.





BRIEF DESCRIPTION OF THE DRAWINGS

For a better understanding of the present invention and to show how the same may be put into effect, reference will now be made, by way of example, to the following drawings in which:



FIG. 1 is a schematic diagram of a prior art FIR filter;



FIG. 2 shows a graph representing input and output signals from the FIR filter of FIG. 1;



FIG. 3 is a schematic diagram of a filter according to a preferred embodiment;



FIG. 4 is a flow chart for a process of filtering a signal using a filter according to a preferred embodiment;



FIG. 5 shows a graph representing input and output signals from the filter of a preferred embodiment;



FIG. 6 is a block diagram of a transmit chain of a transmitter according to a preferred embodiment;



FIG. 7 is a schematic diagram of a crest factor reduction block according to a preferred embodiment;



FIG. 8 is a flow chart for a process of performing crest factor reduction on a transmit signal according to a preferred embodiment;



FIG. 9 shows a graph representing input and output signals from the crest factor reduction block of a preferred embodiment;



FIG. 10 shows a transmit spectrum of a WCDMA ensemble signal before and after application of crest factor reduction; and



FIG. 11 is a graph showing the effectiveness of PAPR reduction by measuring the complementary cumulative distribution function (CCDF) of the transmitted signal after crest factor reduction.





DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Preferred embodiments of the invention will now be described by way of example only. With reference to FIGS. 3 and 4 there will now be described a filter 300 according to a preferred embodiment. The filter 300 can be implemented to filter an input signal (“in”) to generate an output signal (“out”). The filter 300 comprises a first delay line which includes a plurality (N−1) of delay elements 3021 to 302N-1. The filter also comprises a plurality (N) of weighting elements 3040 to 304N-1 and a selection block 306. The filter 300 also comprises a supplementary filter which includes a second delay line having a plurality (M−1) of delay elements 3081 to 308M-1, a summation block 310 and a dividing block 312. A plurality (N) of taps are arranged to provide the output from each of the delay elements 302 in the first delay line to a respective one of the weighting elements 304. The outputs of each of the weighting elements 304 are coupled to the selection block 306. An output of the selection block 306 is coupled to an input of the second delay line. A plurality (M) of taps are arranged to provide the output from each of the delay elements 308 in the second delay line to the summation block 310. An output of the summation block 310 is coupled to an input of the dividing block 312. An output of the dividing block 312 is coupled to an output line of the filter 300 to provide the output signal (“out”) from the filter 300.


In operation, in step S402 an input signal (“in”) is applied to the first delay line. In this way the input signal is supplied to the first delay element 3021 of the first delay line and to the first weighting element 3040. Over time, the input signal is passed along the first delay line through the sequence of delay elements 3021 to 302N-1. The output of each delay element 302 in the first delay line is provided to a respective weighting element 304. The number of delay elements 302 in the first delay line is N−1, and this number can be adjusted to suit particular situations and/or uses of the filter 300. For example, N may be in the range 10 to 50. In one embodiment, N takes a value of 30. The value of N can be chosen in dependence upon the application, the sampling rate, the target performance, or other factors. It will be appreciated that the number of delay elements 302 in the first delay line (i.e. the length of the delay line), and the delay introduced by each delay element determines the amount of time it takes each sample of the input signal to pass through the first delay line.


In step S404 the weighting elements 3040 to 304N-1 apply respective weighting coefficients (w0 to wN-1) to the tap outputs from the first delay line. The weighting coefficients are defined by a window function which is implemented by the filter. The weighting coefficients are normalised such that the maximum coefficient value is unity. A person skilled in the art would be aware of different types of window function which may be implemented in different embodiments of the filter. Different window functions may be suited for different uses of the filter, and an appropriate window function can be chosen for the filter 300 according to the use to which the filter is to be put. Some examples of possible window functions are a rectangular window function, a Hamming window function, a triangular window function and a Kaiser window function. A skilled person would be aware of the respective weighting coefficients associated with each of the window functions mentioned above, and would also be aware of other window functions which are known in the art and which may be applied to the weighting elements of the filter 300.


In step S406 the weighted outputs from the weighting elements 304 are provided to the selection block 306 which implements a max( ) operation in order to determine and select the weighted output which has the highest value. In other words, the maximum weighted output is selected by the selection block 306. That is, only the weighted output which has the highest value is selected by the selection block 306, with the other weighted outputs not being selected by the selection block 306.


As time progresses and the samples of the input signal move through the first delay line, the values of the weighted outputs supplied to the selection block 306 will change (in accordance with variations in the input signal) and as such the weighted output which is selected by the selection block 306 might not always be from the same weighting element 304. However, often the window function will be such that one of the weighting coefficients applied by a particular one of the weighting elements is larger than the other weighting coefficients applied by the other weighting elements 304, such that the weighted output selected by the selection block 306 is more likely to be the weighted output from the particular weighting element 304 than a weighted output from one of the other weighting elements. Although FIG. 3 shows the selection block 306 implementing a max( ) function, it would be apparent to a person skilled in the art that the selection block 306 could use any suitable operation in order to select the weighted output which has the highest value.


In step S408 the selected outputs are passed to the second delay line from the selection block 306. Only one weighted output (the weighted output having the highest value) is passed to the second delay line (of the supplementary filter) at a time. This means that there is no summation of simultaneously generated weighted outputs from the weighting elements 304. The selected outputs pass along the second delay line through the sequence of delay elements 3081 to 308M-1. The selected output is also provided directly from the selection block 306 to the summation block 310.


In step S410 the outputs from each of the taps of the second delay line are provided to the summation block 310 and are summed by the summation block 310.


In step S412 the output of the summation block 310 is provided to the dividing block 312 which divides the sum of the outputs from the taps of the second delay line by the number of taps in the second delay line (M) and provides the resulting signal on the output line of the filter 300. In this way the summation block 310 and the dividing block 312 operate to determine the average (the mean) of the outputs from the taps of the second delay line. Although the block 312 is described as a “dividing” block, in some embodiments this block could be implemented as a multiplying block which multiplies by 1/M. Multiplying by 1/M is equivalent to dividing by M.


In this sense the supplementary filter (comprising the second delay line, the summation block 310 and the dividing block 312) is an M-tap moving average filter used to smooth the signal output from the selection block 306 over time.


As described above, a window function (e.g. a Hamming or Kaiser window function) applies to the coefficients in the first tapped delay line, whereas in the second delay line there are no weighting elements shown in FIG. 3 such that the second delay line acts as an averaging stage (equivalent to weighting each tap of the second delay line with a coefficient equal to 1). In alternative embodiments, a windowing function (e.g. a Hamming or Kaiser window function) could be used in the second delay line, similar to the window function applied by the weighting elements 304 to the taps of the first delay line.


Since only one weighted output (the weighted output having the highest value) is passed to the second delay line (of the supplementary filter), and since the weighting coefficients are normalised, the output from the filter 300 will not exceed the maximum magnitude of the input signal. This is true even when the input signal has its maximum value for multiple samples within the duration of the window of the first delay line (i.e. within the time required for a sample to pass through the first delay line). This can be advantageous and distinguishes the filter 300 over the FIR filter 100.


The method described above is repeated for each sample of the input signal received at the filter 300.



FIG. 5 shows a graph representing the input and output signals passing into and out of the filter 300 according to a preferred embodiment. It can be seen that the “raw” signal, i.e. the input signal 502 has three pulses of short duration. The output (“filtered”) signal 504 smoothes out the pulses of the input signal over time. The peaks of the output signal for each pulse of the input signal are spread over a time equal to the duration of the window defined by the window function applied to the weighting coefficients used by the weighting elements 304. It will be appreciated that the first two peaks of the output signal corresponding to the first two pulses of the input signal shown in FIG. 5 overlap each other. This is because the time interval between the first two pulses of the input signal is less than the window duration implemented by the filter 300. However, instead of adding the two filtered signals together (e.g. at a time of 9.345×104 on the graph of FIG. 5) as the FIR filter 100 would (which could result in the filtered signal exceeding the maximum value of the input signal), the filter 300 selects only the maximum of the filtered signals such that the filtered signal follows whichever is the maximum of the peaks of the filtered signal.


This is particularly useful when the input signal is a scaling factor, generated from another signal and which is to be multiplied with that other signal as described in more detail below in relation to a crest factor reduction block.



FIG. 5 also shows that when a single pulse on the input signal is received within the window duration (e.g. the third pulse shown in FIG. 5) then the filtered output signal from the filter 300 has a similar form as the filtered output signal from the FIR filter 100 shown in FIG. 2.


In summary of the above, the modification to the FIR filter 100 to arrive at the filter 300 can be considered to be two-fold: firstly the FIR tap summation operation (implemented by summation block 106) is replaced with a simple max( ) function (implemented by selection block 306), which ensures the gain of the filter 300 cannot exceed unity; secondly the modified FIR filter is followed by a supplementary filter (comprising the second delay line, the summation block 310 and the dividing block 312) to smooth out the discontinuity caused by the non-linear max( ) function of the selection block 306.


There will now be described, with reference to FIGS. 6 to 11, particular embodiments in which the filter 300 is advantageously implemented in a processing block in a transmit chain of a transmitter for processing a transmit signal.


When transmitting a signal in a wireless network it can be beneficial to be able to increase the Radio Frequency (RF) transmit power. This allows the size (i.e. area) of a cell of a wireless network to be increased. One example, of such a wireless network is a femtocell which provides network coverage to small areas. In particular, femtocells are small, low-power, indoor cellular base stations designed for residential deployment. They provide better network coverage and capacity than that available in such environments from an overlying macrocellular network. In addition, femtocells use a broadband connection to receive data from and send data back to the operator's network (known as “backhaul”). In other types of network, a femtocell device may be known as a home base station, an access point base station or a 3G access point. The filter of the preferred embodiments may be implemented in a transmitter transmitting wireless transmit signals within a femtocell, or within any other suitable wireless network as would be apparent to a person skilled in the art. Furthermore, the filter of the preferred embodiments may be implemented in any device which transmits wireless signals within a wireless network, such as a user terminal (or “user equipment”) or a base station (or “Node B”) of a wireless network.


As described above, for larger cells of a wireless network (e.g. larger femtocells) it is generally necessary to increase the Radio Frequency (RF) transmit power, relative to a smaller cell (e.g. a smaller residential femtocell), in order to serve a larger community of users. However, it is also desirable to maintain low DC power consumption of the transmitter and to keep the Bill of Material (BOM) cost of the hardware of the transmitter as low as possible. Keeping the cost of the hardware as low as possible is of particular importance in femtocells, which may serve a small number of users (e.g. residential users) who are not prepared to pay a large amount money for hardware required to access the femtocell.


One way to increase the RF Transmit (Tx) power of the transmitter is to install a larger Power Amplifier (PA) in the transmitter, but this will typically increase the BOM cost and DC power consumption of the transmitting system.


Therefore, as an alternative, a lower-cost, lower-power power amplifier can be used, but with a reduction in the transmit back-off level such that the RF power is increased. The back-off level indicates a drop in the mean power value of the input signal to the power amplifier. By reducing the back-off level the input signal to the power amplifier has a higher mean power level. If the power of the input signal to the power amplifier is below a maximum power level, then the power amplifier operates in a linear manner where an increase in input power is matched by a proportional increase in the power of the output signal from the power amplifier, (i.e. the power amplifier operates in a linear region). However, if the power of the input signal exceeds the maximum power level, then the power amplifier operates in a nonlinear manner such that an increase in the power of the input signal is not matched by a proportional increase in the power of the output signal. The power of the output signal is less than ideal in the power amplifier's nonlinear operating range resulting in increased EVM. Moreover, if the mean power value of the input signal is too high, some peaks are clipped which acts as a source of further non-linearity in the output signal from the power amplifier. It will therefore be appreciated that by reducing the transmit back-off level, the peaks of the transmitted signal will be more likely to move into the non-linear region of the power amplifier, thereby increasing the spectral leakage and degrading the Error Vector Magnitude (EVM) performance of the transmitted signal.


One solution to this problem is to introduce a Crest Factor Reduction (CFR) block into the baseband transmit chain such that the Peak-to-Average Power Ratio (PAPR) of the transmitted signal is reduced. Crest factor reduction (CFR) reduces the peak-to-average ratio of a signal by clipping the peaks of the signal. This allows additional gain to be subsequently applied to the signal without moving into the non-linear region of the power amplifier, and it allows the power amplifier to operate closer to the threshold between linear and non-linear regions (i.e. a reduced back-off level can be used) such that the power amplifier operates more efficiently.


By introducing crest factor reduction, the peak power of the input signal to the power amplifier is reduced. Therefore, the transmit back-off can also be reduced, resulting in higher RF power, without moving into the non-linear region of the power amplifier. This is because the peak to average power ratio (PAPR) of the input signal to the power amplifier is reduced. Therefore a lower-cost, lower-power PA can be used to achieve an increase in RF transmit power (which thereby allows larger cells to be implemented in the wireless network).


The location of the CFR block in the transmit chain of a WCDMA femtocell is shown in FIG. 6. The transmit chain of a transmitter shown in FIG. 6 includes a physical channel summation block 602, a root raised cosine filter block 604, a CFR block 606, a modulation and up-conversion block 608, a power amplifier 610 and an antenna 612 for wirelessly transmitting a transmit signal. An output of the physical channel summation block 602 is coupled to an input of the root raised cosine filter block 604. An output of the root raised cosine filter block 604 is coupled to an input of the CFR block 606. An output of the CFR block 606 is coupled to an input of the modulation and up-conversion block 608. An output of the modulation and up-conversion block 608 is coupled to an input of the power amplifier 610. An output of the power amplifier 610 is coupled to the antenna 612.


In operation, as is known in the art, a transmit signal is generated by the physical channel summation block 602 and passed to the root raised cosine filter block 604 for filtering and pulse-shaping (e.g. to remove high frequency components from the transmit signal while minimising the inter-symbol interference). The filtered transmit signal is then passed to the CFR block 606 where crest factor reduction is performed on the transmit signal to reduce the PAPR of the transmit signal, as is described in more detail below. The three processing blocks 602, 604 and 606 operate in the baseband section of the transmit chain of the transmitter, and operate in the digital domain. The transmit signal is then passed to the modulation and up-conversion block 608 where the transmit signal is modulated and up-converted to a suitable frequency for wireless transmission from the antenna 612. The transmit signal is then amplified by the power amplifier 610 and then transmitted from the antenna 612.



FIG. 7 shows a schematic diagram of the crest factor reduction (CFR) block 606 according to a preferred embodiment. The CFR block 606 comprises a scaling factor generation block 702, a first summation block 704, a filter 706, a second summation block 708 and a multiplier block 710. The input transmit signal is coupled to an input of the scaling factor generation block 702 and to a first input of the multiplier block 710. An output of the scaling factor generation block 702 is coupled to a first (negative) input of the first summation block 704. A signal having a value of 1 is applied to a second (positive) input of the first summation block 704. The output of the first summation block 704 is coupled to an input of the filter 706. An output of the filter 706 is coupled to a first (negative) input of the second summation block 708. A signal having a value of 1 is applied to a second (positive) input of the second summation block 708. The output of the second summation block 708 is coupled to a second input of the multiplier block 710. The output of the multiplier block 710 provides the output transmit signal for output from the CFR block 606 to the modulation and up-conversion block 608.


The operation of the CFR block 606 is multiplicative. That is to say the CFR procedure involves the application of a time-varying scaling factor which has been calculated to reduce the peak amplitude of the transmit signal. With reference to the flow chart shown in FIG. 8, there is now described a method of performing crest factor reduction on a transmit signal using the CFR block 606 shown in FIG. 7. In step S802 a scaling factor ƒ(x) is generated from the input transmit signal in the scaling factor generation block 702. The scaling factor is generated such that if it is multiplied with the transmit signal then the output of the multiplication does not exceed a threshold value (“thresh”). The threshold value, thresh, is the maximum level to which the magnitude of the transmit signal is to be limited. Preferably, the scaling factor is generated such that if it is multiplied with the transmit signal then the output of the multiplication is equal to the input transmit signal when the input transmit signal does not exceed the threshold value, thresh.


For example, the function ƒ(x) used to generate the scaling factor may be determined using a clipping operation such that:







f


(
x
)


=

{




1
,






x


<
thresh







thresh


x



,






x



thresh









Therefore, the function, ƒ(x), has a first form when the magnitude of the transmit signal is above the threshold value, and the function has a second form when the magnitude of the transmit signal is below the threshold value. Fri this way, the function ƒ(x) calculates the scaling factor required to clip the magnitude of the transmit signal to a defined threshold. The threshold is set according to the output PAPR required from the CFR block 606. The threshold value, thresh, is related to the threshold between the linear and non-linear regions of the power amplifier 610 which is subsequent to the CFR block 606 in the transmit chain.


The scaling factor ƒ(x) is input to the first summation block 704. The first summation block 704 outputs a complementary scaling factor which is given by 1−ƒ(x). The complementary scaling factor is mostly zero with occasional impulses every time the input transmit signal magnitude exceeds the threshold value, thresh.


In step S804 the complementary scaling factor is filtered with the filter 706 to thereby smooth the effect of the clipping across the rise and fall of the peaks of the complementary scaling factor, rather than just truncating the magnitude of the complementary scaling factor. This filtering advantageously reduces the spectral re-growth caused by the clipping of the transmit signal. The filter 706 is implemented with the filter 300 described above and described in relation to FIGS. 3 to 5.


The filtered complementary scaling factor is then passed to the second summation block 708 and the output of the second summation block 708 is given by (1−filtered complementary scaling factor). The output of the second summation block 708 is input to the multiplier block 710 where, in step S806, it is multiplied by the input transmit signal. The output from the multiplier block 710 provides the output of the CFR block 606.


The output of the second summation block 708 mostly has a value of one. However, where the transmit signal exceeds the threshold value, thresh, then the output of the second summation block 708 has a value less than one such that when it is multiplied by the transmit signal, the result does not exceed the threshold value, thresh.



FIG. 9 shows a graph representing input and output transmit signals from the crest factor reduction block 606. The graph in FIG. 9 corresponds to the graph in FIG. 5 which shows the value of the output of the filter 706 when the filter 300 is used in the CFR block 606. By comparing FIGS. 5 and 9 it can be seen that the output of the filter 706 is non zero for times close to impulses in the input transmit signal which exceed the threshold 906. As can be seen in FIG. 9, since the output of the filter 706 is non-zero at these times, the output 904 from the CFR block 606 is lower than the input 902 to the CFR block 606 at these times. Furthermore, the peak magnitude of the output 904 from the CFR block 606 is limited such that it does not exceed the threshold value 906.


In FIG. 7, the CFR block 606 filters the complementary scaling factor (1−ƒ(x)), but this is just an implementation specific detail and is equivalent to filtering the scaling factor ƒ(x) itself. Therefore performing filtering on ƒ(x) or on (1−ƒ(x)) can both be considered to be filtering the scaling factor.


As described above, if the FIR filter 100 was used in the CFR block 606 then when multiple impulses (threshold crossings) occur within the duration of the window of the FIR filter 100, or if a single crossing lasts for longer than a single sample, the gain of the FIR filter 100 may be greater than unity and so the magnitude of the windowed output may be increased beyond the required level. This can cause excessive clipping of the transmitted signal by the multiplier block 710, which may lead to increased EVM, and a failure to reduce the magnitude of the largest peaks of the transmit signal.


However, the detrimental effect of sustained or multiple threshold crossings is overcome by using the filter 300 (described above) instead of the FIR filter 100. Since the filter 300 does not include a FIR tap summation operation (as performed by summation block 106 of FIR filter 100) and instead uses a simple max( ) function, this ensures that the gain of the filter 300 cannot exceed unity. As described above, the max( ) function of the filter 300 is followed by a supplementary filter (comprising the second delay line, the summation block 310 and the dividing block 312) to smooth out discontinuities in the scaling factor caused by the non-linear max( ) function.


A benefit of using the new filter structure 300 in the CFR block 606 is that it reduces the EVM associated with over-clipping of sustained or multiple peaks in the transmit signal (which may be introduced with the FIR filter 100), without introducing significant spectral re-growth into the transmit signal.


Some experimental results showing the benefits of using the filter 300 in the CFR block 606 are shown in FIGS. 10 and 11. FIG. 10 shows the transmit spectrum of a typical WCDMA ensemble signal before and after application of CFR, comparing the new windowing filter 300 with the simple FIR filter 100 of equal length. In this example the CFR is set to limit the PAPR of the transmit signal to 8 dB and a 31-tap Kaiser window is used. It can be seen that implementing the CFR block 606 using the FIR filter 100 introduces more spectral re-growth into the transmit signal than implementing the CFR block 606 using the filter 300.



FIG. 11 shows the effectiveness of the PAPR reduction by measuring the complementary cumulative distribution function (CCDF) of the transmitted signal after CFR. The CCDF of the non-CFR signal clearly extends out beyond a 12 dB peak-to-average ratio while CFR with the filter 300 provides an effective reduction to about 8 dB (which was the limit to the PAPR set in the CFR block 606). The CCDF for CFR with the FIR filter 100 shows how using this filter 100 breaks down for the largest signal peaks.


It can therefore be seen from FIGS. 10 and 11 that implementing CFR with the filter 300 provides less spectral re-growth and a more effective reduction of the PAPR to the transmit signal than is provided by the FIR filter 100. FIG. 11 also shows that implementing CFR with the filter 300 provides a more effective reduction of the PAPR to the transmit signal than is provided by having no CFR at all. It can therefore be seen that use of the new filter 300 is particularly advantageous when used in the CFR block 606 of a transmitter.


While the filter 300 has been described above for use in a CFR block, the filter could be used for other purposes than for crest factor reduction, as would be apparent to a person skilled in the art.


The blocks and method steps described above in relation to FIGS. 3, 4 and 6 to 8 may be implemented in hardware or in software. Furthermore, there may be provided a computer program product comprising instructions which when executed by computer processing means at a device will implement the method described above at the device.


While this invention has been particularly shown and described with reference to preferred embodiments, it will be understood to those skilled in the art that various changes in form and detail may be made without departing from the scope of the invention as defined by the appendant claims.

Claims
  • 1. A method of filtering a signal, comprising: applying the signal to a delay line having a plurality of taps;applying respective weighting coefficients of a windowing function to outputs from the plurality of taps to generate a plurality of weighted outputs;repeatedly selecting the weighted outputs with the highest value;filtering the selected outputs over time to generate a filtered signal, the filtering including: passing the selected outputs to a further delay line having a further plurality of taps; anddetermining an average of outputs from the further plurality of taps to generate the filtered signal; andoutputting the filtered signal.
  • 2. The method of claim 1, wherein the signal is a scaling factor which has been generated from a transmit signal and the filtered signal is a filtered scaling factor which is to be applied to the transmit signal.
  • 3. The method of claim 1, wherein the windowing function is a Hamming function or a Kaiser function.
  • 4. A method of processing a transmit signal for transmission from a transmitter, the method, comprising: generating a scaling factor from the transmit signal using a function which is dependent upon the value of the transmit signal and a threshold value, the threshold value indicating a maximum value to which the transmit signal is to be limited, wherein the function has a first form when the value of the transmit signal is above the threshold value and the function has a second form when the value of the transmit signal is below the threshold value;filtering the scaling factor to create a filtered scaling factor by applying the scaling factor to a delay line having a plurality of taps, applying respective weighting coefficients of a windowing function to outputs from the plurality of taps to thereby generate a plurality of weighted outputs, and repeatedly selecting the weighted outputs with the highest value; andapplying the filtered scaling factor to the transmit signal such that the transmit signal does not exceed the maximum value indicated by the threshold value.
  • 5. The method of claim 4, wherein applying the filtered scaling factor to the transmit signal reduces the peak-to-average power ratio of the transmit signal.
  • 6. The method of claim 4, wherein applying the filtered scaling factor to the transmit signal involves a multiplication operation on the transmit signal.
  • 7. The method of claim 4, further comprising using a power amplifier to perform power amplification on the transmit signal subsequent to applying the filtered scaling factor to the transmit signal.
  • 8. The method of claim 7, wherein the threshold value is related to a threshold between a first regime of the power amplifier in which the power amplifier operates in a linear region and a second regime of the power amplifier in which the power amplifier operates in a non-linear region.
  • 9. A filter for filtering a signal, comprising: a delay line having a plurality of taps, the delay line being arranged to receive the signal;weighting means for applying respective weighting coefficients of a windowing function to outputs from the plurality of taps to thereby generate a plurality of weighted outputs;selecting means for repeatedly selecting for output the weighted outputs with the highest value to create selected outputs; andfiltering means for filtering the selected outputs over time to generate a filtered signal, the filtering means including: a further delay line having a further plurality of taps, the further delay line being arranged to receive the selected outputs; anddetermining means for determining an average of outputs from the further plurality of taps to generate the filtered signal.
  • 10. The filter of claim 9, wherein the further delay line and the determining means constitute at least part of a moving average filter.
  • 11. A processing block for processing a transmit signal for transmission from a transmitter, the processing block, comprising: generating means for generating a scaling factor from the transmit signal using a function which is dependent upon the value of the transmit signal and a threshold value, the threshold value indicating a maximum value to which the transmit signal is to be limited;the filter of claim 9 for filtering the scaling factor to thereby generate a filtered scaling factor; andapplying means for applying the filtered scaling factor to the transmit signal such that the transmit signal does not exceed the maximum value indicated by the threshold value.
  • 12. The processing block of claim 11, wherein the applying means comprises multiplication means for performing a multiplication operation on the transmit signal.
Priority Claims (1)
Number Date Country Kind
1105768.4 Apr 2011 GB national
US Referenced Citations (188)
Number Name Date Kind
4380046 Frosch et al. Apr 1983 A
4574345 Konesky Mar 1986 A
4589066 Lam et al. May 1986 A
4601031 Walker et al. Jul 1986 A
4603404 Yamauchi et al. Jul 1986 A
4622632 Tanimoto et al. Nov 1986 A
4698746 Goldstein Oct 1987 A
4720780 Dolecek Jan 1988 A
4736291 Jennings et al. Apr 1988 A
4814970 Barbagelata et al. Mar 1989 A
4825359 Ohkami et al. Apr 1989 A
4858233 Dyson et al. Aug 1989 A
4890279 Lubarsky Dec 1989 A
4914653 Bishop et al. Apr 1990 A
4937741 Harper et al. Jun 1990 A
4943912 Aoyama et al. Jul 1990 A
4967326 May Oct 1990 A
4974146 Works et al. Nov 1990 A
4974190 Curtis Nov 1990 A
4992933 Taylor Feb 1991 A
5036453 Renner et al. Jul 1991 A
5038386 Li Aug 1991 A
5065308 Evans Nov 1991 A
5109329 Strelioff Apr 1992 A
5152000 Hillis Sep 1992 A
5193175 Cutts et al. Mar 1993 A
5233615 Goetz Aug 1993 A
5239641 Horst Aug 1993 A
5241491 Carlstedt Aug 1993 A
5247694 Dahl Sep 1993 A
5253308 Johnson Oct 1993 A
5265207 Zak et al. Nov 1993 A
5280584 Caesar et al. Jan 1994 A
5353306 Yamamoto Oct 1994 A
5384697 Pascucci Jan 1995 A
5386495 Wong et al. Jan 1995 A
5408676 Mori Apr 1995 A
5410723 Schmidt et al. Apr 1995 A
5410727 Jaffe et al. Apr 1995 A
5473731 Seligson Dec 1995 A
5488374 Frankot et al. Jan 1996 A
5555548 Iwai et al. Sep 1996 A
5557751 Banman et al. Sep 1996 A
5570045 Erdal et al. Oct 1996 A
5600784 Bissett et al. Feb 1997 A
5692139 Slavenburg et al. Nov 1997 A
5719445 McClure Feb 1998 A
5734921 Dapp et al. Mar 1998 A
5752067 Wilkinson et al. May 1998 A
5761514 Aizikowitz et al. Jun 1998 A
5790879 Wu Aug 1998 A
5795797 Chester et al. Aug 1998 A
5796937 Kizuka Aug 1998 A
5802561 Fava et al. Sep 1998 A
5805839 Singhal Sep 1998 A
5826033 Hayashi et al. Oct 1998 A
5826049 Ogata et al. Oct 1998 A
5826054 Jacobs et al. Oct 1998 A
5845060 Vrba et al. Dec 1998 A
5860008 Bradley Jan 1999 A
5861761 Kean Jan 1999 A
5864706 Kurokawa et al. Jan 1999 A
5923615 Leach et al. Jul 1999 A
5926640 Mason et al. Jul 1999 A
5946484 Brandes Aug 1999 A
5951664 Lambrecht et al. Sep 1999 A
5959995 Wicki et al. Sep 1999 A
5963609 Huang Oct 1999 A
6023757 Nishimoto et al. Feb 2000 A
6044451 Slavenburg Mar 2000 A
6052752 Kwon Apr 2000 A
6055285 Alston Apr 2000 A
6069490 Ochotta et al. May 2000 A
6101599 Wright et al. Aug 2000 A
6122677 Porterfield Sep 2000 A
6167502 Pechanek et al. Dec 2000 A
6173386 Key et al. Jan 2001 B1
6175665 Sawada Jan 2001 B1
6199093 Yokoya Mar 2001 B1
6317820 Shiell et al. Nov 2001 B1
6345046 Tanaka Feb 2002 B1
6360259 Bradley Mar 2002 B1
6381293 Lee et al. Apr 2002 B1
6381461 Besson et al. Apr 2002 B1
6393026 Irwin May 2002 B1
6408402 Norman Jun 2002 B1
6424870 Maeda et al. Jul 2002 B1
6448910 Lu Sep 2002 B1
6499096 Suzuki Dec 2002 B1
6499097 Tremblay et al. Dec 2002 B2
6567417 Kalkunte et al. May 2003 B2
6574311 Ross et al. Jun 2003 B1
6615339 Ito et al. Sep 2003 B1
6631439 Saulsbury et al. Oct 2003 B2
6681341 Fredenburg et al. Jan 2004 B1
6775766 Revilla et al. Aug 2004 B2
6795422 Ohsuge Sep 2004 B2
6829296 Troulis et al. Dec 2004 B1
6892293 Sachs et al. May 2005 B2
6928500 Ramanujan et al. Aug 2005 B1
6952181 Karr et al. Oct 2005 B2
6961782 Denneau et al. Nov 2005 B1
6996157 Ohsuge Feb 2006 B2
7103008 Greenblat et al. Sep 2006 B2
7161978 Lu et al. Jan 2007 B2
7237055 Rupp Jun 2007 B1
7302552 Guffens et al. Nov 2007 B2
7340017 Banerjee Mar 2008 B1
7342414 DeHon Mar 2008 B2
7383422 Kageyama et al. Jun 2008 B2
7428721 Rohe et al. Sep 2008 B2
7549081 Robbins et al. Jun 2009 B2
7672836 Lee et al. Mar 2010 B2
7712067 Fung et al. May 2010 B1
7801029 Wrenn et al. Sep 2010 B2
7804719 Chirania et al. Sep 2010 B1
8032142 Carter et al. Oct 2011 B2
20020045433 Vihriala Apr 2002 A1
20020069345 Mohamed et al. Jun 2002 A1
20020090924 Suominen Jul 2002 A1
20020174318 Stuttard et al. Nov 2002 A1
20020198606 Satou Dec 2002 A1
20030063664 Bodenschatz Apr 2003 A1
20030154358 Seong Aug 2003 A1
20030235241 Tamura Dec 2003 A1
20040078548 Claydon et al. Apr 2004 A1
20040083409 Rozenblit et al. Apr 2004 A1
20040139466 Sharma et al. Jul 2004 A1
20040150422 Wong et al. Aug 2004 A1
20040198386 Dupray Oct 2004 A1
20050083840 Wilson Apr 2005 A1
20050114565 Gonzalez et al. May 2005 A1
20050124344 Laroia et al. Jun 2005 A1
20050163248 Berangi et al. Jul 2005 A1
20050250502 Laroia et al. Nov 2005 A1
20050282500 Wang et al. Dec 2005 A1
20060087323 Furse et al. Apr 2006 A1
20060089154 Laroia et al. Apr 2006 A1
20060251046 Fujiwara Nov 2006 A1
20060268962 Cairns et al. Nov 2006 A1
20070036251 Jelonnek et al. Feb 2007 A1
20070127556 Sato Jun 2007 A1
20070173255 Tebbit et al. Jul 2007 A1
20070183427 Nylander et al. Aug 2007 A1
20070220522 Coene et al. Sep 2007 A1
20070220586 Salazar Sep 2007 A1
20070248191 Pettersson Oct 2007 A1
20070254620 Lindqvist et al. Nov 2007 A1
20070263544 Yamanaka et al. Nov 2007 A1
20070270151 Claussen et al. Nov 2007 A1
20080146154 Claussen et al. Jun 2008 A1
20080151832 Iwasaki Jun 2008 A1
20090003263 Foster et al. Jan 2009 A1
20090042593 Yavuz et al. Feb 2009 A1
20090046665 Robson et al. Feb 2009 A1
20090080550 Kushioka Mar 2009 A1
20090092122 Czaja et al. Apr 2009 A1
20090097452 Gogic Apr 2009 A1
20090098871 Gogic Apr 2009 A1
20090111503 Pedersen et al. Apr 2009 A1
20090150420 Towner Jun 2009 A1
20090163216 Hoang et al. Jun 2009 A1
20090168907 Mohanty et al. Jul 2009 A1
20090196253 Semper Aug 2009 A1
20090215390 Ku et al. Aug 2009 A1
20090252200 Dohler et al. Oct 2009 A1
20090264077 Damnjanovic Oct 2009 A1
20090296635 Hui et al. Dec 2009 A1
20100035556 Cai et al. Feb 2010 A1
20100046455 Wentink et al. Feb 2010 A1
20100054237 Han et al. Mar 2010 A1
20100087148 Srinivasan et al. Apr 2010 A1
20100105345 Thampi et al. Apr 2010 A1
20100111070 Hsu May 2010 A1
20100157906 Yang et al. Jun 2010 A1
20100195525 Eerolainen Aug 2010 A1
20100215032 Jalloul et al. Aug 2010 A1
20100216403 Harrang Aug 2010 A1
20100216485 Hoole Aug 2010 A1
20100222068 Gaal et al. Sep 2010 A1
20100234061 Khandekar et al. Sep 2010 A1
20100248646 Yamazaki et al. Sep 2010 A1
20100273481 Meshkati et al. Oct 2010 A1
20100279689 Tinnakornsrisuphap et al. Nov 2010 A1
20110002426 Muirhead Jan 2011 A1
20110122834 Walker et al. May 2011 A1
20110130143 Mori et al. Jun 2011 A1
20110170494 Kim et al. Jul 2011 A1
Foreign Referenced Citations (50)
Number Date Country
101754351 Jun 2010 CN
101873688 Oct 2010 CN
0 180 212 May 1986 EP
492174 Jul 1992 EP
0 877 533 Nov 1998 EP
0 973 099 Jan 2000 EP
0 977 355 Feb 2000 EP
1054523 Nov 2000 EP
1 134 908 Sep 2001 EP
1418776 May 2004 EP
1 946 506 Jul 2008 EP
1876854 Sep 2008 EP
2 071 738 Jun 2009 EP
2 326 118 May 2011 EP
2 304 495 Mar 1997 GB
2 370 380 Jun 2002 GB
2398651 Aug 2004 GB
2 414 896 Dec 2005 GB
2391083 Mar 2006 GB
2 447 439 Sep 2008 GB
2463074 Mar 2010 GB
61123968 Jun 1986 JP
A-8-297652 Nov 1996 JP
11272645 Oct 1999 JP
2001-034471 Feb 2001 JP
2004-525439 Aug 2004 JP
2006-500673 Jan 2006 JP
9004235 Apr 1990 WO
9111770 Aug 1991 WO
9726593 Jul 1997 WO
9850854 Nov 1998 WO
0102960 Jan 2001 WO
0250624 Jun 2002 WO
03001697 Jan 2003 WO
2004029796 Apr 2004 WO
2004034251 Apr 2004 WO
2004102989 Nov 2004 WO
2005048491 May 2005 WO
2006059172 Jun 2006 WO
2007021139 Feb 2007 WO
2007054127 May 2007 WO
2007056733 May 2007 WO
2007126351 Nov 2007 WO
2008030934 Mar 2008 WO
2008090154 Jul 2008 WO
2008099340 Aug 2008 WO
2008155732 Dec 2008 WO
2009054205 Apr 2009 WO
2010072127 Jan 2010 WO
2010126155 Nov 2010 WO
Non-Patent Literature Citations (39)
Entry
Panesar, G. et al., “Deterministic Parallel Processing”, Proceedings of the 1st Microgrid Workshop, Jul. 2005.
Towner, D. et al., “Debugging and Verification of Parallel Systems—the picoChip way”, 2004.
picoChip, “PC7203 Development Platform Preliminary Product Brief”, Jul. 2007.
Ennals, R. et al., “Task Partitioning for Multi-core Network Processors”, 2005.
Rabideau, Daniel J., et al., “Simulated Annealing for Mapping DSP Algorithms on to Multiprocessors,” Signals, Systems and Computers, 1993 Conference Record of the Twenty-Seventh Asilomar Conference, Nov. 1-3, 1993, IEEE, pp. 668-672.
Nanda, Ashwini K., et al., “Mapping Applications onto a Cache Coherent Multiprocessor, ” Conference on High Performance Networking and Computing, Proceedings of the 1992 ACM/IEEE Conference on Supercomputing, 1992, IEEE, pp. 368-377.
Lin, Lian-Yu, et al., Communication-driven Task Binding for Multiprocessor with Latency Insensitive Network-on-Chip, Design Automation Conference, 2005 Proceedings of th ASP-DAC, Jan. 18-21, 2005, IEEE, pp. 39-44.
Holger Claussen, Bell Laboratories, Alcatel-Lucent; “Performance of Macro and Co-Channel Femtocells in a Hierarchical Cell Structure”; The 18th Annual IEEE Internation Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'07); Sep. 1, 2007; pp. 1-5, XP031168593, ISBN: 978-1-4244-1143-6; Swindon, United Kingdom.
Shiroshita, T., et al.: “Reliable data distribution middleware for large-scale massive data replication” Parallel and Distributed Information Systems, 1993, Fourth International Conference on Miami Beach, FL, USA Dec. 18-20, 1996, Los Alamitos, CA, USA IEEE Comput. Soc, US, Dec. 18, 1996, pp. 196-205m XP010213188 ISBN: 0-8186-7475-X.
Levine B. N. et al.: “A comparison of known classes of reliable multicast protocols” Netowrk Protocols, 1996 International Conference on Columbus, OH, USA Oct. 29-Nov. 1, 1996, Los Alamitos, CA, USA IEEE Comput. Soc. US Oct. 29, 1996, pp. 112-121, XP010204425 ISBN: 0-8186-7453-9.
Ishijima, et al., A Semi-Synchronous Circuit Design Method by Clock Tree Modification IEEE Trans. Fundamentals, vol. E85-A, No. 12 Dec. 2002.
Greenstreet, et al., Implementing a STARI Chip, IEEE 1995.
Hierarchical multiprocessor organizations; J. Archer Harris; David R. Smith; International Symposium on computer Architecture; Proceedings of the 4th annual symposium on Computer architecture pp. 41-48 Year of Publication 1977.
“Hierarchical Interconnection Networks for Multicomputer systems” Sivarama P. Dandamudi, et al. IEEE Transactions on Computers archive vol. 39, Issue 6 (Jun. 1990 ) pp. 786-797 Year of Publication: 1990.
A Cluster Structure as an Interconnection Network for Large Multimicrocomputer Systems Wu, S.B. Liu, M.T. This paper appears in: Transactions on Computers Publication Date: Apr. 1981 vol. C-30, Issue: 4 on pp. 254-264.
Performance Analysis of Multilevel Bus Networks for Hierarchichal Multiprocessors S.M. Mahmud IEEE Transactions on Computers archive vol. 43, Issue 7 (Jul. 1994) pp. 789-805 Year of Publication: 1994.
Performance Analysis of a Generalized Class of M-Level Hierarchical Multiprocessor Systems I.O. Mahgoub A.K. Elmagarmid Mar. 1992 (vol. 3, No. 2) pp. 129-138.
Kober, Rudolf, “The Multiprocessor System SMS 201—Combining 128 Microprocessors to a Powerful Computer,” Sep. 1977, Compcon '77, pp. 225-230.
Knight, Thomas and Wu, Henry, “A Method for Skew-free Distribution of Digital Signals using Matched Variable Delay Lines,” VLSI Circuits, 1993. Digest of Technicial Papers. 1993 Symposium on, May 1993, pp. 19-21.
Popli, S.P., et al., “A Reconfigurable VLSI Array for Reliability and Yield Enhancement,” Proceedings of the International Conference on Systolic Arrays, 1988, pp. 631-642.
John, L.K., et al., “A Dynamically Reconfigurable Interconnect for Array Processors,” IEE Transactions on Very Large Scale Integration (lvsi) Systems, vol. 6, No. 1, Mar. 1998, pp. 150-157.
Schmidt, U., et al., “Datawave: A Single-Chip Multiprocessor for Video Applications,” IEEE Micro, vol. 11, No. 3, Jun. 1991, pp. 22-25, 88-94.
Chean, M., et al., “A Taxonomy of Reconfiguration Techniques for Fault-Tolerant Processor Arrays,” Computer, IEEE Computer Society, vol. 23, No. 1, Jan. 1990, pp. 55-69.
Kamiura, N., et al., “A Repairable and Diagnosable Cellular Array on Multiple-Valued Logic,” Proceedings of the 23rd International Symposium on Multiple-Valued Logic, 1993, pp. 92-97.
LaForge, 1., “Externally Fault Tolerant Arrays,” Proceedings: International Conference on Wafer Scale Integration, 1989, pp. 365-378.
Reiner Hartenstein, et al., On Reconfigurable Co-Processing Units, Proceedings of Reconfigurable Architectures Workshop (RAW98), Mar. 30, 1998.
Schmidt, U., et al., “Data-Driven Array Processor for Video Signal Processing”, IEEE—1990 (USA).
Muhammad Ali Mazidi, “The80×86 IBM PC and Compatible Computers”, 2003, Prentice Hall, 4th edition, pp. 513-515.
Shigei, N., et al., “On Efficient Spare Arrangements and an Algorithm with Relocating Spares for Reconfiguring Processor Arrays,” IEICE Transactions on Fundamentals of Electronics, communications and Computer Sciences, vol. E80-A, No. 6, Jun. 1997, pp. 988-995.
“Interference Management in Femto Cell Deployment”, Mingxi Fan, Mehmet Yavuz, Sanjiv Nanda, Yeliz Tokgoz, Farhad Meshkati, Raul Dangui, Qualcomm Incorporated, Qualcomm 3GPP2 Femto Workshop, Boston, MA, Oct. 15, 2007.
3GPP TS 36.331 v9.2.0 3rd Generation Partnership Project: Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Acces (E-UTRA); Radio Resource Control (RRC) Protocol specification (Release 9) Mar. 2010, pp. 1-248.
Alcatel-Lucent, et al., “Congested H(e)NB Hybrid Access Mode cell”, 2009, 3GPP Draft; R3-091053-Congested H(e)NB, 31rd Generation Partnership Project (3GPP), Apr. 29, 2009, 4 pages.
Motorola, “Text proposal for TR 36.9xx: Reducing HeNB interference by dynamically changing HeNB access mode”, 2009, 3GPP Draft: R4-094688, Apr. 29, 2009, 2 pages.
MIPS, MIPS32 Architecture for Programmers, 2001, MIPS Technologies, vol. 2, pp. 1-253.
Pechanek, et al. ManArray Processor Interconnection Network: An Introduction, Euro-Par'99, LNCS 1685, pp. 761-765, 1999.
Waddington, T., Decompilation of “hello world” on Pentium and SPARC, 4 pages, [retrieved on Aug. 3, 2012]. Retrieved from the Internet:<URL: http://web.archive.org/web/20050311141936/http://boomerang.sourceforge.net/helloworld.html>.
Balakrishnan, et al., CodeSurfer/x86—A Platform for Analyzing x86 Executables, Springer-Verlag Berlin Heidelber, 2005, [retrieved on Dec. 30, 2011], retrieved from the internet:<URL:http://www.springerlink com/content/uneu2a95u9nvb20v/>.
Miecznikowski, J., et al., “Decompiling Java Using Stage Encapsulation”, Proceedings of the Eighth Working Conference on Reverse Engineering, Oct. 2-5, 2001.
“Details on specification aspects for UL ICC”, 3GPP TSF-RAN WG1 #53, R1-081973, Qualcomm Europe, May 5-9, 2008, 2 pages.
Related Publications (1)
Number Date Country
20120258676 A1 Oct 2012 US