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 71 for “"Achievable rates"”.

  1. Achievable rates for queue-based timing stegocodes

    … approach is proposed to compute the maximum achievable rate of the queue-based stegocode and the optimal encoding functions. We also design simple practical codes, test them on a communication system while taking network noise into account, and compare their performance to the mappings under …

    uiuc Repository record for Achievable rates for queue-based timing stegocodes (opens in a new tab)

  2. Achievable rates for relay networks using superposition coding

    … strategy and its usefulness in terms of achievable information theoretic rates. The achievable rate of the superposition of block Markov encoding (decode-forward) and side information encoding (compress-forward) for the three-node Gaussian relay channel is analyzed. It is generally …

    iastate Repository record for Achievable rates for relay networks using superposition coding (opens in a new tab)

  3. Achievable rates of iterative MIMO receivers over interference channels

    In this thesis, we study the achievable rates of some interference communication schemes when iterative interference-cancellation (IC) is applied. We assume multiple-input multiple-output (MIMO) communication employing iterative receivers with linear front-ends which involves two modules …

    concordia Download PDF for Achievable rates of iterative MIMO receivers over interference channels (opens in a new tab)

  4. Achievable Rates, Optimal Signalling Schemes and Resource Allocation for Fading Wireless Channels

    … these channels, we obtain the capacity region achievable with power control, as well as the power control policies that achieve the desired rate points on the capacity region. We provide practical one-user-at-a-time iterative algorithms to compute the optimal power distributions as functions of …

    maryland Repository record for Achievable Rates, Optimal Signalling Schemes and Resource Allocation for Fading Wireless Channels (opens in a new tab)

  5. Transmission schemes and achievable rates for the two-way relay channel with intermittency

    … In this thesis, we calculate capacity bounds and achievable rates for the intermittent two-way relay channel. We classify our system model into three different cases depending on the knowledge of the channel state at different nodes in the networks. We consider an ideal case where channel states …

    ubc Repository record for Transmission schemes and achievable rates for the two-way relay channel with intermittency (opens in a new tab) Download PDF for Transmission schemes and achievable rates for the two-way relay channel with intermittency (opens in a new tab)

  6. Cooperative coding and routing in multiple-terminal wireless networks

    We investigate information-theoretic achievable rates for multiple-terminal wireless networks. First, we find the best way to route data from the source to the destination if each relay must fully decode the source message. We design an algorithm that finds a set of routes, containing a …

    nus Repository record for Cooperative coding and routing in multiple-terminal wireless networks (opens in a new tab) Download file for Cooperative coding and routing in multiple-terminal wireless networks (opens in a new tab)

  7. Semantic Security for the Fast Fading Wiretap Channel.

    We provide a set of semantically secure achievable rates for the fast fading wiretap channel. In particular, we do so for the cases where there is channel state information at the transmitter (CSIT) for both the main and eavesdropper channels (full CSIT), for only the main channel (partial CSIT), …

    ndsu Repository record for Semantic Security for the Fast Fading Wiretap Channel. (opens in a new tab)

  8. Capacity Results for Wireless Cooperative Communications with Relay Conferencing

    … over time), for which we obtain the respective achievable rates by using the decode-and-forward (DF), compress-and-forward (CF), and amplify-and-forward (AF) relaying schemes with DF and AF adopted the conferencing schemes. Moreover, we prove some capacity results under some special conditions. …

    tamu Repository record for Capacity Results for Wireless Cooperative Communications with Relay Conferencing (opens in a new tab)

  9. Performance analysis of large scale networks in the finite blocklength regime

    … uplink and downlink (DL) networks, theoretical achievable rates, outage probability, reliability, and the coding rate meta distribution are derived using finite blocklength coding theory and stochastic geometry. Moreover, achievable rates under practical modulation schemes and multilevel polar …

    ubc Repository record for Performance analysis of large scale networks in the finite blocklength regime (opens in a new tab) Download PDF for Performance analysis of large scale networks in the finite blocklength regime (opens in a new tab)

  10. Coding Schemes for Multiple-Relay Channels

    … compression at the relay, cannot achieve higher rates for the original message than successive decoding. This thesis addresses some fundamental issues in generalizing and unifying the above D-F and C-F relay schemes to the multiple-relay case. We first generalize the C-F scheme to multiple-relay …

    waterloo Repository record for Coding Schemes for Multiple-Relay Channels (opens in a new tab)

  11. Resource Management in Multi-channel Relaying

    … and multi-user setups, we present the total achievable rates through optimizing CP, PA and channel-user assignment which incurs multi-user diversity. While the achievable rates provide theoretical insight for the performance of such systems, we next incorporate the integer nature of bit …

    toronto-retro Repository record for Resource Management in Multi-channel Relaying (opens in a new tab)

  12. Millimeter wave wearable communication networks : analytic modeling and MIMO support

    … goggles and augmented reality glasses require rates of the order of gigabits-per-second and potentially very low latency. Supporting high data rate wireless connectivity for applications such as uncompressed video streaming among wearable devices in a densely crowded environment is challenging. …

    texas Repository record for Millimeter wave wearable communication networks : analytic modeling and MIMO support (opens in a new tab)

  13. Topics in network information theory

    … and compressand-forward (CF). Corresponding new achievable rates/rate regions are obtainedfor these channels.

    nus Repository record for Topics in network information theory (opens in a new tab) Download file for Topics in network information theory (opens in a new tab)

  14. Achievable Rate Regions of Two-Way Relay Channels

    … proposed by Van-der Meulen. However, the general achievable rate region of a relay channel is still unknown which inspires more people to persistently work on. There are several different kinds of coding schemes proposed by people after relay channels came into our lives. Until now, the two most …

    waterloo Repository record for Achievable Rate Regions of Two-Way Relay Channels (opens in a new tab)

  15. Binary decomposition and transmission schemes for the optical intensity multiple access channel

    … encoding and decoding processes, along with the achievable rates for each scheme. Performance evaluations of these schemes are presented while adhering to practical constraints. Compared to capacity and bounds, the devised coding schemes show promising results, which closely approximates capacity …

    ubc Repository record for Binary decomposition and transmission schemes for the optical intensity multiple access channel (opens in a new tab) Download PDF for Binary decomposition and transmission schemes for the optical intensity multiple access channel (opens in a new tab)

  16. New Large-Scale Optimization Methods with Applications in Communication Networks, Medical Imaging, and System Identification

    … and dynamical systems. The first chapter concentrates on the algorithm development for the joint problem of mapping virtual network functions to high-volume servers, resource provisioning, and traffic routing where the demand is known. In the next two chapters of this dissertation, we focus on …

    umn Repository record for New Large-Scale Optimization Methods with Applications in Communication Networks, Medical Imaging, and System Identification (opens in a new tab)

  17. Coding for Cooperative Communications

    … based on Wyner-Ziv coding, and derive the achievable rates specifically with BPSK modulation. The CF strategy is implemented with low-density parity-check (LDPC) and irregular repeataccumulate codes and is found to operate within 0.34 dB of the theoretical limit. For the quasi-static fading …

    tamu Repository record for Coding for Cooperative Communications (opens in a new tab)

  18. Lattice-Based Coding Schemes for Wireless Relay Networks

    … Using this, we show that the information rates achievable with nested lattice codebooks over Eisenstein integers are higher than those achievable with nested lattice codebooks over integers considered by Nazer and Gastpar in [6] in the average sense. We also propose a separation-based …

    tamu Repository record for Lattice-Based Coding Schemes for Wireless Relay Networks (opens in a new tab)

  19. Advanced Topics in Estimation and Information Theory

    … the first question raised is "whether the code rates in distributed estimation are different from those in conventional communications?" Surprisingly, under certain conditions, the answer is found to be negative. It is shown that for fixed parameters, the achievable rates coincide with rates in …

    mcmaster Repository record for Advanced Topics in Estimation and Information Theory (opens in a new tab)

Page 1 of 4