Introduction
Hyperdimensional (HD) computing is a brain-inspired computational paradigm that represents information using massive pseudo-random bit-vectors, typically with dimensions $D \ge 10,000$. While HD computing offers significant robustness and efficiency for tasks such as biosignal processing, its implementation on resource-constrained hardware is often hindered by a "memory wall." Traditional architectures require storing thousands of seed hypervectors in memory and performing bit-sequential distance calculations, leading to high latency ($O(D)$) and significant memory footprints. This paper introduces hardware optimizations designed to trade memory for combinational logic, making HD computing more feasible for embedded systems.
Proposed Hardware Modules
The authors propose three primary hardware modules, integrated into a synthesizable VHDL library, to optimize the HD computing pipeline:
1. Rematerialization (MAN Module)
To eliminate the need for storing large Item Memory (IM) or Continuous Item Memory (CIM) in RAM, the authors introduce the Hypervector Manipulator (MAN). This module uses simple OR-XOR gates and hardwired connections to "rematerialize" hypervectors on the fly based on input signals. This approach exploits the holographic nature of HD computing—where the overall pattern is more critical than individual bits—to drastically reduce memory requirements.
2. Binarized Back-to-Back Bundling (B2B)
Learning in HD space involves "bundling" multiple hypervectors into a single prototype, usually via majority voting. Standard implementations use multibit counters, which are resource-intensive. The Binarized Back-to-Back (B2B) bundling module replaces counters with a probabilistic weighting system. In this scheme, the $i$-th vote has a $1/i$ probability of flipping the current bit, allowing the system to remain entirely in the binary domain without sacrificing classification accuracy.
3. Combinational Associative Memory (CMB)
Classification is often the primary bottleneck in HD systems. The Combinational Associative Memory (CMB) module replaces bit-sequential distance calculations with deep adder trees. This allows the hardware to compute the Hamming distance between a query and all learned prototypes in a single clock cycle, reducing latency from $O(D)$ to $O(1)$.
Experimental Evaluation
The proposed optimizations were evaluated using a four-channel Electromyography (EMG) dataset for hand gesture recognition. The task involved identifying five distinct gestures (closed hand, open hand, 2-finger pinch, point index, and rest) across five subjects. The goal was to demonstrate that the optimized hardware could achieve "iso-accuracy" compared to a non-optimized baseline while significantly improving area and throughput.
Key Results and Insights
The design space exploration revealed significant improvements across multiple metrics:
- Throughput: The configuration utilizing the Combinational Associative Memory (
LUT+BC+CMB) achieved a 2337× throughput improvement over the baseline. - Area Efficiency: The
MAN+B2B+VSconfiguration achieved a 2.39× area saving, fitting the entire learner and classifier into 18,340 Configurable Logic Blocks (CLBs) on a Xilinx FPGA. - Complexity Trade-offs: The paper provides a taxonomy of modules based on their Cycles Per Data Item (CPDI), as shown in the table below. This allows designers to select the optimal module based on their specific area and speed constraints.
Conclusion
By prioritizing logic over memory and utilizing probabilistic approximations, the authors demonstrate that HD computing can be highly optimized for FPGA-based embedded devices. The proposed modules offer a flexible library for designers to navigate the trade-offs between throughput and area. Future work will focus on ASIC implementations to further enhance energy efficiency for wearable biosignal processing applications.
Summary updated