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

handle data and parity seperate in both BCH and RS

Browse source
This commit is contained in:
Ahmet Inan 2018-09-27 12:29:15 +02:00
commit f545b5d6ab
8 changed files with 145 additions and 105 deletions
Download patch file Download diff file Expand all files Collapse all files

42
tests/bch_decoder_test.cc
View file

@ -19,18 +19,25 @@ int main()
// NASA INTRO BCH(15, 5) T=3
typedef CODE::GaloisField<4, 0b10011, uint8_t> GF;
typedef CODE::BoseChaudhuriHocquenghemDecoder<6, 1, 5, GF> BCH;
const int L = (BCH::N + 7) / 8;
const int D = (BCH::K + 7) / 8;
const int P = (BCH::NP + 7) / 8;
const int L = D + P;
GF instance;
BCH decode;
uint8_t target[L] = { 0b11001000, 0b11110100 };
uint8_t target[L] = { 0b11001000, 0b00011110, 0b10000000 };
uint8_t code[L];
for (int i = 0; i < L; ++i)
code[i] = target[i];
std::uniform_int_distribution<int> distribution(0, BCH::N-1);
auto noise = std::bind(distribution, generator);
for (int i = 0; i < 3; ++i)
CODE::xor_be_bit(code, noise(), 1);
decode(code);
for (int i = 0; i < 3; ++i) {
int n = noise();
if (n < BCH::K)
CODE::xor_be_bit(code, n, 1);
else
CODE::xor_be_bit(code+D, n-BCH::K, 1);
}
decode(code, code + D);
for (int i = 0; i < L; ++i)
assert(code[i] == target[i]);
}
@ -38,7 +45,9 @@ int main()
// DVB-S2 FULL BCH(65535, 65343) T=12
typedef CODE::GaloisField<16, 0b10000000000101101, uint16_t> GF;
typedef CODE::BoseChaudhuriHocquenghemDecoder<24, 1, 65343, GF> BCH;
const int L = (BCH::N + 7) / 8;
const int D = (BCH::K + 7) / 8;
const int P = (BCH::NP + 7) / 8;
const int L = D + P;
GF *instance = new GF();
BCH *decode = new BCH();
uint8_t *target = new uint8_t[L];
@ -48,15 +57,20 @@ int main()
CODE::set_be_bit(target, i, (s^=s>>7)&1);
bool parity[BCH::NP] = { 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0 };
for (int i = 0; i < BCH::NP; ++i)
CODE::set_be_bit(target, BCH::K+i, parity[i]);
CODE::set_be_bit(target + D, i, parity[i]);
uint8_t *code = new uint8_t[L];
for (int i = 0; i < L; ++i)
code[i] = target[i];
std::uniform_int_distribution<int> distribution(0, BCH::N-1);
auto noise = std::bind(distribution, generator);
for (int i = 0; i < 12; ++i)
CODE::xor_be_bit(code, noise(), 1);
(*decode)(code);
for (int i = 0; i < 12; ++i) {
int n = noise();
if (n < BCH::K)
CODE::xor_be_bit(code, n, 1);
else
CODE::xor_be_bit(code+D, n-BCH::K, 1);
}
(*decode)(code, code + D);
for (int i = 0; i < L; ++i)
assert(code[i] == target[i]);
delete[] target;
@ -64,7 +78,7 @@ int main()
delete decode;
delete instance;
}
if (0) {
if (1) {
// NASA INTRO BCH(15, 5) T=3
typedef CODE::GaloisField<4, 0b10011, uint8_t> GF;
typedef CODE::BoseChaudhuriHocquenghemDecoderReference<6, 1, 5, GF> BCH;
@ -78,11 +92,11 @@ int main()
auto noise = std::bind(distribution, generator);
for (int i = 0; i < 3; ++i)
code[noise()] ^= 1;
decode(reinterpret_cast<GF::ValueType *>(code));
decode(reinterpret_cast<GF::ValueType *>(code), reinterpret_cast<GF::ValueType *>(code) + BCH::K);
for (int i = 0; i < BCH::N; ++i)
assert(code[i] == target[i]);
}
if (0) {
if (1) {
// DVB-S2 FULL BCH(65535, 65343) T=12
typedef CODE::GaloisField<16, 0b10000000000101101, uint16_t> GF;
typedef CODE::BoseChaudhuriHocquenghemDecoderReference<24, 1, 65343, GF> BCH;
@ -101,7 +115,7 @@ int main()
auto noise = std::bind(distribution, generator);
for (int i = 0; i < 12; ++i)
code[noise()] ^= 1;
(*decode)(reinterpret_cast<GF::ValueType *>(code));
(*decode)(reinterpret_cast<GF::ValueType *>(code), reinterpret_cast<GF::ValueType *>(code) + BCH::K);
for (int i = 0; i < BCH::N; ++i)
assert(code[i] == target[i]);
delete[] target;