COOPERATIVE LEARNING METHOD AND APPARATUS FOR POWER ALLOCATION IN DISTRIBUTED MULTIPLE INPUT AND MULTIPLE OUTPUT SYSTEM

Abstract

A method for power allocation in a dAP may comprise: when a change cycle of a transmit power determination vector arrives, generating an uplink message including long-term CSI, the uplink message being normalized such that the long-term local CSI becomes a value within a preconfigured limit range; transmitting the uplink message to a central processing unit through a fronthaul; receiving a downlink message vector for power allocation from the central processing unit through the fronthaul; generating decentralized determination information using the downlink message vector; and extracting a transmit power determination vector based on the decentralized determination information.

Claims

1. A method for power allocation in a distributed access point (dAP), comprising: when a change cycle of a transmit power determination vector arrives, generating an uplink message including long-term local channel state information (CSI), the uplink message being normalized such that the long-term local CSI becomes a value within a preconfigured limit range; transmitting the uplink message to a central processing unit through a fronthaul; receiving a downlink message vector for power allocation from the central processing unit through the fronthaul; generating decentralized determination information using the downlink message vector; and extracting a transmit power determination vector based on the decentralized determination information, wherein the decentralized determination information includes an output vector for generating a local power allocation value and a variable for the dAP.

2. The method according to claim 1, further comprising: extracting power allocation information corresponding to each of terminals based on the decentralized determination information; determining a transmit power for a channel transmitted to each of the terminals based on the power allocation information; and communicating with each of the terminals by using the determined transmit power.

3. The method according to claim 2, wherein the transmit power for the channel transmitted to each of the terminals is determined by a third preconfigured deep neural network (DNN).

4. The method according to claim 1, wherein the long-term local CSI is calculated based on channel state information and a long-term path loss with each of communicating terminals.

5. The method according to claim 1, wherein the normalized uplink message has a length preset by the central processing unit.

6. The method according to claim 1, wherein the normalized uplink message is generated by a first preconfigured DNN.

7. The method according to claim 1, wherein the change cycle of the transmit power determination vector is determined based on a channel change cycle between a terminal and the dAP.

8. The method according to claim 1, wherein the change cycle of the transmit power determination vector is preset by the central processing unit.

9. The method according to claim 1, wherein the change cycle of the transmit power determination vector is determined differently for each group based on a movement speed of terminals communicating within the dAP.

10. A method of a central processing unit, comprising: when an update cycle of a downlink message arrives, receiving uplink messages corresponding to long-term local channel state information (CSI) respectively from two or more distributed access points (dAPs) communicating with terminals through a fronthaul; generating one downlink message based on a pooling operation on the received uplink messages; and transmitting the downlink message to the dAPs, wherein each of the uplink messages is information normalized to a value within a preconfigured limit range.

11. The method according to claim 10, wherein the one downlink message is generated by a preconfigured second deep neural network (DNN).

12. The method according to claim 10, further comprising: configuring length information of the uplink message to each of the dAPs.

13. The method according to claim 10, wherein the central processing unit is an open-radio access network (O-RAN) central unit (CU) of an O-RAN system.

14. The method according to claim 10, wherein the update cycle of the downlink message is determined based on channel state change information received from each of the dAPs.

15. The method according to claim 14, further comprising: transmitting information on the update cycle of the downlink message to each of the dAPs.

16. A distributed access point (dAP) comprising a processor, wherein the processor causes the dAP to perform: when a change cycle of a transmit power determination vector arrives, generating an uplink message including long-term local channel state information (CSI), the uplink message being normalized such that the long-term local CSI becomes a value within a preconfigured limit range; transmitting the uplink message to a central processing unit through a fronthaul; receiving a downlink message vector for power allocation from the central processing unit through the fronthaul; generating decentralized determination information using the downlink message vector; and extracting a transmit power determination vector based on the decentralized determination information, wherein the decentralized determination information includes an output vector for generating a local power allocation value and a variable for the dAP.

17. The dAP according to claim 16, wherein the processor further causes the dAP to perform: extracting power allocation information corresponding to each of terminals based on the decentralized determination information; determining a transmit power for a channel transmitted to each of the terminals based on the power allocation information; and communicating with each of the terminals by using the determined transmit power.

18. The dAP according to claim 17, wherein the transmit power for the channel transmitted to each of the terminals is determined by a third preconfigured deep neural network (DNN).

19. The dAP according to claim 16, wherein the long-term local CSI is calculated based on channel state information and a long-term path loss with each of communicating terminals.

20. The dAP according to claim 11, wherein the normalized uplink message has a length preset by the central processing unit.

Description

BRIEF DESCRIPTION OF DRAWINGS

[0030] FIG. 1 is a conceptual diagram illustrating a transmission structure of a distributed MIMO system.

[0031] FIG. 2A is a flowchart for cooperative learning with CPU at dAP according to an exemplary embodiment of the present disclosure.

[0032] FIG. 2B is a flowchart for cooperative learning with each dAP at CPU according to an exemplary embodiment of the present disclosure.

[0033] FIG. 3A is a conceptual diagram for describing a structure of an uplink fronthaul cooperation message generation operator DNN among the cooperative learning operation functions according to the present disclosure.

[0034] FIG. 3B is a conceptual diagram for describing a structure of a downlink fronthaul cooperation message generation operator DNN among the cooperative learning operation functions according to the present disclosure.

[0035] FIG. 3C is a conceptual diagram for describing a structure of a distributed power allocation determination operator DNN among the cooperative learning operation functions according to the present disclosure.

[0036] FIG. 4 is a conceptual diagram for describing a cooperative learning-based power allocation deep neural network structure according to an exemplary embodiment of the present disclosure.

[0037] FIG. 5 is a conceptual diagram of an open RAN system configuration to which a cooperative learning-based DNN according to the present disclosure is applied.

[0038] FIG. 6 is a conceptual diagram illustrating block configuration of a device according to an exemplary embodiment of the present disclosure.

DETAILED DESCRIPTION OF THE EMBODIMENTS

[0039] Since the present disclosure may be variously modified and have several forms, specific exemplary embodiments will be shown in the accompanying drawings and be described in detail in the detailed description. It should be understood, however, that it is not intended to limit the present disclosure to the specific exemplary embodiments but, on the contrary, the present disclosure is to cover all modifications and alternatives falling within the spirit and scope of the present disclosure.

[0040] Relational terms such as first, second, and the like may be used for describing various elements, but the elements should not be limited by the terms. These terms are only used to distinguish one element from another. For example, a first component may be named a second component without departing from the scope of the present disclosure, and the second component may also be similarly named the first component. The term and/or means any one or a combination of a plurality of related and described items.

[0041] When it is mentioned that a certain component is coupled with or connected with another component, it should be understood that the certain component is directly coupled with or connected with to the other component or a further component may be disposed therebetween. In contrast, when it is mentioned that a certain component is directly coupled with or directly connected with another component, it will be understood that a further component is not disposed therebetween.

[0042] The terms used in the present disclosure are only used to describe specific exemplary embodiments, and are not intended to limit the present disclosure. The singular expression includes the plural expression unless the context clearly dictates otherwise. In the present disclosure, terms such as comprise or have are intended to designate that a feature, number, step, operation, component, part, or combination thereof described in the specification exists, but it should be understood that the terms do not preclude existence or addition of one or more features, numbers, steps, operations, components, parts, or combinations thereof.

[0043] Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs. Terms that are generally used and have been in dictionaries should be construed as having meanings matched with contextual meanings in the art. In this description, unless defined clearly, terms are not necessarily construed as having formal meanings.

[0044] A communication system to which exemplary embodiments according to the present disclosure are applied will be described. The communication system to which the exemplary embodiments according to the present disclosure are applied is not limited to the contents described below, and the exemplary embodiments according to the present disclosure may be applied to various communication systems. Here, the communication system may have the same meaning as a communication network.

[0045] Throughout the present disclosure, a network may include, for example, a wireless Internet such as wireless fidelity (WiFi), mobile Internet such as a wireless broadband Internet (WiBro) or a world interoperability for microwave access (WiMax), 2G mobile communication network such as a global system for mobile communication (GSM) or a code division multiple access (CDMA), 3G mobile communication network such as a wideband code division multiple access (WCDMA) or a CDMA2000, 3.5G mobile communication network such as a high speed downlink packet access (HSDPA) or a high speed uplink packet access (HSUPA), 4G mobile communication network such as a long term evolution (LTE) network or an LTE-Advanced network, 5G mobile communication network, or the like.

