Abinesh Ramakrishnan

Learn More
We propose interference alignment techniques, originally developed for wireless interference channels, for the problem of network coding across unicast sessions. We describe two general approaches (namely, coding at the edge or in the middle of the network) and one specific example of each approach (namely, symbol extension method and ergodic alignment,(More)
We consider the problem of network coding across three unicast sessions over a directed acyclic graph, when each session has min-cut one. Previous work by Das et al. adapted a precoding-based interference alignment technique, originally developed for the wireless interference channel, specifically to this problem. We refer to this approach as(More)
We consider the problem of network coding across three unicast sessions over a directed acyclic graph, where the sender and receiver of each unicast session are both connected to the network via a single edge of unit capacity. We consider a network model in which the middle of the network can only perform random linear network coding, and restrict our(More)
We characterize the degrees of freedom (DoF) of multiple-input and multiple-output (MIMO) interference channels with rank-deficient channel matrices. For the two-user rank-deficient MIMO interference channel, we provide a tight outer bound to show that the previously known achievable DoF in the symmetric case is optimal and generalize the result to fully(More)
We consider the interference channel with K transmitters and K receivers all having a single antenna, wherein the K × K transfer matrix representing this channel has rank D (D <; K) . The degrees of freedom (DoF) of such channels are not known as the rank deficiency in the transfer matrix creates algebraic dependencies between the channel(More)
  • 1