4 ms·
So (2) in this case would be the scalar version of the function that takes a starting pointer, row stride, channel stride, and a row_length and channel_length.
by jesse__ 2y ago
So (2) in this case would be the scalar version of the function that takes a starting pointer, row stride, channel stride, and a row_length and channel_length. By setting the strides to 1 and lengths to max you effectively tell that function the whole matrix is leftovers and it just does the whole computation. Correct?
- hansvm 2y agoThat's not the only option, but it's very reasonable and almost certainly the thing I'd start with, maybe the thing I'd finish with. You then pass an appropriate sub-matrix to this thing which does a whole-matrix computation, and that's the entire "add another loop" trick from TFA.
- jesse__ 2y agoYeah, got it. Thanks for the explanation