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

In this paper, we study the information theoretic maximal degrees of freedom(DoF) for the symmetric multi-input-multi-output (MIMO) interfering broadcastchannel (IBC) with arbitrary antenna configurations. For the G-cell K-user MXNMIMO-IBC network, we find that the information theoretic maximal DoF per userare related to three DoF bounds: 1) the decomposition DoF boundd^{Decom}=MN/(M+KN), a lower-bound of linear interference alignment (IA) withinfinite time/frequency extensions (called asymptotic IA); 2) the proper DoFbound d^{Proper}=(M+N)/(GK+1), an upper-bound of linear IA withouttime/frequency extensions (called linear IA); and 3) the quantity DoF boundd^{Quan}, a zigzag piecewise linear function of M and N. The whole region ofM/N can be divided into two regions, Region I and Region II. Specifically, formost configurations in Region I, the information theoretic maximal DoF are thedecomposition DoF bound and can be achieved by the asymptotic IA. For allconfigurations in Region II, the information theoretic maximal DoF are thequantity DoF bound and can be achieved by the linear IA. To obtain the tightupper-bound, we propose a unified way to construct genies, where the genieshelp each base station or user resolve the maximal number of interference.According to the feature that the designed genies with the same dimension canderive identical DoF upper-bound, we convert the information theoretic DoFupper-bound problem into a linear algebra problem and obtain the closed-formDoF upper-bound expression. Moreover, we develop a non-iterative linear IAtransceiver to achieve the DoF upper-bound for the networks with antennaconfigurations in Region II, which means that the derived DoF upper-bound istightest. The basic principles to derive the DoF upper-bound and design thelinear IA transceiver to achieve the DoF upper-bound can be extended intogeneral asymmetric networks.

Genie Tree and Degrees of Freedom of the Symmetric MIMO Interfering Broadcast Channel