For the DSA-HBF, \(\mathbf {S}_{\sf {DSA}}\)  needs to be optimized, resulting in a large design space. In [1]}, a sub-optimal method named “Dynamic Subarray Partitioning” is proposed. We consider this method as a point of comparison for our proposed unsupervised learning solution.
<FIGURE>