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 12 of 12 for “"butterfly network"”.

  1. Factored-matrix representation of distributed fast transforms

    … required later-processor data transfers on the Butterfly Network. The properties of there "transfer matrices" and the resulting output ordering are discussed in detail. The factored-matrix representation is then used to show that the Fast Hartley Transform (FHT) and the Walsh-Hadamard Transform …

    nps Repository record for Factored-matrix representation of distributed fast transforms (opens in a new tab)

  2. On the VLSI complexity and architecture of the Arithmetic Fourier Transform (AFT)

    … thesis presents a novel logarithmic-depth VLSI network for implementing a fundamental computation of the Arithmetic Fourier Transform (AFT). The VLSI optimality —in terms of area-time trade-off— of this Orthogonal Flat Tree (OFT) network is proved. Namely, it is proven that the area of the …

    ubc Repository record for On the VLSI complexity and architecture of the Arithmetic Fourier Transform (AFT) (opens in a new tab) Download PDF for On the VLSI complexity and architecture of the Arithmetic Fourier Transform (AFT) (opens in a new tab)

  3. Contiguous search by mobile agents in cube networks and chordal rings

    … the problem of searching for an intruder in a network. There is a team of collaborative software agents that are deployed to capture a hostile intruder (e.g., a virus). These agents move along the network links and the intruder has the capability of escaping arbitrarily fast. We propose …

    ottawa-retro Repository record for Contiguous search by mobile agents in cube networks and chordal rings (opens in a new tab)

  4. Performance of network coded systems supported by automatic repeat request

    Inspired by the network information theory, network coding was invented in 2000. Since then, the theory and application of network coding have received intensive research and various network coding schemes have been proposed and studied. It has been demonstrated that the packet-level network coding …

    soton Download PDF for Performance of network coded systems supported by automatic repeat request (opens in a new tab)

  5. Analysing and reducing the limitations of continuous-variable quantum cryptography and quantum networks

    … classical communications over various existing network topologies. Continuous-variable (CV) quantum key distribution (QKD) poses a practical solution to the security risks implied by the advancement of quantum information theory, with the promise of provably secure communications. Unfortunately, …

    whiterose Download PDF for Analysing and reducing the limitations of continuous-variable quantum cryptography and quantum networks (opens in a new tab)

  6. Generalized Information Bottleneck

    … Third, we discuss a task-aware cooperative networked control problem that minimizes the control cost of a control system with exogenous inputs under dimensionality bottleneck. In the end, we extend the generalized information bottleneck problem to a distributed setting with multiple sources …

    cornell Repository record for Generalized Information Bottleneck (opens in a new tab)

  7. Energy Consumption of Error Control Coding Circuits

    … up to polylogarithmic factors using a mesh network topology defined by Thompson and the encoding algorithm defined by Arιkan. A general class of circuits that compute successive cancellation decoding adapted from Arιkan's butterfly network algorithm is defined. It is shown that such decoders …

    toronto-retro Repository record for Energy Consumption of Error Control Coding Circuits (opens in a new tab)

  8. Parallel and Distributed Programing for Data Computation Intensive Applications

    … multi-core systems. The novel sorting technique, Butterfly Network Sort, exploit high parallelism in its design and thus achieve considerable speedup against state-of-the-art sorting techniques. Fast Fourier Transforms library (named ToPe-FFT) is implemented using OpenCL. ToPe-FFT is based on the …

    poli-torino Repository record for Parallel and Distributed Programing for Data Computation Intensive Applications (opens in a new tab)

  9. Local network coding on packet erasure channels -- From Shannon capacity to stability region

    Network Coding (NC) has emerged as a ubiquitous technique of communication networks and has extensive applications in both practical implementations and theoretical developments. While the Avalanche P2P file system from Microsoft, the MORE routing protocol, and the COPE coding architecture from MIT …

    purdue-thes Repository record for Local network coding on packet erasure channels -- From Shannon capacity to stability region (opens in a new tab)

  10. Coherent and non-coherent coded modulation for cooperative communications

    … assisted NC scheme relying on the popular butterfly network topology. As expected, the achievable BER performance is affected by the location of the RN. More specifically, when the transmit powers at the SNs and RN are identical, the RN located at the centre of the butterfly network …

    soton Download PDF for Coherent and non-coherent coded modulation for cooperative communications (opens in a new tab)

  11. An Operational Road towards Understanding Causal Indefiniteness within Post-Quantum Theories

    A theory, whatever it does, must correlate data. We commit ourselves to operational methodology, as a means towards studying the space of Generalised Probability Theories that are compatible with Indefinite Causality. Such a space of theories that combines the radical aspects of Quantum Theory: its …

    waterloo Repository record for An Operational Road towards Understanding Causal Indefiniteness within Post-Quantum Theories (opens in a new tab)

  12. Delay-sensitive Communications Code-Rates, Strategies, and Distributed Control

    … and reliable information on modern communication networks forces codewords to operate in a non-asymptotic regime. To achieve reliability for imperfect channels in this regime, codewords need to be retransmitted from receiver to the transmit buffer, aided by a fast feedback mechanism. Large …

    tamu Repository record for Delay-sensitive Communications Code-Rates, Strategies, and Distributed Control (opens in a new tab)