Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1607.01039

Practical Tera-scale Walsh-Hadamard Transform

Yi Lu
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the mid-second decade of new millennium, the development of IT has reached unprecedented new heights. As one derivative of Moore's law, the operating system evolves from the initial 16 bits, 32 bits, to the ultimate 64 bits. Most modern computing platforms are in transition to the 64-bit versions. For upcoming decades, IT industry will inevitably favor software and systems, which can efficiently utilize the new 64-bit hardware resources. In particular, with the advent of massive data outputs regularly, memory-efficient software and systems would be leading the future. In this paper, we aim at studying practical Walsh-Hadamard Transform (WHT). WHT is popular in a variety of applications in image and video coding, speech processing, data compression, digital logic design, communications, just to name a few. The power and simplicity of WHT has stimulated research efforts and interests in (noisy) sparse WHT within interdisciplinary areas including (but is not limited to) signal processing, cryptography. Loosely speaking, sparse WHT refers to the case that the number of nonzero Walsh coefficients is much smaller than the dimension; the noisy version of sparse WHT refers to the case that the number of large Walsh coefficients is much smaller than the dimension while there exists a large number of small nonzero Walsh coefficients. Clearly, general Walsh-Hadamard Transform is a first solution to the noisy sparse WHT, which can obtain all Walsh coefficients larger than a given threshold and the index positions. In this work, we study efficient implementations of very large dimensional general WHT. Our work is believed to shed light on noisy sparse WHT, which remains to be a big open challenge. Meanwhile, the main idea behind will help to study parallel data-intensive computing, which has a broad range of applications.

Explore related subjects

cs.DC

Keep this discovery

BibTeXRIS

Yi Lu. 2016-06-28. Practical Tera-scale Walsh-Hadamard Transform. https://doi.org/10.1109/ftc.2016.7821757

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Online Treasure Hunt in Vertex-Permuted Dynamic Rings

We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions on the sequence of permutations used in the dynamic ring. We then study the $VP(\delta)$ setting, in which for every pair $i, j$ of vertices, the edge $(i, j)$ is guaranteed to appear within $\delta$ steps. We show that the class $VP(\delta)$ is feasible only for $\delta \geq \left\lceil \frac{n-1}{2}\right\rceil$. For the one-agent case, we show a tight bound of $\Theta(\delta n)$ on the worst-case search time as well as competitive ratio of any online algorithm for treasure hunt, provided $\delta \geq 2n$. We then give an optimal algorithm for $k$ agents, thereby showing that $k$ agents can obtain a speedup of $k$ on the worst-case search time. Finally, in the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, we show that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.

cs.DC↗
arXiv2026

The Computing Channel: How Modulation Programs the Airwaves

Distributed computing and distributed artificial intelligence require frequent exchanges of intermediate results, although many applications need only an aggregate rather than messages from individual devices. Conventional systems recover each message before computing the aggregate, whereas over-the-air computation (OAC) exploits simultaneous transmission to obtain it directly. However, dominant OAC implementations rely on analog signaling, creating a mismatch with finite-precision data and digital communication procedures. This article presents digital function-oriented communication, in which finite-alphabet symbol representations and receiver decisions are jointly designed so that multiple-access superposition encodes the desired function without recovering individual inputs. We introduce its computational-constellation principle, main design approaches, extensions, and implementation challenges. Federated edge learning illustrates how the framework can reduce user-dependent data-bearing resources while operating directly on quantized model updates.

cs.DC↗
arXiv2026

Can AI Remediate Backend Failures Safely? GuardedAct with Blast-Radius-Aware Sandboxing

Large Language Models (LLMs) have shown promising capabilities in generating remediation actions for microservice failures. However, directly executing AI-generated repair actions in production risks cascading collateral damage. We propose GuardedAct, a sandbox-first remediation framework that interposes a blast-radius-aware verification layer between the LLM action generator and the production environment. GuardedAct operates in four phases: (1) ingesting a diagnosis report together with the live system topology and recent telemetry, (2) prompting an LLM to produce a ranked list of candidate remediation actions, (3) simulating each action in a lightweight digital-twin sandbox that estimates the blast radius and assigns a risk label, and (4) enforcing a rollback-confidence gate that auto-executes only low-risk actions while escalating high-risk ones for human review. We evaluate GuardedAct on five fault scenarios injected into the DeathStarBench social-network application. Experimental results show that GuardedAct achieves an overall recovery rate of 87.4% while reducing collateral damage by 79.7% relative to direct LLM execution (from 25.6% to 5.2%), at the cost of a modest sandbox-induced increase in mean time to recovery (approximately 8 s). Ablation studies confirm that each component contributes meaningfully to the safety-speed trade-off.

cs.DC↗