Forward link power control

Information

  • Patent Grant
  • 10587333
  • Patent Number
    10,587,333
  • Date Filed
    Wednesday, December 13, 2017
    7 years ago
  • Date Issued
    Tuesday, March 10, 2020
    5 years ago
  • Inventors
    • Bhave; Paven
    • Sharkey; Patrick
    • Bath; David
    • Locke; Richard
  • Original Assignees
  • Examiners
    • Hailu; Kibrom T
    Agents
    • Sterne, Kessler, Goldstein & Fox P.L.L.C.
Abstract
A method of forward link power control in a communications system comprises: grouping a plurality of user terminals into a plurality of groups, at least one of which comprises more than one of the user terminals; for each said group, determining a corresponding forward link power level required to satisfy an aggregate demand of the group; and assigning one or more forward link carriers to the group, with the corresponding power level.
Description
FIELD OF THE INVENTION

The present invention relates to a method and apparatus for power control in a forward link of a communication system, particularly but not exclusively a satellite communications system.


BACKGROUND OF THE INVENTION

Many satellite communications systems have Adaptive Coding and Modulation (ACM) that aim to maximize the throughput of a forward link (i.e. for transmission to a user terminal (UT)). An example system is disclosed in US2014/0056335 A1.



FIG. 1 depicts a satellite communication system comprising a ground station 1 that transmits uplink signals UL to a satellite 2, which transmits corresponding downlink signals DL in one or more beams. A plurality of UTs (User Terminals) 6 in a beam 5 are served by two forward carriers FC1 and FC2. The forward carriers FC1, FC2 are shared between multiple user terminals 6. In a typical satellite communication network both the forward carriers FC1, FC2 will operate with a fixed EIRP (Effective Isotropic Radiated Power).


Consider an example where a UT 6 is making a voice over internet-protocol (VOIP), and is in an area where there is excellent signal strength. In a conventional ACM method the UT 6 will report its link conditions and the network will adapt the code rate and modulation so that the user can achieve maximum data rate. However, the UT 6 only requires a sufficient data rate to make a VOIP call, whereas the maximum data rate may only be required if the UT 6 is streaming real time data. Hence, the conventional approach to ACM may not give the optimum overall system performance.


SUMMARY OF THE INVENTION

Aspects of the present invention are defined by the accompanying claims. Embodiments of the invention include a method to optimise the system performance for given aggregate satellite power in the forward direction. This method may maximise total system throughput, rather than per user throughput in cases where the forward link is shared with a plurality of users.


Embodiments of the invention may use an algorithm that overcomes the conventional mismatch of requirements by adjusting the forward carrier EIRP.


The method may maintain equilibrium between ACM and optimisation of system capacity, for example by grouping of user terminals based on demand and/or geographic location, optimising the forward link power control such that the demand for each group is met, and balancing the total power available to optimise the link per user terminal group.


Optimising the forward link power may involve one or more of the following benefits. First, power distribution is no longer fixed so that user terminal groups with higher demand can be serviced with a higher power. Second, some user links may be operated with a lower power than in a conventional ACM method, which leads to reduction in interference, further improving system performance.





BRIEF DESCRIPTION OF THE DRAWINGS

Specific embodiments of the present invention will now be described with reference to the accompanying drawings, in which:



FIG. 1 is a diagram of a satellite communication system using a conventional ACM method;



FIG. 2 is a diagram of a satellite communication system using an ACM method according to an embodiment of the invention;



FIG. 3 is a flowchart of the ACM method in the embodiment; and



FIG. 4 is a diagram illustrating a specific use example of the embodiment.





DETAILED DESCRIPTION OF EMBODIMENTS

Apparatus for use in an embodiment of the invention is shown in FIG. 2, in which similar parts to those in FIG. 1 carry the same reference numerals.


In the following discussion, the term ‘carrier’ may refer to a frequency channel having a predetermined bandwidth. The carrier may be shared between different UTs 6, for example using time slots in a TDMA system or spreading codes in a CDMA system.


The ground station 1 is arranged to maintain a record of demand from the UTs 6, for example from forward data queue length and/or demand requirements received from the UTs 6. The ground station 1 and/or the satellite 2 are able to adjust independently the power (e.g. EIRP) of each forward link carrier, for example for the forward carriers FC1, FC2.


