5 ms·
I've implemented a Reed-Solomon encoder for telemetry blocks over a RF channel. There, I was using a (255, 223) code on GF(2^8). There were interleaving paramet
by planteen 9y ago
I've implemented a Reed-Solomon encoder for telemetry blocks over a RF channel. There, I was using a (255, 223) code on GF(2^8). There were interleaving parameters for a telemetry "packet" but each encoding took constant O(1) time. So the overall time to encode a downlink was just O(N). What exactly is meant by "Reed-Solomon ECC"? I'm guessing the code is doing something different related to data storage than what a traditional communications RS code does?
- loeg 9y agoThis application of RS is identical to a communications RS code. Same idea: you want your data to transmit accurately over a lossy media. Just, in this case, the media is aging disk instead of radio.
- Bulat-Ziganshin 9y agoLet's see: in order to produce 32 parity blocks from 255 data blocks you are probably perform 32x255 multiplications, i.e. NxM operations where N,M is number of data/parity blocks. for a fixed N/M rate it is considered as O(N^2) algo Once you fixed N and M, encoding speed will be fixed in both your and my algo. In mine, it's 1 GB/s for N=M=524288 And yes, it's doing the same as your algo - generate parity blocks from data blocks and then restore from any combination of N survived blocks