PATH-LOSS MODEL FOR SIZE AND PLACEMENT OF ENGINEERED METASURFACES
20250343573 ยท 2025-11-06
Inventors
Cpc classification
International classification
Abstract
The technology described herein is directed towards designing and configuring a reconfigurable intelligent surface for deployment, based on a straightforward path-loss model having simplified input variables available to a designer, and having mitigated characterization complexity when compared to other path loss models. The relatively large distance that exists between the feed antenna and a reconfigurable intelligent surface facilitates approximation of certain factors, resulting in a practical solution for design and deployment of a reconfigurable intelligent surface of interest. The input variables include the geometry of the reconfigurable intelligent surface, receiver gain, transmitter gain, and the directivity of the transmitting antenna, which are parameters that are easily available to a designer for deploying a reconfigurable intelligent surface. A reconfigurable intelligent surface deployment position and/or size can be determined via an iterative optimization approach, to optimize the position and/or size based on a defined optimization cost expression.
Claims
1. A system, comprising: at least one processor; and a memory that stores executable instructions that, when executed by the at least one processor, facilitate performance of operations, the operations comprising: determining a metasurface deployment position and size usable to deploy a metasurface, comprising: executing one or more iterations using a path loss model to determine the metasurface deployment position and size based on a selected candidate position and size from combinations of candidate metasurface positions and sizes, each iteration comprising: determining a path loss value at the selected candidate position and size using a path loss model, the path loss model being based on a receiver gain level corresponding to a receiver that receives a reflected signal from the metasurface at a reflected angle from a transmitter of a transmitted signal impinging on the metasurface at an incident angle, and a metasurface gain value; determining a cost value at the selected candidate position and size, wherein the cost value corresponds to a threshold receiver power level that is based on a transmitter power level of the transmitter, and the path loss value; in response to a stopping criterion being determined to be satisfied, ending the executing of the one or more iterations, and outputting the selected candidate position and size corresponding to a highest gain at the receiver as the metasurface deployment position; and in response to the stopping criterion being determined not to be satisfied, selecting a previously unselected candidate position and size as the selected candidate position and size, and continuing the executing of the one or more iterations.
2. The system of claim 1, wherein the stopping criterion corresponds to the threshold receiver power level being satisfied.
3. The system of claim 1, wherein the operations further comprise, storing, for respective iterations, one or more respective selected candidate positions and sizes associated with respective cost values determined in the respective iterations, wherein the stopping criterion corresponds to having no remaining unselected candidate positions and sizes, and wherein the outputting of the selected candidate position and size corresponding to the highest gain at the receiver comprises determining, as the metasurface deployment position, a respective candidate position and size from the respective selected candidate positions and one or more sizes that is associated with a respective cost value of the respective cost values that corresponds to the highest gain at the receiver.
4. The system of claim 1, wherein the cost value equals the threshold power level minus the transmitter power level minus the path loss value at the selected candidate position.
5. The system of claim 1, wherein the group of candidate metasurface positions comprises locations along one dimension.
6. The system of claim 1, wherein the path loss value is further based on a free space path loss level, and wherein the metasurface gain value is based on a wavelength of the transmitted signal, a spillover efficiency ratio, and an effective area of the metasurface determined from a physical aperture area of the metasurface, the incident angle, and the reflected angle.
7. The system of claim 6, wherein the spillover efficiency ratio is dependent on antenna reflectivity data, metasurface size data, and distance data corresponding to a distance between the metasurface and the transmitter.
8. The system of claim 1, wherein the metasurface gain value is further based on an illumination efficiency ratio.
9. The system of claim 1, wherein the metasurface gain value is a function of the effective area, the wavelength, the spillover efficiency ratio, and the illumination efficiency ratio.
10. The system of claim 9, wherein the illumination efficiency is nearly equal to one, and is approximated to be equal to one.
11. The system of claim 1, wherein the threshold path loss value corresponds to a selected reference signal received power level.
12. The system of claim 11, wherein the selected received power level corresponds to a reference signal received power level.
13. The system of claim 1, wherein the threshold path loss value corresponds to a signal strength value.
14. The system of claim 13, wherein the signal strength value corresponds to a received signal strength indicator.
15. A method, comprising: obtaining, by a system comprising at least one processor, a transmitter gain value of a transmitter of a signal incident on a reconfigurable intelligent surface; obtaining, by the system, a receiver gain value of a receiver of a reflected signal from the reconfigurable intelligent surface; obtaining, by the system, one or more physical aperture areas of the reconfigurable intelligent surface; deriving, by the system, at least one of a deployment position or deployment size for deployment of the reconfigurable intelligent surface, the at least one of the deployment position or deployment size corresponding to a lowest path loss value of respective path loss values, the deriving comprising: determining the respective path loss values based on the transmitter gain value, the receiver gain value, and respective reconfigurable intelligent surface gain values that are based on respective one or more effective area values that are based on the one or more physical aperture areas and respective candidate positions for the deployment of the reconfigurable intelligent surface, and selecting the deployment position from the respective candidate positions and selecting a deployment size from the one or more respective effective area values that corresponds to the lowest determined path loss value of the respective path loss values; and configuring, by the system, the reconfigurable intelligent surface for usage, comprising locating the reconfigurable intelligent surface, based on the deployment size, at the deployment position.
16. The method of claim 15, wherein the selecting of the deployment position occurs in response to a respective gain value, corresponding to a respective path loss value of the respective path loss values, being determined to satisfy a threshold gain value at the receiver.
17. The method of claim 15, wherein the obtaining of the respective effective area values comprises determining respective incident angles corresponding to the signal incident on the reconfigurable intelligent surface at the respective candidate positions, and respective reflected angles corresponding to the reflected signal from the reconfigurable intelligent surface at the respective candidate positions.
18. The method of claim 15, wherein the respective reconfigurable intelligent surface gain values are further based on a spillover efficiency ratio.
19. A non-transitory machine-readable medium, comprising executable instructions that, when executed by at least one processor, facilitate performance of operations, the operations comprising: obtaining a transmitter gain value of a transmitter of a signal incident on a reconfigurable intelligent surface having a defined physical aperture area; obtaining a receiver gain value of a receiver of a reflected signal from the reconfigurable intelligent surface; determining respective candidate gain values corresponding to respective candidate positions of the reconfigurable intelligent surface, comprising: determining respective effective areas based on the physical aperture area, respective incident angles of the signal incident on the reconfigurable intelligent surface at the respective candidate positions, and respective reflected angles of the signal from the reconfigurable intelligent surface at the respective candidate positions, and determining respective path loss values based on the respective effective areas, and based on respective geometric data corresponding to the respective candidate positions, a transmitter location, and the receiver location, wherein the respective candidate gain values at the receiver location are based on the transmitter gain value, the receiver gain value, and the respective path loss values; selecting, as a deployment position, a candidate position of the respective candidate positions that corresponds to a highest candidate gain value of the respective candidate gain values; and configuring the reconfigurable intelligent surface for usage at the deployment position.
20. The non-transitory machine-readable medium of claim 19, wherein the respective candidate gain values correspond to respective cost data, and wherein the determining of the respective candidate gain values comprises iteratively selecting different respective instances of the respective candidate positions to determine which respective instance of the respective instances optimizes the cost data.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
[0002] The technology described herein is illustrated by way of example and not limited in the accompanying figures in which like reference numerals indicate similar elements and in which:
[0003]
[0004]
[0005]
[0006]
[0007]
[0008]
[0009]
[0010]
[0011]
[0012]
[0013]
DETAILED DESCRIPTION
[0014] Various embodiments and implementations of the technology described herein are generally directed towards designing and implementing a reconfigurable intelligent surface (metasurface) based on a path-loss model for reconfigurable intelligent surface (RIS) placement and/or size, using far less design variables (e.g., three) compared to more than twelve complex variables as currently used in a standard path loss model. As described herein, path loss estimation, that is, the estimated attenuation of signal strength through the dynamic environment of RIS-equipped networks, can be used in a design process flow for more optimal reconfigurable intelligent surface size and placement.
[0015] The path loss model described herein is based, in part, on a large distance approximation on aperture efficiency analysis for reflector antennas, using the characteristic of a reconfigurable intelligent surface scenario in which a relatively large distance exists between the feed antenna and the surface of interest. The resulting expression of this model avoids the need for intricate empirical parameters, such as spectrum reflection loss/gain and unit-cell pattern, which can be difficult to accurately characterize. Instead, the path loss model described herein relies on the directivity of the feed antenna and other geometric parameters, offering a more accessible and practical path-loss modeling solution.
[0016] It should be understood that any of the examples and/or descriptions herein are non-limiting. Thus, any of the embodiments, example embodiments, concepts, structures, functionalities or examples described herein are non-limiting, and the technology may be used in various ways that provide benefits and advantages in communications and reconfigurable intelligent surfaces in general.
[0017] Reference throughout this specification to one embodiment, an embodiment, one implementation, an implementation, etc. means that a particular feature, structure, characteristic and/or attribute described in connection with the embodiment/implementation can be included in at least one embodiment/implementation. Thus, the appearances of such a phrase in one embodiment, in an implementation, etc. in various places throughout this specification are not necessarily all referring to the same embodiment/implementation. Furthermore, the particular features, structures, characteristics and/or attributes may be combined in any suitable manner in one or more embodiments/implementations. Repetitive description of like elements employed in respective embodiments may be omitted for sake of brevity.
[0018] The detailed description is merely illustrative and is not intended to limit embodiments and/or application or uses of embodiments. Furthermore, there is no intention to be bound by any expressed or implied information presented in the preceding sections, or in the Detailed Description section. Further, it is to be understood that the present disclosure will be described in terms of a given illustrative architecture; however, other architectures, structures, materials and process features, and steps can be varied within the scope of the present disclosure.
[0019] It also should be noted that terms used herein, such as optimize, optimization, optimal, optimally and the like only represent objectives to move towards a more optimal state, rather than necessarily obtaining ideal results. For example, optimal position can mean selecting a position from a finite set of incremental positions, rather than necessarily achieving an optimal result. Similarly, maximize means moving towards a maximal state (e.g., up to some processing capacity limit), not necessarily achieving such a state, and so on.
[0020] It will also be understood that when an element such as a layer, region or substrate is referred to as being on or over atop above beneath below and so forth with respect to another element, it can be directly on the other element or intervening elements can also be present. In contrast, only if and when an element is referred to as being directly on or directly over another element, are there no intervening element(s) present. Note that orientation is generally relative; e.g., on or over can be flipped, and if so, can be considered unchanged, even if technically appearing to be under or below/beneath when represented in a flipped orientation. It will also be understood that 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 can be present. In contrast, only if and when an element is referred to as being directly connected or directly coupled to another element, are there no intervening element(s) present.
[0021] The following detailed description is merely illustrative and is not intended to limit embodiments and/or application or uses of embodiments. Furthermore, there is no intention to be bound by any expressed or implied information presented in the preceding sections, or in the Detailed Description section.
[0022] One or more example embodiments are now described with reference to the drawings, in which example components, graphs and/or operations are shown, and in which like referenced numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a more thorough understanding of the one or more embodiments. It is evident, however, in various cases, that the one or more embodiments can be practiced without these specific details, and that the subject disclosure may be embodied in many different forms and should not be construed as limited to the examples set forth herein.
[0023]
[0024] To this end, in one example implementation the position and/or size determination logic 102, coupled to at least one processor 110 and memory 112, iteratively performs calculations, including path loss calculations using the path loss model as described herein, over various candidate positions and/or candidate sizes, to evaluate respective path losses and corresponding respective desired gain values until a stopping criterion is met. The stopping criterion can be satisfying a threshold gain value, or some other stopping criterion, such as stopping when the full set of available candidate reconfigurable intelligent surface positions and/or sizes has been iterated over, e.g., with the candidate reconfigurable intelligent surface position with the highest resultant highest gain selected thereafter.
[0025] Described herein with reference to
[0027] It will be shown herein that the combination of surface with the feed antenna is advantageous for computation and validation purposes. The free space path loss can be calculated for a given transmitting distance and reconfigurable intelligent surface operating frequency; the gain of the receiving antenna is usually known. Described herein is estimating the gain of the reconfigurable intelligent surface with feed antenna, without excessive numerical experiments.
[0028] With reference to
Hence in order to calculate gain of the reconfigurable intelligent surface given a feed antenna, three terms are to be evaluated A, .sub.s, .sub.i as described below.
[0030] Instead of the physical aperture area, the effective aperture area from antenna theory is used as shown in
[0031] However, based on the large distance approximation, the following relationship exists:
[0033] Another factor, the spillover efficiency, .sub.s, is defined as the ratio of the radiated power from the feed that is intercepted by the reflecting aperture to the total radiated power. The mathematical expression for this is set forth in equation (5):
[0035] The spillover efficiency for engineered metasurfaces or reflectarrays is typically computed numerically, because the numerator in equation (5) is dependent on the feed position and aperture shape. By using a circular aperture, closed-form expression of the spillover efficiency can be evaluated using integration by parts:
[0036] It should be emphasized that the expression for spillover efficiency is only dependent on the feed antenna directivity, captured by q, and the geometry of the reconfigurable intelligent surface deployment, captured by the feed-to-RIS distance r.sub.f and the RIS size d.sub.s. Although the aperture shape is assumed to be circular to arrive at a closed form expression, a square reconfigurable intelligent surface can also use the same expression for estimation with only a small percent error on calculated efficiency.
[0037] The illumination efficiency, .sub.i, is another factor, is mathematically given as:
[0039] This expression is also generally evaluated at each element on the aperture using numerical techniques:
[0040] However, with a large distance as approximated for reconfigurable intelligent surface scenarios, the angle .sub.p, .sub.f is close to zero. After applying the 0-th order Taylor expansion of the cosine function, which assumes a constant value of amplitude distribution across the reconfigurable intelligent surface aperture, the spillover efficiency can be approximated:
[0042] The reconfigurable intelligent surface gain model described herein, based on a large distance approximation aperture efficiency analysis, is:
[0044] The model can be directly compared to the gain from numerical method, for example full-wave simulation with around a 2-3 dB error due to the simplification of the model, which will be described herein. A more accurate reconfigurable intelligent surface gain model can include the unit-cell radiation pattern and the average loss of the cell:
[0046] Either of these surface gain models can be substituted into equation (1) to estimate the expected path loss. Full-wave simulation and other more sophisticated path-loss models can also be used to calculate reconfigurable intelligent surface gain, Gain.sub.surf, more accurately at the expense of a much greater time consumption.
[0047] Turning to determining the position of the reconfigurable intelligent surface based on the above,
[0049] Because reference signal received power is given in one protocol as a requirement, in one implementation the received power level can be used as the goal for optimization. The above expression can be rewritten to an optimization cost using the path-loss model described herein:
[0051]
[0052] Returning to the iterative RIS placement procedure of
[0053] If there is insufficient receive power without the RIS, operation 304 instead branches to operation 308 to begin the cost optimization (equation (20), based on equations (21) and (22)) until a stopping criterion is met, which in this example implementation is a desired (the P.sub.rx,goal) threshold receive power level being satisfied. Operation 310 initializes a selected RIS candidate position, e.g., as far right along the horizontal axis as possible; note that vertical positioning is not considered in this example, however vertical axis candidate iterations can also be performed in conjunction with horizontal axis candidate iterations in a relatively straightforward manner.
[0054] Operation 312 represents calculating the path loss at the currently selected candidate position, which corresponds to the cost determination/amount of receive gain using the equations (20)-(22). If there is not enough receive power (with the RIS if deployed at the currently selected position) as evaluated at operation 314, operation 316 modifies the selected RIS position, e.g., selects a different candidate position some incremental amount (e.g., one inch to the left of the previous candidate position, although it may be possible to use a binary search to hone in on the final deployment position more quickly), and the iterations continue. If there is enough receive power (with the RIS if deployed at the currently selected position) as evaluated at operation 314, operation 318 represents deploying (e.g., configuring the RIS for deployment/usage) at this final deployment position, along with the radio unit, and the process ends. Note that this deployment position for the RIS may not correspond to the largest receive gain possible, but is the largest receive gain determined during the iterations until the stopping criterion is met, that is, until a selected candidate position results in a sufficient receive gain level.
[0055]
[0056] If there is insufficient receive power without the RIS, operation 504 instead branches to operation 508 to begin the cost optimization (equation (20)) until a stopping criterion is met, which in this example implementation is iterating over the full set of possible candidate positions. Operation 510 initializes a selected RIS candidate position, e.g., as far right along the horizontal axis as possible; note that vertical positioning is again not considered in this example.
[0057] Operation 512 represents calculating the path loss at the currently selected candidate position, which corresponds to the cost determination/amount of receive gain using the equations (20)-(22). This currently selected candidate position and receive gain (or cost) pairing is stored via operation 514; note that each pairing can be maintained, or only if a pairing for the current iteration has a higher receive gain than that stored for a previous iteration as the highest thus far. Operations 516 and 518 modify the candidate position, to select new candidate positions for repeating the iterative process until no candidate positions remain.
[0058] When no candidate positions remain to evaluate for path loss, the position with the highest receive gain, corresponding to the optimized cost is known. Operation 520 selects (e.g., outputs or saves) the candidate position with the highest receive gain as the final deployment position for the RIS. Operation 522 represents deploying (e.g., configuring the RIS for deployment/usage) at this deployment position, along with the radio unit, and the process ends. Note that although not shown in
[0059] It should be noted that the operations of
[0060] Still further, combinations of sizes and positions can be iterated over, such as in a nested loop, as described with reference to
[0061] If there is insufficient receive power without the RIS, operation 604 instead branches to operation 608 to begin the cost optimization (equation (20)) until a stopping criterion is met, which in this example implementation is iterating over the full set of possible candidate positions and candidate sizes. Operation 610 initializes a selected RIS candidate position, e.g., as far right along the horizontal axis as possible; note that vertical positioning is again not considered in this example. Operation 612 initializes a selected RIS candidate size, e.g., a smallest practical surface area that will fit along the horizontal dimension over which candidate positions are iterated.
[0062] Operation 614 represents calculating the path loss at the currently selected candidate position and selected candidate size, which corresponds to the cost determination/amount of receive gain using the equations (20)-(22). This currently selected candidate position, size and receive gain (or cost) grouping is stored via operation 616; note that each grouping can be maintained, or only stored if a grouping for the current iteration has a higher receive gain than that stored for a previous iteration combination as the highest thus far. Operations 618 and 620 modify the candidate size, to select new candidate sizes for repeating the iterative process until no candidate sizes remain. For example, the smallest practical size initialized at operation can be based on the area of an 88 array of unit cells, with each iteration increasing by two more unit cells per dimension, e.g., a 10 10 array, a 12 12 array and so on up to some size limit, such as a 6464 array. Alternatively, power of two iterations may be used, e.g., starting with a 44 array, then an 88 array, then a 1616 array, and so on up to the predetermined limit.
[0063] When no candidate sizes remain to evaluate for path loss at the currently selected candidate position, operations 622 and 624 modify the selected RIS position, returning to operation 612 to reinitialize the selected RIS size to the starting size, to be evaluated with new selected candidate positions for repeating the iterative process until no candidate positions or candidate sizes remain.
[0064] When no candidate positions and sizes remain to evaluate for path loss, the position and size grouping with the highest receive gain, corresponding to the optimized cost is known. Operation 626 selects (e.g., outputs or saves) the candidate position with the highest receive gain as the final deployment position for the RIS. Operation 624 represents deploying (e.g., configuring the RIS for deployment/usage) at this deployment position, along with the radio unit, and the process ends. Note that although not shown in
[0065] It should be noted that the operations of
[0066] If expense is a significant consideration, the smallest size RIS that achieves a highest receive gain (that is sufficiently high) can be selected, such as by modifying the nested loop ordering in
[0067]
[0068] The following table shows a comparison of the estimated gain using different approaches:
TABLE-US-00001 Approach Name Gain dB Path Loss Model Described Herein 6.72 Path Loss Model Described Herein with Minor Effects 5.29 Numerical 5.54 Approaches in Literature 3.92-7.92
[0069] This comparison highlights limitations and the improvement of the path-loss model described herein compared to the existing literature. One limitation includes lower accuracy (2 dB higher than the numerical/experimental result) due to exclusion of physical effects that are not easily accessible. Usually, such effects are included as a fitting/empirical parameters in the existing standard model; such a standard model will produce a range of values where the actual value is included, such as the value in the range 3.92-7.92 dB shown in the table. In contrast, the path loss model described herein uses only geometrical parameters and the Tx-Rx directivity, which are easily accessible to the designer, and which result in a single value with acceptable error.
[0070] One or more concepts described herein can be embodied in a system, such as represented in the example operations of
[0071] The stopping criterion can correspond to the threshold receiver power level being satisfied.
[0072] Further operations can include, storing, for respective iterations, one or more respective selected candidate positions and sizes associated with respective cost values determined in the respective iterations; the stopping criterion can correspond to having no remaining unselected candidate positions and sizes, and the outputting of the selected candidate position and size corresponding to the highest gain at the receiver can include determining, as the metasurface deployment position, a respective candidate position and size from the respective selected candidate positions and a selected one or more sizes that are associated with a respective cost value of the respective cost values that corresponds to the highest gain at the receiver.
[0073] The cost value can equal the threshold power level minus the transmitter power level minus the path loss value at the selected candidate position.
[0074] The group of candidate metasurface positions include locations along one dimension.
[0075] The path loss value can be further based on a free space path loss level, and the metasurface gain value can be based on a wavelength of the transmitted signal, a spillover efficiency ratio, and an effective area of the metasurface determined from a physical aperture area of the metasurface, the incident angle, and the reflected angle. The spillover efficiency ratio can be dependent on antenna reflectivity data, metasurface size data, and distance data corresponding to a distance between the metasurface and the transmitter.
[0076] The metasurface gain value can be further based on an illumination efficiency ratio.
[0077] The metasurface gain value can be a function of the effective area, the wavelength, the spillover efficiency ratio, and the illumination efficiency ratio. The illumination efficiency can be nearly equal to one, and can be approximated to be equal to one.
[0078] The threshold path loss value can correspond to a selected reference signal received power level.
[0079] The selected received power level can correspond to a reference signal received power level.
[0080] The threshold path loss value can correspond to a signal strength value.
[0081] The signal strength value can correspond to a received signal strength indicator.
[0082] One or more example implementations and embodiments, such as corresponding to example operations of a method, are represented in
[0083] Selecting the deployment position can occur in response to a respective gain value, corresponding to a respective path loss value of the respective path loss values, being determined to satisfy a threshold gain value at the receiver.
[0084] Obtaining the respective effective area values can include determining respective incident angles corresponding to the signal incident on the reconfigurable intelligent surface at the respective candidate positions, and respective reflected angles corresponding to the reflected signal from the reconfigurable intelligent surface at the respective candidate positions.
[0085] The respective reconfigurable intelligent surface gain values can be further based on a spillover efficiency ratio.
[0086]
[0087] The respective candidate gain values can correspond to respective cost data, and determining the respective candidate gain values can include iteratively selecting different respective instances of the respective candidate positions to determine which respective instance of the respective instances optimizes the cost data.
[0088] As can be seen, the technology described herein facilitates designing and implementing a reconfigurable intelligent surface based on a straightforward path-loss model, with simplified input variables and the mitigation of characterization complexity. Also described herein are optimization approaches with a defined optimization cost expression. The technology described herein overcomes the many drawbacks of existing standard approaches, including highly-complex path-loss modeling and extensive numerical methods, e.g., that include many physical effects such as phase error, spectrum reflection, and average unit cell loss, which are challenging to evaluate. As such, the existing approaches use physical effect parameters as fitting parameters to make the estimation closer to the numerical or experimental gain, because the estimation provides a range instead of a single value, where the actual gain is included in such range.
[0089] Using the technology described herein, a design process based on the path loss is able to achieve an optimization goal, e.g., defined based on the path loss model and received power. Numerical experiments using an industry standard full-wave 3D electromagnetic modeler validate the model described herein. The accurate path-loss modeling technology described herein thus overcomes the drawbacks of traditional path-loss modeling that deals with the intricacies of empirical parameters for curve fitting, including unit cell pattern characterization, spectrum reflection loss/gain, phase error losses, and more, which do not well suit real-world RIS implementations.
[0090] The above description of illustrated embodiments of the subject disclosure, comprising what is described in the Abstract, is not intended to be exhaustive or to limit the disclosed embodiments to the precise forms disclosed. While specific embodiments and examples are described herein for illustrative purposes, various modifications are possible that are considered within the scope of such embodiments and examples, as those skilled in the relevant art can recognize.
[0091] In this regard, while the disclosed subject matter has been described in connection with various embodiments and corresponding Figures, where applicable, it is to be understood that other similar embodiments can be used or modifications and additions can be made to the described embodiments for performing the same, similar, alternative, or substitute function of the disclosed subject matter without deviating therefrom. Therefore, the disclosed subject matter should not be limited to any single embodiment described herein, but rather should be construed in breadth and scope in accordance with the appended claims below.
[0092] As employed in the subject specification, the term processor can refer to substantially any computing processing unit or device comprising, but not limited to comprising, single-core processors; single-processors with software multithread execution capability; multi-core processors; multi-core processors with software multithread execution capability; multi-core processors with hardware multithread technology; parallel platforms; and parallel platforms with distributed shared memory. Additionally, a processor can refer to an integrated circuit, an application specific integrated circuit, a digital signal processor, a field programmable gate array, a programmable logic controller, a complex programmable logic device, a discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. Processors can exploit nano-scale architectures such as, but not limited to, molecular and quantum-dot based transistors, switches and gates, in order to optimize space usage or enhance performance of user equipment. A processor may also be implemented as a combination of computing processing units.
[0093] As used in this application, the terms component, system, platform, layer, selector, interface, and the like are intended to refer to a computer-related resource or an entity related to an operational apparatus with one or more specific functionalities, wherein the entity can be either hardware, a combination of hardware and software, software, or software in execution. As an example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration and not limitation, both an application running on a server and the server can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components may communicate via local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems via the signal). As another example, a component can be an apparatus with specific functionality provided by mechanical parts operated by electric or electronic circuitry, which is operated by a software or a firmware application executed by a processor, wherein the processor can be internal or external to the apparatus and executes at least a part of the software or firmware application. As yet another example, a component can be an apparatus that provides specific functionality through electronic components without mechanical parts, the electronic components can comprise a processor therein to execute software or firmware that confers at least in part the functionality of the electronic components.
[0094] In addition, the term or is intended to mean an inclusive or rather than an exclusive or. That is, unless specified otherwise, or clear from context, X employs A or B is intended to mean any of the natural inclusive permutations. That is, if X employs A; X employs B; or X employs both A and B, then X employs A or B is satisfied under any of the foregoing instances.
[0095] While the embodiments are susceptible to various modifications and alternative constructions, certain illustrated implementations thereof are shown in the drawings and have been described above in detail. It should be understood, however, that there is no intention to limit the various embodiments to the specific forms disclosed, but on the contrary, the intention is to cover all modifications, alternative constructions, and equivalents falling within the spirit and scope.
[0096] In addition to the various implementations described herein, it is to be understood that other similar implementations can be used or modifications and additions can be made to the described implementation(s) for performing the same or equivalent function of the corresponding implementation(s) without deviating therefrom. Still further, multiple processing chips or multiple devices can share the performance of one or more functions described herein, and similarly, storage can be effected across a plurality of devices. Accordingly, the various embodiments are not to be limited to any single implementation, but rather are to be construed in breadth, spirit and scope in accordance with the appended claims.