Essays about: "Matrix Multiplication"

Showing result 1 - 5 of 47 essays containing the words Matrix Multiplication.

  1. 1. AI Based Methods for Matrix Multiplication in High Resolution Simulations of Radio Access Networks

    University essay from KTH/Matematisk statistik

    Author : Marcus Johnson; Herman Forslund; [2023]
    Keywords : Product-Quantization; MADDNESS; Radio Access Networks; Channel Estimation; MIMO; Approximate Matrix Multiplication; Pruduktkvantisering; MADDNESS; RAN; MIMO; Approximativa matrismultiplikation;

    Abstract : The increasing demand for mobile data has placed significant strain on radio access networks (RANs), leading to a continuous need for increased network capacity. In keeping with that, a significant advancement in modern RANs is the ability to utilize several receivers and transmitters, to allow for beamforming. READ MORE

  3. 2. Effects of Varying Precision on a FPGA using the SpMXV problem : A comparative study

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Vendela Asplund; Martin Lindefors; [2023]
    Keywords : ;

    Abstract : With Moore’s Law slowing down, designing computer hardware that keeps up with the performance demands is becoming increasingly difficult. An interesting area of research is the Field Programmable Gate Array (FPGA) which is a re-programmable hardware device, and which might not be as dependent on Moore’s Law as other hardware. READ MORE

  4. 3. Tensor rank and support rank in the context of algebraic complexity theory

    University essay from KTH/Matematik (Avd.)

    Author : Pelle Andersson; [2023]
    Keywords : linear algebra; tensor product; tensor rank; matrix multiplication; complexity; linjär algebra; tensorprodukt; tensorrang; matrismultiplikation; komplexitet;

    Abstract : Starting with the work of Volker Strassen, algorithms for matrix multiplication have been developed which are time complexity-wise more efficient than the standard algorithm from the definition of multiplication. The general method of the developments has been viewing the bilinear mapping that matrix multiplication is as a three-dimensional tensor, where there is an exact correspondence between time complexity of the multiplication algorithm and tensor rank. READ MORE

  5. 4. Evaluation of Ferroelectric Tunnel Junction memristor for in-memory computation in real world use cases

    University essay from Lunds universitet/Institutionen för elektro- och informationsteknik

    Author : Alec Guerin; Christos Papadopoulos; [2023]
    Keywords : FTJ; Ferroelectric Tunneling Junction; Analog in-memory computing; AIMC; Memristor; A.I.; AIHWKIT; Semantic segmentation; Natural Language Processing; NLP; Neuromorphic Computing; Matrix Vector Multiplication; Technology and Engineering;

    Abstract : Machine learning algorithms are experiencing unprecedented attention, but their inherent computational complexity leads to high energy consumption. However, a paradigm shift in computing methods has the potential to address the issue. READ MORE

  6. 5. Performance evaluation for choosing between Rust and C++

    University essay from Blekinge Tekniska Högskola/Institutionen för programvaruteknik

    Author : Patrik Karlsson; [2023]
    Keywords : C ; Rust; evaluation;

    Abstract : Developers face numerous challenges in their careers, including the critical decision of choosing the most suitable programming language to tackle these challenges. Each programming language presents its unique set of advantages and disadvantages, making the decision-making process complex. READ MORE