Bobak Nazer

Bobak Nazer

Auto-generated profile, based on publicly available information

Bobak Nazer

Department of Electrical and Computer Engineering, Boston University, Boston, MA, USA

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 July 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
BNBobak Nazer
Bobak Nazer
VCViveck R. Cadambe
Viveck R. Cadambe
VNVasilis Ntranos
Vasilis Ntranos
Giuseppe CaireGiuseppe Caire
Giuseppe Caire
The compute-and-forward framework permits each receiver in a Gaussian network to directly decode a linear combination of the transmitted messages. The resulting linear combinations can then be employed as an end-to-end communication strategy for relaying, interference alignment, and other applications. Recent efforts have demonstrated the advantages of employing unequal powers at the transmitters and decoding more than one linear combination at each receiver. However, neither of these techniques fit naturally within the original formulation of compute-and-forward. This paper proposes an expanded compute-and-forward framework that incorporates both of these possibilities and permits an intuitive interpretation in terms of signal levels. Within this framework, recent achievability and optimality results are unified and generalized.

5 April 2011 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
BNBobak Nazer
Bobak Nazer
ADAlexandros G. Dimakis
Alexandros G. Dimakis
MGMichael Gastpar
Michael Gastpar
In this paper, we show how interference can be exploited to perform gossip computations for average-based consensus over a larger local neighborhood, rather than only pairs of nodes. We use a new channel coding technique called computation coding to compute sums reliably over the wireless medium. Since many nodes can simultaneously average in a single round, our neighborhood gossip algorithm converges faster than the standard nearest neighbor gossip algorithm. For a network with n nodes and size m neighborhoods, neighborhood gossip requires O(n2/m2) rounds while standard gossip requires Θ(n2) rounds. Furthermore, we show that if the power path loss coefficient is less than 4, the total transmit energy employed by neighborhood gossip is polynomially smaller than that employed by standard gossip.

10 January 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
WHWenbo He
Wenbo He
BNBobak Nazer
Bobak Nazer
Shlomo Shamai (Shitz)Shlomo Shamai (Shitz)
Shlomo Shamai (Shitz)
Consider a Gaussian multiple-input multiple-output (MIMO) multiple-access channel (MAC) with channel matrix H and a Gaussian MIMO broadcast channel (BC) with channel matrix HT. For the MIMO MAC, the integer-forcing architecture consists of first decoding integer-linear combinations of the transmitted codewords, which are then solved for the original messages. For the MIMO BC, the integer-forcing architecture consists of pre-inverting the integer-linear combinations at the transmitter so that each receiver can obtain its desired codeword by decoding an integer-linear combination. In both cases, integerforcing offers higher achievable rates than zero-forcing while maintaining a similar implementation complexity. This paper establishes an uplink-downlink duality relationship for integerforcing, i.e., any sum rate that is achievable via integer-forcing on the MIMO MAC can be achieved via integer-forcing on the MIMO BC with the same sum power and vice versa. Using this duality relationship, it is shown that integer-forcing can operate within a constant gap of the MIMO BC sum capacity. Finally, the paper proposes a duality-based iterative algorithm for the non-convex problem of selecting optimal beamforming and equalization vectors, and establishes that it converges to a local optimum.

24 September 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
Sung Hoon LimSung Hoon Lim
Sung Hoon Lim
CFChen Feng
Chen Feng
APAdriano Pastore
Adriano Pastore
BNBobak Nazer
Bobak Nazer
MGMichael Gastpar
Michael Gastpar
This paper presents a joint typicality framework for encoding and decoding nested linear codes in multi-user networks. This framework provides a new perspective on compute-forward within the context of discrete memoryless networks. In particular, it establishes an achievable rate region for computing a linear combination over a discrete memoryless multiple-access channel (MAC). When specialized to the Gaussian MAC, this rate region recovers and improves upon the lattice-based compute-forward rate region of Nazer and Gastpar, thus providing a unified approach for discrete memoryless and Gaussian networks. Furthermore, our framework provides some valuable insights on establishing the optimal decoding rate region for compute-forward by considering joint decoders, progressing beyond most previous works that consider successive cancellation decoding. Specifically, this paper establishes an achievable rate region for simultaneously decoding two linear combinations of nested linear codewords from K senders.

29 January 2013 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
BNBobak Nazer
Bobak Nazer
YSYanina Y. Shkel
Yanina Y. Shkel
SDStark C. Draper
Stark C. Draper
Consider the following unequal error protection scenario. One special message, dubbed the “red alert” message, is required to have an extremely small probability of missed detection. The remainder of the messages must keep their average probability of error and probability of false alarm below a certain threshold. The goal then is to design a codebook that maximizes the error exponent of the red alert message while ensuring that the average probability of error and probability of false alarm go to zero as the blocklength goes to infinity. This red alert exponent has previously been characterized for discrete memoryless channels. This paper completely characterizes the optimal red alert exponent for additive white Gaussian noise channels with block power constraints.

1 July 2018 in Journal of Neurotrauma
Verified
Journal Article
Closed access
KHKyle R. Hansen
Kyle R. Hansen
GDGloria J. DeWalt
Gloria J. DeWalt
AMAli I. Mohammed
Ali I. Mohammed
HTHua-An Tseng
Hua-An Tseng
MAMoona E. Abdulkerim
Moona E. Abdulkerim
XHXue Han
Xue Han
Mild traumatic brain injury (mTBI) represents a serious public health concern. While much is understood about long term changes in cell signaling and anatomical pathologies associated with mTBI, little is known about acute changes in neuronal function. Using large scale Ca2+ imaging in vivo, we characterized the intracellular Ca2+ dynamics in thousands of individual hippocampal neurons using a repetitive mild blast injury model where blasts were directed onto the cranium of unanesthetized mice on two consecutive days. Immediately following each blast event, neurons exhibited two types of changes in Ca2+ dynamics at different time scales. One was a reduction in slow Ca2+ dynamics that corresponded to shifts in basal intracellular Ca2+ levels at a time scale of minutes, suggesting a disruption of biochemical signaling. The second was a reduction in the rates of fast transient Ca2+ fluctuations at the sub-second time scale that are known to be closely linked to neural activity. Interestingly, the blast-induced changes in basal Ca2+ levels were independent of the changes in the rates of fast Ca2+ transients, suggesting that blasts had heterogeneous effects on different cell populations. Both types of changes recovered after about an hour. Together, our results demonstrate that mTBI induced acute, heterogeneous changes in neuronal function, altering intracellular Ca2+ dynamics across different time scales, which may contribute to the initiation of longer term pathologies.