Search Results - "Avestimehr, S."

Refine Results
  1. 1

    Wireless Network Information Flow: A Deterministic Approach by Avestimehr, A S, Diggavi, S N, Tse, D N C

    Published in IEEE transactions on information theory (01-04-2011)
    “…In a wireless network with a single source and a single destination and an arbitrary number of relay nodes, what is the maximum rate of information flow…”
    Get full text
    Journal Article
  2. 2

    Accuracy of the Morphology Enabled Dipole Inversion (MEDI) Algorithm for Quantitative Susceptibility Mapping in MRI by Tian Liu, Weiyu Xu, Spincemaille, P., Avestimehr, A. S., Yi Wang

    Published in IEEE transactions on medical imaging (01-03-2012)
    “…Determining the susceptibility distribution from the magnetic field measured in a magnetic resonance (MR) scanner is an ill-posed inverse problem, because of…”
    Get full text
    Journal Article
  3. 3

    Tactical Jupiter: Dynamic Scheduling of Dispersed Computations in Tactical MANETs by Poylisher, A., Cichocki, A., Guo, K., Hunziker, J., Kant, L., Krishnamachari, B., Avestimehr, S., Annavaram, M.

    “…We present Tactical Jupiter, an adaptation of the recently developed Jupiter framework for scheduling of dispersed computations on heterogeneous resources to…”
    Get full text
    Conference Proceeding
  4. 4

    Two-Unicast Wireless Networks: Characterizing the Degrees of Freedom by Shomorony, I., Avestimehr, A. S.

    Published in IEEE transactions on information theory (01-01-2013)
    “…We consider two-source two-destination (i.e., two-unicast) multihop wireless networks that have a layered structure with arbitrary connectivity. We show that,…”
    Get full text
    Journal Article
  5. 5

    Interference Channels With Rate-Limited Feedback by Vahid, A., Suh, C., Avestimehr, A. S.

    Published in IEEE transactions on information theory (01-05-2012)
    “…We consider the two-user interference channel with rate-limited feedback. Related prior works focus on the case where feedback links have infinite capacity,…”
    Get full text
    Journal Article
  6. 6

    Divide-and-Conquer: Approaching the Capacity of the Two-Pair Bidirectional Gaussian Relay Network by Sezgin, A., Avestimehr, A. S., Khajehnejad, M. A., Hassibi, B.

    Published in IEEE transactions on information theory (01-04-2012)
    “…The capacity region of multi-pair bidirectional relay networks, in which a relay node facilitates the communication between multiple pairs of users, is…”
    Get full text
    Journal Article
  7. 7

    Worst-Case Additive Noise in Wireless Networks by Shomorony, I., Avestimehr, A. S.

    Published in IEEE transactions on information theory (01-06-2013)
    “…A classical result in information theory states that the Gaussian noise is the worst-case additive noise in point-to-point channels, meaning that, for a fixed…”
    Get full text
    Journal Article
  8. 8

    On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels by Yue Zhao, Chee Wei Tan, Avestimehr, A. S., Diggavi, S. N., Pottie, G. J.

    Published in IEEE transactions on information theory (01-06-2012)
    “…In this paper, we investigate the maximum achievable sum-rate of the two-user Gaussian interference channel with Gaussian superposition coding and successive…”
    Get full text
    Journal Article
  9. 9

    Cross-Layer Optimization for Wireless Networks With Deterministic Channel Models by Ziyu Shao, Minghua Chen, Avestimehr, A. S., Li, S. R.

    Published in IEEE transactions on information theory (01-09-2011)
    “…Cross-layer optimization is a key step in wireless network design that coordinates the resources allocated to different layers in order to achieve globally…”
    Get full text
    Journal Article
  10. 10

    On Achieving Local View Capacity Via Maximal Independent Graph Scheduling by Aggarwal, V, Avestimehr, A S, Sabharwal, A

    Published in IEEE transactions on information theory (01-05-2011)
    “…"If we know more, we can achieve more." This adage also applies to communication networks, where more information about the network state translates into…”
    Get full text
    Journal Article
  11. 11

    Two-Hop Interference Channels: Impact of Linear Schemes by Issa, Ibrahim, Fong, Silas L., Avestimehr, Amir Salman

    Published in IEEE transactions on information theory (01-10-2015)
    “…We consider the two-hop interference channel (IC), which consists of two source-destination pairs communicating with each other via two relays. We analyze the…”
    Get full text
    Journal Article
  12. 12

    Outage Capacity of the Fading Relay Channel in the Low-SNR Regime by Avestimehr, A.S., Tse, D.N.C.

    Published in IEEE transactions on information theory (01-04-2007)
    “…In slow-fading scenarios, cooperation between nodes can increase the amount of diversity for communication. We study the performance limit in such scenarios by…”
    Get full text
    Journal Article
  13. 13

    On the Optimality of Treating Interference as Noise by Chunhua Geng, Naderializadeh, Navid, Avestimehr, Amir Salman, Jafar, Syed A.

    Published in IEEE transactions on information theory (01-04-2015)
    “…It is shown that in the K-user interference channel, if for each user the desired signal strength is no less than the sum of the strengths of the strongest…”
    Get full text
    Journal Article
  14. 14

    Analyzing Weighted \ell1 Minimization for Sparse Recovery With Nonuniform Sparse Models by Khajehnejad, M A, Weiyu Xu, Avestimehr, A S, Hassibi, B

    Published in IEEE transactions on signal processing (01-05-2011)
    “…In this paper, we introduce a nonuniform sparsity model and analyze the performance of an optimized weighted ℓ 1 minimization over that sparsity model. In…”
    Get full text
    Journal Article
  15. 15

    Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake by Shomorony, Ilan, Avestimehr, Amir Salman

    Published in IEEE transactions on information theory (01-05-2014)
    “…We show that fully connected two-hop wireless networks with K sources, K relays, and K destinations have K degrees of freedom both in the case of time-varying…”
    Get full text
    Journal Article
  16. 16

    Capacity Results for Binary Fading Interference Channels With Delayed CSIT by Vahid, Alireza, Maddah-Ali, Mohammad Ali, Avestimehr, Amir Salman

    Published in IEEE transactions on information theory (01-10-2014)
    “…To study the effect of lack of up-to-date channel state information at the transmitters (CSITs), we consider two-user binary fading interference channels with…”
    Get full text
    Journal Article
  17. 17

    Interference Networks With no CSIT: Impact of Topology by Naderializadeh, Navid, Avestimehr, Amir Salman

    Published in IEEE transactions on information theory (01-02-2015)
    “…We consider partially connected K -user interference networks, where the transmitters have no knowledge about the channel gain values, but they are aware of…”
    Get full text
    Journal Article
  18. 18

    Introduction to the Special Issue on Interference Networks by Avestimehr, A. S., El Gamal, H., Jafar, S. A., Ulukus, S., Vishwanath, S.

    Published in IEEE transactions on information theory (01-05-2011)
    “…The papers in this special issue focus on interference networks. A majority of the papers focus on capacity analysis of the interference channel and its…”
    Get full text
    Journal Article
  19. 19

    Linear Degrees of Freedom of the X -Channel With Delayed CSIT by Lashgari, Sina, Avestimehr, Amir Salman, Suh, Changho

    Published in IEEE transactions on information theory (01-04-2014)
    “…We establish the degrees of freedom (DoF) of the two-user X-channel with delayed channel knowledge at transmitters [i.e., delayed channel state information at…”
    Get full text
    Journal Article Conference Proceeding
  20. 20

    Cooperative relaying with side information by Avestimehr, S.

    “…We study the problem of cooperative communication in the case that the assisting node (i.e. the relay) has access to correlated information about the source…”
    Get full text
    Conference Proceeding