Method and Apparatus for Controlling Radio Emissions of a Base Station

Abstract

Methods and apparatus are proposed for computing a power reduction policy to control radio emissions of a base station over a time window, with the objective to keep the time-averaged radio emissions over the time window below an authorized value set by regulations, with minimum impact on the performance of the overall system. The time window is subdivided into a plurality of time periods starting at a plurality of time steps, and the policy control comprises, at least at a first time step in the time window: generating a predicted average radio emissions over subsequent time periods in the time window, based on radio emissions historical data; finding couples of values of a power reduction factor and an average radio emissions that minimize a cost function for each time step in the time window, based on the predicted average radio emissions.

Claims

1. An apparatus for computing a power reduction policy to control radio emissions of a base station over a time window subdivided into a plurality of time periods starting at a plurality of time steps, the apparatus comprising: at least one processor; and at least one non-transitory memory storing instructions that, when executed with the at least one processor, cause the apparatus to, at least at a first time step in the time window, perform: generating a prediction of averaged radio emissions over subsequent time periods in the time window, based on radio emissions historical data; and finding couples of values of a power reduction factor and an average of radio emissions that minimize a cost function for [[each]] the at least first time step in the time window, based on the prediction of averaged radio emissions.

2. A method for computing a power reduction policy to control radio emissions of a base station over a time window subdivided into a plurality of time periods starting at a plurality of time steps, the method comprising, at least at a first time step in the time window: generating a prediction of averaged radio emissions over subsequent time periods in the time window, based on radio emissions historical data; and finding couples of values of a power reduction factor and an average of radio emissions that minimize a cost function for the at least first time step in the time window, based on the prediction of averaged radio emissions.

3. The apparatus as claimed in claim 1, wherein the instructions, when executed with the at least one processor, cause the apparatus to perform generating the prediction of averaged radio emissions over subsequent time periods in the time window based on an average of radio emissions measured over a previous time period in the time window.

4. The apparatus as claimed in claim 1, wherein the instructions, when executed with the at least one processor, cause the apparatus to perform generating the prediction of averaged radio emissions over subsequent time periods in the time window, and finding couples of values of a power reduction factor and an average of radio emissions that minimize a cost function for the at least first time step in the time window, repeated at the time steps in the time window.

5. The apparatus as claimed in claim 1, wherein the cost function is based on: a first auxiliary function applicable to the average of radio emissions to penalize more radio emissions being farther from an authorized value, and a second auxiliary function applicable to the power reduction factor to penalize high power reduction factors and smooth out the power reduction factors over time.

6. The apparatus as claimed in claim 1, wherein, the instructions, when executed with the at least one processor, further cause the apparatus to perform: for a time step starting from a last time step in the time window until a given time step, iteratively backward computing the value of the cost function for the time step for a set of possible values of power reduction factor and selecting the power reduction factor that minimizes the cost function, and storing the selected power reduction factors for the given time step in association with an average of radio emissions.

7. A base station comprising the apparatus of claim 1, wherein the instructions, when executed with the at least one processor, cause the base station to perform: obtaining a power reduction policy, and implementing the power reduction policy during the time period starting at a given time step based on the radio emissions averaged over the time window at the given time step.

8. (canceled)

9. A method for controlling radio emissions of a radio base station based on a power reduction policy computed with the method as claimed in claim 2, comprising: obtaining the power reduction policy, and implementing the power reduction policy during the time period starting at the given time step based on the radio emissions averaged over the time window at the given time step.

10. The base station as claimed in claim 7, wherein the instructions, when executed with the at least one processor, cause the base station to perform: retrieving a power reduction factor from the power reduction policy based on the given time step and the radio emissions averaged over the time window at the given time step, and applying the retrieved power reduction factor during the given time period.

11. The base station as claimed in claim 7, wherein the instructions, when executed with the at least one processor, cause the base station to perform: retrieving a power reduction factor from the power reduction policy based on the given time step and the radio emissions averaged over the time window at the given time step, converting the retrieved power reduction factor into a radio emission constraint, and ensuring that the radio emissions averaged over the given time period remain under the radio emission constraint.