The ground station periodically runs the algorithm shown in FIG. 3 to achieve optimised system capacity. Step S1 is a trigger event to start the method. The trigger can be a periodic time to wake up the ground station 1 to run the algorithm or an event such as addition of a new UT to the pool. The next step S2 is to group the UTs 6. The ground station 1 monitors the forward data queue and any pre-negotiated demand parameters for a particular UT to calculate the user terminal demand in the forward link. The ground station 1 then sorts the UTs 6 based on their traffic demand. The grouping is then done based on segregating the UTs into groups 6.1 and 6.2. There may be more than 2 groups, but preferably the number of groups is limited to a maximum predefined value.


In Step S3 the ground station 1 calculates the maximum EIRP needed within a group 6.1, 6.2 to satisfy the demands of every UT within that group.


In step S4 the power control function of the satellite 2 and/or the ground station 1 is used to adjust the EIRP for each forward link FC1, FC2, preferably subject to the following constraints.


Constraints


Let there be a maximum of θmax groups per beam 5 and let upiθj be the EIRP required to achieve a data rate driθj for useriθj where i=ith user and θj=jth user group.


Constraint 1: Total Beam Power







bp
n

=





j
=
0


θ





max




up

θ





jmin





Max





E





I





R





P





per





Beam





5







Where upθjmin is the minimum power required in the jth user group to attain max(driθj).


Constraint 2: Aggregate EIRP







power
total

=





j
=
0


θ





max




bp
n




Aggregate





E





I





R





P





for





the





satellite





2







Algorithm


An example of the method of FIG. 3 will now be described as an algorithm.


Start S1:






    • init_qosi=Read QoS per User

    • cnocurrenti=Read CNo for User “i”

    • capacitycarrieri=lookupdatarate(min (cnocurrenti),ue_type)

    • Look-up Table for Data-rate or carrier to Noise Ratio

    • For each User Equipment Type the network will store a look up table mapping of the

    • CNo and Datarate, for example as shown below.

    • LookupDataRate(Look up value, UT Type)





















Type
Sub Type
C/No
Data Rate





















T5X4
L8
51.5
110.7



T5X4
L7
52.6
135



T5X4
L6
53.75
162



T5X4
L5
54.72
190.8



T5X4
L4
55.77
220.5



T5X4
L3
56.83
250.2



T5X16
L2
57.35
270



T5X16
L1
58.43
315



T5X16
R
59.53
360



T5X16
H1
60.50
400.5



T5X16
H2
61.50
441



T5X16
H3
62.48
486



T5X16
H4
63.74
531



T5X16
H5
64.80
559.8



T5X16
H6
65.45
576



T5X64
H2
66.25
634.4



T5X64
H3
67.45
702



T5X64
H4
68.64
767



T5X64
H5
69.75
819



T5X64
H6
70.95
858











Where Type indicates the modulation type (the number after ‘X’ indicating the number of possible modulation symbols), and Sub Type indicates the FEC coding rate.


Group Users S2:



















cnorequiredi = lookupdatarate(init_qosi, uetype)




deficiti = cnocurrenti − cnorequiredi




sort_useri = sorthightolow(deficit)




Let qosi = init_qosi of sort_useri









cum
i

=




k
=
0


k
=
i




qos
i










n = 0




Loop1:




 i = 0




 loop2:




 If(cumi/capacitycarriern > 0):




  capacitygroupn = cumi




  userni = sort_useri




  Increment i




 Else:




  Exit loop1




 End of If:




 End of loop2:




 total_carriers = n




 Increment n




End of loop1:











Calculate EIRP S3:














groupcnorequiredn = lookupdatarate(capacitygroupn, uetype)


  usernleast_capable = Read CNo for least capable UT in Group ′n′


cno_deficitn = usernleast_capable − groupcnorequiredn


For all Carriers


If cno_deficitn = 0 then don't do anything for this carrier


If cno_deficitn > 0:


Add carrier to the list ‘dec_power’ as the carier power has to be decreased


Else:


Add carrier to the list ‘inc_power’ as the carrier power has to be increased


Let D = number of carriers that have to be decreased in power, B be the


total number of carriers that have to be increased in power and C be the


total number of carriers that do not need any power change


Loop:


For each carrier (n = 1 to D) that needs power decrease


  eirpn = Read EIRP of carrier ′n′


  usernleast_capable = Read CNo for least capable UE in Group ′n′


  delta_cnon = usernleast_capable − groupcnorequiredn


  If delta_cnon = 0


  D = D − 1 Remove carrier for list of acrriers to be reduced


