Sökning: "approximate computing"

Visar resultat 1 - 5 av 25 uppsatser innehållade orden approximate computing.

  1. 1. Using Approximate Computing Circuits to Optimize Power of an ASIC

    Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

    Författare :Padmashree Nuggehalli Srinivasa; Shi-Tien Hsing; [2023]
    Nyckelord :ASIC; Power; Optimization; Approximate Arithmetic Circuits; Approximate Computing; Technology; Technology and Engineering;

    Sammanfattning : The growing demand for network cameras to support real-time image processing and machine-learning applications has created a need for low-power solutions. Although technology scaling makes complex computations feasible, voltage scaling is limited, leading to higher power density and dark silicon problems. LÄS MER

  3. 2. The Quantum Approximate Optimization Algorithm and it's Applications

    Kandidat-uppsats, Uppsala universitet/Institutionen för fysik och astronomi

    Författare :Erik Bashore; [2023]
    Nyckelord :Quantum computing; quantum optimization; combinatorial optimization problems;

    Sammanfattning : This is a project with the ambition of demonstrating the possibilities and applications of the quantum approximation optimization algorithm (QAOA). Throughout the paper discussions on the theoretical background and fundamentals of the algorithm will be done by examining the relevant nomenclature. LÄS MER

  4. 3. Exploiting Spatial Redundancy and Approximate Computing for Area Efficient Image Compression

    Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

    Författare :Saurav Arjun; [2022]
    Nyckelord :Image Compression; VLSI; Spatial redundancy; DCT; Compression; System Verilog; Technology and Engineering;

    Sammanfattning : Owing to the intensive computation involved in the Discrete Cosine Transform during image com- pression, the design of the efficient hardware architectures for fast computation of the transform has become imperative, especially for real-time applications. Although fast computation techniques have been able to minimise the hardware computation complexity to a certain limit, they could further extend the research to figure out the interesting approaches which can be implemented on applications where power, speed and area are crucial factors to determine the performance of the system. LÄS MER

  5. 4. Data-driven Discovery of Real-time Road Compaction Parameters

    Master-uppsats, KTH/Matematisk statistik

    Författare :Yuqi Shao; [2022]
    Nyckelord :statistics; machine learning; road compaction; statistik; maskininlärning; vägpackning;

    Sammanfattning : Road compaction is the last and important stage in road construction. Both under-compaction and over-compaction are inappropriate and may lead to road failures. Intelligent compactors has enabled data gathering and edge computing functionalities, which introduces possibilities in data-driven compaction control. LÄS MER

  7. 5. The V-SLAM Hurdler : A Faster V-SLAM System using Online Semantic Dynamic-and-Hardness-aware Approximation

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Liu Mingxuan; [2022]
    Nyckelord :Approximate Computing; Deep Learning; Dynamic Environments; Object Detection; Online Controller; Semantic SLAM; Ungefärlig Beräkning; Djup Lärning; Dynamiska miljöer; Objektdetektion; Online Kontroller; Semantisk SLAM;

    Sammanfattning : Visual Simultaneous Localization And Mapping (V-SLAM) and object detection algorithms are two critical prerequisites for modern XR applications. V-SLAM allows XR devices to geometrically map the environment and localize itself within the environment, simultaneously. LÄS MER