12. A central entity for use in a radio access network comprising at least one base station, the central entity comprising the apparatus as claimed in claim 1 wherein the instructions, when executed with the at least one processor, send the power reduction policy to the base station.

13. The method as claimed in claim 2, further comprising sending the power reduction policy to the base station.

14. The central entity as claimed in claim 12, wherein the instructions, when executed with the at least one processor, collect the radio emissions historical data from base stations in the radio access network.

15. A non-transitory program storage device readable with an apparatus, tangibly embodying a program of instructions executable with the apparatus for performing a method for computing a power reduction policy to control radio emissions of a base station over a time window subdivided into a plurality of time periods starting at a plurality of time steps, the method comprising, at least at a first time step in the time window: generating a prediction of averaged radio emissions over subsequent time periods in the time window, based on radio emissions historical data; and finding couples of values of a power reduction factor and an average of radio emissions that minimize a cost function for the time step in the time window, based on the prediction of averaged radio emissions.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0040] Example embodiments will become more fully understood from the detailed description given herein below and the accompanying drawings, which are given by way of illustration only and thus are not limiting of this disclosure.

[0041] FIG. 1 is a block diagram representing a method for controlling radio emissions a first embodiment.

[0042] FIG. 2 is a block diagram representing a method for controlling radio emissions in a second embodiment.

[0043] FIG. 3 is an example of implementation in a radio access network of a method for controlling radio emissions as depicted in FIG. 1 and FIG. 2.

[0044] FIG. 4A and FIG. 4B are representations of an example of a first and respectively a second auxiliary function.

[0045] FIG. 5 is a flow chart of a method for computation a power reduction policy based on dynamic programming.

[0046] FIG. 6 is a graph representing a power reduction policy obtained with a method as disclosed herein.

[0047] FIG. 7 is a block diagram of a method for reducing power based on a power reduction policy in an exemplary embodiment.

[0048] FIG. 8A and FIG. 8B represent the distribution of the radio emissions over a time period.

[0049] FIG. 9 is a block diagram illustrating the learning of the equivalent EIRP reduction factor.

[0050] FIG. 10 is a schematic diagram of an example embodiment of an apparatus suitable for implementing a first base station and a device hosting a central entity as disclosed herein.

[0051] It should be noted that these figures are intended to illustrate the general characteristics of methods, structure and/or materials utilized in certain example embodiments and to supplement the written description provided below. These drawings are not, however, to scale and may not precisely reflect the precise structural or performance characteristics of any given embodiment and should not be interpreted as defining or limiting the range of values or properties encompassed by example embodiments. The use of similar or identical reference numbers in the various drawings is intended to indicate the presence of a similar or identical element or feature.

DETAILED DESCRIPTION

[0052] Various example embodiments will now be described more fully with reference to the accompanying drawings in which some example embodiments are shown.

[0053] Detailed example embodiments are disclosed herein. However, specific structural and functional details disclosed herein are merely representative for purposes of describing example embodiments. The example embodiments may, however, be embodied in many alternate forms and should not be construed as limited to only the embodiments set forth herein. Accordingly, while example embodiments are capable of various modifications and alternative forms, the embodiments are shown by way of example in the drawings and will be described herein in detail. It should be understood, however, that there is no intent to limit example embodiments to the particular forms disclosed.

[0054] The present disclosure applies the control of radio emissions in general. Various quantities may be controlled by using the disclosed apparatus, base station, central entity and methods, for example power or EIRP (Equivalent Isotropic Radiated Power—which combines power and gain). In the following of the description, we will refer to EIRP by way of example. This is not limitative.

[0055] FIG. 1 and FIG. 2 show two variants of a method for controlling radio emissions. In both variants a power reduction policy is computed to control the average EIRP of a base station over a time window [0, T]. The time window [0, T] is subdivided into a plurality of time periods [t.sub.i,t.sub.i+1] starting at a plurality of time steps t.sub.i with i=0, . . . , L−1. For example, the time window may have a length of 24 hours and the time periods may have a length of 3 or 6 hours each.

