English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study the downlink linear precoder design problem in a multi-cell denseheterogeneous network (HetNet). The problem is formulated as a generalsum-utility maximization (SUM) problem, which includes as special cases manypractical precoder design problems such as multi-cell coordinated linearprecoding, full and partial per-cell coordinated multi-point transmission,zero-forcing precoding and joint BS clustering and beamforming/precoding. TheSUM problem is difficult due to its non-convexity and the tight coupling of theusers' precoders. In this paper we propose a novel convex approximationtechnique to approximate the original problem by a series of convexsubproblems, each of which decomposes across all the cells. The convexity ofthe subproblems allows for efficient computation, while their decomposabilityleads to distributed implementation. {Our approach hinges upon theidentification of certain key convexity properties of the sum-utilityobjective, which allows us to transform the problem into a form that can besolved using a popular algorithmic framework called BSUM (Block SuccessiveUpper-Bound Minimization).} Simulation experiments show that the proposedframework is effective for solving interference management problems in largeHetNet.

Decomposition by Successive Convex Approximation: A Unifying Approach for Linear Transceiver Design in Heterogeneous Networks