Sökning: "VLSI architectures"

Visar resultat 1 - 5 av 20 avhandlingar innehållade orden VLSI architectures.

  1. 1. Synchoros VLSI Design Style

    Författare :Dimitrios Stathis; Ahmed Hemani; Anders Lansner; Christian Weis; Dimitrios Soudris; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; VLSI; ASIC; CGRA; hardware architectures; synchoros VLSI; SiLago; eBrain; BCPNN; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : Computers have become essential to everyday life as much as electricity, communications and transport. That is evident from the amount of electricity we spend to power our computing systems. According to some reports it is estimated to be ≈ 7% of the total consumption worldwide. LÄS MER

  3. 2. Baseband Processing for 5G and Beyond: Algorithms, VLSI Architectures, and Co-design

    Författare :Mojtaba Mahdavi; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; VLSI Implementation; Hardware architectures; ASIC implementation; FPGA implementation; CMOS Technology; Baseband Processing; Massive MIMO; 5G New Radio; Beyond 5G; Co-Design; FFT processor; OFDM modulation; wireless communications; Massive MIMO Detection; Angular domain processing; Zero forcing; Systolic array; Non-linear detector; Channel Sparsity; Channel compression; Linear detector; Channel coding; Spatial coupling; Turbo-like codes; Spatially coupled serially concatenated codes; Threshold analysis; Decoder architecture; BCJR algorithm; MAP algorithm; Coupling memory; Window decoding; Complexity analysis; Performance Evaluation; Throughput; Decoding Latency; Silicon area; Design tradeoffs; Interleaver architecture; Memory requirements; Matrix multiplication; Channel state information CSI ; Cholesky decomposition; Tanner graph; Trellis codes; Convolutional encoder; Code design; Puncturing; Reordering circuit; wireless communication system; digital electronic;

    Sammanfattning : In recent years the number of connected devices and the demand for high data-rates have been significantly increased. This enormous growth is more pronounced by the introduction of the Internet of things (IoT) in which several devices are interconnected to exchange data for various applications like smart homes and smart cities. LÄS MER

  4. 3. VLSI aspects on inversion in finite fields

    Författare :Mikael Olofsson; Christof Paar; Linköpings universitet; []
    Nyckelord :VLSI; Inversion; Finite Fields; Area; Delay; Power dissipation; Irreducible polynomials; Polynomial basis; Triangular basis; Normal basis; Dual basis; Tower fields.; TECHNOLOGY; TEKNIKVETENSKAP;

    Sammanfattning : Different algorithms and architectures for inversion in finite extension fields are studied. The investigation is restricted to fields of characteristic two. Based on a simple transistor model, various architectures are compared with respect to delay, area requirement, and energy consumption. LÄS MER

  5. 4. Trellis Decoding: From Algorithm to Flexible Architectures

    Författare :Matthias Kamuf; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Electronics; Signalbehandling; Signal processing; VLSI; Viterbi algorithm; trellis decoding; TCM; survivor path; flexibility; convolutional codes; ACS; ASIC; Elektronik; Telecommunication engineering; Telekommunikationsteknik;

    Sammanfattning : Trellis decoding is a popular method to recover encoded information corrupted during transmission over a noisy channel. Prominent members of this class of decoding algorithms are the Viterbi algorithm, which provides maximum likelihood estimates, and the BCJR algorithm, which is a maximum a posteriori estimator commonly used in iterative decoding. LÄS MER

  7. 5. Three Specialized Computer Architectures for Functional Program Execution

    Författare :Jonas Vasell; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; computer architectures; G-machine; programming languages; program compilation techniques; VLSI implementation; performance; array architecture;

    Sammanfattning : Functional programming languages offer a new programming paradigm with many advantages over the more conventional imperative or procedural programming languages. However, these new languages are not as well adapted to the existing computers as the conventional languages, which results in low performance. LÄS MER