[0056] The method comprises a prediction block B1, a policy computation block B2 and a power reduction block B3. Prediction block B1 retrieves, at least at time step t.sub.0, EIRP historical data H.sub.EIRP(t.sub.0) and predicts an average EIRP value EIRP.sub.t.sub.i+1.sup.p with i=0, . . . , L−1 over each subsequent time periods [t.sub.0, t.sub.1], . . . , [t.sub.i,t.sub.i+1], . . . , [t.sub.L−1, t.sub.L].

[0057] The policy computation block B2 computes a power reduction policy P that maps average EIRP values with values of power reduction factors for each time step t.sub.i in the time window.

[0058] The power reduction block B3 obtains the power reduction policy P. For a given time step t.sub.i, block B3 retrieves from policy P the power reduction factor r.sub.t.sub.i+1 which corresponds to the measured average EIRP at time t.sub.i. Block B3 controls the actual EIRP during the time period [t.sub.i,t.sub.i+1] based on the retrieved power reduction factor r.sub.t.sub.i+1.

[0059] In the embodiment of FIG. 1, the prediction at block B1 and the computation of the power reduction policy at block B2 are performed only at the beginning of the time window, that is at the first time step t.sub.0. At time step t.sub.0 a power reduction policy P.sub.0 is computed for each time step t.sub.i, i=0, . . . , L−1 in the time window. This policy P.sub.0 is applied by block B3 during the whole time window [0, T].

[0060] In the embodiment of FIG. 2, the power reduction policy is recomputed at several time steps t.sub.i in the time window. For example, at each time step t.sub.i, block B1 predicts an average EIRP value over each subsequent time periods [t.sub.i,t.sub.i+1], . . . , [t.sub.L−1, t.sub.L]. And block B2 computes a refreshed power reduction policy P.sub.i for each time step t.sub.k, k=i, . . . , L−1.

[0061] FIG. 3 is an exemplary implementation of a method for controlling radio emissions in a radio access network 30 comprising a central entity 31 and a plurality of base stations 32. For example, the central entity can be a RIC (Radio Intelligent Controller) or a CSON entity (Central Self Organizing Network).

[0062] In the example depicted in FIG. 3, blocks B1 and B2 are implemented in the central entity 31 whereas block B3 is implemented in the base stations 32.

[0063] At step 33, the central entity 31 requests EIRP measurements to the base stations 32. At step 34, the base stations 32 respond by sending their EIRP historical data. At step 35, the central entity 31 performs the EIRP prediction of block B1. At step 36, the central entity 31 performs the policy computation of block B2. At step 37, the central entity 31 sends the power reduction policy P obtained at step 36 to the base stations 32. At step 38, the base stations 32 perform the power reduction of block B3 based on the received power reduction policy P.

[0064] For example, historical data H.sub.EIRP(t.sub.i) sent by the base stations 32 at time step t.sub.i includes: [0065] average EIRP measured at the same time of the day on previous days; [0066] average EIRP measured over the previous time period [t.sub.i−1, t.sub.i] for i=1, . . . , L−1.

[0067] Advantageously the central entity 31 receives EIRP historical data from a plurality of base stations in the radio access network which improves the prediction and the performance of the power reduction policy. In this embodiment, a significant quantity of data needs to be transmitted between the central entity 31 and the base stations 32. This can be mitigated by reducing the frequency at which the power reduction policy is recomputed by the central entity 31 or, when the policy is recomputed at each time step, by increasing the duration of the time periods.

[0068] For example, when the central entity is a RIC, data are transmitted between the central entity 31 and the base stations 32 over an E2 interface.

[0069] As an alternative to the embodiment depicted in FIG. 3, all three blocks B1, B2, B3 may be implemented in the base stations. In this case, the base stations perform block B1 prediction based on their own historical data only.

