Online convex optimization with periodic updates for downlink multi-cell MIMO wireless network virtualization

Patent metadata

Field	Value
Publication number	US-11979206-B2
Application number	US-202017789951-A
Country	US
Kind code	B2
Filing date	Mar 30, 2020
Priority date	Feb 14, 2020
Publication date	May 7, 2024
Grant date	May 7, 2024

Abstract

A method and network node for online coordinated multi-cell precoding are provided. According to one aspect, a method includes receiving from each of the plurality of service providers a virtual precoder matrix determined by the corresponding service provider. The method also includes determining a precoder matrix by minimizing a precoding deviation from a virtualization demand of the network subject to at least one power constraint, the virtualization demand being based at least in part on a product of a channel state matrix and a virtual precoder matrix. The method further includes applying the determined precoder matrix to signals applied to a plurality of antennas to achieve a sum of throughputs for the plurality of service providers that is greater than a sum of throughputs for the plurality of service providers achievable when the virtual precoder matrices are applied to the signals.

First claim

The invention claimed is:

1. A method of online coordinated multi-cell precoding for a network node configurable at least in part by an infrastructure provider, the network node being configured to facilitate sharing of wireless network infrastructure resources by a plurality of service providers, the method comprising:
obtaining a global channel state, the global channel state being based at least in part on a channel state in each cell of a plurality of cells;
communicating a channel state to a corresponding service provider;
receiving a virtual precoding matrix from each service provider of the plurality of services providers, each virtual precoding matrix being based at least in part on the channel state communicated to the corresponding service provider and being further based at least in part on a condition that each service provider of the plurality of services providers is allowed to use all of a plurality of available antennas and available wireless spectrum resources;
executing an optimization procedure to periodically determine a multiple input multiple output, MIMO, precoding matrix that minimizes an accumulated precoding deviation from a virtualization demand subject to constraints, the virtualization demand and the MIMO precoding matrix being based at least in part on the virtual precoding matrices received from the plurality of service providers; and
applying the determined MIMO precoding matrix to signals applied to the plurality of available antennas to achieve a sum of throughputs for the plurality of service providers that is greater than a sum of the throughputs for the plurality of service providers achievable when the virtual precoder matrices are applied to the signals.

2. The method of claim 1 , wherein the optimization procedure includes periodically determining a gradient of a convex loss function and providing the determined gradient as feedback to the determination of the MIMO precoding matrix.

3. The method of claim 2 , wherein feedback in the optimization procedure is allowed to be delayed for multiple time slots, at least one of:
received out of order; and
partly missing within an update period.

4. The method of claim 1 , wherein the optimization procedure includes an online projected gradient ascent algorithm that provides O(√{square root over ())} regret and O(1) long term constraint violation, where T is a total time horizon over which multiple updates of the determined MIMO precoding matrix occur.

5. The method of claim 1 , wherein the accumulated precoding deviation is determined according to f t (x t ) where T is a time horizon, x t is a decision in a sequence of decisions made by the network node, f t (x t ) is a convex loss function, f t (x t ) is an accumulated loss and xº arg min x∈X 0 f t (x) is the argument of f t (x) that produces a minimum value of f t (x).

6. The method of claim 1 , further comprising dividing a total time horizon T into update periods, each update period having a duration of T o time slots, T o being at least one time slot, and updating the MIMO precoding matrix at a beginning or end of each update period.

7. The method of claim 6 , wherein at a beginning of each update period, a decision is taken from a known convex decision space and a loss is determined by an end of the duration of T o time slots based at least in part on the decision, the loss being based at least in part on a convex loss function.

8. The method of claim 1 , wherein the virtualization demand is further based at least in part on past channel states.

9. The method of claim 1 , wherein the constraints include long term transmit power constraints and short term transmit power constraints.

10. The method of claim 1 , wherein the MIMO precoding matrix is determined to provide sub-linear T-slot regret with partial feedback on the accumulated precoding deviation from the virtualization demand, where T is a total time horizon.

11. A network node configured for online coordinated multi-cell precoding, the network node configurable at least in part by an infrastructure provider, the network node being configured to facilitate sharing of wireless network infrastructure resources by a plurality of service providers, the network node including processing circuitry configured to:
obtain a global channel state, the global channel state being based at least in part on a channel state in each cell of a plurality of cells;
communicate a channel state to a corresponding service provider;
receive a virtual precoding matrix from each service provider of the plurality of services providers, each virtual precoding matrix being based at least in part on the channel state communicated to the corresponding service provider and being further based at least in part on a condition that each service provider of the plurality of services providers is allowed to use all of a plurality of available antennas and available wireless spectrum resources;
execute an optimization procedure to periodically determine a multiple input multiple output, MIMO, precoding matrix that minimizes an accumulated precoding deviation from a virtualization demand subject to constraints, the virtualization demand and the MIMO precoding matrix being based at least in part on the virtual precoding matrices received from the plurality of service providers; and
apply the determined MIMO precoding matrix to signals applied to the plurality of available antennas to achieve a sum of throughputs for plurality of service providers that is greater than a sum of the throughputs for the plurality of service providers achievable when the virtual precoder matrices are applied to the signals.

12. The network node of claim 11 , wherein the optimization procedure includes periodically determining a gradient of a convex loss function and providing the determined gradient as feedback to the determination of the MIMO precoding matrix.

13. The network node of claim 12 , wherein feedback in the optimization procedure is allowed to be delayed for multiple time slots, at least one of:
received out of order; and
partly missing within an update period.

14. The network node of claim 11 , wherein the optimization procedure includes an online projected gradient ascent algorithm that provides O(√{square root over (T)}) regret and O(1) long term constraint violation, where T is a total time horizon over which multiple updates of the determined MIMO precoding matrix occur.

15. The network node of claim 11 , wherein the accumulated precoding deviation is determined according to f t (x t ) where T is a time horizon, x t is a decision in a sequence of decisions made by the network node, f t (x t ) is a convex loss function, f t (x t ) is an accumulated loss and xº arg min x∈X 0 f t (x) is the argument of f t (x) that produces a minimum value of f t (x).

16. The network node of claim 11 , wherein the processing circuitry is further configured to divide a total time horizon T into update periods, each update period having a duration of T o time slots, T o being at least one timeslot, and updating the MIMO precoding matrix at a beginning or end of each update period.

17. The network node of claim 16 , wherein at a beginning of each update period, a decision is taken from a known convex decision space and a loss is determined by an end of the duration of T o time slots based at least in part on the decision, the loss being based at least in part on a convex loss function.

18. The network node of claim 11 , wherein the virtualization demand is further based at least in part on past ch

Assignees

• Ericsson Telefon Ab L M

Inventors

• Boudreau Gary
• Liang Ben
• Wang Juncheng
• Dong Min

Classifications

• H04B7/0452 Primary

  Multi-user MIMO systems · CPC title

• H04B7/024 Primary

  Co-operative use of antennas of several sites, e.g. in co-ordinated multipoint or co-operative multiple-input multiple-output [MIMO] systems · CPC title

• H04B7/0615

  of weighted versions of same signal · CPC title