Else:


  power_adjustn = delta_cnon * α where α is the convergence factor < 1


  Adjust_EIRP (carriern, − poweradjustn)


For each carrier (n = 1 to B) that need power increase


  eirpn = Read EIRP of carrier ′n′





  
current_power=j=0j=D+B+Ceirpj






  available_power = Max EIRP per Beam − current_power


  power_adjustn = available_power/B


  Adjust_EIRP ( carriern, poweradjustn)


Decrement D


If D = 0 Exit Loop:


End of Loop:










Adjust EIRP S4:














Adjust_EIRP ( carriern, poweradjustn)


If poweradjustn < Satellite_power_Adjust_Threshold


  satellite_carrier_eirpn = satellite_carrier_eirpn + power_adjustn


Else poweradjustn > Satellite_power_Adjust_Threshold


  satellite_carrier_eirpn


      = satellite_carrier_eirpn


      + Satellite_power_Adjust_Threshold


  power_adjustn


      = power_adjustn − Satellite_power_Adjust_Threshold


  SAS_carrier_eirpn = SAS_carrier_eirpn + power_adjustn










End S5:
    • End Algorithm


Specific Use Example

A specific use example will now be described with reference to FIG. 4, which shows a beam pattern of a satellite network utilising a four-colour re-use scheme. In other words, carriers are assigned into four groups, with the groups being re-used between different beams having a minimum separation.


In an example, there are 3 users in each of Beam A and Beam B, with symmetric demands. For ease of link analysis, the beam isolation at all points is assumed to be the same. The user demands are as shown in Table 1 below.









TABLE 1







User Demands













Max QoS kbps



User
Service Type
requested















User 1A and 1B
Voice Call
24



User 2A and 2B
Streaming
128



User 3A and 3B
High Quality Video
858










The system will assign two full carriers F1 and F2 to users 3B and 3A respectively as they demand the maximum throughput that can be achieved by the system. Users 1A and 2A can be served on the same frequency as their maximum aggregate rate is 152 kbps which can be served with one carrier.


As the frequencies can be re-used, Users 1A and 1B are assigned frequency F1 and Users 2A and 2B are assigned frequency F2. In a conventional scenario the network will set both carriers with the same EIRP, for example 41.5 dBW. The conventional ACM allocates the best possible modulation and code rate. Table 2 details the link analysis for such a situation.









TABLE 2







Link analysis for all carriers with equal EIRP


















Max QoS
EIRP
CCI EIRP
C/No

Throughput


Beam
Frequency
Users
kbps
dBW
dBW
dBHz
Code Rate
kbps


















A
F1
1A-F1
24
41.5
41.5
64.5
T5X16-H4
531




2A-F1
128



F2
3A-F2
856
41.5
41.5
64.5
T5X16-H4
531


B
F2
1B-F2
24
41.5
41.5
64.5
T5X16-H4
531




2B-F2
128



F1
3B-F1
856
41.5
41.5
64.5
T5X16-H4
531









The total power used by the two beams A and B is 47.5 dBW and the useful aggregate Data Rate is 1366 kbps.


In contrast, an implementation of the algorithm in an embodiment of the invention will now be described. The network has the information that Users 1A and 1B need a maximum of 24 kbps (IP voice) and Users 2A and 2B need a maximum of 128 kbps streaming rate i.e. an aggregate maximum of 152 kbps. Therefore the network can lower the power for those carriers. On the other hand users 3A and 3B need 858 kbps, which they cannot achieve. Therefore, the network will have to increase the power. The network optimises management of the co-channel interference and the required data rate, and adjusts the carrier powers as shown below, maintaining the same total power per beam.









TABLE 3







Link analysis for all carriers with optimised EIRP


















Max QoS
EIRP
CCI EIRP
C/No

Throughput


Beam
Frequency
Users
kbps
dBW
dBW
dBHz
Code Rate
kbps


















A
F1
1A-F1
24
31.5
44
54.4
T5X4-L6
162




2A-F1
128



F2
3A-F2
856
44
31.5
67.6
T5X64-H3
702


B
F2
1B-F2
24
31.5
44
54.4
T5X4-L6
162




2B-F2
128



F1
3B-F1
856
44
31.5
67.6
T5X64-H3
702