[0070] The EIRP prediction of block B1 may be performed by using prediction techniques known in the art, for example linear regression or neural network-based prediction.

[0071] The computation of the power reduction policy performed at block B2 will now be described by reference to FIG. 4A and FIG. 4B, and FIG. 5.

[0072] The objective of the power reduction policy is to keep the average EIRP over the time window [0, T] below an authorized value M.sub.T set in the regulations, with minimum impact on the performance of the overall system.

[0073] As explained above, the power reduction policy maps average EIRP values with values of power reduction factors for each time step t.sub.i in the time window. The above objective is achieved by finding, for each time step t.sub.i in the time window, couples of values {r.sub.t.sub.i, EIRP.sub.t.sub.i} of power reduction factors and average EIRP that minimize a cost function C.

[0074] Preferably, the policy shall avoid overshooting with EIRP.sub.t.sub.i(r.sub.t.sub.i) values too low from the authorized value M.sub.T. It shall also avoid enforcing high power reduction factor at all time.

[0075] To this aim the cost function C is based on two auxiliary functions h and g. The first auxiliary function h applies to the average EIRP and is defined to penalize more radio emissions that are farther from an authorized value M.sub.T. The second auxiliary function g applies to the power reduction factor and is defined to penalize high power reduction factors and to smooth out the power reduction factors over time.

[0076] FIG. 4A gives an example of a first auxiliary function h and FIG. 4B gives an example of a second auxiliary function g.

[0077] For example, a first auxiliary function h as depicted in FIG. 4A can be defined as follows:

h(x)=a.sub.1|x−M.sub.T|.sup.n.sup.1+b.sub.1|x−M.sub.T| for x>M.sub.T, and

h(x)=a.sub.2|x−M.sub.T|.sup.n.sup.2+b.sub.2|x−M.sub.T| for x<M.sub.T

where a.sub.1>a.sub.2 and b.sub.1>b.sub.2 and n.sub.1>n.sub.2≥1 to penalize violation of the authorized value M.sub.T more than an excessive EIRP reduction.

[0078] For example, a second auxiliary function g as depicted in FIG. 4B can be defined as follows: g(r)=c(r−1).sup.n where c>0,n>1.

[0079] The power reduction policy can be computed by using a mathematical optimization method, for example dynamic programming as will be described in more details below by reference to FIG. 5.

[0080] EIRP.sub.t.sub.i(r.sub.t.sub.i) denotes the reduced EIRP at time step t.sub.i obtained by applying the power reduction factor r.sub.t.sub.i, retrieved from the power reduction policy, to the EIRP averaged over the time period [t.sub.i,t.sub.i+1]:

[00001]${\mathrm{EIRP}}_{t_i}\left(r_{t_i}\right)=\frac{{\mathrm{EIR}}_{t_i}}{r_{t_i}}.$

[0081] s.sub.k denotes the weighted average EIRP up to time t.sub.k with s.sub.k=Σ.sub.i=1.sup.kω.sub.iEIRP.sub.t.sub.i(r.sub.t.sub.i) where ω.sub.i is the relative length of the time period [t.sub.i,t.sub.i+1]:

[00002]${\omega }_i=\frac{t_{i+1}-t_i}{T}.$

[0082] The set of possible values of weighted average EIRP is denoted S={0, . . . , s.sup.max},

[0083] And the set of possible values of power reduction factors is denoted R={1, . . . , r.sup.max}

[0084] The objective is to find the couples of values {r,s}, r ∈ R,s ∈ S that minimize the cost function C for a given time step Q in the time window.

[0085] This is achieved with the method described below by reference to FIG. 5. Steps 51 to 53 in FIG. 5 are executed for each values in the set S={0, . . . , s.sup.max} of possible values of weighted average EIRP.

[0086] At step 51 the cost function C is first initialized: C.sub.L(s)=h(s) ∀ s and C.sub.k(s.sup.max)=h(s.sup.max). Then the problem is resolved by backward computation.

