arXiv · 2509.15069
Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators
Abstract
This letter presents a novel approach for \mbox{efficiently} computing time-index powered weighted sums of the form $\sum_{n=0}^{N-1} n^{K} v[n]$ using cascaded accumulators. Traditional direct computation requires $K{\times}N$ general multiplications, which become prohibitive for large $N$, while alternative strategies based on lookup tables or signal reversal require storing entire data blocks. By exploiting accumulator properties, the proposed method eliminates the need for such storage and reduces the multiplicative cost to only $K{+}1$ constant multiplications, enabling efficient real-time implementation. The approach is particularly useful when such sums need to be efficiently computed in sample-by-sample processing systems.
Explore related subjects
Keep this discovery
Deijany Rodriguez Linares, Oksana Moryakova, Håkan Johansson. 2025-09-18. Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators. https://doi.org/10.1109/lsp.2026.3661843
Cite the original work for its findings. Save a collection to share your selection of sources.