Using Transposition to Efficiently Solve Constant Matrix-Vector Multiplication and Sum of Product Problems
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1939-8115
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Using Transposition to Efficiently Solve Constant Matrix-Vector Multiplication and Sum of Product Problems ; volume:92 ; number:10 ; day:9 ; month:7 ; year:2020 ; pages:1075-1089 ; date:10.2020
Journal of signal processing systems ; 92, Heft 10 (9.7.2020), 1075-1089, 10.2020
- Urheber
-
Sarband, Narges Mohammadi
Gustafsson, Oscar
Garrido, Mario
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s11265-020-01560-z
- URN
-
urn:nbn:de:101:1-2020102619582950376026
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:20 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Sarband, Narges Mohammadi
- Gustafsson, Oscar
- Garrido, Mario
- SpringerLink (Online service)
Ähnliche Objekte (12)
Using fast matrix multiplication to solve structured linear systems
Multiple constant multiplication optimizations for field programmable gate arrays
Run-time reconfigurable constant multiplication on field programmable gate arrays
Run-time Reconfigurable Constant Multiplication on Field Programmable Gate Arrays
Seshadri constants on principally polarized abelian surfaces with real multiplication
Hierarchical matrices : a means to efficiently solve elliptic boundary value problems ; with 53 tables
A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem
A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem
A novel method for the approximation of multiplierless constant matrix vector multiplication
Multiplication
Multiplication.
Multiplication
Using fast matrix multiplication to solve structured linear systems
Multiple constant multiplication optimizations for field programmable gate arrays
Run-time reconfigurable constant multiplication on field programmable gate arrays
Run-time Reconfigurable Constant Multiplication on Field Programmable Gate Arrays
Seshadri constants on principally polarized abelian surfaces with real multiplication
Hierarchical matrices : a means to efficiently solve elliptic boundary value problems ; with 53 tables
A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem
A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem
A novel method for the approximation of multiplierless constant matrix vector multiplication
Multiplication
Multiplication.
Multiplication
Using fast matrix multiplication to solve structured linear systems
Multiple constant multiplication optimizations for field programmable gate arrays
Run-time reconfigurable constant multiplication on field programmable gate arrays
Run-time Reconfigurable Constant Multiplication on Field Programmable Gate Arrays
Seshadri constants on principally polarized abelian surfaces with real multiplication
Hierarchical matrices : a means to efficiently solve elliptic boundary value problems ; with 53 tables
A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem
A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem
A novel method for the approximation of multiplierless constant matrix vector multiplication
Multiplication
Multiplication.