4 ms·
Have you commented without looking at the link? > Because this is a matrix multiplication operation fundamentally, the order is O(n^2) or so in terms of scalin
by eps 4y ago
Have you commented without looking at the link?
> Because this is a matrix multiplication operation fundamentally, the order is O(n^2) or so in terms of scaling. Sooooo yeah, quadratically difficult to calculate as the data per block grows.
It's literally in repo's description -
Reed-Solomon coder computing one million parity
blocks at 1 GB/s. O(N*log(N)) algo employing FFT.
That's what makes FastECC notable. The repo is 5 years old. Obviously, it's going to be more than 1.2 GB/s on a modern hardware.
- joshspankit 4y agoKind of surprised that GB/s was even a metric that was used considering how variable CPUs are, even ones manufactured in the same year.
- Bulat_Ziganshin 4y ago1. As of 2017, we had quadcores as top desktop CPUs for years, and very little IPC and frequency improvements since 2011 2. But the main reason is that I can say "70 MB/s per Haswell core*GHz" and noone will feel whether it's good or not. Performance stated for top modern CPU is much easier to grok