The total power used in the total beams is almost the same as in the conventional case (the embodiment requires 0.25 dB less). The total data rate achieved is 1708 kbps i.e. 25% increase in total capacity for the two beams. In addition, the maximum per-user throughput goes up by 32% from 531 kbps to 702 kbps.


The application of the algorithm in the embodiment to the above example will now be described.


Start S1:


Each User signals their Max QoS (Quality of Service):


1A, 1B Signals 24 kbps


2A, 2B signals 128 kbps


3A, 3B signals 858 kbps


The RAN records the current CNo for each user. For simplicity in this example, they all have a CNo of 64.4 dBHz


Current max capacity of each current carrier=531 kps


Group Users S2:


The required CNo is obtained from a look up table which is specific to a given satellite network.


In this case for beam 1 the following are the required CNo


1A, 1B require 51.5 dBHz


2A, 2B require 52.6 dBHz


3A, 3B require 71 dBHz


The above steps are shown for Beam A; the same applies to Beam B.


Calculate Deficit


1A=64.4−51.5=12.9


2A=64.4−52.6=11.8


3A=64.4−71.0=−6.6


Sort User from Highest to Lowest


1A, 2A, 3A


Calculate Cumulative Max QoS


24, 152, 1010


Group based on max capacity of current carrier=531


Group 1=1A, 1B with aggregate data requirement of 152


Group 2=3A with aggregate data requirement of 852


Calculate EIRP S3:


The required CNo for each group is obtained from a look up table which is specific to a given satellite network.


Group 1=53.75


Group 2=71


Calculate deficit CNo


Group 1=64.4−53.75=10.75


Group 2=64.4−71=−6.6


Let F1 be the frequency for Group 1 and F2 for Group 2


Therefore, power of F1 has to be reduced whereas the power of F2 has to be increased.


Applying the EIRP control algorithm of the embodiment:









TABLE 4







Example 1: alpha = 0.5 slower convergence













EIRP
EIRP
Current


Power
Total


F2
F1
CNo
DeltaCNo
Delta *
adjust
Power


dBW
dBW
dBHz
dB
0.5 dB
dB
dBW
















41.5
41.5
64.5
10.75
5.4
5.0
44.5


44
36.5
59.13
5.38
2.7
3.0
44.5


44
33.5
56.54
2.79
1.4
1.0
44.5


44
32.5
55.39
1.64
0.8
1.0
44.5


44
31.5
54.43
0.68
0.3
0.0
44.5
















TABLE 5







Example 2: alpha = 0.8 fast convergence













EIRP
EIRP
Current


Power
Total


F2
F1
CNo
DeltaCNo
Delta *
adjust
Power


dBW
dBW
dBHz
dB
0.8 dB
dB
dBW
















41.5
41.5
64.5
10.75
8.6
9.0
44.5


44
32.5
55.39
1.64
1.1
1.0
44.5


44
31.5
54.43
0.68
0.5
0.0
44.5









Alternative Embodiments

Alternative embodiments of the invention may be envisaged, which may nevertheless fall within the scope of the accompanying claims.

