优化直方图更新

Question

我正在更新一个直方图，该直方图使用一个简单的整数阵列表示，该数组带有16个垃圾箱，如下所示。

const int binSize = 4096;
int histogram[16];
unsigned short inData[1024];  // This is my input data. Short is 16 bits
for(int i = 0; i < 1024; ++i)
{
   ++histogram[inData[i] / binSize];
}

我经常运行此操作，因此这成为瓶颈，因为该循环与DSP不同步，因为无法同时更新多个垃圾箱。我该如何优化？

我在Ti DSP C6000系列上运行此代码。

Answer 1

举一个评论含义的示例：

#include <array>
#include <algorithm>
#include <boost/range/adaptor/transformed.hpp>
using Histogram = std::array<int, 16>;
Histogram from_short(short num)
{
    Histogram result;
    result[num / 4096] = 1;
    return result;
}
Histogram add(const Histogram & lhs, const Histogram & rhs)
{
    Histogram result;
    for (size_t i = 0; i < 16; ++i) { result[i] = lhs[i] + rhs[i]; }
    return result;
}
auto singles = indata | boost::adaptors::transformed(from_short);
Histogram histogram = std::reduce(begin(singles), end(singles), Histogram{}, add);

另一个选项：

std::sort(begin(indata), end(indata));
short * previous = begin(indata);
for (size_t i = 0; i < 15; ++i)
{
    short * current = std::lower_bound(indata, 4096 * (i + 1));
    histogram[i] = std::distance(previous, current);
    previous = current;
}
histogram[16] = std::distance(previous, end(indata));