arXiv subjects

Hua Sun

Publications and source records attributed to Hua Sun.

95 records · Page 6Linked to original sources

arXiv2013

Multilevel Topological Interference Management

The robust principles of treating interference as noise (TIN) when it is sufficiently weak, and avoiding it when it is not, form the background for this work. Combining TIN with the topological interference management (TIM) framework that identifies optimal interference avoidance schemes, a baseline TIM-TIN approach is proposed which decomposes a network into TIN and TIM components, allocates the signal power levels to each user in the TIN component, allocates signal vector space dimensions to each user in the TIM component, and guarantees that the product of the two is an achievable number of signal dimensions available to each user in the original network.

cs.IT↗

arXiv2013

Degrees of Freedom of MIMO X Networks: Spatial Scale Invariance, One-Sided Decomposability and Linear Feasibility

We show that an M X N user MIMO X network with A antennas at each node has AMN/(M+N-1) degrees of freedom (DoF), thus resolving in this case a discrepancy between the spatial scale invariance conjecture (scaling the number of antennas at each node by a constant factor will scale the total DoF by the same factor) and a decomposability property of overconstrained wireless networks. While the best previously-known general DoF outer bound is consistent with the spatial invariance conjecture, the best previously-known general DoF inner bound, inspired by the K user MIMO interference channel, was based on the decomposition of every transmitter and receiver into multiple single antenna nodes, transforming the network into an AM X AN user SISO X network. While such a decomposition is DoF optimal for the K user MIMO interference channel, a gap remained between the best inner and outer bound for the MIMO X channel. Here we close this gap with the new insight that the MIMO X network is only one-sided decomposable, i.e., either all the transmitters or all the receivers (but not both) can be decomposed by splitting multiple antenna nodes into multiple single antenna nodes without loss of DoF. The result is extended to SIMO and MISO X networks as well and in each case the DoF results satisfy the spatial scale invariance property. In addition, the feasibility of linear interference alignment is investigated based only on spatial beamforming without symbol extensions. Similar to MIMO interference networks, we show that when the problem is improper, it is infeasible.

cs.IT↗

arXiv2013

Index Coding Capacity: How far can one go with only Shannon Inequalities?

An interference alignment perspective is used to identify the simplest instances (minimum possible number of edges in the alignment graph, no more than 2 interfering messages at any destination) of index coding problems where non-Shannon information inequalities are necessary for capacity characterization. In particular, this includes the first known example of a multiple unicast (one destination per message) index coding problem where non-Shannon information inequalities are shown to be necessary. The simplest multiple unicast example has 7 edges in the alignment graph and 11 messages. The simplest multiple groupcast (multiple destinations per message) example has 6 edges in the alignment graph, 6 messages, and 10 receivers. For both the simplest multiple unicast and multiple groupcast instances, the best outer bound based on only Shannon inequalities is $\frac{2}{5}$, which is tightened to $\frac{11}{28}$ by the use of the Zhang-Yeung non-Shannon type information inequality, and the linear capacity is shown to be $\frac{5}{13}$ using the Ingleton inequality. Conversely, identifying the minimal challenging aspects of the index coding problem allows an expansion of the class of solved index coding problems up to (but not including) these instances.

cs.IT↗

arXiv2013

Topological Interference Management with Alternating Connectivity

The topological interference management problem refers to the study of the capacity of partially connected linear (wired and wireless) communication networks with no channel state information at the transmitters (no CSIT) beyond the network topology, i.e., a knowledge of which channel coefficients are zero (weaker than the noise floor in the wireless case). While the problem is originally studied with fixed topology, in this work we explore the implications of varying connectivity, through a series of simple and conceptually representative examples. Specifically, we highlight the synergistic benefits of coding across alternating topologies.

cs.IT↗

arXiv2002

Computer simulations of polydisperse ER fluids in DID model

The theoretical investigations on electrorheological (ER) fluids are usually concentrated on monodisperse systems. Real ER fluids must be polydisperse in nature, i.e., the suspended particles can have various sizes and/or different dielectric constants. An initial approach for these studies would be the point-dipole (PD) approximation, which is known to err considerably when the particles approach and finally touch due to multipolar interactions. In a recent work, we proposed a dipole-induced-dipole (DID) model for computer simulation of ER fluids, which was shown to be both more accurate than the PD model and easy to use. The DID model was applied to simulate the athermal aggregation of particles in ER fluids and the aggregation time was found to be significantly reduced as compared to the PD model. In this work, we will report results for the case when the dielectric contrasts of some particles can be negative. In which case, the direction of the force is reversed. Moreover, the inclusion of DID force further complicates the results because the symmetry between positive and negative contrasts will be broken by the presence of dipole-induced interactions.

cond-mat.soft↗