Claims
  • 1. A method of forward link power control in a wireless communication system, the method comprising: a. for each of a plurality of user terminals, determining a respective forward link demand of that user terminal;b. grouping the plurality of user terminals into a plurality of groups according to said determined forward link demands of each of the user terminals, wherein at least one of the groups comprises more than one of the user terminals;c. for each said group, determining a corresponding forward link power level required to satisfy an aggregate of said determined forward link demands of each of the user terminals within that group, and assigning one or more forward link carriers to the group, with the corresponding forward link power level.
  • 2. The method of claim 1, wherein grouping the user terminals includes sorting the user terminals by said determined forward link demands of each of the user terminals and segregating the user terminals into the plurality of groups.
  • 3. The method of claim 1, wherein said forward link demands are determined from corresponding forward data queue lengths for each of said terminals.
  • 4. The method of claim 1, wherein said forward link demands are determined from corresponding demand requirements received from each of the user terminals.
  • 5. The method of claim 1, wherein at least one of the groups comprises a single said user terminal having a higher determined forward link demand than other ones of the user terminals.
  • 6. The method claim 1, wherein the user terminals are additionally grouped by geographic location.
  • 7. The method of claim 1, wherein the wireless communication system is a satellite communications system.
  • 8. The method of claim 7, wherein the user terminals are arranged in a plurality of beams in which the carriers may be re-used subject to a minimum re-use distance.
  • 9. The method of claim 1, wherein the number of groups is limited to a predetermined maximum.
  • 10. The method of claim 1, wherein the forward link power levels are constrained by a maximum aggregate power level.
  • 11. The method of claim 1, wherein the power level comprises an EIRP.
  • 12. The method of claim 1, wherein the carriers comprise frequency channels.
  • 13. The method of claim 1, including assigning a corresponding coding and/or modulation rate to each of the forward link carriers.
  • 14. The method of claim 1, including transmitting to the user terminals using the forward link carriers with the corresponding power levels.
  • 15. The method of claim 1, wherein each said group is assigned to a corresponding one of the forward link carriers.
  • 16. The method of claim 8, wherein a plurality of said groups of user terminals are located within the same one of said beams.
  • 17. A wireless communication system comprising: a plurality of user terminals; anda transmitter arranged to transmit wireless signals to the plurality of user terminals over a forward link;wherein a respective forward link demand is determined for each of the user terminals, and the user terminals are grouped into a plurality of groups according to said determined forward link demands of each of the user terminals, wherein at least one of the groups comprises more than one of the user terminals;for each said group, a corresponding forward link power level required to satisfy an aggregate of said determined forward link demands of each of the user terminals within that group is determined, and one or more forward link carriers are assigned to the group, with the corresponding forward link power level.
  • 18. A non-transient computer readable medium containing program instructions for causing a computer to: a. for each of a plurality of user terminals, determine a forward link demand of that user terminal;b. group the plurality of wireless user terminals into a plurality of groups according to said determined forward link demands of each of the user terminals, wherein at least one of the groups comprises more than one of the user terminals;c. for each said group, determine a corresponding forward link power level required to satisfy an aggregate of said determined forward link demands of each of the user terminals within that group, and assign one or more forward link carriers to the group, with the corresponding forward link power level.
