Sökning: "lookup tables"

Visar resultat 1 - 5 av 15 uppsatser innehållade orden lookup tables.

  1. 1. Wordlength inference in the Spade HDL : Seven implementations of wordlength inference and one implementation that actually works

    Master-uppsats, Linköpings universitet/Institutionen för systemteknik

    Författare :Edvard Thörnros; [2023]
    Nyckelord :FPGA; spade; wordlength inference; word length; word-length; compiler; hdl; hardware description language; LUT; lookup tables; resource usage; compiler; FPGA; spade; ordlängdsinferens; kompilator; hdl; ordlängd;

    Sammanfattning : Compilers, complex programs with the potential to greatly facilitate software and hardware design. This thesis focuses on enhancing the Spade hardware description language, known for its user-friendly approach to hardware design. LÄS MER

  3. 2. Automated Generation of EfficientBitslice Implementations forArbitrary Sboxes

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

    Författare :Augustin Bariant; [2023]
    Nyckelord :Bitslicing; Cryptography; Whitebox; Compilation; Boolean circuits.; Parallélisation au bit; Cryptographie; Boîte blanche; Compilation; Circuits booléens.; Bitslicing; Kryptografi; Vit låda; Kompilering; Booleska kretsar.;

    Sammanfattning : Whitebox cryptography aims at protecting standard cryptographic algorithmsthat execute in attacker-controlled environments. In these, the attacker is ableto read a secret key directly from memory. Common implementations mask alldata at runtime and operate on masked data by using many small precomputedtables. LÄS MER

  4. 3. Multibit Trie For The Longest Matching Prefix Problem

    Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Karl Hed Dahlqvist; [2022]
    Nyckelord :Multibit trie; longest marching prefix problem; CIDR; IP lookup;

    Sammanfattning :  With the ever growing forwarding tables of the internet and the large amount of traffic that flows through them, efficient algorithms to handle search are needed. One of these algorithms is the Multibit trie (prefix tree). LÄS MER

  5. 4. A Method of CFD-based System Identification for Standardized Co-Simulation

    Master-uppsats, Linköpings universitet/Fluida och mekatroniska system

    Författare :Olle Lindqvist; [2022]
    Nyckelord :CFD; system identification; FMI; SSP; co-simulation; steady-state;

    Sammanfattning : System simulations are a useful tool when analyzing complex systems. For example, simulations can be cheaper than physical testing of the actual system. Models canalso be created for systems that do not exist yet, that would be impossible to analyze experimentally. LÄS MER

  7. 5. Software supported hazards identification for Plug & produce systems

    Master-uppsats, Högskolan Väst/Institutionen för ingenjörsvetenskap

    Författare :Waddah Mosa; [2022]
    Nyckelord :Plug Produce; Hazard identification; Safety; Risk assessment; Automation;

    Sammanfattning : This work proposed a new automated hazard identification (AHI) approach for Pluge&Produce systems. After going through related standards and research works, the required inputs for automated hazard identification were determined. Then, software was presented to demonstrate using these inputs to perform AHI. LÄS MER