mirror of
https://github.com/aicodix/code.git
synced 2026-04-27 14:30:36 +00:00
quick and dirty packed bits for the BCH encoder
This commit is contained in:
parent
deb6ede15f
commit
1f354379d3
2 changed files with 101 additions and 5 deletions
|
|
@ -12,9 +12,43 @@ Copyright 2018 Ahmet Inan <inan@aicodix.de>
|
|||
int main()
|
||||
{
|
||||
if (1) {
|
||||
// NASA INTRO BCH(15, 5) T=3
|
||||
typedef CODE::BoseChaudhuriHocquenghemEncoder<15, 5> BCH;
|
||||
const int L = (BCH::N + 7) / 8;
|
||||
BCH encode({0b10011, 0b11111, 0b00111});
|
||||
uint8_t code[L] = { 0b11001000 };
|
||||
uint8_t target[L] = { 0b11001000, 0b11110100 };
|
||||
encode(code);
|
||||
for (int i = 0; i < L; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
}
|
||||
if (1) {
|
||||
// DVB-S2 FULL BCH(65535, 65343) T=12
|
||||
typedef CODE::BoseChaudhuriHocquenghemEncoder<65535, 65343> BCH;
|
||||
const int L = (BCH::N + 7) / 8;
|
||||
BCH *encode = new BCH({0b10000000000101101, 0b10000000101110011, 0b10000111110111101, 0b10101101001010101, 0b10001111100101111, 0b11111011110110101, 0b11010111101100101, 0b10111001101100111, 0b10000111010100001, 0b10111010110100111, 0b10011101000101101, 0b10001101011100011});
|
||||
uint8_t *target = new uint8_t[L];
|
||||
for (int i = 0; i < L; ++i)
|
||||
target[i] = 0;
|
||||
for (int i = 0, s = 0; i < BCH::K; ++i, s=(s*(s*s*51767+71287)+35149)&0xffffff)
|
||||
target[i/8] |= ((s^=s>>7)&1) << (7-i%8);
|
||||
uint8_t *code = new uint8_t[L];
|
||||
for (int i = 0; i < L; ++i)
|
||||
code[i] = target[i];
|
||||
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)
|
||||
target[(BCH::K+i)/8] |= parity[i] << (7-(BCH::K+i)%8);
|
||||
(*encode)(code);
|
||||
for (int i = 0; i < L; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
delete[] target;
|
||||
delete[] code;
|
||||
delete encode;
|
||||
}
|
||||
if (0) {
|
||||
// NASA INTRO BCH(15, 5) T=3
|
||||
typedef CODE::GaloisField<4, 0b10011, uint8_t> GF;
|
||||
typedef CODE::BoseChaudhuriHocquenghemEncoder<6, 1, 5, GF> BCH;
|
||||
typedef CODE::BoseChaudhuriHocquenghemEncoderReference<6, 1, 5, GF> BCH;
|
||||
GF instance;
|
||||
BCH encode({0b10011, 0b11111, 0b00111});
|
||||
uint8_t code[BCH::N] = { 1, 1, 0, 0, 1 };
|
||||
|
|
@ -23,10 +57,10 @@ int main()
|
|||
for (int i = 0; i < BCH::N; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
}
|
||||
if (1) {
|
||||
if (0) {
|
||||
// DVB-S2 FULL BCH(65535, 65343) T=12
|
||||
typedef CODE::GaloisField<16, 0b10000000000101101, uint16_t> GF;
|
||||
typedef CODE::BoseChaudhuriHocquenghemEncoder<24, 1, 65343, GF> BCH;
|
||||
typedef CODE::BoseChaudhuriHocquenghemEncoderReference<24, 1, 65343, GF> BCH;
|
||||
GF *instance = new GF();
|
||||
BCH *encode = new BCH({0b10000000000101101, 0b10000000101110011, 0b10000111110111101, 0b10101101001010101, 0b10001111100101111, 0b11111011110110101, 0b11010111101100101, 0b10111001101100111, 0b10000111010100001, 0b10111010110100111, 0b10011101000101101, 0b10001101011100011});
|
||||
uint16_t *code = new uint16_t[BCH::N];
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue