Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 83 for “"Capacity region"”.

  1. Capacity Region of Two Interfering Mimo Multiple Access Channels With Strong Interference

    … same time-frequency space, and characterize the capacity region of this network when the channel matrices satisfy a strong interference condition. This interfering MAC (IMAC) with aforementioned channel matrices is called strongly ordered IMAC in this work. We characterize the capacity region …

    ndsu Repository record for Capacity Region of Two Interfering Mimo Multiple Access Channels With Strong Interference (opens in a new tab)

  2. The Capacity Region of the Gaussian Z-Interference Channel with Gaussian Input and Weak Interference

    We consider a wireless communication scenario with two transmit-receive pairs where each of the transmitters has a message for its corresponding receiver and only one of the receivers face interference from the undesired transmitter. In our research, we focused on devising optimal ways to manage …

    ndsu Repository record for The Capacity Region of the Gaussian Z-Interference Channel with Gaussian Input and Weak Interference (opens in a new tab)

  3. On the capacity of multi-terminal systems : the interference and fading broadcast channels

    … networks is critical to determine the capacity of wireless networks. The capacity region of an interference network is defined as the set of rates that the users can simultaneously achieve while ensuring arbitrarily small probability of decoding error. It is an inherently hard problem …

    texas Repository record for On the capacity of multi-terminal systems : the interference and fading broadcast channels (opens in a new tab)

  4. Capacity Results for Wireless Networks: Effects of Correlation, Cooperation and Interference

    … perspective. The main focus of the thesis is on capacity results for entirely wireless networks. Correlated data is an inherent part of wireless networks. We study the multiple access channel with a special form of correlated data, called common data, in fading. We obtain a characterization of …

    maryland Repository record for Capacity Results for Wireless Networks: Effects of Correlation, Cooperation and Interference (opens in a new tab)

  5. On models for multi-user gaussian channels with fading

    … channels with fading is studied, and the capacity region of this model is found to be a good approximation of the capacity region of the original Gaussian network. This work extends the existing body of work on deterministic models for Gaussian multiuser channels to include the physical …

    texas Repository record for On models for multi-user gaussian channels with fading (opens in a new tab)

  6. Capacity Bounds for Broadcast Channels with Cooperative Receivers

    In this thesis, we investigate capacity bounds for selected communication networks. We first establish a novel capacity upper bound for a class of relay channels (RCs), derived using the Csisz\'{a}r-K\"{o}rner identity in combination with genie-aided techniques. We demonstrate that this bound is …

    toronto-retro Repository record for Capacity Bounds for Broadcast Channels with Cooperative Receivers (opens in a new tab)

  7. Information-theoretic Secrecy in Multi-user Channels

    … from the eavesdropper. We obtain the entire capacity-equivocation region for this channel model. In particular, we show the sufficiency of jointly Gaussian auxiliary random variables and channel input to evaluate the existing single-letter description of the capacity-equivocation region due …

    maryland Repository record for Information-theoretic Secrecy in Multi-user Channels (opens in a new tab)

  8. Characterization and computation of network coding capacity bounds

    … set of feasible information rates, called the capacity region of communication networks, is not known. Explicit characterization of the capacity region of communication networks is a long standing problem. In fact, characterizing the capacity region requires determination of the set of all …

    adelaide Repository record for Characterization and computation of network coding capacity bounds (opens in a new tab)

  9. A Theory of Second-Order Wireless Network Optimization

    … we sharply characterize the second-order capacity region of wireless access networks. We also propose a simple scheduling policy and prove that it can achieve every interior point in the second-order capacity region.

    tamu Repository record for A Theory of Second-Order Wireless Network Optimization (opens in a new tab)

  10. Information Transmission over Two-Way Networks

    … not fully explored. This thesis examines channel capacity problems for TWCs and identifies coding methods to facilitate and enhance two-way simultaneous transmission. We first make use of channel symmetry properties to determine the capacity region of three types of two-way networks: (a) …

    queens Repository record for Information Transmission over Two-Way Networks (opens in a new tab)

  11. Capacity of interference networks : achievable regions and outer bounds

    … using the same communication channel. The capacity region of an interference network is defined as the set of data rates that can be simultaneously achieved by the users of the network. One of the most important example of an interference network is the wireless network, where the …

    texas Repository record for Capacity of interference networks : achievable regions and outer bounds (opens in a new tab)

  12. An information theoretic approach to non-centralized multi- user communication systems

    … simplified description of the Han-Kobayashi rate region, the best known rate region to date for the IFC, is established. Using this result, we prove the capacity region of a new class of IFCs. For the two-user ZC, we study both the discrete memoryless ZC and the Gaussian ZC. We first establish …

    nus Repository record for An information theoretic approach to non-centralized multi- user communication systems (opens in a new tab) Download file for An information theoretic approach to non-centralized multi- user communication systems (opens in a new tab)

  13. Resource Provisioning in the Electrical Grid

    … to sizing the electrical grid, obtaining the capacity region corresponding to a given transformer and storage size. We conduct a fine-grained measurement study of household electrical load. These measurements are essential for two reasons. First, we use them to construct reference models for …

    waterloo Repository record for Resource Provisioning in the Electrical Grid (opens in a new tab)

  14. Capacity-Achieving Distributions of Gaussian Multiple Access Channel with Peak Constraints

    … ground-breaking paper, Shannon showed that the capacity of a point-to-point additive white Gaussian noise channel under an average power constraint at the input, is achieved by Gaussian distribution. Although imposing a limitation on the peak of the channel input is also very important in …

    waterloo Repository record for Capacity-Achieving Distributions of Gaussian Multiple Access Channel with Peak Constraints (opens in a new tab)

  15. Design and Analysis of Low Complexity Network Coding Schemes

    … In the first part we studied the routing capacity of wired networks. We provided a description of the routing capacity region in terms of a finite set of linear inequalities. We next used this result to study the routing capacity region of undirected ring networks for two multimessage …

    tamu Repository record for Design and Analysis of Low Complexity Network Coding Schemes (opens in a new tab)

  16. Optimal resource allocation algorithms for cloud computing

    … Given our model of a cloud, we define its capacity, i.e., the maximum rates at which jobs can be processed in such a system. An algorithm is said to be throughput-optimal if it can stabilize the system whenever the load is within the capacity region. We show that the widely-used Best-Fit …

    uiuc Repository record for Optimal resource allocation algorithms for cloud computing (opens in a new tab)

  17. Physical-Layer Security in Wireless Communication Systems

    … and present an inner bound on the secrecy capacity region for this model. This inner bound is based on a combination of random binning, and the Gelfand-Pinsker binning. We further study the situation in which the channels are degraded. For the degraded broadcast channel with an …

    waterloo Repository record for Physical-Layer Security in Wireless Communication Systems (opens in a new tab)

  18. Topics in Network Information Representation and Communication

    … dissertation, the problem of determining the capacity region of the Gaussian interference channel is discussed. New outer bounds on capacity are derived, and a very simple power-splitting scheme is shown to be within 1 bits/s/Hz of the capacity of the channel for all values of the channel …

    uiuc Repository record for Topics in Network Information Representation and Communication (opens in a new tab)

  19. Coding for Relay Networks with Parallel Gaussian Channels

    … is asymptotically optimal and achieves the capacity region to within 1 bit; however, similar results beyond the memoryless case are still lacking. This is mainly because channels with memory would destroy the lattice structure that is most crucial for the compute-and-forward paradigm. Hence, …

    tamu Repository record for Coding for Relay Networks with Parallel Gaussian Channels (opens in a new tab)

Page 1 of 5