Capacity bounds for diamond networks with an orthogonal broadcast channel

Shirin Saeedi Bidokhti
Postdoctoral researcher, Stanford
Date: Dec. 4th, 2015


A class of diamond networks is studied where the broadcast component is orthogonal and modeled by two independent bit-pipes. New upper and lower bounds on the capacity are derived. The proof technique for the upper bound generalizes bounding techniques of Ozarow for the Gaussian multiple description problem (1981) and Kang and Liu for the Gaussian diamond network (2011). The lower bound is based on Marton's coding technique and superposition coding. The bounds are evaluated for Gaussian and binary adder multiple access channels (MACs). For Gaussian MACs, both the lower and upper bounds strengthen the Kang-Liu bounds and establish capacity for interesting ranges of bit-pipe capacities. For binary adder MACs, the capacity is established for all ranges of bit-pipe capacities.


Shirin Saeedi Bidokhti is a postdoctoral researcher in the Electrical Engineering Department at Stanford University where she works with Tsachy Weissman. She got her B.Sc (2005) in Electrical Engineering from University of Tehran, and her M.Sc (2007) and PhD (2012) both in Communication Systems from Ecole Polytechnique Fédérale de Lausanne (EPFL). Her PhD advisors were Suhas Diggavi and Christina Fragouli. From 2013 to 2015, she was a postdoctoral researcher at the Technical University of Munich working with Gerhard Kramer.

Dr. Saeedi was awarded a Prospective Researcher Fellowship (2012) and an Advanced Postdoc.Mobility Fellowship (2014) both from the Swiss National Science Foundation. Her research interests include information theory and applications, multi-user communication systems and network coding.