Search Constraints

Start Over
Filtering by: Creator Hedge, Z. N. Remove constraint Creator: Hedge, Z. N. Committee Member Nguyen, Thinh Remove constraint Committee Member: Nguyen, Thinh

Search Results

  • Convergence Analysis Framework for Fixed-Point Algorithms in Machine Learning and Signal Processing

    Creator:
    Vu, Trung
    Abstract:
    Iterative algorithms are simple yet efficient in solving large-scale optimization problems in practice. With a surge in the amount of data in past decades, these methods have become increasingly important in many application areas including matrix/tensor recovery, deep learning, data mining, and reinforcement learning. To optimize or improve iterative algorithms,...
    Resource Type:
    Dissertation
    Full Text:
    given by (7.19) . 302 7.2 Scaled histogram and the limiting ESD of Hn = W n pq(W n pq) ⊤, for n

  • Target-based coverage extension of 802.11 MANETs via constrained UAV mobility

    Creator:
    Johnson, Taylor N.
    Abstract:
    MANETs are known to be useful in situations where mobile nodes need to communicate and coordinate in dynamic environments with no access to fixed network infrastructure. However, connectivity problems can occur when sub-groups within a MANET move out of communication range from one another. The increasingly prolific use of UAVs...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Taylor N. Johnson for the

  • Dynamic and Dual Streaming Methods for H.264 Video and Parallel Performance Modeling

    Creator:
    Johnson, Taylor N.
    Abstract:
    Traditional approaches to streaming H.264 video over a network typically rely on a single method of transport (i.e., reliable or unreliable) and/or use static values for parameters that can have a significant negative impact on the perceptual quality of the received video. This dissertation presents a dynamic method for wireless...
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF Taylor N. Johnson for the

  • 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 integer α = a+ bi is N(α) = a2 + b2. Let Z[i]α, a subset of Z[i], be all Gaussian integers under

  • 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:
    , (2.10) for all integers m∈ IIN. The quantity (n w ) m is the coefficient of the monomial z w in the

  • 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:
    ′) ≥ 1 and N(X ′, X) ≥ 1, where N(Y, Z) is the number of 1 to 0 crossovers from an n-bit vector Y to

  • An inner product on adelic measures

    Creator:
    Oberly, Peter J.
    Abstract:
    We define an inner product on a vector space of adelic measures over a number field $K$. We find that the norm induced by this inner product governs weak convergence at each place of $K$. The canonical adelic measure associated to a rational map is in this vector space, and...
    Resource Type:
    Dissertation
    Full Text:
    ◦ gn for f(z) = z3 + 1 and g(z) = z2 − 1 180 9 Julia sets of (z2 − 1)2n , n = 1, 2, 3, 4. 188 1 An

  • Co-channel Blocker and Self-Interferer Tolerant Receiver Architectures for MIMO and Full-Duplex MIMO Receivers

    Creator:
    Jain, Sanket
    Abstract:
    This research focuses on receiver architectures which enable better spectral eciency by handling blockers in the same spectral range as the signal. The presence of such blockers, without the use of blocker cancelling/ ltering techniques leads to gain compression and hence, consequent performance degradation of receivers leading to reduced spectrum...
    Resource Type:
    Dissertation
    Full Text:
    -duplex integrated N-path based circulator-Rx architecture. STAR radios enable higher spectrum efficiency

  • Micropower incremental analog-to-digital converters

    Creator:
    Chen, Chia-Hung
    Abstract:
    Incremental ADCs (IADCs) have many advantages for low-frequency high-accuracy data conversion—they are easy to multiplex between channels, need simpler digital decimation filter, and allow extended counting with a Nyquist-rate ADC. A single-loop incremental ADC was designed and fabricated in 90 nm for a biosensor interface circuit. It incorporates one integrator,...
    Resource Type:
    Dissertation
    Full Text:
    sensor interface circuits. It extends the order of a conventional incremental ADC from N to (2N-1) by

  • Low-complexity high-speed VLSI design of low-density parity-check decoders

    Creator:
    Cui, Zhiqiang
    Abstract:
    Low-Density Parity-check (LDPC) codes have attracted considerable attention due to their capacity approaching performance over AWGN channel and highly parallelizable decoding schemes. They have been considered in a variety of industry standards for the next generation communication systems. In general, LDPC codes achieve outstanding performance with large codeword lengths (e.g.,...
    Resource Type:
    Dissertation
    Full Text:
    ., N>1000 bits), which lead to a linear increase of the size of memory for storing all the soft