AI & ML
Adaptive Filtering With Reduced Computational Complexity Using SOPOT Arithmetic
arXiv eess.SP0 views
arXiv:2611.25054v1 Announce Type: new Abstract: Implementing finite impulse response (FIR) adaptive filters by employing the sums of signed-powers-of-two (SOPOT) arithmetic may lead to simpler hardware and consequently reduced power consumption. In this paper, one evaluates the effects of SOPOT arithmetic on the adaptive filter's recursion algorithms. The filters' coefficients and algorithms' underlying variables are fully operated using SOPOT arithmetic in the whole iterative process. More specifically, one evaluates convergence rate, numerical stability, and accuracy since using few signed-powers-of-two (SPT) terms propagates numerical errors during the adaptive cycle that may impair the algorithm behavior. The SOPOT approximations are obtained through the technique known as Matching Pursuits with Generalized Bit-Plane (MPGBP) algorithm, with notable cost-performance trade-off and low computational complexity. Results are provided for the Least-Mean-Squares (LMS), the Normalized Least-Mean-Squares (NLMS) and the Recursive-Least-Squares (RLS) algorithms, considering adaptive filters employed for system identification and change detection.
Source:https://arxiv.org/abs/2611.25054PreviousDAST: A VLM-LLM Framework for Cross-Interface Anomaly Detection in O-RANNextAE-DISC: Automorphism Ensemble Direct-Invocation Successive Cancellation for Low-Latency Decoding
Related posts

So sicherst du einen MCP-Server mit codex sandbox ab
0dev.to

Perfiles de permisos de Codex: ejemplos de config.toml para ejecuciones seguras de agentes
0dev.to

GPTBot vs OAI-SearchBot: How to Configure robots.txt for AI Crawlers
0dev.to

ملفات تعريف أذونات Codex: أمثلة config.toml لتشغيل الوكلاء بأمان
0dev.to

Write a cover letter with AI and keep every fact yours: a nine-step loop
0dev.to
Reading project health off a download page — faster than star count
0dev.to