Search Constraints

Start Over
Filtering by: Creator Hyskell, C. M. Remove constraint Creator: Hyskell, C. M. Advisor Bose, Bella Remove constraint Advisor: Bose, Bella

Search Results

  • Diversity combining ARQ over the m(> 2)-ary unidirectional channel

    Creator:
    Elarief, Noha
    Abstract:
    In diversity combining automatic repeat request (ARQ), erroneous packets are combined together forming a single, more reliable, packet. In this thesis, we give a diversity combining scheme for the m-ary unidirectional channel. A system using the given scheme with a t-unidirectional error detecting code is able to correct up to...
    Resource Type:
    Masters Thesis
    Full Text:
    ) = ⌊ (m−1) n 2 ⌋ , has the maximum number of unordered codewords; thus, C is an optimal AUED code. Given

  • On edge disjoint Hamiltonian cycles in torus and Gaussian networks

    Creator:
    Alazemi, Fawaz M.
    Abstract:
    Many algorithms in parallel systems can be easily solved if we can generate a Hamiltonian cycle on the underly network. Finding Hamiltonian cycle is a well known NP-complete problem. For specific instances of regular graphs, such as Torus and Gaussian network, one can easily find Hamiltonian cycles. In this thesis,...
    Resource Type:
    Masters Thesis
    Full Text:
    Gaussian network G bn/2c α , for 1 ≤ 2r ≤ n < 2r+1. c©Copyright by Fawaz M. Alazemi December 4, 2014

  • Efficient key management protocols for mobile ad hoc networks

    Creator:
    Erdem, Özkan M.
    Abstract:
    In this thesis, novel solutions are proposed for key management issues in mobile ad hoc networks. Presented Hierarchical Binary Tree (HBT) based model is distributed, self-organizing, scalable and does not employ online key distribution authority or group manager. Two different group authentication and group key establishment protocols are proposed for...
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF Ozkan M. Erdem for the

  • Some contributions to asymmetric error control codes

    Creator:
    Elmougy, Samir
    Abstract:
    In some practical systems, most of the errors are of 1 → 0 type and 0 → 1 errors occur very rarely. In this thesis, first, the capacity of the asymmetric channel is derived. The capacity of the binary symmetric channel (BSC) and the Z-channel can be derived from this...
    Resource Type:
    Dissertation
    Full Text:
    systematic t-unidirectional error detecting codes over Zm, m > 2 is designed. These codes can detect 2

  • A token caching waiting-matching unit for tagged-token dataflow computers

    Creator:
    Traylor, Roger L.
    Abstract:
    Computers using the tagged-token dataflow model are among the best candidates for delivering extremely high levels of performance required in the future. Instruction scheduling in these computers is determined by associatively matching data-bearing tokens in a Waiting-Matching Unit (W-M unit). At the W-M unit, incoming tokens with matching contexts are...
    Resource Type:
    Masters Thesis
    Full Text:
    associatively matching data-bearing tokens in a Waiting-Matching Unit (W-M unit). At the W-M unit, incoming

  • Object-Oriented simulation model of a Digital Switching System

    Creator:
    Krishnapura, SheshaPrasad G.
    Abstract:
    In this project we have implemented an Object-Oriented simulation model of a Digital Switching System. We analyzed various software components of a Digital Switching System. The call processing module is the principal component and the most complex of all. The features of Object-Oriented principles were investigated and found to fit...
    Resource Type:
    Capstone Project
    Full Text:
    been implemented in C++ and its complete functionality is demonstrated by using a suite of test cases

  • Design of totally self-checking checker for t-unidirectional error detecting codes

    Creator:
    Malhotra, Sanjeev
    Abstract:
    The use of Totally Self-Checking Checkers in the design of highly reliable systems has significant advantages. It allows errors to be detected upon occurance without testing whether the error is caused by a permanent or an intermittent fault. The TSC circuit provides an error indication whenever the input is not...
    Resource Type:
    Masters Thesis
    Full Text:
    been designed for m-out of-n codes and Berger codes. Bose Lin Code is a separable and efficient code

  • Balanced codes

    Creator:
    Al-Bassam, Sulaiman
    Abstract:
    Balanced codes, in which each codeword contains equally many 1's and 0's, are useful in such applications as in optical transmission and optical recording. When balanced codes are used, the same number of 1's and 0's pass through the channel after the transmission of every word, so the channel is...
    Resource Type:
    Dissertation
    Full Text:
    ) Non-Binary Balanced Codes Balanced codes over a non-binary alphabet. c) Semi-Balanced Codes -- Codes

  • On asymmetric error-correcting codes

    Creator:
    Cunningham, Robert Stephen
    Abstract:
    Historically, coding theory has dealt with binary codes correcting symmetric errors, in which errors are made in both 0 and 1 bits with equal likelihood. Within the past ten years, some study has been made of asymmetric codes, under the assumption that the only errors which occur are errors in...
    Resource Type:
    Masters Thesis
    Full Text:
    . Theorem (Bose). Let C be an systematic 1-asymmetric code with k information bits, where 2m - M + 2 < k

  • Separabilities for a new class of gray codes

    Creator:
    Park, Jung Pil
    Resource Type:
    Capstone Project
    Full Text:
    at most a three-bit error. On the other hand, the minimum analog error required to generate m-bit