Mirror/aicodix___code
1
0
Fork 0
mirror of https://github.com/aicodix/code.git synced 2026-04-27 14:30:36 +00:00
Code Issues Projects Releases Packages Wiki Activity

merge generator xor with shifting

Browse source
This commit is contained in:
Ahmet Inan 2018-09-24 11:56:42 +02:00
commit c133ab2553
1 changed files with 10 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

18
bose_chaudhuri_hocquenghem_encoder.hh
View file

@ -69,14 +69,16 @@ public:
for (int l = K/8+1; l < N/8; ++l)
code[l] = 0;
for (int i = 0; i < K; ++i) {
bool fb = get_be_bit(code, i) != get_be_bit(code, K);
code[K/8] = (~mask&code[K/8]) | (mask&((code[K/8]<<1)|(code[K/8+1]>>7)));
for (int l = K/8+1; l < (N-1)/8; ++l)
code[l] = (code[l]<<1) | (code[l+1]>>7);
code[(N-1)/8] <<= 1;
if (fb) {
for (int l = 0; l <= N/8-K/8; ++l)
code[l+K/8] ^= generator[l];
if (get_be_bit(code, i) != get_be_bit(code, K)) {
code[K/8] = generator[0] ^ ((~mask&code[K/8])|(mask&((code[K/8]<<1)|(code[K/8+1]>>7))));
for (int l = K/8+1; l < (N-1)/8; ++l)
code[l] = generator[l-K/8] ^ ((code[l]<<1)|(code[l+1]>>7));
code[(N-1)/8] = generator[NP/8] ^ (code[(N-1)/8]<<1);
} else {
code[K/8] = (~mask&code[K/8]) | (mask&((code[K/8]<<1)|(code[K/8+1]>>7)));
for (int l = K/8+1; l < (N-1)/8; ++l)
code[l] = (code[l]<<1) | (code[l+1]>>7);
code[(N-1)/8] <<= 1;
}
}
}