[0087] Steps 52 and 53 is executed for each time step t.sub.k with k=L−1, . . . , Q.

[0088] At step 52 the cost function C.sub.k(s) is calculated for the values r in the set R={1, . . . , r.sup.max} of possible values of power reduction factor.

[00003]$C_k\left(s\right)=\underset{r\in R}{\min }g\left(r\right)+\underset{s^{\prime }\in s}{.Math.}Pr\left(s_{k+1}=s^{\prime }|s_k=s,r_{t_k}=r\right)C_{k+1},\forall s\in S\setminus s^{\max }$

[0089] At step 53, the power reduction factor r.sub.k(s)=argmin {C.sub.k(s)} is calculated. The value r.sub.k(s) is the value that minimize the cost function C.sub.k(s).

[0090] Then variable k is incremented and the method repeats at step 52 until k=Q. When k=Q, the final value r.sub.Q(s) is output and stored in association with the corresponding value s of weighted average EIRP.

[0091] The process described at step 51 to 54 is repeated for each time step in the time window, that is for Q=0, . . . , L−1.

[0092] For example, the resulting policy P can be stored in a table which comprises for each value of Q (that is for each time step t.sub.Q), couples of values {r,s} that minimize the cost function C. FIG. 6 gives an example of a power reduction policy obtained with the method described above. In FIG. 6 the policy is depicted for time steps t.sub.0, . . . , t.sub.3. The weighted average EIRP s is represented on the x-axis and the power reduction factor r is represented on the y-axis. For example, if at time step t.sub.3, the weighted average EIRP value is s=400 W, then the power reduction ratio obtained from the policy is r.sub.t.sub.3=3,4.

[0093] As previously explained by reference to FIGS. 1 and 2, block B3 controls the actual EIRP during the time period [t.sub.i,t.sub.t+1] based on the retrieved power reduction factor r.sub.t.sub.i+1.

[0094] In a first embodiment the actual EIRP is controlled by applying the retrieved power reduction factor directly during the entire duration of the time period [t.sub.i,t.sub.i+1]. In practice this may be achieved by reducing utilization of the Physical Resource Block (PBR) by the constant factor r.sub.t.sub.i+1 during the whole time period [t.sub.i,t.sub.i+1]. Reducing the PBR means that transmission is only allowed for a portion 1/r.sub.t.sub.i+1 of the available PBRs while the remaining PBRs are blanked out.

[0095] A second embodiment is based on the solution described in WO2021/023375 which controls the actual EIRP values exceeding an EIRP constraint β.sub.i+1 over the time period [t.sub.i,t.sub.i+1]. With this approach, the constraint β.sub.i+1 needs first to be obtained from the power reduction factor r.sub.t.sub.i+1. FIG. 7 shows a detailed representation of block B3 with this second approach. At block B71, the power reduction factor r.sub.t.sub.i+1 is retrieved from the policy, based on the value of the EIRP averaged during [t.sub.0, t.sub.i]. Block B72 receives the EIRP predicted over the time period [t.sub.i,t.sub.i+1] and computes a function F.sub.i+1 that maps the EIRP constraint β.sub.i+1 to an effective power reduction factor. And block B73 inverts function F.sub.i+1 to compute the EIRP constraint β.sub.i+1 from the value r.sub.t.sub.i+1 retrieved by block 71 so that β.sub.i+1=F.sub.i+1.sup.−1(r.sub.t.sub.i+1). Then the base station ensures that the power averaged over the time period [t.sub.i,t.sub.i+1] remains under the constraint β.sub.i+1 for example by using the method disclosed in WO2021/023375.

[0096] In the following, F.sub.i(β.sub.i) is referred to as equivalent EIRP reduction factor.

[0097] Under NGBR traffic, it can be assumed that any blanked-out PRB is lost, which means that it does not generate an increase of EIRP over the next slots. In this case, the actual EIRP with power reduction can be approximated as the minimum between β.sub.i+1 and the actual EIRP without power reduction

