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 848 for “"random access"”.

  1. Random Access DNA Registers

    … tasks directly on DNA without compromising local random access memory operations. We propose a novel encoding strategy that stores data in individual register strands. Each register strand encodes both the value and address of the data in two functionally separate subsequences, providing …

    umn Repository record for Random Access DNA Registers (opens in a new tab)

  2. Random access cooperative systems

    … is being sent. We present analysis of a class of random-access cooperative systems and show that the same performance as the scheduled systems can be achieved as long as certain requirements are met in the packet detection scheme of the relay. In particular, we find that a static decision …

    rice Repository record for Random access cooperative systems (opens in a new tab)

  3. Random access spectral imaging

    … snapshot spectral imaging device that employs a random-spatial-access technique to record spectra only from the regions of interest in the scene, thus enabling maximisation of integration time and minimisation of data volume and recording rate. The aim of this prototype is to demonstrate how a …

    glasgow Download PDF for Random access spectral imaging (opens in a new tab)

  4. Multicarrier Diversity in Random Access Networks

    Random access schemes are primarily used for data transmission in the uplink of cellular networks. Every user in a random access network is programmed to follow a predetermined transmit control policy that is designed to achieve optimal network performance. This approach, however, is not very …

    gatech Repository record for Multicarrier Diversity in Random Access Networks (opens in a new tab)

  5. Computational complexity of random-access models

    … machine and its multidimensional variant, the random access machine (RAM), the tree machine, and the pointer machine. The basic computational properties of the pointer machine are examined in more detail. For example, time and space hierarchy theorems for pointer machines are presented.

    uiuc Repository record for Computational complexity of random-access models (opens in a new tab)

  6. Multistate spin-transfer-torque random access memory

    Spin-transfer-torque random access memory (STT-RAM) is an emerging non-volatile memory technology that stores information as the relative alignment of two ferromagnets in a magnetic tunnel junction stack. Due to high scalability, speed and endurance STT-RAM is being considered as a promising …

    texas Repository record for Multistate spin-transfer-torque random access memory (opens in a new tab)

  7. Optimal random access protocols for wireless networks

    In this thesis, we present several random access algorithms for medium access control in wireless networks. Optimization theory, game theory, and dynamic programming are applied in the analysis and the design of these algorithms. First, we study the problem of multi-channel random access using the …

    ubc Repository record for Optimal random access protocols for wireless networks (opens in a new tab) Download PDF for Optimal random access protocols for wireless networks (opens in a new tab)

  8. Sorting real numbers on random access machines

    … of Segment-Sort algorithm: deterministic and random. With the deterministic model, the Basic RAM, it is possible to sort input populations randomly chosen from a broad class of common probability distributions in "space" (number of memory words, each able to hold a real number) and average …

    ubc Repository record for Sorting real numbers on random access machines (opens in a new tab) Download PDF for Sorting real numbers on random access machines (opens in a new tab)

  9. Quantum Random Access Codes with Shared Randomness

    … This procedure is called (n,1,p) quantum random access code (QRAC) where p > 1/2 is its success probability. It is known that (2,1,0.85) and (3,1,0.79) QRACs (with no classical counterparts) exist and that (4,1,p) QRAC with p > 1/2 is not possible. We extend this model with shared …

    waterloo Repository record for Quantum Random Access Codes with Shared Randomness (opens in a new tab)

  10. Sparse Activity Detection for Massive Random Access

    This thesis considers the massive random access problem in which a large number of sporadically active devices attempt to communicate with the base-station (BS) in the uplink. For device identification, each device is preassigned a unique signature sequence from a large set of non-orthogonal …

    toronto-retro Repository record for Sparse Activity Detection for Massive Random Access (opens in a new tab)

  11. Advanced random access techniques for satellite communications

    In this thesis, Advanced Random Access techniques for Satellite Communications are studied. In the last years, new advances in multi-access communication protocols together with the increasing need for bidirectional communications in consumer type of interactive satellite terminals have revived the …

    cagliari Repository record for Advanced random access techniques for satellite communications (opens in a new tab)

  12. Random access for massive machine-type communications

    … to accommodate such a massive connectivity, random access schemes are deemed as an efficient method. While the random access schemes can reduce the signalling overhead, they result in the unknown user activity and the inevitable interference from contending users. This seriously hinders the …

    unsw Repository record for Random access for massive machine-type communications (opens in a new tab)

  13. Instruction Sets for Parallel Random Access Machines

    … the computational power of time bounded Parallel Random Access Machines (PRAMs) with different instruction sets. A basic PRAM can perform the following operations in unit-time: addition, subtraction, Boolean operations, comparisons, and indirect addressing. Multiple processors may concurrently …

    uiuc Repository record for Instruction Sets for Parallel Random Access Machines (opens in a new tab)

  14. Cerium oxide based resistive random access memory devices

    Resistive Random Access Memory (RRAM) is an emerging technology of non-volatile memory (NVM). Although the observation of metal oxide that can undergo an abrupt insulator-metal transition into a conductive state has been known for over 40 years, researchers started investigating those materials for …

    texas Repository record for Cerium oxide based resistive random access memory devices (opens in a new tab)

  15. High Performance Lateral Phase Change Random Access Memory

    Phase change random access memory (PCRAM) is one of the best candidates for next generation non-volatile memory. Lateral PCRAM presents one of the best device structures for achieving high device performance. This thesis presents the solutions to achieve high performance lateral PCRAM devices. …

    nus Repository record for High Performance Lateral Phase Change Random Access Memory (opens in a new tab) Download file for High Performance Lateral Phase Change Random Access Memory (opens in a new tab)

  16. The Reliability of dynamic random access memory chips

    Advances in dynamic random access memory (DRAM) chip capacity have required designers to develop and incorporate many new techniques to ensure viable yields and to maintain adequate reliability. One technique used is the incorporation of error correction code circuitry which increases the yield of …

    uvic Repository record for The Reliability of dynamic random access memory chips (opens in a new tab)

  17. Leveraging Massive MIMO Spatial Diversity in Random Access

    Random access is a crucial building block for nearly all wireless networks, and impacts both the overall spectral efficiency and latency in communication. In next-generation networks, it is expected that the diverse new services will be served by cellular networks, e.g. connections to …

    rice Repository record for Leveraging Massive MIMO Spatial Diversity in Random Access (opens in a new tab)

  18. Optimizing Database Algorithms for Random-Access Block Devices

    … these technologies enable what we refer to as random-access block devices. Unlike hard disks, these devices have fast random accesses; on the other hand, their writes are more expensive than their reads. In this work, we study how to optimize database and storage algorithms for the I/O …

    duke Repository record for Optimizing Database Algorithms for Random-Access Block Devices (opens in a new tab)

  19. Coding and Compressed Sensing for Massive Random Access

    … at a low computational cost for the unsourced random access channel. Unsourced random access is a novel multiple access paradigm attuned to machine driven communications. In this setting, a wireless network is composed of a massive number of devices among which a small subset are active at any …

    tamu Repository record for Coding and Compressed Sensing for Massive Random Access (opens in a new tab)

Page 1 of 43