[0046] Throughout the present disclosure, a terminal may refer to a mobile station, mobile terminal, subscriber station, portable subscriber station, user equipment, access terminal, or the like, and may include all or a part of functions of the terminal, mobile station, mobile terminal, subscriber station, mobile subscriber station, user equipment, access terminal, or the like.

[0047] Here, a desktop computer, laptop computer, tablet PC, wireless phone, mobile phone, smart phone, smart watch, smart glass, e-book reader, portable multimedia player (PMP), portable game console, navigation device, digital camera, digital multimedia broadcasting (DMB) player, digital audio recorder, digital audio player, digital picture recorder, digital picture player, digital video recorder, digital video player, or the like having communication capability may be used as the terminal.

[0048] Throughout the present disclosure, the base station may refer to an access point, radio access station, node B (NB), evolved node B (eNB), base transceiver station, mobile multihop relay (MMR)-BS, or the like, and may include all or part of functions of the base station, access point, radio access station, NB, eNB, base transceiver station, MMR-BS, or the like.

[0049] Hereinafter, preferred exemplary embodiments of the present disclosure will be described in more detail with reference to the accompanying drawings. In describing the present disclosure, in order to facilitate an overall understanding, the same reference numerals are used for the same elements in the drawings, and redundant descriptions for the same elements are omitted.

[0050] FIG. 1 is a conceptual diagram illustrating a transmission structure of a distributed MIMO system.

[0051] Referring to FIG. 1, a plurality of terminals 101, 102, . . . and 103 may communicate with a plurality of dAPs 111, 112, . . . , and 113. The dAPs 111, 112, . . . , and 113 may be connected to a CPU 121 through a fronthaul network.

[0052] It is assumed that the distributed MIMO system illustrated in FIG. 1 includes one CPU 121, M dAPs 111, 112, . . . , and 113, and K terminals 101, 102, . . . , and 103. The CPU 121 of the distributed MIMO system may provide services simultaneously to K terminals 101, 102, . . . , and 103 through M dAPs 111, 112, . . . , and 113. In other words, as shown by dotted arrows in FIG. 1, the M dAPs 111, 112, . . . , and 113 may perform downlink transmission of a multi-user beamforming system that simultaneously serves K terminals 101, 102, . . . , and 103.

[0053] In the present disclosure, for convenience of description, it is assumed that each of the dAPs 111, 112, . . . , and 113 has a single antenna. However, each of the M dAPs 111, 112, . . . , and 113 and the K terminals 101, 102, . . . , and 103 may have a plurality of antennas. In this case, the number of antennas or antenna panels may be two or more, and all of the M dAPs 111, 112, . . . , and 113 may have the same number of antennas or antenna panels. As another example, each of the M dAPs 111, 112, . . . , and 113 may have a different number of antennas or a different number of antenna panels. The K terminals 101, 102, . . . , and 103 may all have the same number of antennas, or each of the K terminals 101, 102, . . . , and 103 may have a different number of antennas.

[0054] In addition, for convenience of description, it is assumed that the maximum transmit power of each of the dAPs 111, 112, . . . , and 113 has the same value of P, and a fronthaul link between the CPU 121 and each of the dAPs 111, 112, . . . , and 113 also has the same limited capacity. However, the present disclosure is not limited thereto, and based on the description below, a transmit power of each of the dAPs 111, 112, . . . , and 113 may have a different value. In addition, the fronthaul link capacity between each the dAPs 111, 112, . . . , and 113 and the CPU 121 may be configured to a different value. For example, the fronthaul link capacities configured to different values may mean that a fronthaul link capacity between the first dAP 111 and the CPU 121 is configured to a first value, and the fronthaul link capacity between the second dAP 112 and the CPU 121 is configured to a second value different from the first value.

[0055] In the configuration of FIG. 1, an index set of the dAPs 111, 112, . . . , and 113 may be defined as Equation 1 below, and an index set of the terminals 101, 102, . . . , and 103 may be defined as Equation 2 below.

[00001]$\begin{array}{cc}?\stackrel{?}{=}\left\{1,2,.Math.,M\right\}& \left[\mathrm{Equation}1\right]\end{array}$$\begin{array}{cc}?\stackrel{?}{=}\left\{1,2,.Math.,K\right\}& \left[\mathrm{Equation}2\right]\end{array}$

[0056] In Equation 1 and Equation 2, M may correspond to the number of dAPs, and K may correspond to the number of terminals.

[0057] When channel coefficients between the m-th dAP and the k-th terminal are h.sub.k,m, the channel coefficients may usually follow a distribution of h.sub.k,m?(0, ?.sub.k,m) based on Gaussian noises, and a long-term path loss of a link between the m-th dAP and the k-th terminal may be expressed as Equation 3 below.

[00002]$\begin{array}{cc}{?}_{k,m}\stackrel{?}{=}?\left[{.Math.h_{k,m}.Math.}^2\right]& \left[\mathrm{Equation}3\right]\end{array}$

[0058] Using a standard channel acquisition process, actual local channel state information (CSI) for each of the dAPs 111, 112, . . . , and 113 may be obtained as Equation 4 below, and an estimate of the local CSI may be obtained as Equation 5 below. A value of Equation 5 may be a short-term local CSI estimate or a short-term CSI estimate.

[00003]$\begin{array}{cc}{h}_m\stackrel{?}{=}{\left\{h_{k,m}\right\}}_{k??}& \left[\mathrm{Equation}4\right]\end{array}$$\begin{array}{cc}{\stackrel{?}{h}}_m\stackrel{?}{=}{\left\{{\stackrel{?}{h}}_{k,m}\right\}}_{k??}& \left[\mathrm{Equation}5\right]\end{array}$

[0059] In Equation 5, ?.sub.k,m may be modeled as in Equation 6 below.

[00004]$\begin{array}{cc}{h}_{k,m}={\stackrel{?}{h}}_{k,m}+e_{k,m}& \left[\mathrm{Equation}6\right]\end{array}$

[0060] In Equation 6, e.sub.k,m is a channel estimation error. When using a linear MMSE estimator, e.sub.k,m is independent of ?.sub.k,m. ?.sub.k,m and e.sub.k,m follow distributions shown in Equation 7 below, respectively.

[00005]$\begin{array}{cc}{\stackrel{?}{h}}_{k,m}?\left(0,\left(1-?\right){?}_{k,m}\right)\mathrm{and}{e}_{k,m}?\left(0,{\mathrm{??}}_{k,m}\right)& \left[\mathrm{Equation}7\right]\end{array}$

[0061] In Equation 7, ? has a value of [0,1] and represents an error rate. The error rate may depend on a signal to noise ratio (SNR) of a pilot symbol. Therefore, the error rate may be regarded as an arbitrary value that changes dynamically depending on a propagation environment. In addition, statistics on the channel coefficients may be obtained through mathematical channel modeling or may be obtained from channel big data obtained from an actual system.

[0062] In case of centralized interference management, the local CSI estimate needs to be shared with the CPU 121 through fronthaul coordination. However, these frequent updates of short-term CSIs result in significant fronthauling overhead. As an example of solutions to reduce the fronthaul overhead may be that each of the dAPs 111, 112, . . . , and 113 delivers its local long-term CSI to the CPU 121. Here, the local long-term CSI may be expressed as Equation 8 below.

[00006]$\begin{array}{cc}{?}_m={\left\{{?}_{k,m}\right\}}_{k??}& \left[\mathrm{Equation}8\right]\end{array}$

[0063] By having each of the dAPs 111, 112, . . . , and 113 deliver its local long-term CSI to the CPU 121, the CPU 121 can reduce signaling overhead in fronthaul coordination. In addition, the CPU 121 can mitigate interference between users by using long-term fading.

[0064] The m-th dAP may calculate a beam-direction setting precoding w.sub.k,m for the k-th terminal using only its local CSI. In general, as a precoding scheme using local CSI, a conjugate beamforming (hereinafter CB) scheme and a local regularized zero forcing (hereinafter L-RZF) scheme may be used, and these are calculated using Equation 9 below.