[0098] Based on this assumption the equivalent EIRP reduction factor F.sub.i+1(β.sub.i+1) can be computed analytically as follows:

[00004]$F_{i+1}\left({\beta }_{i+1}\right)=\frac{{\mu }_{i+1}}{{\mu }_{i+1}^{\prime }\left({\beta }_{i+1}\right)}$

where μ.sub.i+1 is the predicted EIRP over the time period [t.sub.i,t.sub.i+1] when no control is applied (that is without power reduction) and μ′.sub.i+1(β.sub.i+1) is minimum between β.sub.i+1 and the predicted EIRP without power reduction, over the time period [t.sub.i,t.sub.i+1].

[0099] In the above-described embodiment, as illustrated in FIG. 8A, it is assumed that the power control clips EIRP values higher than the constraint β.sub.i+1 to exactly β.sub.i+1 while the remaining part of the distribution remains unchanged.

[0100] However if the majority of the traffic is GBR and/or if the constraint β.sub.i+1 has a sufficiently low value, this approximation may not hold in practice. In this case, blanked-out PRBs may reappear in the upcoming future for packet retransmission. This means that the EIRP distribution is not only clipped when it exceeds the constraint β.sub.i+1 as represented in FIG. 8A but the power control also changes the shape of the EIRP distribution as illustrated in FIG. 8B. In this case, advantageously, the equivalent EIRP reduction factor, F.sub.i+1(β.sub.i+1) is learned offline (that is prior to the deployment of the power control). With this offline learning approach, different values of the constraint β.sub.i+1 are deployed within the same time period [t.sub.i,t.sub.i+1] but possibly over different days, and the equivalent EIRP reduction factor F.sub.i+1(β.sub.i+1) is computed directly from measurements, instead of being obtained from pure calculations as in the analytical approach described-above.

[0101] FIG. 9 is a block diagram illustrating the offline learning of the equivalent EIRP reduction factor F.sub.i+1(β.sub.i+1). At block B91 power control is applied based on the constraint β.sub.i+1. Then at block B92 the average EIRP over the time period [t.sub.i,t.sub.i+1] denoted μ″.sub.i+1(β.sub.i+1) is computed. At block B93, μ.sub.i, the predicted EIRP over the time period [t.sub.i,t.sub.i+1], is computed and at block B94 the equivalent EIRP reduction factor F.sub.i+1(β.sub.i+1) is obtained:

[00005]$F_{i+1}\left({\beta }_{i+1}\right)=\frac{{\mu }_{i+1}}{{\mu }_{i+1}^{″}\left({\beta }_{i+1}\right)}.$

Finally the value of the constraint β.sub.i+1 is adjusted as indicated by arrow 95.

[0102] FIG. 10 depicts a high-level block diagram of an apparatus 100 suitable for implementing various aspects of the disclosure. Although illustrated in a single block, in other embodiments the apparatus 100 may also be implemented using parallel and distributed architectures. Thus, for example, various steps such as those illustrated in the system and methods described above by reference to FIG. 1 to 9 may be executed using apparatus 100 sequentially, in parallel, or in a different order based on particular implementations.

[0103] According to an exemplary embodiment, depicted in FIG. 10, apparatus 100 comprises a printed circuit board 101 on which a communication bus 102 connects a processor 103 (e.g., a central processing unit “CPU”), a random access memory 104, a storage medium 111, an interface 105 for connecting a display 106, a series of connectors 107 for connecting user interface devices or modules such as a mouse or trackpad 108 and a keyboard 109, a wireless network interface 110 and a wired network interface 112. Depending on the functionality required, the apparatus may implement only part of the above. Certain modules of FIG. 10 may be internal or connected externally, in which case they do not necessarily form integral part of the apparatus itself. For example display 106 may be a display that is connected to the apparatus only under specific circumstances, or the apparatus may be controlled through another device with a display, i.e. no specific display 106 and interface 105 are required for such an apparatus. Memory 111 contains software code which, when executed by processor 103, causes the apparatus 100 to perform the methods described herein. Storage medium 113 is a detachable device such as a USB stick which holds the software code which can be uploaded to memory 111.

