#### Filter Results:

#### Publication Year

2006

2013

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Bike Xie, Richard Wesel
- 2008

— There are numerous notions of symmetry for discrete memoryless channels. A common goal of these various definitions is that the capacity may be easily computed once the channel is declared to be symmetric. In this paper we focus on a class of definitions of symmetry characterized by the invariance of the channel mutual information over a group of… (More)

—This paper provides an explicit expression for the capacity region of the two-user broadcast Z channel and proves that the optimal boundary can be achieved by independent encoding of each user. Specifically, the information messages corresponding to each user are encoded independently and the OR of these two encoded streams is transmitted. Nonlinear turbo… (More)

- Bike Xie, Miguel Griot, Andres I Vila Casado, Richard D Wesel
- 2007

— This paper presents an optimal transmission strategy, with simple encoding and decoding, for the two-user broadcast Z channel. This paper provides an explicit-form expression for the capacity region and proves that the optimal surface can be achieved by independent encoding. Specifically, the information messages corresponding to each user are encoded… (More)

Let X → Y → Z be a discrete memoryless degraded broadcast channel (DBC) with marginal transition probability matrices T Y X and T ZX. Denote q as the distribution of the channel input X. For any given q, and H(Y |X) ≤ s ≤ H(Y), where H(Y |X) is the conditional entropy of Y given X and H(Y) is the entropy of Y , define the function F * TY X ,TZX (q, s) as… (More)

— Certain degraded broadcast channels (DBCs) have the property that the boundary of the capacity region can be achieved by an encoder that combines independent codebooks (one for each receiver) using the same single-letter function that adds distortion to the channel. We call this the natural encoder for the DBC. Natural encoders are known to achieve the… (More)

In this paper, we propose serially concatenated trellis coded modulations (SCTCMs) that perform consistently close to the available mutual information for periodic erasure channel (PEC), periodic fading channel (PFC) and the ¾ ¢ ¾ compound matrix channel. We use both the maximum-likelihood decoding criteria and iterative decoding criteria to design… (More)

— This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weighted sum finish time (WSFT) for the one-to-many file transfer where peers have both uplink and downlink bandwidth constraints specified. The static scenario is a file-transfer scheme in… (More)

This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weighted sum download time (WSDT) for the one-to-many file transfer. Previous work has shown that, given an order at which the receivers finish downloading, the minimum WSD can be solved in… (More)

—Certain binary asymmetric channels, such as Z-channels in which one of the two crossover probabilities is zero, demand optimal ones densities different from 50%. Some broadcast channels, such as broadcast binary symmetric channels (BBSC) where each component channel is a binary symmetric channel, also require a non-uniform input distribution due to the… (More)

—Consider a memoryless degraded broadcast channel (DBC) in which the channel output is a single-letter function of the channel input and the channel noise. As examples, for the Gaussian broadcast channel (BC) this single-letter function is real scalar addition and for the binary-symmetric BC this single-letter function is modulo-two addition. This paper… (More)