Bobak Nazer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bobak Nazer has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Michael Gastpar
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, USA
5 shared publications
Latest Publications
- 1 March 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21603839,p. 112-115
Structured Random Codes and Sensor Network Coding Theorems
In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually established via a two-stage approach: The sources are compressed into bits, and these bits are reliably communicated across the noisy channels. Random coding arguments are the backbone of both stages of the proof. This "separation" strategy not only establishes the optimal performance for stationary ergodic point-to-point problems, but also for a number of simple network situations, such as independent sources that are communicated with respect to separate fidelity criteria across a multiple-access channel. Beyond such simple cases, for general networks, separation-based coding is suboptimal. For instance, for a simple Gaussian sensor network, uncoded transmission is exactly optimal and performs exponentially better than a separation-based solution. In this note, we generalize this sensor network strategy by employing a lattice code. The underlying linear structure of our code is crucial to its success.
- 1 March 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21603839,p. 112-115
Structured Random Codes and Sensor Network Coding Theorems
In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually established via a two-stage approach: The sources are compressed into bits, and these bits are reliably communicated across the noisy channels. Random coding arguments are the backbone of both stages of the proof. This "separation" strategy not only establishes the optimal performance for stationary ergodic point-to-point problems, but also for a number of simple network situations, such as independent sources that are communicated with respect to separate fidelity criteria across a multiple-access channel. Beyond such simple cases, for general networks, separation-based coding is suboptimal. For instance, for a simple Gaussian sensor network, uncoded transmission is exactly optimal and performs exponentially better than a separation-based solution. In this note, we generalize this sensor network strategy by employing a lattice code. The underlying linear structure of our code is crucial to its success.
- Open Access
The Case for Structured Random Codes in Network Capacity Theorems
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for proving some network capacity theorems: structured coding arguments, such as random linear or lattice codes, attain higher rates. Historically, structured codes have been studied as a stepping stone to practical constructions. However, K\"{o}rner and Marton demonstrated their usefulness for capacity theorems through the derivation of the optimal rate region of a distributed functional source coding problem. Here, we use multicasting over finite field and Gaussian multiple-access networks as canonical examples to demonstrate that even if we want to send bits over a network, structured codes succeed where simple random codes fail. Beyond network coding, we also consider distributed computation over noisy channels and a special relay-type problem.
Open AccessThe Case for Structured Random Codes in Network Capacity Theorems
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for proving some network capacity theorems: structured coding arguments, such as random linear or lattice codes, attain higher rates. Historically, structured codes have been studied as a stepping stone to practical constructions. However, K\"{o}rner and Marton demonstrated their usefulness for capacity theorems through the derivation of the optimal rate region of a distributed functional source coding problem. Here, we use multicasting over finite field and Gaussian multiple-access networks as canonical examples to demonstrate that even if we want to send bits over a network, structured codes succeed where simple random codes fail. Beyond network coding, we also consider distributed computation over noisy channels and a special relay-type problem.
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 260-265
The Case for Structured Random Codes in Network Communication Theorems
In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually established via a two-stage approach: The sources are compressed into bits, and these bits are reliably communicated across the noisy channels. Random coding arguments are the backbone of both stages of the proof. This strategy not only establishes the optimal performance for stationary ergodic point-to-point problems, but also for a number of simple network situations, such as independent sources that are communicated with respect to separate fidelity criteria across a multiple-access channel. Beyond such simple cases, for general networks, unstructured random coding arguments are not sufficient. This was first realized for source coding by Korner and Marton, who showed that for a distributed souce coding problem where one only needs to recover a function of the sources random linear codes are necessary. The goal of this note is to extend this insight to pure channel coding as well as to joint source-channel coding problems, such as the problem of reliable computation over a multiple-access channel and a multi-access network with relays.
- 1 September 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 260-265
The Case for Structured Random Codes in Network Communication Theorems
In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually established via a two-stage approach: The sources are compressed into bits, and these bits are reliably communicated across the noisy channels. Random coding arguments are the backbone of both stages of the proof. This strategy not only establishes the optimal performance for stationary ergodic point-to-point problems, but also for a number of simple network situations, such as independent sources that are communicated with respect to separate fidelity criteria across a multiple-access channel. Beyond such simple cases, for general networks, unstructured random coding arguments are not sufficient. This was first realized for source coding by Korner and Marton, who showed that for a distributed souce coding problem where one only needs to recover a function of the sources random linear codes are necessary. The goal of this note is to extend this insight to pure channel coding as well as to joint source-channel coding problems, such as the problem of reliable computation over a multiple-access channel and a multi-access network with relays.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2391-2395
Computation over Gaussian Multiple-Access Channels
We consider the problem of computing the sum of independent Gaussian sources over a Gaussian multiple-access channel (MAC) with respect to a mean-squared error criterion. When the source and channel bandwidths are equal, the best separation-based solution to this problem performs exponentially worse in a distortion sense compared to the optimal solution: uncoded transmission. In this paper, we develop lattice codes for exploiting the structure of the Gaussian MAC when there are more channel uses than source symbols. We also demonstrate the usefulness of these codes in determining the multicast capacity of a simple AWGN network.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2391-2395
Computation over Gaussian Multiple-Access Channels
We consider the problem of computing the sum of independent Gaussian sources over a Gaussian multiple-access channel (MAC) with respect to a mean-squared error criterion. When the source and channel bandwidths are equal, the best separation-based solution to this problem performs exponentially worse in a distortion sense compared to the optimal solution: uncoded transmission. In this paper, we develop lattice codes for exploiting the structure of the Gaussian MAC when there are more channel uses than source symbols. We also demonstrate the usefulness of these codes in determining the multicast capacity of a simple AWGN network.
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1354-1358
Computing over Multiple-Access Channels with Connections to Wireless Network Coding
We study the problem of multicasting over a network of multiple-access channels (MACs). The separation-based solution to this problem is to reduce each MAC to a set of noiseless bit pipes via a channel code and then employ network coding. Sometimes, however, the physical-layer structure of the MAC can be exploited more advantageously. In many cases of interest, the MAC output is a (deterministic) function of its inputs, corrupted by noise. We develop structured codes to exploit the natural function of a MAC to reliably compute functions as part of a network code and show that in many scenarios of interest our scheme outperforms the separation-based solution. If each MAC can be written as a sum over some finite field plus noise, then our achievable rate coincides with the max-flow min-cut bound
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1354-1358
Computing over Multiple-Access Channels with Connections to Wireless Network Coding
We study the problem of multicasting over a network of multiple-access channels (MACs). The separation-based solution to this problem is to reduce each MAC to a set of noiseless bit pipes via a channel code and then employ network coding. Sometimes, however, the physical-layer structure of the MAC can be exploited more advantageously. In many cases of interest, the MAC output is a (deterministic) function of its inputs, corrupted by noise. We develop structured codes to exploit the natural function of a MAC to reliably compute functions as part of a network code and show that in many scenarios of interest our scheme outperforms the separation-based solution. If each MAC can be written as a sum over some finite field plus noise, then our achievable rate coincides with the max-flow min-cut bound