[0104] The processor 603 may be any type of processor such as a general purpose central processing unit (“CPU”) or a dedicated microprocessor such as an embedded microcontroller or a digital signal processor (“DSP”).

[0105] In addition, apparatus 100 may also include other components typically found in computing systems, such as an operating system, queue managers, device drivers, or one or more network protocols that are stored in memory 111 and executed by the processor 103.

[0106] Although aspects herein have been described with reference to particular embodiments, it is to be understood that these embodiments are merely illustrative of the principles and applications of the present disclosure. It is therefore to be understood that numerous modifications can be made to the illustrative embodiments and that other arrangements can be devised without departing from the spirit and scope of the disclosure as determined based upon the claims and any equivalents thereof.

[0107] For example, the data disclosed herein may be stored in various types of data structures which may be accessed and manipulated by a programmable processor (e.g., CPU or FPGA) that is implemented using software, hardware, or combination thereof.

[0108] It should be appreciated by those skilled in the art that any block diagrams herein represent conceptual views of illustrative circuitry embodying the principles of the disclosure. Similarly, it will be appreciated that any flow charts, flow diagrams, state transition diagrams, and the like represent various processes which may be substantially implemented by circuitry.

[0109] Each described function, engine, block, step can be implemented in hardware, software, firmware, middleware, microcode, or any suitable combination thereof. If implemented in software, the functions, engines, blocks of the block diagrams and/or flowchart illustrations can be implemented by computer program instructions/software code, which may be stored or transmitted over a computer-readable medium, or loaded onto a general purpose computer, special purpose computer or other programmable processing apparatus and/or system to produce a machine, such that the computer program instructions or software code which execute on the computer or other programmable processing apparatus, create the means for implementing the functions described herein.

[0110] In the present description, block denoted as “means configured to perform . . . ” (a certain function) shall be understood as functional blocks comprising circuitry that is adapted for performing or configured to perform a certain function. A means being configured to perform a certain function does, hence, not imply that such means necessarily is performing said function (at a given time instant). Moreover, any entity described herein as “means”, may correspond to or be implemented as “one or more modules”, “one or more devices”, “one or more units”, etc. When provided by a processor, the functions may be provided by a single dedicated processor, by a single shared processor, or by a plurality of individual processors, some of which may be shared. Moreover, explicit use of the term “processor” or “controller” should not be construed to refer exclusively to hardware capable of executing software, and may implicitly include, without limitation, digital signal processor (DSP) hardware, network processor, application specific integrated circuit (ASIC), field programmable gate array (FPGA), read only memory (ROM) for storing software, random access memory (RAM), and non-volatile storage. Other hardware, conventional or custom, may also be included. Their function may be carried out through the operation of program logic, through dedicated logic, through the interaction of program control and dedicated logic, or even manually, the particular technique being selectable by the implementer as more specifically understood from the context.

[0111] As used herein, the term “and/or,” includes any and all combinations of one or more of the associated listed items.

[0112] When an element is referred to as being “connected,” or “coupled,” to another element, it can be directly connected or coupled to the other element or intervening elements may be present. Other words used to describe the relationship between elements should be interpreted in a like fashion (e.g., “between,” versus “directly between,” “adjacent,” versus “directly adjacent,” etc.).

[0113] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting. As used herein, the singular forms “a,” “an,” and “the,” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises,” “comprising,” “includes,” and/or “including,” when used herein, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

[0114] Benefits, other advantages, and solutions to problems have been described above with regard to specific embodiments of the invention. However, the benefits, advantages, solutions to problems, and any element(s) that may cause or result in such benefits, advantages, or solutions, or cause such benefits, advantages, or solutions to become more pronounced are not to be construed as a critical, required, or essential feature or element of any or all the claims.