Priority Claims (1)
Number Date Country Kind
1621173.2 Dec 2016 GB national
US Referenced Citations (196)
Number Name Date Kind
4119964 Johannsen et al. Oct 1978 A
4228538 Scharla-Nielsen et al. Oct 1980 A
4261054 Scharla-Nielsen Apr 1981 A
4567485 Oshima et al. Jan 1986 A
4691882 Young Sep 1987 A
4731866 Muratani et al. Mar 1988 A
4905235 Saburi Feb 1990 A
4910792 Takahata et al. Mar 1990 A
4941199 Saam Jul 1990 A
5073900 Mallinckrodt Dec 1991 A
5257019 Schwendeman et al. Oct 1993 A
5257029 Miyo Oct 1993 A
5285208 Bertiger et al. Feb 1994 A
5339330 Mallinckrodt Aug 1994 A
5446756 Mallinckrodt Aug 1995 A
5612703 Mallinckrodt Mar 1997 A
5619525 Wiedeman et al. Apr 1997 A
5678175 Stuart et al. Oct 1997 A
5697056 Tayloe Dec 1997 A
5710982 Laborde et al. Jan 1998 A
5754942 Wachs May 1998 A
5765098 Bella Jun 1998 A
5790940 Laborde et al. Aug 1998 A
5828947 Michel et al. Oct 1998 A
5832379 Mallinckrodt Nov 1998 A
5835846 Furukawa et al. Nov 1998 A
5835847 Gilmore et al. Nov 1998 A
5835857 Otten Nov 1998 A
5864547 Strodtbeck et al. Jan 1999 A
5878329 Mallinckrodt Mar 1999 A
5924015 Garrison Jul 1999 A
5940753 Mallinckrodt Aug 1999 A
5951709 Tanaka Sep 1999 A
5956619 Gallagher et al. Sep 1999 A
5963862 Adiwoso Oct 1999 A
5978363 Dimitrijevic et al. Nov 1999 A
5995832 Mallinckrodt Nov 1999 A
6021309 Sherman et al. Feb 2000 A
6081710 Sherman et al. Jun 2000 A
6085067 Gallagher et al. Jul 2000 A
6091933 Sherman et al. Jul 2000 A
6097752 Wiedeman et al. Aug 2000 A
6108561 Mallinckrodt Aug 2000 A
6157811 Dent Dec 2000 A
6163679 Bakke et al. Dec 2000 A
6219528 Wright et al. Apr 2001 B1
6240124 Wiedeman et al. May 2001 B1
6272325 Wiedeman et al. Aug 2001 B1
6317585 Shibasaki Nov 2001 B1
6321065 Wilcoxson et al. Nov 2001 B1
6328264 Maeda et al. Dec 2001 B1
6352222 Maeda et al. Mar 2002 B1
6422516 Maeda et al. Jul 2002 B1
6430418 Nivens et al. Aug 2002 B1
6477355 Grayson et al. Nov 2002 B1
6490448 Hogberg et al. Dec 2002 B1
6499698 Maeda et al. Dec 2002 B2
6615052 Parmenter Sep 2003 B1
6628920 Wolcott Sep 2003 B1
6634602 Maeda et al. Oct 2003 B2
6684057 Karabinis Jan 2004 B2
6711398 Talaie et al. Mar 2004 B1
6760566 Wright et al. Jul 2004 B1
6764049 Maeda et al. Jul 2004 B1
6824107 Maeda et al. Nov 2004 B2
6829226 Apostolides et al. Dec 2004 B1
6839540 Katzur Jan 2005 B1
6982964 Beering Jan 2006 B2
6985716 Talaie et al. Jan 2006 B2
6996077 Suenaga et al. Feb 2006 B1
7043199 Dai et al. May 2006 B2
7047029 Godwin et al. May 2006 B1
7116936 Kim Oct 2006 B2
7120434 Talaie et al. Oct 2006 B2
7194270 Smith Mar 2007 B2
7254117 Choi et al. Aug 2007 B2
7289460 Thacker et al. Oct 2007 B1
7386310 Dai et al. Jun 2008 B2
7450602 Vazquez Castro Nov 2008 B2
7599659 Wang et al. Oct 2009 B2
7633895 Schiff et al. Dec 2009 B2
7639981 Karabinis Dec 2009 B2
7715788 Lozano May 2010 B1
7720136 Friedman et al. May 2010 B2
7782811 Battista et al. Aug 2010 B2
7783287 Karabinis Aug 2010 B2
7929482 Tian et al. Apr 2011 B2
7933215 Schiff et al. Apr 2011 B2
7974576 Martin et al. Jul 2011 B2
8010043 Miller Aug 2011 B2
8068827 Miller et al. Nov 2011 B2
8107875 Miller Jan 2012 B2
8131212 Laufer Mar 2012 B2
8144643 Miller et al. Mar 2012 B2
8155584 Wang et al. Apr 2012 B2
8179778 Kim et al. May 2012 B2
8189504 Becker et al. May 2012 B2
8195090 Treesh et al. Jun 2012 B2
8213929 Miller et al. Jul 2012 B2
8218476 Miller Jul 2012 B2
8238817 Avellan et al. Aug 2012 B1
8254303 Becker et al. Aug 2012 B2
8254832 Dankberg et al. Aug 2012 B2
8270898 Karabinis et al. Sep 2012 B2
8285202 Miller Oct 2012 B2
8300571 Becker et al. Oct 2012 B2
8315199 Dankberg et al. Nov 2012 B2
8320296 Becker et al. Nov 2012 B2
8369776 Karabinis et al. Feb 2013 B2
8374118 Becker et al. Feb 2013 B2
8385223 Miller et al. Feb 2013 B2
8401038 Becker et al. Mar 2013 B2
8411615 Hong et al. Apr 2013 B2
8428000 Battista et al. Apr 2013 B2
8447295 Palmer et al. May 2013 B2
8483609 Miller Jul 2013 B2
8509144 Miller et al. Aug 2013 B2
8538323 Dankberg et al. Sep 2013 B2
8547863 Miller et al. Oct 2013 B2
8548337 Taylor Oct 2013 B2
8576767 Ravishankar et al. Nov 2013 B2
8600296 Miller Dec 2013 B2
8699465 Tian et al. Apr 2014 B2
8712321 Dankberg Apr 2014 B1
8726133 Hong et al. May 2014 B2
8737925 Beeler et al. May 2014 B2
8774731 Brown et al. Jul 2014 B2
8792821 Treesh et al. Jul 2014 B2
8804857 Kim et al. Aug 2014 B2
8805390 Swardh et al. Aug 2014 B2
8831598 Clemmensen et al. Sep 2014 B1
8855552 Dankberg et al. Oct 2014 B2
8879982 Jayasimha et al. Nov 2014 B2
8891434 Becker et al. Nov 2014 B2
8897207 Argov et al. Nov 2014 B2
8897769 Miller et al. Nov 2014 B2
8977191 Jong et al. Mar 2015 B2
9009338 Dankberg Apr 2015 B2
9009762 Kim et al. Apr 2015 B2
9014620 Dankberg Apr 2015 B2
9025679 Ryu et al. May 2015 B2
9026106 Livergood May 2015 B2
9036661 Becker et al. May 2015 B2
9037078 Karabinis May 2015 B2
9077428 Tronc Jul 2015 B2
9086471 Mengwasser Jul 2015 B2
9088335 Jong et al. Jul 2015 B2
9124342 Beeler et al. Sep 2015 B2
9172457 Dankberg et al. Oct 2015 B2
9176213 Liu et al. Nov 2015 B2
9184829 Miller et al. Nov 2015 B2
9198077 Park Nov 2015 B2
9198126 Topping et al. Nov 2015 B2
9203431 Lee et al. Dec 2015 B2
9203504 Zakaria et al. Dec 2015 B2
9246576 Yanai et al. Jan 2016 B2
9300391 Ravishankar et al. Mar 2016 B2
9319128 Yamamoto et al. Apr 2016 B2
9356685 Angeletti et al. May 2016 B2
9357508 Elinav et al. May 2016 B2
9379806 Mandell et al. Jun 2016 B1
9391690 Jong et al. Jul 2016 B2
9485010 Chen et al. Nov 2016 B1
9496946 Battista et al. Nov 2016 B2
10110300 Xu Oct 2018 B2
20020137457 Nivens et al. Sep 2002 A1
20030083089 Malladi May 2003 A1
20040033780 Kelly Feb 2004 A1
20040116134 Maeda et al. Jun 2004 A1
20050117610 Chevallier et al. Jun 2005 A1
20050288012 Morgan Dec 2005 A1
20080159419 Smith Jul 2008 A1
20120058797 Peter et al. Mar 2012 A1
20120120869 Miller May 2012 A1
20120282922 Fodor Nov 2012 A1
20120294230 Dankberg et al. Nov 2012 A1
20130157560 Blau et al. Jun 2013 A1
20130222179 Jeong Aug 2013 A1
20130309961 Lim et al. Nov 2013 A1
20140056335 Ryu et al. Feb 2014 A1
20140064118 Hong et al. Mar 2014 A1
20140198721 Walker et al. Jul 2014 A1
20140199940 Dockemeyer, Jr. et al. Jul 2014 A1
20140211722 Pietraski Jul 2014 A1
20150031408 Kalla Jan 2015 A1
20150139072 Hong et al. May 2015 A1
20150215029 Lemme Jul 2015 A1
20160072613 Esserman Mar 2016 A1
20160191145 Fang et al. Jun 2016 A1
20160195618 Baer et al. Jul 2016 A1
20160218796 Ryu Jul 2016 A1
20160242066 Ryu Aug 2016 A1
20160274240 Wheatley Sep 2016 A1
20160277096 Ryu Sep 2016 A1
20160278063 Zhang et al. Sep 2016 A1
20160308603 Hirsch et al. Oct 2016 A1
Foreign Referenced Citations (26)
Number Date Country
104581918 Apr 2015 CN
3824338 Dec 1992 DE
3642213 Jan 1994 DE
0416462 Mar 1991 EP
0790715 Jun 1997 EP
116866 Jan 2002 EP
1168663 Jan 2002 EP
1199828 Apr 2002 EP
2073400 Dec 2011 EP
2611043 Jul 2013 EP
2745673 Apr 1998 FR
2348339 Mar 2001 GB
H02-280424 Nov 1990 JP
WO 9513671 May 1995 WO
WO 0105063 Jan 2001 WO
WO 0221725 Mar 2002 WO
WO 02078216 Oct 2002 WO
WO 2004057777 Jul 2004 WO
WO 2004100501 Nov 2004 WO
WO 2007021155 Feb 2007 WO
WO 2007071059 Jun 2007 WO
WO 2007082719 Jul 2007 WO
WO 2009078539 Jun 2009 WO
WO 2010054394 May 2010 WO
WO 2010097349 Sep 2010 WO
WO 2014084464 Jun 2014 WO
Non-Patent Literature Citations (2)
Entry
Combined Search and Examination Report for GB1621173.2, dated Dec. 13, 2016, 3 pages.
European Search Report directed to European Patent Application No. EP 17 20 6824, completed May 3, 2018, 2 pages.
Related Publications (1)
Number Date Country
20180167135 A1 Jun 2018 US