[00007]$\begin{array}{cc}{w}_{k,m}=\{\begin{array}{cc}\frac{{\stackrel{?}{h}}_{k,m}^{*}}{.Math.{\stackrel{?}{h}}_{k,m}^{*}.Math.},& \mathrm{CB}\\ \frac{{\stackrel{?}{h}}_{k,m}^{*}}{{.Math.{\stackrel{?}{h}}_{k,m}^{*}.Math.}^2+1}/\sqrt{?\left\{\frac{{.Math.{\stackrel{?}{h}}_{k,m}^{*}.Math.}^2}{{\left({.Math.{\stackrel{?}{h}}_{k,m}^{*}.Math.}^2+1\right)}^2}\right\},}& L-\mathrm{RZF}\end{array}& \left[\mathrm{Equation}9\right]\end{array}$

[0065] A transmit signal x.sub.m of the m-th dAP may be expressed as Equation 10 below.

[00008]$\begin{array}{cc}{x}_m={.Math.}_{k??}\sqrt{p_{k,m}}{w}_{k,m}{s}_k,m??& \left[\mathrm{Equation}10\right]\end{array}$

[0066] In Equation 10, s.sub.k may represent a data symbol for the k-th terminal, and p.sub.k,m may represent a transmit power allocated to transmit s.sub.k by the m-th AP. A total transmit power of the m-th dAP may be defined as Equation 11 below.

[00009]$\begin{array}{cc}{P}_m\stackrel{?}{=}{\left\{p_{k,m}\right\}}_{k??}& \left[\mathrm{Equation}11\right]\end{array}$

[0067] This may depend on the maximum power P per dAP, such as ?{square root over (p.sub.k,m)}?P, m?. An achievable data rate R.sub.k of the k-th terminal may be expressed as Equation 12 below.

[00010]$\begin{array}{cc}{R}_k\left(\stackrel{?}{h},e,p\right)={\log }_2\left(1+{\mathrm{SINR}}_k\left(\stackrel{?}{h},e,p\right)\right)& \left[\mathrm{Equation}12\right]\end{array}$

[0068] In Equation 12, an index set of the local CSI estimates for the m-th dAP may be ??, an index set of channel estimation errors for the m-th dAP may be e?, and an index set of the maximum powers for the m-th dAP may be p?. A signal to interference plus noise ratio (SNIR) for the k-th terminal may be defined as in Equation 13 below.

[00011]$\begin{array}{cc}\begin{array}{c}{\mathrm{SINR}}_k\left(\stackrel{?}{h},e,p\right)=\frac{{.Math.{.Math.}_{m??}{h}_{k,m}{x}_m.Math.}^2}{1+{.Math.}_{i???\left\{k\right\}}{.Math.{.Math.}_{m??}{h}_{k,m}{x}_i.Math.}^2}\\ =\frac{{.Math.{.Math.}_{m?M}\left({\stackrel{?}{h}}_{k,m}+e_{k,m}\right)w_{k,m}\sqrt{p_{k,m}}.Math.}^2}{1+{.Math.}_{i???\left\{k\right\}}{.Math.{.Math.}_{m?M}\left({\stackrel{?}{h}}_{k,m}+e_{k,m}\right)w_{k,m}\sqrt{p_{i,m}}.Math.}^2}\end{array}& \left[\mathrm{Equation}13\right]\end{array}$

[0069] In the present disclosure, a network utility function U(?, e, p) needs to be maximized by optimizing the transmit power p with respect to channel statistics (?, e, ?). Popular choices for the network utility function U() may be a sum-rate (SR), minimum-rate (MR), or proportional-fairness (PF), each of which may be expressed as Equation 14 to Equation 16.

[00012]$\begin{array}{cc}{U}_{\mathrm{SR}}(.Math.)={.Math.}_{k??}{R}_k\left(\stackrel{?}{h},e,p\right)& \left[\mathrm{Equation}14\right]\end{array}$$\begin{array}{cc}{U}_{\mathrm{MR}}(.Math.)=\underset{k??}{\min }{R}_k\left(\stackrel{?}{h},e,p\right)& \left[\mathrm{Equation}15\right]\end{array}$$\begin{array}{cc}{U}_{\mathrm{PF}}(.Math.)={.Math.}_{k??}\ln R_k\left(\stackrel{?}{h},e,p\right)& \left[\mathrm{Equation}16\right]\end{array}$

[0070] In other words, Equation 14 represents a case of maximizing the network utility function U() using the sum-rate (SR), Equation 15 represents a case of maximizing the network utility function U() using the minimum rate (MR), and Equation 16 represents a case of maximizing the network utility function U() using the proportional-fairness (PF).

[0071] Accordingly, the optimization problem for maximizing the network utility may be expressed as Equation 17 below.

[00013]$\begin{array}{cc}\underset{p}{\max }{?}_{\stackrel{?}{h},e,p}U.\left(R_k\left(\stackrel{?}{h},e,p\right)\right)& \left[\mathrm{Equation}17\right]\end{array}$$s.t.{.Math.}_{k??}\sqrt{p_{k,m}}?P,m??$

[0072] In the following description, for convenience of description, the first row (top line) of Equation 17 will be described as Equation 17a, and the second row (bottom line) of Equation 17 will be described as Equation 17b.

[0073] Equation 17 is generally nonconvex. Therefore, it is not easy to obtain a globally optimal solution therefor. An expected value for a randomly distributed CSI (?, e, ?) has no analytical formula. This makes it difficult to apply traditional nonconvex optimization techniques. Methods known to date propose a traceable closed-form approximation for an utility based on an average transmission rate. According to the approximation method, all short-term fading coefficients may be simply removed using Jensen's inequality, which leads to model mismatch between a transmission rate and its approximated value. In addition, since the representation of the approximated rate relies only on long-term channel statistics, there is no room to utilize short-term CSI in optimizing power control parameters. Moreover, the individually deployed dAPs 111, 112, . . . , and 113 require a new decentralized calculation structure.

[0074] Each of the dAP 111, 112, . . . , and 113 may need to infer its local power allocation solution p.sub.m based only on partial network knowledge, that is, the local CSI vectors ?.sub.m and ?.sub.m. Such partial observations are insufficient to individually recover the optimal solution of Equation 17. Therefore, interaction between the dAPs 111, 112, . . . , and 113 may be essential to configure effective power control schemes.

[0075] The present disclosure proposes a low-complexity solution to Equation 17 described above using deep learning technology. In addition, as described above, there is no optimal solution to Equation 17. Therefore, in the present disclosure, instead of adopting supervised learning methods, a method for identifying an unsupervised deep learning framework is used. This can be implemented even without knowledge of the optimal solution to Equation 17.

[0076] In the present disclosure, the original problem presented in Equation 17 is transformed into a functional optimization problem to be suitable for generalized learning. According to this transformation, the targets of optimization may be transformed into a function representative of the optimization procedure. An arbitrary problem with specified inputs and outputs can be refined into functional optimization tasks.

[0077] In addition, Equation 17 may be regarded as a procedure for identifying a solution p for arbitrarily given channel statistics (?, e, ?) and system parameter P. This input-output relationship may be captured by a functional operator p=(?, ?, P). By applying the functional operator to Equation 17 described above, functional optimization expressed as Equation 18 below may be obtained.

[00014]$\begin{array}{cc}\underset{?(.Math.)}{\max }{?}_{\stackrel{?}{h},e,p}U.\left(\stackrel{?}{h},e,?\left(\stackrel{?}{h},?,P\right)\right)s.t.{.Math.}_{k??}\sqrt{p_{k,m}}?P,m??& \left[\mathrm{Equation}18\right]\end{array}$

[0078] In the following description, for convenience of description, the first row (top line) of Equation 18 will be described as Equation 18a, and the second row (bottom line) of Equation 18 will be described as Equation 18b. In addition, it can be seen that Equation 18b is the same as Equation 17b described above.

[0079] As a result, by solving Equation 18, a general mapping rule (?) for an arbitrarily given input {?, e, ?, P} may be obtained.

[0080] In the present disclosure, the operator (?), which is the mapping rule, may be designed through cooperation between the CPU 121 and the dAPs 111, 112, . . . , and 113, so that computing powers and short-term CSIs of the dAPs 111, 112, . . . , and 113 can be utilized maximally while minimizing the fronthaul overhead.

[0081] For this purpose, the operator (?), which is the mapping rule, may be divided into an uplink fronthaul cooperation message generation operator (?) and a distributed power allocation determination operator (?) performed in each dAP, and a downlink fronthaul cooperation message generation operator (?) performed in the CPU. Each of these operators may refer to processing of a deep neural network (DNN) illustrated in FIGS. 3A to 3C, which will be further described with reference to FIGS. 2A and 2B and FIGS. 3A to 3C.

[0082] FIG. 2A is a flowchart for cooperative learning with CPU at dAP according to an exemplary embodiment of the present disclosure, and FIG. 2B is a flowchart for cooperative learning with each dAP at CPU according to an exemplary embodiment of the present disclosure.

[0083] Operations of FIG. 2A described below may be performed by all of the dAPs 111, 112, . . . , and 113 described in FIG. 1, and operations of FIG. 2B may be performed by the CPU 121 having the configuration of FIG. 1. In addition, dotted lines in FIG. 2A illustrate cases where the dAP transmits/receives a message (or signal or information) with the CPU 121, and dotted lines in FIG. 2B illustrate cases where the CPU 121 transmits/receives a message (or signal or information) with the dAP.

[0084] In the following description, when describing operations of the dAP with reference to FIG. 2A, the corresponding operation of the CPU 121 will be described with reference to FIG. 2B as a message (or signal or information) is transmitted to the CPU 121, as shown by the dotted line. Additionally, when describing operations of the CPU with reference to FIG. 2B, the corresponding operation of the dAP will be described with reference to FIG. 2A as a message (or signal or information) is transmitted to the dAP, as shown by the dotted line.

[0085] In the following description, the dAP will be described as representing a specific dAP. However, it should be noted that the dAP described below and all dAPs illustrated in FIG. 1 perform the same operations. However, a timing of the operation may be an appropriate time for each dAP.

[0086] The CPU 121 may need to collect local information from the dAPs for uplink fronthaul cooperation. Therefore, the CPU 121 may instruct the dAPs 111, 112, . . . , and 113 to perform the operation of FIG. 2A before performing the operation of FIG. 2A. As another example, each of the dAPs 111, 112, . . . , and 113 may be configured in advance to perform the operation of FIG. 2A. As another example, it may be promised that the operation of FIG. 2A is to be performed through signaling between the CPU 121 and the dAPs 111, 112, . . . , and 113.

[0087] In describing with reference to FIG. 2A, it should be noted that the dAP is assumed to be an arbitrary m-th dAP.

[0088] Referring to FIG. 2A, in step S210, as preprocessing, the m-th dAP may calculate input characteristics defined as Equation 19 as in Equation 20 below.

[00015]$\begin{array}{cc}{?}_m^{}\stackrel{?}{=}{\left\{{?}_{k,m}^{}\right\}}_{k??}& \left[\mathrm{Equation}19\right]\end{array}$$\begin{array}{cc}{?}_{k,m}^{}=\sqrt{P}\frac{\sqrt{{?}_{k,m}}}{{.Math.}_{i??}\sqrt{{?}_{i,m}}}& \left[\mathrm{Equation}20\right]\end{array}$

[0089] First, in Equation 19, ?.sub.m may be input characteristics for the m-th dAP, and may mean information (or value) on a path loss between the k-th terminal and the m-th dAP.

[0090] In Equation 20, data preprocessing may be performed so that the input characteristics, a result of normalizing the long-term local CSI ?.sub.m, are located within a limited region or have a value within a limited range as shown in Equation 21 below.

[00016]$\begin{array}{cc}{?}_{k,m}^{}?\left[0,\sqrt{P}\right]& \left[\mathrm{Equation}21\right]\end{array}$

[0091] In step S212, the m-th dAP may generate an uplink message having a length .sub.U as shown in Equation 22 below by using the input characteristics on which the preprocessing operation of step S210 has been performed as shown in Equation 19. In this case, the length of the uplink message may be a predetermined length. The predetermined length value may be a length agreed with the CPU 121 or a length indicated (or set) by the CPU 121. By setting the length of the uplink message to a specific value, learning may be performed without changing the size of DNNs described in FIGS. 3A to 3C even when the number of dAPs changes. Therefore, although not illustrated in FIGS. 2A and 2B, the procedure for indicating or setting the length of the uplink message may be performed in advance.

[00017]$\begin{array}{cc}{\mathrm{um}}_m=V_m\left({?}_m^{};{?}_{v_m}\right)& \left[\mathrm{Equation}22\right]\end{array}$

[0092] The uplink message um.sub.m in Equation 22 may have a relationship shown in Equation 23.

[00018]$\begin{array}{cc}{\mathrm{um}}_m?{?}^{{?}_U}& \left[\mathrm{Equation}23\right]\end{array}$

[0093] In Equation 22, may be implemented using parameters trainable in the m-th dAP. Here, when the operation of the dAP is implemented using DNN(s), the trainable parameters may mean connection weights between nodes constituting the respective layers described below. As in Equation 22, the m-th dAP belonging to the total M dAPs may use a dedicated individual operator . However, this scheme lacks flexibility for the number M of dAPs. In other words, there is a problem that a group of operators implemented based on the specific total number M of the dAPs cannot be applied equally to networks with different number of dAPs.

[0094] Due to this problem, networks with a variable number of dAPs may need to implement multiple operators for all possible distributed MIMO configurations. In other words, there is a problem of having to implement a plurality of operators in advance in various forms to determine which operator to use based on the number of dAPs in the distributed MIMO network where the dAPs are deployed.

[0095] To solve this problem, the present disclosure proposes to adopt a scalable architecture in which operator implementation is independent of the number M of APs. In other words, all dAPs reuse the same operator as shown in Equation 24 below to realize the corresponding uplink message generation inference.

[00019]$\begin{array}{cc}v\left(.Math.;{?}_v\right)& \left[\mathrm{Equation}24\right]\end{array}$

[0096] When using the operator of Equation 24, the uplink message um.sub.m generated by the dAP may be modified as Equation 25 below instead of Equation 22.

[00020]$\begin{array}{cc}{\mathrm{um}}_m=v\left(p_m^{};{?}_v\right)& \left[\mathrm{Equation}25\right]\end{array}$

[0097] Accordingly, the m-th dAP according to the present disclosure may generate the uplink message as exemplified in Equation 25 using trainable parameters that can be used regardless of the number of dAPs, as shown in Equation 25 in step S212. In this case, the length of the uplink message may be set to the length described above. From Equation 25, it can be seen that the operator has no dependence on m. This allows the same operator to be used in all dAPs, and the output uplink message may vary depending on the input of the operator. As a result, since the operator is replaced by a neural network, there is an advantage in that the same neural network can be used for all dAPs regardless of the number of dAPs.

[0098] In step S214, the m-th dAP may deliver the uplink message generated as shown in Equation 25 to the CPU 121 through a fronthaul link.

[0099] Steps S210 to S214 described above may be performed in all dAPs as described above.

[0100] Then, the operations performed by the CPU 121 will be described below with reference to FIG. 2B.

[0101] In step S240, the CPU 121 may receive the uplink messages um.sub.m from the M dAPs 111, 112, . . . , and 113. In this case, the CPU 121 may calculate the uplink messages um.sub.m received from all dAPs as one uplink message as shown in Equation 26 below based on pooling.

[00021]$\begin{array}{cc}\mathrm{um}=\frac{{.Math.}_{m??}{\mathrm{um}}_m}{M}& \left[\mathrm{Equation}26\right]\end{array}$

[0102] The operation of Equation 26 may use a superposition coding concept of a non-orthogonal multiple access system. Through this, unnecessary statistics may be removed and important uplink message characteristics um may be extracted from individual dAP message vectors without changing the message length. As a result, dimension-independent fronthaul cooperation can be effectively utilized.

[0103] In step S242, the CPU 121 may use the operator of the CPU 121 with the parameter set to convert the pooled information vector into an output (i.e. downlink message with a length of .sub.dn). Here, the parameter set may mean weights for the connections between nodes included in the respective layers constituting the DNN of the CPU 121. Therefore, the parameter set may be updated when the DNN is trained. In the present disclosure, further description on a learning procedure for the DNNs will be omitted. The configuration (structure) of the DNNs will be described with reference to FIGS. 3A to 3C below. Based on the above description, the operations of the operator may actually correspond to the operations of the DNN processing input data by weights (or parameter set) and outputting it.

[0104] In addition, since the length of the uplink message is determined to be a specific value as described above, the length of the downlink message may also be determined to be a specific value. In other words, since one downlink message is generated by performing a pooling operation on the uplink messages, the downlink message may also have a specific length. For example, the downlink message may have the same length as the uplink message.

[0105] In addition, the pooled information vector may be exemplified as shown in Equation 27 below, and the downlink message may have a relationship as shown in Equation 28 below.

[00022]$\begin{array}{cc}\mathrm{um}?{?}^{{?}_{\mathrm{up}}}& \left[\mathrm{Equation}27\right]\end{array}$$\begin{array}{cc}\mathrm{dm}?{?}^{{?}_{\mathrm{dn}}}& \left[\mathrm{Equation}28\right]\end{array}$

[0106] The CPU 121 may generate the downlink message in form of Equation 29 below based on the operators of the CPU 121 and Equations 27 and 28.

[00023]$\begin{array}{cc}\mathrm{dm}=?\left(\mathrm{um};{?}_{?}\right)& \left[\mathrm{Equation}29\right]\end{array}$

[0107] The downlink message calculated as in Equation 29 may be a downlink communication message to be broadcast to all dAPs.

[0108] Therefore, the CPU 121 may transmit the downlink message to all dAPs through the fronthaul link in step S244. In step S246, the CPU 121 may identify whether an update cycle of the downlink message arrives. When the update cycle of the downlink message does not arrive, the CPU 121 may wait until the update cycle of the downlink message arrives. On the other hand, when the update cycle of the downlink message arrives, the CPU 121 may repeatedly perform steps S240 to S244 described above.

[0109] The procedures of steps S240 to S244 described above may be a downlink message generation operation using long-term CSI. Therefore, the update cycle of the downlink message in step S246 may be set to a cycle at which the long-term CSI statistics change.

[0110] As described in FIG. 2A above, the update cycle of the downlink message may be determined individually by the dAP or by the CPU 121. If the CPU 121 determines the update cycle, channel change information reported in advance from the respective dAPs may be used. It should be noted that an operation of transmitting channel change information is not illustrated in FIGS. 2A and 2B.

[0111] Meanwhile, in the operation described above, the CPU 121 performs a pooling operation on all dAPs as in Equation 26 in step S240 and then generates the downlink communication message as in Equation 30 in step S242. However, another method is also possible. For example, the CPU 121 may change the order of the pooling operation and the downlink message generation operation. In other words, if the CPU 121 defines the latent characteristics of the uplink message um.sub.m as in Equation 30 below, the latent characteristics of the uplink message may be extracted as in Equation 31 below.

[00024]$\begin{array}{cc}{\mathrm{dm}}_m?{?}^{{?}_{\mathrm{dn}}}& \left[\mathrm{Equation}30\right]\end{array}$$\begin{array}{cc}{\mathrm{dm}}_m=?\left({\mathrm{um}}_m;{?}_{?}\right)& \left[\mathrm{Equation}31\right]\end{array}$

[0112] The unique operator for the uplink messages in Equation 25 may parallelly generate a group of information vectors expressed as Equation 32 below.

[00025]$\begin{array}{cc}{\left\{{\mathrm{dm}}_m\right\}}_{m??}& \left[\mathrm{Equation}32\right]\end{array}$

[0113] The CPU 121 may use the concept of superposition coding of a non-orthogonal multiple access system, thereby generating a downlink message vector dm as shown in Equation 33 below as an average for the m-th dAP, which is an element of the M dAPs.

[00026]$\begin{array}{cc}\mathrm{dm}=\frac{{.Math.}_{m??}{\mathrm{dm}}_m}{M}& \left[\mathrm{Equation}33\right]\end{array}$

[0114] Based on one of the two schemes described above, the CPU 121 may transmit the downlink message to all dAPs in step S244. Accordingly, the m-th dAP in FIG. 2A may receive the downlink message in step S216. In other words, the m-th dAP may receive the downlink message generated as in Equation 30 or the downlink message as in Equation 33 from the CPU 121.

[0115] Referring again to FIG. 2A, the m-th dAP that receives the downlink message from the CPU 121 in step S216 may perform step S218.

[0116] In step S218, the m-th dAP may generate decentralized determination information. Hereinafter, generation of the decentralized determination information will be described. The m-th dAP may determine a local power allocation value (i.e. total transmit power of the m-th dAP) using the local CSI, which is its input characteristics expressed as Equation 19, and an estimate of the short-term CSI defined as Equation 5. Since the total transmit power of the m-th dAP needs to satisfy Equation 17b described above, one operator with parameters trainable in all dAPs may be implemented as shown in Equation 34 below. Here, the parameters trainable in each of all dAPs may be the same parameters.

[00027]$\begin{array}{cc}?\left(.Math.;{?}_{?}\right)& \left[\mathrm{Equation}34\right]\end{array}$

[0117] If an output result by the operator of Equation 34 is d.sub.m, the local power allocation value p.sub.m may be determined using the output result. In other words, the m-th dAP may implement calculation of the operator of Equation 34 as shown in Equation 35 below.

[00028]$\begin{array}{cc}{d}_m=?\left(\mathrm{dm},{?}_m^{},{\stackrel{?}{h}}_m;{?}_{?}\right)& \left[\mathrm{Equation}35\right]\end{array}$

[0118] The output vector d.sub.m of the operator exemplified in Equation 34 may be defined as shown in Equation 36 below.

[00029]$\begin{array}{cc}{d}_m=\left[d_{1,m}.Math.d_{K,m},{?}_m\right]?{?}^{K+1}& \left[\mathrm{Equation}36\right]\end{array}$

[0119] Then, the remaining elements d.sub.k,m?0, ?k? excluding the last element exemplified in Equation 36 may control a ratio between transmit power variables defined as in Equation 37 below. The information described above may be the decentralized determination information. In other words, the output vector d.sub.m of the operator shown in Equation 34 and the last element of Equation 36 may be used as the decentralized determination information. In the following description, the last element ?.sub.m of Equation 36 will be referred to as first information for decentralization decision, and ?.sub.m may be a variable for the m-th dAP.

[0120] The m-th dAP may extract a power allocation variable for each terminal in step S220. The power allocation variable for each terminal may correspond to a postprocessing operation. Therefore, a ratio between transmit power variables defined by Equation 37 below may be a power allocation variable for each terminal.

[00030]$\begin{array}{cc}{p}_{k,m},?k??& \left[\mathrm{Equation}37\right]\end{array}$

[0121] On the other hand, the last element of Equation 36, the first information for decentralized determination, may determine the total transmit power to be consumed by the m-th dAP. In order to limit a possible range of the first information for decentralized determination, which is the last element of Equation 36, to [0,P], the first information for decentralized determination may be normalized as in Equation 38 below. Here, P may be the maximum power value that can be transmitted by the m-th dAP, as described above.

[00031]$\begin{array}{cc}{?}_m?P\min \left(\max \left({?}_m,0\right),6\right)/6& \left[\mathrm{Equation}38\right]\end{array}$

[0122] In addition, the power allocation variable p.sub.k,m may be recovered from the output vector d.sub.m of the operator in Equation 34 as shown in Equation 39 below.

[00032]$\begin{array}{cc}{p}_{k,m}={?}_m\frac{d_{k,m}}{{.Math.}_{i??}{d}_{i,m}}& \left[\mathrm{Equation}39\right]\end{array}$

[0123] The results according to Equation 38 and Equation 39 may always lead to a solution that satisfies the power constraints of Equation 17b described above, as shown in Equation 40 below.

[00033]$\begin{array}{cc}{.Math.}_{k??}{p}_{k,m}={?}_m?P& \left[\mathrm{Equation}40\right]\end{array}$

[0124] The generation cycle of the downlink message d.sub.m received from the CPU 121 and the update cycle of the uplink message of the m-th dAP may be determined according to the long-term CSI change cycle. The long-term CSI change cycle has a relatively much larger value than a short-term CSI change cycle. Therefore, the fronthaul overhead caused by exchanging two messages is much smaller than the overhead caused by short-term CSI exchange.

[0125] In addition, considering that short-term CSI is used as an input to the operator of Equation 35 as shown in Equation 36, the m-th dAP may repeat the process of deriving power allocation variables for the respective terminals with a short-term CSI change cycle using the same downlink message d.sub.m. The power allocation variable for each terminal may be expressed as Equation 39 described above.

[0126] Finally, in step S222, the dAP may identify whether the update cycle of the output vector d.sub.m arrives. When the update cycle of the output vector d.sub.m arrives, the dAP may proceed to step S210, and when the update cycle of the output vector d.sub.m does not arrive, the dAP may proceed to step S218. FIG. 2A illustrates the case of proceeding to step S218, but the dAP may proceed to step S220.

[0127] The output vector may be the downlink message d.sub.m as described above, and the output vector may be a vector that determines the transmit power. The update cycle of the output vector may be set in various manners.

[0128] For example, the update cycle of the output vector may be set in advance by the CPU 121. When it is preset by the CPU 121, the CPU 121 may transmit the set output vector update cycle to each of the dAPs. As another example, the update cycle of the output vector may be set independently by each dAP.

[0129] When the CPU 121 or each dAP determines the update cycle of the output vector, the following methods may be used.

[0130] The update cycle of the output vector may be determined based on channel variability. For example, when a dAP is installed in an area where many high-speed vehicles move, such as near a highway, the channel may change very quickly. In cases where the channel change speed is fast, the update cycle of the output vector may be set to a short value. On the other hand, in cases where the movement speed of most users is slow, such as in schools, factories, large buildings, etc., the update cycle of the output vector may be set to a long value. In addition, in areas where vehicle movement and human movement are mixed, the update cycle of the output vector may be determined based on an average channel change speed. As another example, a channel change cycle may be individually set for each individual terminal. As another example, a channel change cycle may be set for each specific group.

[0131] Setting the channel change cycle for each individual terminal or specific group may be necessary in the following cases. For example, assuming a highway rest area, vehicles that do not stop at the rest area may move at high speeds. On the other hand, users moving within the highway rest area may move at a very slow speed compared to vehicles. Therefore, in this case, if an average of the two values is used, both users in the rest area and high-speed vehicles may experience unsatisfactory channel environments. Therefore, in the above-described environment, individual users may be divided into groups of high-speed moving objects and low-speed users, and the channel change cycle may be set for each group.

[0132] When the channel change cycle described above is determined by the CPU 121 and transmitted to each dAP, each of the dAPs may receive and use it. On the other hand, when each dAP determines the channel change cycle, information on the channel change cycle determined by each dAP may be reported to the CPU 121. It should be noted that FIG. 2A does not illustrate a procedure for reporting such information on the channel change cycle.

[0133] To summarize the operations described above with reference to FIGS. 2A and 2B, the group of operators presented in Equations 20, 22, 25, 26, 30, 31, 33, and 35 may provide an end-to-end forward pass mapping (?; ?) of the cooperative operation according to the present disclosure as p=(?, ?; ?). Here, the end-to-end forward pass mapping factor may be defined as Equation 41 below.

[00034]$\begin{array}{cc}?\stackrel{?}{=}\left\{{?}_{?},{?}_{?},{?}_{?}\right\}& \left[\mathrm{Equation}41\right]\end{array}$

[0134] The end-to-end forward pass mapping factor expressed as Equation 41 may represent collection of all trainable parameters.

[0135] The remaining task is to design correct DNNs that successfully approximate the intractable operator (?). In general, it has been theoretically shown that DNN can approximate arbitrary functions within a small error.

[0136] Based on the methods described above, each dAP can communicate with at least one terminal that communicates with it through beamforming.

[0137] In the present disclosure, the operator of Equation 24 expressed as Equation 25, the operator defined as Equation 31 that calculates the latent characteristics of the uplink message defined as Equation 30, and the operator defined as Equation 35 may be modeled as DNNs that perform basic computational functions to approximate the operator (?). Hereinafter, a method of modeling such the DNNs will be described with reference to FIGS. 3A to 3C.

[0138] FIG. 3A is a conceptual diagram for describing a structure of an uplink fronthaul cooperation message generation operator DNN among the cooperative learning operation functions according to the present disclosure, FIG. 3B is a conceptual diagram for describing a structure of a downlink fronthaul cooperation message generation operator DNN among the cooperative learning operation functions according to the present disclosure, and FIG. 3C is a conceptual diagram for describing a structure of a distributed power allocation determination operator DNN among the cooperative learning operation functions according to the present disclosure.

[0139] In the present disclosure, cooperation may mean cooperation between computational operations in a processor included in the dAP or a DNN driven by the processor and computational operations in a processor included in the CPU 121 or a DNN driven by the processor. In other words, this may refer to a procedure in which, in order to obtain a final result, a result of a first operation (or processing) performed in the dAP is received by the CPU 121, a second operation (or processing) is performed by the CPU 121, and a third operation (processing) is performed by the CPU 121 on a result of the second operation (or processing).

[0140] In addition, parameters of the DNN may be specified by a learning procedure. Therefore, in the present disclosure, cooperative learning may refer to a process of training the DNNs provided in each of the dAP and the CPU 121 through cooperation between the dAP and the CPU 121, or a procedure performed by the DNN provided in each of the dAP and the CPU 121 using the trained parameters.

[0141] FIGS. 3A to 3C show an exemplary embodiment considering fully-connected DNNs. However, various forms of DNN may be used. For example, an input vector of length N.sub.0 may be defined as shown in Equation 42 below.

[00035]$\begin{array}{cc}i?{?}^{N_0}& \left[\mathrm{Equation}42\right]\end{array}$

[0142] For the input vector defined as Equation 42, calculations of an L-layer DNN with a trainable parameter set ? may be given as Equation 43 below.

[00036]$\begin{array}{cc}{?}_L\left(i;?\right)=a_L\left(W_L?.Math.?a_1\left(W_{1}i+o_1\right)+.Math.+o_L\right)& \left[\mathrm{Equation}43\right]\end{array}$

[0143] In Equation 43, a.sub.l(?), l=1, . . . , L may be an activation function of an l-th layer, and when N.sub.l represents an output resource of the l-th layer, a weight matrix may be expressed as Equation 44 below, and a bias vector may be expressed as Equation 45 below.

[00037]$\begin{array}{cc}{W}_l?{?}^{N_{l-1}?N_l}& \left[\mathrm{Equation}44\right]\end{array}$$\begin{array}{cc}{o}_l?{?}^{N_l}& \left[\mathrm{Equation}45\right]\end{array}$

[0144] These may constitute the trainable parameter set described above, and the trainable parameter set may be expressed as Equation 46 below.

[00038]$\begin{array}{cc}?\stackrel{?}{=}\left\{W_l,o_l:?l\right\}& \left[\mathrm{Equation}46\right]\end{array}$

[0145] The operators (?; ), , and for calculating the end-to-end forward pass mapping factors expressed in Equation 41 may be respectively modeled as DNNs as shown in Equations 47 to 49 below.

[00039]$\begin{array}{cc}{?}_{L_{?}}\left(i_{?};{?}_{?}\right)& \left[\mathrm{Equation}47\right]\end{array}$$\begin{array}{cc}{?}_{L_{?}}\left(i_{?};{?}_{?}\right)& \left[\mathrm{Equation}48\right]\end{array}$$\begin{array}{cc}{?}_{L_{?}},\left(i_{?};{?}_{?}\right)& \left[\mathrm{Equation}49\right]\end{array}$

[0146] In this case, the input vector of the uplink fronthaul cooperation message generation operator DNN illustrated in FIG. 3A may be expressed as Equation 50 below, the input vector of the downlink fronthaul cooperation message generation operator DNN illustrated in FIG. 3B may be expressed as Equation 50 below, and the input vector of the distributed power allocation determination operator DNN illustrated in FIG. 3C may be expressed as Equation 52 below.

[00040]$\begin{array}{cc}{i}_{?}=\left\{p_m^{}\right\}?{?}^K& \left[\mathrm{Equation}50\right]\end{array}$$\begin{array}{cc}{i}_{?}=\left\{um\right\}?{?}^K& \left[\mathrm{Equation}51\right]\end{array}$$\begin{array}{cc}{i}_{?}=\left\{\mathrm{dm},p_m^{},{\stackrel{?}{h}}_m\right\}?{?}^{\left(2N+2\right)K}& \left[\mathrm{Equation}52\right]\end{array}$

[0147] In FIG. 3A, the uplink fronthaul cooperation message generation operator DNN 310 may include a plurality of hidden layers between an input layer 311 and an output layer 313. It should be noted that the hidden layers may be composed of one or multiple hidden layers. When there are multiple hidden layers, each of a first hidden layer 312 and subsequent hidden layers may constitute one hidden layer, as illustrated in FIG. 3A.

[0148] Information input to each node of the input layer 311 may be a normalized value of the long-term local CSI, as previously described in FIG. 2A. In other words, it may be a value generated using information measured (or reported from the terminal) on a channel state between the m-th dAP and each terminal.

[0149] In FIG. 3A, a case where the output of each layer is expressed as a single function is illustrated using equations below. For example, the output of the input layer 311 may be expressed as W.sub.1,v, the output of the first hidden layer 312 may be expressed as W.sub.2,v, and the output of the output layer 313 may be expressed as W.sub.n.sub.v.sub.+1,v. The outputs of the respective layers illustrated in FIG. 3A may be determined by parameters as described above, and the parameters may be connection weights between nodes constituting the respective layers. These parameters may be determined (or updated) based on the learning of the DNN.

[0150] Referring to FIG. 3B, the downlink fronthaul cooperation message generation operator DNN 320 illustrates a form that includes a plurality of hidden layers between an input layer 321 and an output layer 323. It should be noted that the hidden layers of the downlink fronthaul cooperation message generation operator DNN 320 may also be composed of one or multiple hidden layers. When there are multiple hidden layers, each layer may constitute one hidden layer, each of a first hidden layer 322 and subsequent hidden layers may constitute one hidden layer, as illustrated in FIG. 3B.

[0151] In FIG. 3B, a case where the output of each layer is expressed as a single function is illustrated using equations below. For example, the output of the input layer 321 may be expressed as W.sub.1,Z, the output of the first hidden layer 322 may be expressed as W.sub.2,Z, and the output of the output layer 323 may be expressed as W.sub.n.sub.Z.sub.+1,Z. The outputs of the respective layers illustrated in FIG. 3B may also be determined by parameters as described above, and the parameters may be connection weights between nodes constituting the respective layers. These parameters may be determined (or updated) based on the learning of the DNN.

[0152] Referring to FIG. 3C, the distributed power allocation determination operator DNN 330 illustrates a form that includes a plurality of hidden layers between an input layer 331 and an output layer 333. It should be noted that the hidden layers of the distributed power allocation determination operator DNN 320 may also be composed of one or multiple hidden layers. When there are multiple hidden layers, each of a first hidden layer 332 and subsequent hidden layers may constitute one hidden layer, as illustrated in FIG. 3C.

[0153] In FIG. 3C, a case where the output of each layer is expressed as a single function is illustrated using equations below. For example, the output of the input layer 331 may be expressed as W.sub.1,D, the output of the first hidden layer 332 may be expressed as W.sub.2,D, and the output of the output layer 333 may be expressed as W.sub.n.sub.D.sub.+1,D. The outputs of the respective layers illustrated in FIG. 3C may also be determined by parameters as described above, and the parameters may be connection weights between nodes constituting the respective layers. These parameters may be determined (or updated) based on the learning of the DNN.

[0154] The m-th dAP may allocate power to a channel (or signal) transmitted to each of the terminals communicating within the m-th dAP based on the output of the distributed power allocation determination operator DNN 330 illustrated in FIG. 3C.

[0155] FIG. 4 is a conceptual diagram for describing a cooperative learning-based power allocation deep neural network structure according to an exemplary embodiment of the present disclosure.

[0156] Referring to FIG. 4, configuration of a cooperative learning-based power allocation deep neural network 400 is illustrated. The power allocation deep neural network 400 may perform an operation based on parameter update according to the present disclosure. With reference to FIG. 4, the configuration and operation of the collaborative learning-based power allocation deep neural network 400 according to the present disclosure will be described.

[0157] Device local CSI may be output by an estimate calculation unit 410 calculating the short-term CSI estimate. The short-term CSI estimate may be input to an uplink fronthaul cooperation message generation operator DNN 420. The uplink fronthaul cooperation message generation operator DNN may perform the operation as previously described in FIG. 3A, and provide an operation result to a pooling-based uplink message calculation unit 430. The uplink message calculation unit 430 may calculate one uplink message based on pooling, as previously described in step S240 of FIG. 2B. The uplink message calculated by the uplink message calculation unit 430 may be input to a downlink fronthaul cooperation message generation operator DNN 440. The downlink fronthaul cooperation message generation operator DNN 440 may perform the operation as previously described in FIG. 3B. An operation result of the downlink fronthaul cooperation message generation operator DNN 440 may be input to a distributed power allocation determination operator DNN 450. The distributed power allocation determination operator DNN 450 may perform the operation previously described in FIG. 3C. In this case, as illustrated in FIG. 4, the distributed power allocation determination operator DNN 450 may use the output of the estimate calculation unit 410, the output of the downlink fronthaul cooperation message generation operator DNN 440, and the short-term CSI estimate as inputs.

[0158] The distributed power allocation determination operator DNN 450 may generate a downlink communication message to be broadcast to all dAPs, and calculate and output the first information for decentralized determination as previously described in Equation 36.

[0159] The downlink communication message and the first information for decentralized determination that are the output of the distributed power allocation determination operator DNN 450 may be input to a transmit power determination unit 460. The transmit power determination unit 460 may use each input to generate power allocation variables through calculations such as Equation 39 described above.

[0160] The power allocation variables may be used as an output of the power allocation deep neural network 400, and simultaneously input to a loss calculation unit 470.

[0161] The loss calculation unit 470 may calculate a loss value using the power allocation variables, channel estimation error, and short-term local CSI estimate as inputs. The loss value calculated may be input to the uplink fronthaul cooperation message generation operator DNN 420, the downlink fronthaul cooperation message generation operator DNN 440, and the distributed power allocation determination operator DNN 450.

[0162] Hereinafter, a derivation process by which the power allocation deep neural network 400 as shown in FIG. 4 is constructed.

[0163] As previously described with reference to FIGS. 2A and 2B, the end-to-end forward pass mapping factor of cooperative operations may be provided as in Equation 53 below.

[00041]$\begin{array}{cc}p=?\left(p,\stackrel{?}{h};?\right)& \left[\mathrm{Equation}53\right]\end{array}$

[0164] By substituting the value of Equation 53 into Equation 17 described above, a DNN training problem such as Equation 54 below may be established.

[00042]$\begin{array}{cc}\underset{?}{\max }{?}_{\stackrel{?}{h},e,p}U.Math.\left(R_k\left(\stackrel{?}{h},e,?\left(?,\stackrel{?}{h};?\right)\right)\right)& \left[\mathrm{Equation}54\right]\end{array}$

[0165] Equation 17b, which is the power limitation, may be eliminated from Equation 54. The reason is that the power limit is always satisfied by Equation 38 and Equation 39 described above. Therefore, the training problem of Equation 54 may be directly handled by mini-batch stochastic gradient descent (SGD) algorithms such as an Adam optimizer. A loss function used in SGD algorithms may be defined as Equation 55 below.

[00043]$\begin{array}{cc}?\left(?\right)=-{?}_{\stackrel{?}{h},e,p}\left[U.Math.\left(\left\{R_k\left(\stackrel{?}{h},e,?\left(?,\stackrel{?}{h};?\right)\right):?k??\right\}\right)\right]& \left[\mathrm{Equation}55\right]\end{array}$

[0166] A training data set may include numerous realizations of long-term CSI ?. At each training epoch, one mini-batch set comprising long-term CSIs may be arbitrarily selected. The long-term CSIs may be collected in advance by experiments or generated based on well-known dAP-UE deployment scenarios.

[0167] Then, short-term CSI estimates and error vectors may be generated using known distributions as shown in Equation 7. Since an error rate ? in Equation 7 randomly changes in real situations, it is necessary to construct multipurpose DNNs that are adaptive to the randomly changing ?. To this end, in the present disclosure, an error rate factor may be randomly generated in the training step. In other words, it may be generated from a uniform distribution ??(0,1).

[0168] As a result, the cooperative learning proposed in the present disclosure may be universally adapted to the arbitrary CSI error statistics ?. These may be utilized to calculate a gradient of Equation 54, which is a training target averaged over the mini-batch set. As a result, according to the cooperative learning proposed in the present disclosure, several artificially generated CSI error samples may be observed and trained. By observing and training CSI error samples as described above, the DNN may support a powerful power allocation mechanism by learning an unknown distribution of actual CSIs based on the estimates.

[0169] The proposed cooperative training process as shown in FIG. 4 may be implemented in an offline manner by collecting all element DNNs. The trained DNN modules may be loaded (or mounted, or stored) on the dAPs and the CPU 121 for power allocation optimization based on cooperative learning.

[0170] At this implementation stage, CSI errors are no longer needed, since the proposed cooperative learning only uses long-term CSIs and short-term CSI estimates, as defined by Equation 53.

[0171] The number M of dAPs may be considered as a hyper-parameter of the proposed cooperative learning strategy. When the number of dAPs considered in the training phase is assumed to be M.sub.train, in order to further improve scalability, it needs to be carefully selected so that a result of the proposed cooperative learning based on a specific M.sub.train works well universally over a wide range of test dAP numbers M.sub.test. Small or large M.sub.train values may cause overfitting problems in which the result of cooperative learning only works in a specific network configuration. Therefore, the optimal choice for M.sub.train may not be equal to the test dAP number M.sub.test.

[0172] FIG. 5 is a conceptual diagram of an open RAN system configuration to which a cooperative learning-based DNN according to the present disclosure is applied.

[0173] FIG. 5 illustrates an exemplary embodiment of configuring a distributed MIMO system in an open radio access network (O-RAN) architecture. Hereinafter, operations of performing real-time RAN intelligent control (RT-RIC) by applying cooperative learning according to the present disclosure, and components therefor will be described with reference to FIG. 5.

[0174] According to the O-RAN architecture, a RAN 520 may be configured with three types of logical functional unitsan O-RAN central unit (O-CU) 521, O-RAN distributed units (O-DUs) 531, 532, and 533, and O-RAN radio units (O-RUs) 541, 542, and 543. The O-RUs 541, 542, and 543 may communicate with terminals 551, 552, and 553, respectively. Here, the terminals 551, 552, and 553 may correspond to the terminals 101, 102, and 103 previously described in FIG. 1.

[0175] As illustrated in FIG. 5, each of the O-DUs 531, 532, and 533 may perform artificial intelligence (AI)/machine learning (ML). The O-CU 521 may also apply AI/ML. The O-DUs 531, 532, and 533 and the O-CU 521 may be connected with a service management and orchestration (SMO) and a RAN intelligent controller (RIC) 510 that facilitate intelligent control on the RAN 520 through training and deployment of AI/ML models.

[0176] More specifically, the SMO/RIC 510 may include a non-real time RIC and a near-real time RIC therein. The SMO/RIC 510 proposed to date may automatically manage life-cycles of AI/ML models. However, the SMO/RIC 510 proposed to date does not consider deployment of AI/ML on the O-CU 521, O-DUs 531, 532, and 533, and O-RUs 541, 542, and 543. Therefore, in the present disclosure, the AI/ML components described in FIGS. 1 to 4 may be deployed in the O-RAN system to which the cooperative learning DNNs are applied, as shown in FIG. 5.

[0177] Meanwhile, the dAP of the distributed MIMO system shown in FIG. 1 may include one of the O-RUs 541, 542, and 543 and some functions of one of the O-DUs 531, 532, and 533. Accordingly, the CPU 121 described in FIG. 1 may be regarded as including a part of the O-DUs 531, 532, or 533 and the O-CU 521 illustrated in FIG. 5. However, considering that the channel estimation function is performed in the O-DUs 531, 532, and 533 and that they have greater computing power than the O-RUs 541, 542, and 543, as an exemplary embodiment of the present disclosure, it may be assumed that the dAP performs operations of one of the O-RUs 541, 542, and 543 and one of the O-DUs 531, 532, and 533, and the CPU 121 corresponds to the O-CU 521.

[0178] The cooperative learning model illustrated in FIGS. 2 to 4 described above may generate individual cooperative learning models according to beam-direction setting precoding schemes and network utility functions used. The SMO/RIC 510 may selectively deploy cooperative learning models on the O-CU 521 and O-DUs 531, 532, and 533 according to determination of a network operator and/or measured performance data of the RAN.

[0179] As another example, the SMO/RIC 510 may deploy all individual cooperative learning models in advance on the O-CU 521 and O-DUs 531, 532, and 533, and select a suitable cooperative learning model according to a situation based on policy information.

[0180] The method of deploying the cooperative learning models described above on the O-CU/O-DUs may be performed using the existing interfaces of O-RAN or using newly-defined interfaces.

[0181] FIG. 6 is a conceptual diagram illustrating block configuration of a device according to an exemplary embodiment of the present disclosure.

[0182] The configuration of FIG. 6 may be a partial configuration of the terminals 101, 102, . . . , and 103 of FIG. 1. As another example, the configuration of FIG. 6 may be a partial configuration of each of the M dAPs 111, 112, . . . , and 113. As another example, the configuration of FIG. 6 may be a configuration of the CPU 121. As another example, the configuration of FIG. 6 may be a configuration of one of the O-CU 521, O-DUs 531, 532, and 533, and O-RUs 541, 542, and 543 illustrated in FIG. 5. As another example, the configuration of FIG. 6 may be a configuration of the SMO/RIC 510.

[0183] In other words, the configuration of FIG. 6 may be a configuration of each of the communication node or a part thereof. Accordingly, each of the communication nodes may have additional components other than those illustrated in FIG. 6. For example, a terminal may further include a user interface and various sensors. The configuration of FIG. 6 and operations thereof will be described.

[0184] Referring to FIG. 6, a processor 611 may control operations of the communication node. For example, when the configuration in FIG. 6 corresponds to a terminal, the processor 611 may control operations of the terminal. As another example, when the configuration of FIG. 6 corresponds to one of the O-CU 521, O-DUs 531, 532, and 533, and O-RUs 541, 542, and 543, the processor 611 may control operations of each communication node. Accordingly, the processor 611 may perform deep learning-based beamforming control according to the present disclosure described in FIGS. 2 to 4. In particular, the processor 611 may control at least some of the operations of the DNNs described in FIGS. 3A to 3C, perform the operations of FIGS. 2A and/or 2B, or control the operations described in FIG. 4.

[0185] A memory 612 may store control information for the operations of the DNNs according to the present disclosure and various information for operations in the corresponding communication node.

[0186] A receiver 613 may be configured to receive signals from other communication nodes. For example, if a received signal is a radio frequency (RF) signal, the receiver 613 may be configured to receive and process the RF signal. As another example, if a received signal is received through a wired line, the receiver 613 may be configured to process the signal received through the wired line.

[0187] A transmitter 614 may be configured to transmit signals to other communication nodes. For example, if an RF signal is transmitted to another communication node, the transmitter 614 may be configured to transmit the RF signal. As another example, if a signal is transmitted through a wired line, the transmitter 614 may be configured to transmit the signal through the wired line.

[0188] An interface 615 may provide various interfaces for connection with operators or other devices. For example, when the configuration in FIG. 6 corresponds to one of the O-CU 521, O-DUs 531, 532, and 533, and O-RUs 541, 542, and 543 that constitute the O-RAN, the interface 615 may be O-RAN system internal interfaces or may provide an interface for access of the operators. As another example, when the configuration of FIG. 6 corresponds to a terminal, the interface may provide interfaces for a user to connect with other devices, such as various electronic devices (e.g. other terminals, laptops, computers, PDAs, etc.).

[0189] A bus 601 may provide a path for data and/or control signals between the respective components illustrated in FIG. 6.

[0190] The operations of the method according to the exemplary embodiment of the present disclosure can be implemented as a computer readable program or code in a computer readable recording medium. The computer readable recording medium may include all kinds of recording apparatus for storing data which can be read by a computer system. Furthermore, the computer readable recording medium may store and execute programs or codes which can be distributed in computer systems connected through a network and read through computers in a distributed manner.

[0191] The computer readable recording medium may include a hardware apparatus which is specifically configured to store and execute a program command, such as a ROM, RAM or flash memory. The program command may include not only machine language codes created by a compiler, but also high-level language codes which can be executed by a computer using an interpreter.

[0192] Although some aspects of the present disclosure have been described in the context of the apparatus, the aspects may indicate the corresponding descriptions according to the method, and the blocks or apparatus may correspond to the steps of the method or the features of the steps. Similarly, the aspects described in the context of the method may be expressed as the features of the corresponding blocks or items or the corresponding apparatus. Some or all of the steps of the method may be executed by (or using) a hardware apparatus such as a microprocessor, a programmable computer or an electronic circuit. In some embodiments, one or more of the most important steps of the method may be executed by such an apparatus.

[0193] In some exemplary embodiments, a programmable logic device such as a field-programmable gate array may be used to perform some or all of functions of the methods described herein. In some exemplary embodiments, the field-programmable gate array may be operated with a microprocessor to perform one of the methods described herein. In general, the methods are preferably performed by a certain hardware device.

[0194] The description of the disclosure is merely exemplary in nature and, thus, variations that do not depart from the substance of the disclosure are intended to be within the scope of the disclosure. Such variations are not to be regarded as a departure from the spirit and scope of the disclosure. Thus, it will be understood by those of ordinary skill in the art that various changes in form and details may be made without departing from the spirit and scope as defined by the following claims.