371 citations · 2.6k across the 122 of their papers we have counts for
12 papers · 1 filter
A Survey on Modulation Techniques in Molecular Communication via Diffusion
Mehmet Sukru Kuran, H. Birkan Yilmaz, Ilker Demirkol +2
This survey paper focuses on modulation aspects of molecular communication, an emerging field focused on building biologically-inspired systems that embed data within chemical sign…
Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes
Seyyed Ali Hashemi, Marco Mondelli, Arman Fazeli +3
This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the nu…
Bayesian Algorithms for Decentralized Stochastic Bandits
Anusha Lalitha, Andrea Goldsmith
We study a decentralized cooperative multi-agent multi-armed bandit problem with arms and agents connected over a network. In our model, each arm's reward distribution is s…
Interference Reduction in Virtual Cell Optimization
Michal Yemini, Elza Erkip, Andrea J. Goldsmith
Virtual cell optimization clusters cells into neighborhoods and performs optimized resource allocation over each neighborhood. In prior works we proposed resource allocation scheme…
Decentralized optimization over noisy, rate-constrained networks: Achieving consensus by communicating differences
Rajarshi Saha, Stefano Rini, Milind Rao +1
In decentralized optimization, multiple nodes in a network collaborate to minimize the sum of their local loss functions. The information exchange between nodes required for this t…
Construction of Polar Codes with Reinforcement Learning
Yun Liao, Seyyed Ali Hashemi, John Cioffi +1
This paper formulates the polar-code construction problem for the successive-cancellation list (SCL) decoder as a maze-traversing game, which can be solved by reinforcement learnin…
Learned Factor Graphs for Inference from Stationary Time Sequences
Nir Shlezinger, Nariman Farsad, Yonina C. Eldar +1
The design of methods for inference from time sequences has traditionally relied on statistical models that describe the relation between a latent desired sequence and the observed…
Capacities and Optimal Input Distributions for Particle-Intensity Channels
Nariman Farsad, Will Chuang, Andrea Goldsmith +6
This work introduces the particle-intensity channel (PIC) as a model for molecular communication systems and characterizes the capacity limits as well as properties of the optimal…
Exploiting Local and Cloud Sensor Fusion in Intermittently Connected Sensor Networks
Michal Yemini, Stephanie Gil, Andrea Goldsmith
We consider a detection problem where sensors experience noisy measurements and intermittent communication opportunities to a centralized fusion center (or cloud). The objective of…
Threshold-Based Fast Successive-Cancellation Decoding of Polar Codes
Haotian Zheng, Seyyed Ali Hashemi, Alexios Balatsoukas-Stimming +4
Fast SC decoding overcomes the latency caused by the serial nature of the SC decoding by identifying new nodes in the upper levels of the SC decoding tree and implementing their fa…
Data-Driven Symbol Detection via Model-Based Machine Learning
Nariman Farsad, Nir Shlezinger, Andrea J. Goldsmith +1
The design of symbol detectors in digital communication systems has traditionally relied on statistical channel models that describe the relation between the transmitted symbols an…
Data-Driven Factor Graphs for Deep Symbol Detection
Nir Shlezinger, Nariman Farsad, Yonina C. Eldar +1
Many important schemes in signal processing and communications, ranging from the BCJR algorithm to the Kalman filter, are instances of factor graph methods. This family of algorith…