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 5 of 5 for “"Asymptotic capacity"”.

  1. Free-space phase-fading MIMO: system model and capacity analysis

    … is stochastic, based on Telatar's research, its capacity is determined by singular eigenvalue distribution of the random correlation matrix corresponding to channel transmit matrix. Firstly, for proposed Free-Space MIMO system, the asymptotic analysis was performed for the ergodic capacity with …

    unsw Repository record for Free-space phase-fading MIMO: system model and capacity analysis (opens in a new tab)

  2. Multichannel Wireless Networks: Capacity and Protocols

    In this dissertation, we have established the asymptotic capacity of multichannel wireless networks with varying number of channels and interfaces. Capacity analysis has shown that it is feasible to effectively use a large number of channels even with only a few interfaces per node. Based on …

    uiuc Repository record for Multichannel Wireless Networks: Capacity and Protocols (opens in a new tab)

  3. On the saddle-point solution and the large-coalition behavior of fingerprinting games

    … pirated copies to the colluders. Fingerprinting capacity has recently been derived as the limit value of a sequence of maximin games with mutual information as their payoff functions. However, these games generally do not admit saddle-point solutions and are very hard to solve numerically. Here …

    uiuc Repository record for On the saddle-point solution and the large-coalition behavior of fingerprinting games (opens in a new tab)

  4. Some Optimization Problems in Wireless Networks

    … into two parts. In the first part, we study the asymptotic capacity scaling laws of different types of wireless networks. By "asymptotic", we mean that the number of nodes in the network goes to infinity. Such asymptotic capacity scaling laws offer fundamental understandings on the trend of …

    vt Repository record for Some Optimization Problems in Wireless Networks (opens in a new tab)

  5. Distances on rankings: from social choice to flash memories

    … read disturb or write disturb errors. We present capacity achieving codes that can correct a constant number of errors and asymptotically good codes that can correct a linear number of errors in the length of the code. Our results also include derivation of the asymptotic capacity of permutation …

    uiuc Repository record for Distances on rankings: from social choice to flash memories (opens in a new tab)