Search Constraints

Start Over
Filtering by: Contributor Negueruela, M. J. Remove constraint Contributor: Negueruela, M. J. Advisor Bose, Bella Remove constraint Advisor: Bose, Bella Committee Member Nguyen, Thinh Remove constraint Committee Member: Nguyen, Thinh

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:
    increasing error: (1) Error in the information part (x′j = xj + e ): S = (( k−1∑ i=0 ( m− 1− x′i

  • 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:
    AN ABSTRACT OF THE THESIS OF Fawaz M. Alazemi for the degree

  • Some communication algorithms for Gaussian and Eisenstein-Jacobi networks

    Creator:
    Albader, Bader
    Abstract:
    Interconnection networks play important roles in designing high performance computers. Recently two new classes of interconnection networks based on the concept of Gaussian and Eisenstein-Jacobi integers were introduced. In this research, efficient routing and broadcasting algorithms for these networks are developed. Furthermore, constructing edge disjoint Hamiltonian cycles in Gaussian networks...
    Resource Type:
    Dissertation
    Full Text:
    Broadcasting in Eisenstein-Jacobi Networks in the General Case ................... 67 4.3 𝐽-adjacency in

  • On shortest disjoint paths and Hamiltonian cycles in some interconnection networks

    Creator:
    Hussain, Zaid
    Abstract:
    Parallel processors are classified into two classes: shared-memory multiprocessors and distributed- memory multiprocessors. In the shared-memory system, processors communicate through a common memory unit. However, in the distributed multiprocessor system, each processor has its own memory unit and the communications among the processors are performed through an interconnection network. Thus,...
    Resource Type:
    Dissertation
    Full Text:
    Representation of an EJ Network. . . . . . . . . . . . . . . . . 47 3.3 Edges of Node iρ2 + j

  • Gray codes and their applications

    Creator:
    Anantha, Madhusudhanan
    Abstract:
    An n-bit Gray code is an ordered set of all 2n binary strings of length n. The special property of this listing is that Hamming distance between consecutive vectors is exactly 1. If the last and first codeword also have a Hamming distance 1 then the code is said to...
    Resource Type:
    Dissertation
    Full Text:
    Yi, i = 1, 2, 3, . . . be the received word at the i-th time assuming errors in all Yj, j = 1, 2, 3

  • Limited magnitude error control codes

    Creator:
    Elarief, Noha
    Abstract:
    A relatively new model of error control is the limited magnitude error over high radix channels. In this error model, the error magnitude does not exceed a certain limit known beforehand. In this dissertation, we study systematic error control codes for common channels under the assumption that the maximum error...
    Resource Type:
    Dissertation
    Full Text:
    h ∑ j=1 a jbi j , where 0≤ i1 < i2 < · · ·< ih ≤ m−1 and a j ∈ S, are distinct. A modular Bh(S

  • Deletions and Insertions of the Symbol 0 and Asymmetric/Unidirectional Error Control Codes for the L₁ Metric

    Creator:
    Alqwaifly, Nawaf
    Abstract:
    This work gives some theory and efficient design of binary block codes capable of controlling the deletions of the symbol “0” (referred to as 0-deletions) and/or the insertions of the symbol “0” (referred to as 0-insertions). This problem of controlling 0-deletions and/or 0-insertions (referred to as symmetric 0-errors) is shown...
    Resource Type:
    Dissertation
    Full Text:
    . The work of M. Kovačević in [3] gives some thoughts on insertion/ deletion correcting code in DNA