Implementation and Optimization of HQC Decoding on NPU-Integrated Devices

• URL: http://arxiv.org/abs/2606.01968v1
• Date: Mon, 01 Jun 2026 09:31:49 GMT
• Title: Implementation and Optimization of HQC Decoding on NPU-Integrated Devices
• Abstract summary: This paper studies HQC decoding on Qualcomm Hexagon processors in NPU-integrated devices.<n>We focus on the Hexagon Vector eXtensions (HVX) backend rather than a tensor-inference engine.<n>Results show that Hexagon/HVX-assisted decoding substantially reduces latency and energy consumption, improving energy efficiency by up to $18.13times$ while significantly offloading host CPU work.
• Score: 0.6157382820537719
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hamming Quasi-Cyclic (HQC) has been selected by NIST for standardization as an additional code-based key-encapsulation mechanism, providing algorithmic diversity alongside lattice-based post-quantum cryptography. Efficient deployment of HQC on mobile and embedded platforms, however, requires careful optimization of its decoding procedure, whose Reed-Muller and Reed-Solomon components dominate the computational cost. This paper studies HQC decoding on Qualcomm Hexagon processors in NPU-integrated devices, focusing on the Hexagon Vector eXtensions (HVX) backend rather than a tensor-inference engine. We observe that HQC decoding naturally exposes vector-structured computation, including Reed-Muller reliability vectors, Hadamard-transform coefficients, Reed-Solomon syndrome vectors, finite-field products, and packed support-point evaluations. Based on this observation, we redesign the dominant decoding kernels around HVX-friendly data layouts and execution patterns, including a vectorized Reed-Muller Hadamard transform, scalar-equivalent peak selection, HVX-oriented finite-field arithmetic, vectorized syndrome computation, and shortened-support locator-root evaluation. We implement and evaluate the optimized decoder using both Hexagon simulator measurements and real-device experiments on a Snapdragon~8 Gen~2 hardware development kit. The results show that Hexagon/HVX-assisted decoding substantially reduces latency and energy consumption, improving energy efficiency by up to $18.13\times$ while significantly offloading host CPU work. These results indicate that NPU-integrated mobile platforms can serve as effective backends for structured post-quantum cryptographic decoding when the underlying kernels are reformulated around vector execution.

Related papers

• Accelerated Decoding of Centroid Positional Encoding for Instance Segmentation [49.97373153077311]
  We investigate the decoding overhead associated with a centroid encoding for Instance, in which each pixel regresses a positional embedding of its instance centroid.<n>Our solution significantly reduces decoding overhead and improves Endto-End latency, outperforming both CPU-based approaches and naive GPU implementations.
  arXiv  Detail & Related papers  (2026-09-15T09:05:17Z)
• CONQuER: Hardware-Aware Mixed-Precision Quantisation with Online-Calibrated Surrogates [3.4090089330250724]
  We present CONQuER, a unified compiler-integrated infrastructure for hardware-aware MPQ.<n> CONQuER shifts quantisation into the compiler pipeline at the TOSA level, enabling intelligent configuration handling.<n>We show that CONQuER discovers configurations up to 12.19x faster with top-1 accuracy within 1.44% of the unquantised baseline.
  arXiv  Detail & Related papers  (2026-07-28T15:45:26Z)
• CANN Bench: Benchmarking Agent Generated Kernels against Real NPU and Algorithmic Limits [9.970450719182633]
  CANN Bench is an open benchmark for AI-generated operator code on Huawei's Ascend NPU.<n> Evaluation adopts a textbfthree-dimensional weighted composite score that treats compilation, functional correctness, and performance as independent axes.
  arXiv  Detail & Related papers  (2026-07-08T02:22:22Z)
• Even More Efficient Soft-Output Decoding with Extra-Cluster Growth and Early Stopping [2.370310454459195]
  We introduce two types of novel soft-outputs: the bounded cluster gap and the extra-cluster gap.<n>The latter, the extra-cluster gap, quantifies decoder reliability by performing a small, additional growth of the clusters obtained by the decoder.<n>These techniques offer lower computational complexity and higher hardware compatibility.
  arXiv  Detail & Related papers  (2026-02-03T10:00:40Z)
• OptHQC: Optimize HQC for High-Performance Post-Quantum Cryptography [5.281697362177691]
  We propose OptHQC, an optimized implementation of the HQC scheme to deliver high-performance cryptographic operations.<n>Our approach provides a comprehensive analysis of each computational blocks in HQC and introduces optimizations across all three stages: key generation, encryption, and computation.<n>Overall, OptHQC achieves an average 55% speedup over the reference HQC implementation on CPU.
  arXiv  Detail & Related papers  (2025-12-15T01:07:57Z)
• TC-GS: A Faster Gaussian Splatting Module Utilizing Tensor Cores [8.422911585027924]
  This paper integrates TC-GS, an algorithm-independent universal module that expands the applicability of Core (TCU) for 3DGS.<n>Our method maintains rendering quality while providing an additional 2.18x speedup over existing Gaussian acceleration algorithms, thereby achieving a total acceleration of up to 5.6x.
  arXiv  Detail & Related papers  (2025-05-30T16:58:18Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• Medical Image Segmentation via Sparse Coding Decoder [3.9633192172709975]
  Transformers have achieved significant success in medical image segmentation, owing to its capability to capture long-range dependencies. Previous works incorporate convolutional layers into the encoder module of transformers, thereby enhancing their ability to learn local relationships among pixels. However, transformers may suffer from limited generalization capabilities and reduced robustness, attributed to the insufficient spatial recovery ability of their decoders.
  arXiv  Detail & Related papers  (2023-10-17T03:08:35Z)
• Soft Convex Quantization: Revisiting Vector Quantization with Convex Optimization [40.1651740183975]
  We propose Soft Convex Quantization (SCQ) as a direct substitute for Vector Quantization (VQ) SCQ works like a differentiable convex optimization (DCO) layer. We demonstrate its efficacy on the CIFAR-10, GTSRB and LSUN datasets.
  arXiv  Detail & Related papers  (2023-10-04T17:45:14Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• An Adaptive Device-Edge Co-Inference Framework Based on Soft Actor-Critic [72.35307086274912]
  High-dimension parameter model and large-scale mathematical calculation restrict execution efficiency, especially for Internet of Things (IoT) devices. We propose a new Deep Reinforcement Learning (DRL)-Soft Actor Critic for discrete (SAC-d), which generates the emphexit point, emphexit point, and emphcompressing bits by soft policy iterations. Based on the latency and accuracy aware reward design, such an computation can well adapt to the complex environment like dynamic wireless channel and arbitrary processing, and is capable of supporting the 5G URL
  arXiv  Detail & Related papers  (2022-01-09T09:31:50Z)
• Rethinking Semantic Segmentation from a Sequence-to-Sequence Perspective with Transformers [149.78470371525754]
  We treat semantic segmentation as a sequence-to-sequence prediction task. Specifically, we deploy a pure transformer to encode an image as a sequence of patches. With the global context modeled in every layer of the transformer, this encoder can be combined with a simple decoder to provide a powerful segmentation model, termed SEgmentation TRansformer (SETR) SETR achieves new state of the art on ADE20K (50.28% mIoU), Pascal Context (55.83% mIoU) and competitive results on Cityscapes.
  arXiv  Detail & Related papers  (2020-12-31T18:55:57Z)
• Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
  qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
  arXiv  Detail & Related papers  (2020-10-08T12:49:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.