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 84 for “"reduced complexity"”.

  1. Reduced complexity adaptive beamformers

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms

    uiuc Repository record for Reduced complexity adaptive beamformers (opens in a new tab)

  2. Reduced Complexity Mechanisms for Network Resource Allocation

    … VCG-Kelly mechanism can be applied to reduce the complexity of a combinatorial auction if the users' valuation functions satisfy the strong substitute condition. We investigate the properties of substitute functions. The sufficient and necessary condition for a function to be substitute appears …

    uiuc Repository record for Reduced Complexity Mechanisms for Network Resource Allocation (opens in a new tab)

  3. Reduced Complexity Detection Methods for Continuous Phase Modulation

    … (CPM) is often plagued by high receiver complexity. One successful method of dealing with this is the well-known pulse amplitude modulation (PAM) representation of CPM, which was first proposed by Laurent. It is shown that the PAM representation also applies to multi-h CPM and ternary …

    byu Repository record for Reduced Complexity Detection Methods for Continuous Phase Modulation (opens in a new tab)

  4. Reduced-complexity disparity estimation for efficient multiview imagery encoding

    … by a 2D camera array efficiently in terms of complexity besides quality and bit-rate. The results on this thesis show that the complexity of the encoder can be reduced significantly without compromising the quality and bitrate.

    ghent Repository record for Reduced-complexity disparity estimation for efficient multiview imagery encoding (opens in a new tab)

  5. A reduced complexity adaptive filtering system for directional listening

    Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.

    mit Repository record for A reduced complexity adaptive filtering system for directional listening (opens in a new tab)

  6. Low power, reduced complexity filtering and improved tracking accuracy for GNSS

    … power which translates to increased hardware complexity and higher power dissipation which reduces the battery life of a mobile platform. During the course of the work undertaken, a power analysis tool was developed in order to be able to estimate the hardware utilisation as well as the power …

    westminster Repository record for Low power, reduced complexity filtering and improved tracking accuracy for GNSS (opens in a new tab)

  7. Digital communication receiver algorithms and architectures for reduced complexity and high throughput

    … algorithms that can offer good performance-complexity trade-offs in high dimensional communication systems such as multi-input multi-output (MIMO) systems and systems with a large delay spread. In this dissertation, computationally efficient receiver algorithms and low-power implementation …

    uiuc Repository record for Digital communication receiver algorithms and architectures for reduced complexity and high throughput (opens in a new tab)

  8. An information theoretic study of reduced-complexity receivers for intersymbol interference channels

    The complexity of the optimal receiver for communications over a discrete-time additive Gaussian intersymbol interference channel typically grows exponentially with the duration of the channel impulse response. Consequently, practical sub-optimal receivers are often designed as though the channel …

    mit Repository record for An information theoretic study of reduced-complexity receivers for intersymbol interference channels (opens in a new tab)

  9. Reduced-complexity near-optimal Ant-Colony-aided multi-user detection for CDMA systems

    Reduced-complexity near-maximum-likelihood Ant-Colony Optimization (ACO) assisted Multi-User Detectors (MUDs) are proposed and investigated. The exhaustive search complexity of the optimal detection algorithm may be deemed excessive for practical applications. For example, a Space-Time Block Coded …

    soton Repository record for Reduced-complexity near-optimal Ant-Colony-aided multi-user detection for CDMA systems (opens in a new tab)

  10. Application of the hector-brick reduced complexity earth system model for probabilistic climate projection

    … of decision-relevant uncertainties. Reduced complexity climate models can be useful tools for quantifying uncertainty, given their flexibility, computational efficiency, and the ability to link these models with large-ensemble frameworks. Here, we develop and use the Hector-BRICK …

    uiuc Repository record for Application of the hector-brick reduced complexity earth system model for probabilistic climate projection (opens in a new tab)

  11. A novel reduced-complexity approach to hidden Markov modeling of two-dimensional processes with application to face recognition.

    … 2-D HMMs are known for their prohibitively high complexity. This encouraged many researchers to work on alternatives such as Pseudo 2-D HMM and Embedded HMM for 2-D recognition applications to avoid the complexity problem. Those applications include, but are not limited to, Face Recognition, …

    ottawa-retro Repository record for A novel reduced-complexity approach to hidden Markov modeling of two-dimensional processes with application to face recognition. (opens in a new tab)

  12. Wireless communication and localization systems under spatial and temporal channel variations

    … the spatial boundaries of human conversation; a reduced-complexity tone reservation algorithm for optimizing signals to avoid amplifier non-linearities; and new tools for the study of physical-layer privacy and anonymity in wireless systems.

    mit Repository record for Wireless communication and localization systems under spatial and temporal channel variations (opens in a new tab)

  13. Assessing Hydrologic Connectivity using Water Temperature, Wax Lake Delta, Louisiana

    We take a reduced complexity approach to assessing the advective factors that contribute to the hydrologic connectivity between a primary distributary channel and interdistributary island on the Wax Lake Delta of coastal Louisiana. We deployed a relatively inexpensive, open-source data logging …

    umn Repository record for Assessing Hydrologic Connectivity using Water Temperature, Wax Lake Delta, Louisiana (opens in a new tab)

  14. Multiuser Detection for Pulse Amplitude Modulated Signals

    … examine the tradespace between performance and complexity. We first examine the Optimal MUD algorithm. The modeling technique of virtual constellations is used to apply the single user maximum likelihood (ML) detector to two synchronous users sharing a common pulse shape and to assess and …

    mit Repository record for Multiuser Detection for Pulse Amplitude Modulated Signals (opens in a new tab)

  15. Lattice reduction for MIMO detection: from theoretical analysis to hardware realization

    … bit-error-rate performance of conventional, low-complexity detectors while simultaneously exhibiting considerably reduced complexity when compared to the optimal method, maximum likelihood detection. Specifically, we first develop an understanding of the complex Lenstra-Lenstra-Lovász (CLLL) LR …

    gatech Repository record for Lattice reduction for MIMO detection: from theoretical analysis to hardware realization (opens in a new tab)

  16. VLSI Architectures for Iterative Channel Decoders

    … architectures for LDPC codes introduce another complexity dimension related to the on-chip interconnect bottleneck of LDPC decoders. A new parameterized-core-based design methodology targeted for scalable and programmable LDPC decoders is proposed. The methodology solves the problems of …

    uiuc Repository record for VLSI Architectures for Iterative Channel Decoders (opens in a new tab)

  17. Reduced Order Model Study of Burgers' Equation using Proper Orthogonal Decomposition

    … of the 1D viscous Burgers' equation and several Reduced Order Models (ROMs) over a range of parameter values. This study is motivated by the need for robust reduced order models that can be used both for design and control. Thus the model should first, allow for selection of optimal parameter …

    vt Repository record for Reduced Order Model Study of Burgers' Equation using Proper Orthogonal Decomposition (opens in a new tab)

  18. Simulation and Mathematical Tools for Performance Analysis of Low-Complexity Receivers

    … has received considerable attention owing to complexity in the realization of the optimal receiver algorithms over wireless channels. This thesis addresses the effects of using reduced complexity receivers for the Satellite Digital Audio Radio (SDAR), Code Division Multiple Access (CDMA) and …

    vt Repository record for Simulation and Mathematical Tools for Performance Analysis of Low-Complexity Receivers (opens in a new tab)

  19. Optimizations for sampling-based motion planning algorithms

    … solving several separate suproblems of reduced complexity. As a result, the efficiency of the sampling-based algorithm depends on the complexity of each of the algorithms used to solve the individual subproblems, namely the procedures GenerateSample, FindNearest, LocalPlan, …

    mit Repository record for Optimizations for sampling-based motion planning algorithms (opens in a new tab)

  20. Energy-efficient analog-to-digital conversion for ultra-wideband radio

    … register (SAR) topology exhibits significantly reduced complexity compared to the traditional flash architecture. Three time-interleaved SAR ADCs have been implemented. At the mixed-signal optimum energy point, parallelism and reduced voltage supplies provide more than 3x energy savings. Custom …

    mit Repository record for Energy-efficient analog-to-digital conversion for ultra-wideband radio (opens in a new tab)

Page 1 of 5