The field of the disclosure relates generally to communication systems and networks, and more particularly, to communications systems and networks employing non-orthogonal multiple access.
Conventional hybrid fiber-coaxial (HFC) architectures typically deploy fiber strands from an optical hub to a fiber node, and often many short coaxial or fiber strands to cover the shorter distances from the fiber nodes to a plurality of end users. Conventional Multiple Service Operators (MSOs) offer a variety of services, including analog/digital TV, video on demand (VoD), telephony, and high speed data internet, over these HFC networks, which utilize both optical fibers and coaxial cables, and which provide video, voice, and data services to the end user subscribers. HFC networks are known to include a master headend, and the optical fiber strands carry the optical signals between the headend, the hub, and the fiber node. Conventional HFC networks also typically include a plurality of coaxial cables to connect the fiber nodes to the respective end users, and to carry radio frequency (RF) modulated analog electrical signals.
The HFC fiber node converts optical analog signals from the optical fiber into the RF modulated electrical signals that are transported by the coaxial cables to the end users/subscribers. In the conventional HFC network, both the optical and electrical signals are analog, from the hub to the end user subscriber's home. Typically, a modem termination system (MTS) is located at either the headend or the hub, and provides complementary functionality to a modem of the respective end user.
The signal components of the conventional HFC fiber/coaxial cable links experience higher propagation attenuation at higher frequency. The attenuation increases over distance and this attenuation effect is particularly significant in coaxial cables. Thus, different users of the network will experience difference system performance at different distances from the fiber node, at different operation frequencies. Conventional HFC networks, however, implement orthogonal multiple access (OMA) techniques to allocate resources orthogonally in the frequency and time domains.
According to conventional OMA distribution 100, the OMA techniques of distribution 100 do not consider the respective variations experienced by users 102 according to the distance of a particular user 102 from the node, or the frequency slot at which that user 102 is operating. More particularly, the conventional OMA techniques do not optimize resource allocation based on these variations, thereby resulting in low spectral efficiency. Accordingly, it is desirable to provide techniques that consider the channel differences of different users and frequencies to optimize network resource allocation, and in an equitable manner, to increase the spectral efficiency and throughput of the network.
In an embodiment, a resource allocation method is provided for a non-orthogonal multiple access distribution of access network users communicatively coupled to a single transport medium. The method includes steps of allocating a first frequency and time domain resource to a first user and a second frequency and time domain resource to a second user of the access network users, obtaining channel information regarding a particular communication channel of the access network for which resources are allocated, grouping the first user with the second user based on an overlap of the first frequency and time domain resource with the second frequency and time domain resource, and assigning the first user to a different power allocation resource than the second user within the frequency and time domain overlap.
In an embodiment, a resource allocation method is provided for a non-orthogonal multiple access distribution of access network users communicatively coupled to a single transport medium. The method includes steps of allocating a first frequency and time domain resource to a first user and a second frequency and time domain resource to a second user of the access network users, obtaining channel information regarding a particular communication channel of the access network for which resources are allocated, grouping the first user with the second user based on an overlap of the first frequency and time domain resource with the second frequency and time domain resource, and assigning the first user to a different code allocation resource than the second user within the frequency and time domain overlap.
These and other features, aspects, and advantages of the present disclosure will become better understood when the following detailed description is read with reference to the accompanying drawings in which like characters represent like parts throughout the drawings, wherein:
Unless otherwise indicated, the drawings provided herein are meant to illustrate features of embodiments of this disclosure. These features are believed to be applicable in a wide variety of systems including one or more embodiments of this disclosure. As such, the drawings are not meant to include all conventional features known by those of ordinary skill in the art to be required for the practice of the embodiments disclosed herein.
In the following specification and the claims, reference will be made to a number of terms, which shall be defined to have the following meanings.
The singular forms “a,” “an,” and “the” include plural references unless the context clearly dictates otherwise.
“Optional” or “optionally” means that the subsequently described event or circumstance may or may not occur, and that the description includes instances where the event occurs and instances where it does not.
As used herein, the term “database” may refer to either a body of data, a relational database management system (RDBMS), or to both, and may include a collection of data including hierarchical databases, relational databases, flat file databases, object-relational databases, object oriented databases, and/or another structured collection of records or data that is stored in a computer system.
Furthermore, as used herein, the term “real-time” refers to at least one of the time of occurrence of the associated events, the time of measurement and collection of predetermined data, the time for a computing device (e.g., a processor) to process the data, and the time of a system response to the events and the environment. In the embodiments described herein, these activities and events occur substantially instantaneously.
Approximating language, as used herein throughout the specification and claims, may be applied to modify any quantitative representation that could permissibly vary without resulting in a change in the basic function to which it is related. Accordingly, a value modified by a term or terms, such as “about,” “approximately,” and “substantially,” are not to be limited to the precise value specified. In at least some instances, the approximating language may correspond to the precision of an instrument for measuring the value. Here and throughout the specification and claims, range limitations may be combined and/or interchanged; such ranges are identified and include all the sub-ranges contained therein unless context or language indicates otherwise.
The present embodiments advantageously improve over the conventional OMA techniques, described above, by implementing non-orthogonal multiple access (NOMA) to expand the channel resource space into a third dimension, namely, that of the power domain (i.e., PD-NOMA) and/or the code domain (i.e., CD-NOMA). The present systems and methods are therefore able to take the channel difference between different users and different frequencies into consideration, and then optimize the resource allocation of the network (e.g., an HFC network) in a more equitable manner. According to the techniques described herein, both the spectral efficiency and the throughput of the network are significantly increased, while also advantageously generating more use cases, and including more classes of users, than may be realized according to the conventional techniques.
In exemplary operation, process 300 begins at step 302, in which a frequency-time resource is allocated to a set of users 402 (
In step 306, based on the channel information, the set of users 402 are divided into groups. In an exemplary embodiment of step 306, each user group is formed of users that occupy the same two-dimensional frequency-time resource, but at a different power/code domain level. Accordingly, in some embodiments, each user 402 may belong to multiple groups at the same time (e.g., users 402(4), 402(5), 402(6)). In this case, different users 402 are capable of occupying different amounts of frequency-time resources, that is, different users may have different sizes and shapes of resource blocks 202. In an embodiment, user grouping may be performed according to criteria such as maximized capacity, system requirements satisfaction, service level agreement fulfillment, and present or dynamic traffic demands. In step 308, within each group, process 300 calculates the optimal power/code allocation among users 402.
For further ease of explanation, in this example, it is assumed that (1) capacity is the exemplary criterion used to determine the resource allocation in the power domain over a frequency-time slot, (2) the frequency-time slot is fixed by other preconditions or constraints of the overall allocation, (3) the frequency range of the given frequency-time slot is relatively small, (4) the total power for 402(1), 402(2) over the given frequency-time slot is fixed by other preconditions or constraints of the overall allocation (and is denoted as P), and (5) the channel is time-invariant. The person of ordinary skill in the art though, will understand that these assumptions are provided by way of example, and not in a limiting sense.
In the exemplary embodiment depicted in
In the example illustrated in
Assuming, for purposes of this description, that the additive white Gaussian noise (AWGN) channels and Gaussian noise have a power of N within the frequency slot fg at a receiver side of system 400, the spectral efficiency η of first user 402(1) and second user 402(2) within the frequency slot fg may be respectively represented by:
for first user 402(1)/user1, and by:
for second user 402(2)/user2, where a1=10{circumflex over ( )}(−A1/10), a2=10{circumflex over ( )}(−A2/10), P is the total power budget for both users at the transmitter side, and 0≤x≤1 is the proportion of power for first user 402(1). The total spectral efficiency ηtotal may then be represented as:
Accordingly, in the embodiments described above, including allocation process 300, system 400 is advantageously configured to enable maximization of η1, η2, and/or ηtotal according to a desired purpose of the system operator, and/or preconditions or constraints that may be placed on the system and its operation. In some embodiments, resource allocation may be further realized by adjusting value of x.
In an exemplary embodiment, the spectral efficiencies η1 and η2 are maximized for first user 402(1) and second user 402(2), respectively. Thus, by traversing the value x over [0, 1], an upper boundary curve 602 of (ƒ1, η2) may be derived for the PD-NOMA implementation. With respect to the exemplary embodiment depicted in
In an exemplary embodiment of technique 600, a constraint 606 of η1=η2 is applied, which intersects both curves 602, 604 at points C and D, respectively. Thus, when compared with OMA value (i.e., point D) of counterpart curve 604, the spectral efficiency of both η1 and η2 are improved for the PD-NOMA implementation (i.e., point C).
In this example, the respective resource blocks 202 of first and second users 402(1), 402(2) (i.e., user1 and user2) are assumed to occupy a total bandwidth of 20 MHz, and at a central frequency of 1 GHz after frequency-time allocation and user grouping. Referring back to
Accordingly, when compared with first user 402(2), second user 402(2) experiences higher attenuation at 1 GHz due to the fact that second user 402(1) is farther away from node 404. Thus, because first and second users 402(1), 402(2) share the same frequency resource (20 MHz, in this example), the relative capacity both users has a tradeoff relationship. As can be seen from the exemplary effect 800 depicted in
Accordingly, implementing OMA techniques, trade-off effect 800 demonstrates, in this simulation example, that 1001.2-1010 MHz is allocated to first user 402(1) and 990-1001.2 MHz is allocated to second user 402(2). However, in contrast, the implementation of PD-NOMA enables 6.41% of the total transmitted power to be allocated to first user 402(1) and 93.59% of the transmitted power to be allocated to second user 402(2).
Also similar to effect 800, effect 900 depicts an OMA curve 906 and a NOMA curve 908, and applies an equal capacity constraint 910 as a criterion. In this example, it may be seen that, at point 912 on NOMA curve 908, 11.9 Mbps (i.e. 21.8%) of higher capacity is realized in comparison with a corresponding equal-capacity point 914 on OMA curve 906. Additionally, implementing OMA techniques, 1001.2-1010 MHz is again allocated to first user 402(1) and 990-1001.2 MHz is again allocated to second user 402(2). However, in this example, the implementation of PD-NOMA enables 5% of the total transmitted power to be allocated to first user 402(1) and 95% of the transmitted power to be allocated to second user 402(2).
The present embodiments are described above with respect to HFC networks by way of example, and not in a limiting sense. The person of ordinary skill in the art will appreciate how the systems and methods described herein are also applicable to the optical fiber segments in the HFC network, as well as a passive optical network (PON) architecture that utilizes optical fiber segments in multiple fiber nodes at endpoints, which may be analogous to the various users described with respect to the present embodiments. The NOMA techniques described herein are also provided for illustrative purposes, but are not intended to be limiting. Other NOMA techniques, for example, may also be implemented within the scope of the present embodiments, including without limitation Multi-User Superposition Transmission (MUST), Sparse Code Multiple Access (SCMA), Pattern Division Multiple Access (PDMA), Lattice Partition Multiple Access (LPMA), and/or Multi-User Shared Access (MUSA).
The person of ordinary skill will further appreciate that the present techniques are generally applicable to access systems having a power domain and/or a code domain, and which adopt non-orthogonal signal space in an HFC network. As featured above, the principles of the present systems and methods are described with respect to two users separated in the power/code domain. Nevertheless, the person of ordinary skill in the art will appreciate that these principles apply in the case of more than two users separated in the power/code domains. It will further be appreciated, from the description herein and the accompanying drawings, that the present techniques for optimizing the power/code domains are not exclusive of optimization techniques for the frequency and time domains. That is, the present embodiments may be employed as joint allocation and/or joint optimization techniques for the power/code domain in a complementary and/or simultaneous fashion with allocation/optimization techniques of the frequency and time domains.
Exemplary embodiments of systems and methods for optimizing non-orthogonal multiple access are described above in detail. The systems and methods of this disclosure though, are not limited to only the specific embodiments described herein, but rather, the components and/or steps of their implementation may be utilized independently and separately from other components and/or steps described herein.
Although specific features of various embodiments of the disclosure may be shown in some drawings and not in others, this is for convenience only. In accordance with the principles of the disclosure, a particular feature shown in a drawing may be referenced and/or claimed in combination with features of the other drawings.
Some embodiments involve the use of one or more electronic or computing devices. Such devices typically include a processor or controller, such as a general purpose central processing unit (CPU), a graphics processing unit (GPU), a microcontroller, a reduced instruction set computer (RISC) processor, an application specific integrated circuit (ASIC), a programmable logic circuit (PLC), a field programmable gate array (FPGA), a DSP device, and/or any other circuit or processor capable of executing the functions described herein. The processes described herein may be encoded as executable instructions embodied in a computer readable medium, including, without limitation, a storage device and/or a memory device. Such instructions, when executed by a processor, cause the processor to perform at least a portion of the methods described herein. The above examples are exemplary only, and thus are not intended to limit in any way the definition and/or meaning of the term “processor.”
This written description uses examples to disclose the embodiments, including the best mode, and also to enable any person skilled in the art to practice the embodiments, including making and using any devices or systems and performing any incorporated methods. The patentable scope of the disclosure is defined by the claims, and may include other examples that occur to those skilled in the art. Such other examples are intended to be within the scope of the claims if they have structural elements that do not differ from the literal language of the claims, or if they include equivalent structural elements with insubstantial differences from the literal language of the claims.
This application is a continuation of U.S. patent application Ser. No. 16/729,960, filed Dec. 30, 2019. U.S. patent application Ser. No. 16/729,960 is a continuation of U.S. patent application Ser. No. 16/180,912, filed Nov. 5, 2018, now U.S. Pat. No. 10,523,324, issued on Dec. 31, 2019. U.S. patent application Ser. No. 16/180,912 claims the benefit of and priority to U.S. Provisional Patent Application Ser. No. 62/581,339, filed Nov. 3, 2017. All of these prior applications are incorporated herein by reference in their entireties.
Number | Name | Date | Kind |
---|---|---|---|
10523324 | Cheng | Dec 2019 | B2 |
20180254807 | Takeda | Sep 2018 | A1 |
Number | Date | Country | |
---|---|---|---|
62581339 | Nov 2017 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16729960 | Dec 2019 | US |
Child | 17201452 | US | |
Parent | 16180912 | Nov 2018 | US |
Child | 16729960 | US |