Cover Image

Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Linares, Deijany Rodriguez, Moryakova, Oksana, Johansson, Håkan
Format:	Preprint
Published:	2025
Subjects:	Signal Processing Data Structures and Algorithms Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Joint Sampling Frequency Offset Estimation and Compensation Based on the Farrow Structure
by: Linares, Deijany Rodriguez, et al.
Published: (2025)

Joint Sampling Frequency Offset Estimation and Compensation Algorithms Based on the Farrow Structure
by: Linares, Deijany Rodriguez, et al.
Published: (2026)

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
by: Bentert, Matthias, et al.
Published: (2025)

Fast Computation of the Discrete Fourier Transform Rectangular Index Coefficients
by: Queiroz, Saulo, et al.
Published: (2025)

Fast Computation of the Discrete Fourier Transform Square Index Coefficients
by: Queiroz, Saulo, et al.
Published: (2024)

Sublinear Time Low-Rank Approximation of Hankel Matrices
by: Kapralov, Michael, et al.
Published: (2025)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
by: Musco, Cameron, et al.
Published: (2024)

Modeling, Analysis, and Optimization of Cascaded Power Amplifiers
by: Moryakova, Oksana, et al.
Published: (2025)

Digital Linearizer Based on 1-Bit Quantizations
by: Linares, Deijany Rodriguez, et al.
Published: (2025)

Low-Complexity Frequency-Dependent Linearizers Based on Parallel Bias-Modulus and Bias-ReLU Operations
by: Linares, Deijany Rodriguez, et al.
Published: (2024)

Low-Complexity Memoryless Linearizer for Analog-to-Digital Interfaces
by: Linares, Deijany Rodriguez, et al.
Published: (2023)

Preserving Extreme Singular Values with One Oblivious Sketch
by: Mango, John M., et al.
Published: (2025)

Complex Mean and Variance of Linear Regression Model for High-Noised Systems by Kriging
by: Suslo, Tomasz
Published: (2005)

Stochastic Rounding 2.0, with a View towards Complexity Analysis
by: Drineas, Petros, et al.
Published: (2024)

The Lanczos algorithm for matrix functions: a handbook for scientists
by: Chen, Tyler
Published: (2024)

Algorithms and data structures for numerical computations with automatic precision estimation
by: Netay, Igor V.
Published: (2024)

Near-optimal hierarchical matrix approximation from matrix-vector products
by: Chen, Tyler, et al.
Published: (2024)

Stability of the Lanczos Method for Matrix Function Approximation
by: Musco, Cameron, et al.
Published: (2017)

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
by: Amsel, Noah, et al.
Published: (2026)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
by: Chen, Tyler, et al.
Published: (2022)

Fixed-sparsity matrix approximation from matrix-vector products
by: Amsel, Noah, et al.
Published: (2024)

Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
by: Balabanov, Oleg, et al.
Published: (2022)

Analysis of Different Algorithmic Design Techniques for Seam Carving
by: Aijaz, Owais, et al.
Published: (2024)

Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
by: Larsen, Brett W., et al.
Published: (2022)

Fast algorithms for least square problems with Kronecker lower subsets
by: Malik, Osman Asif, et al.
Published: (2022)

Finer-Grained Hardness of Kernel Density Estimation
by: Alman, Josh, et al.
Published: (2024)

Fast DCT+: A Family of Fast Transforms Based on Rank-One Updates of the Path Graph
by: Fernández-Menduiña, Samuel, et al.
Published: (2024)

Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation
by: Chenakkod, Shabarish, et al.
Published: (2026)

Query Efficient Structured Matrix Learning
by: Amsel, Noah, et al.
Published: (2025)

Efficient Design and Implementation of Fast-Convolution-Based Variable-Bandwidth Filters
by: Moryakova, Oksana, et al.
Published: (2024)

Diagonally-Addressed Matrix Nicknack: How to improve SpMV performance
by: Saak, Jens, et al.
Published: (2023)

Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
by: Kao, Ming-Yang, et al.
Published: (1999)

Fast Approximate Determinants Using Rational Functions
by: Colthurst, Thomas, et al.
Published: (2024)

Closed-Form Least-Squares Design of Fast-Convolution Based Variable-Bandwidth FIR Filters
by: Moryakova, Oksana, et al.
Published: (2025)

Order Estimation of Linear-Phase FIR Filters for DAC Equalization in Multiple Nyquist Bands
by: Linares, Deijany Rodriguez, et al.
Published: (2024)

Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm
by: Cai, Xufeng, et al.
Published: (2025)

Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, $MAM^*$!
by: Boahen, Edem, et al.
Published: (2025)

Permutation-Avoiding FFT-Based Convolution
by: Venkovic, Nicolas, et al.
Published: (2025)

Block Encoding of Sparse Matrices via Coherent Permutation
by: Setty, Abhishek
Published: (2025)

A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
by: Doney, Kyle, et al.
Published: (2025)