mirror of
https://github.com/aicodix/code.git
synced 2026-04-27 22:35:44 +00:00
added Reed Solomon error correction
lifted from my FEC project: https://github.com/xdsopl/FEC
This commit is contained in:
Ahmet Inan
parent
dab95db1bc
commit
01db8f516e
10 changed files with 846 additions and 1 deletions
65
tests/bch_decoder_test.cc
Normal file
65
tests/bch_decoder_test.cc
Normal file
|
|
@ -0,0 +1,65 @@
|
|||
/*
|
||||
Test for the Bose Chaudhuri Hocquenghem Decoder
|
||||
|
||||
Copyright 2018 Ahmet Inan <inan@aicodix.de>
|
||||
*/
|
||||
|
||||
#include <cassert>
|
||||
#include <random>
|
||||
#include <iostream>
|
||||
#include "galois_field.hh"
|
||||
#include "bose_chaudhuri_hocquenghem_decoder.hh"
|
||||
|
||||
int main()
|
||||
{
|
||||
std::random_device rd;
|
||||
std::default_random_engine generator(rd());
|
||||
if (1) {
|
||||
// NASA INTRO BCH(15, 5) T=3
|
||||
typedef CODE::GaloisField<4, 0b10011, uint8_t> GF;
|
||||
typedef CODE::BoseChaudhuriHocquenghemDecoder<6, 1, 5, GF> BCH;
|
||||
GF instance;
|
||||
BCH decode;
|
||||
uint8_t target[15] = { 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0 };
|
||||
uint8_t code[15];
|
||||
for (int i = 0; i < 15; ++i)
|
||||
code[i] = target[i];
|
||||
std::uniform_int_distribution<uint8_t> distribution(0, 15);
|
||||
auto noise = std::bind(distribution, generator);
|
||||
for (int i = 0; i < 3; ++i)
|
||||
code[noise()] ^= 1;
|
||||
decode(code);
|
||||
for (int i = 0; i < 15; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
}
|
||||
if (1) {
|
||||
// DVB-S2 FULL BCH(65535, 65343) T=12
|
||||
typedef CODE::GaloisField<16, 0b10000000000101101, uint16_t> GF;
|
||||
typedef CODE::BoseChaudhuriHocquenghemDecoder<24, 1, 65343, GF> BCH;
|
||||
GF *instance = new GF();
|
||||
BCH *decode = new BCH();
|
||||
uint16_t *target = new uint16_t[65535];
|
||||
for (int i = 0, s = 0; i < 65343; ++i, s=(s*(s*s*51767+71287)+35149)&0xffffff)
|
||||
target[i] = (s^=s>>7)&1;
|
||||
uint16_t parity[192] = { 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 < 192; ++i)
|
||||
target[65343+i] = parity[i];
|
||||
uint16_t *code = new uint16_t[65535];
|
||||
for (int i = 0; i < 65535; ++i)
|
||||
code[i] = target[i];
|
||||
std::uniform_int_distribution<uint16_t> distribution(0, 65535);
|
||||
auto noise = std::bind(distribution, generator);
|
||||
for (int i = 0; i < 12; ++i)
|
||||
code[noise()] ^= 1;
|
||||
(*decode)(code);
|
||||
for (int i = 0; i < 65535; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
delete[] target;
|
||||
delete[] code;
|
||||
delete decode;
|
||||
delete instance;
|
||||
}
|
||||
std::cerr << "Bose Chaudhuri Hocquenghem Decoder test passed!" << std::endl;
|
||||
return 0;
|
||||
}
|
||||
|
||||
50
tests/bch_encoder_test.cc
Normal file
50
tests/bch_encoder_test.cc
Normal file
|
|
@ -0,0 +1,50 @@
|
|||
/*
|
||||
Test for the Bose Chaudhuri Hocquenghem Encoder
|
||||
|
||||
Copyright 2018 Ahmet Inan <inan@aicodix.de>
|
||||
*/
|
||||
|
||||
#include <cassert>
|
||||
#include <iostream>
|
||||
#include "galois_field.hh"
|
||||
#include "bose_chaudhuri_hocquenghem_encoder.hh"
|
||||
|
||||
int main()
|
||||
{
|
||||
if (1) {
|
||||
// NASA INTRO BCH(15, 5) T=3
|
||||
typedef CODE::GaloisField<4, 0b10011, uint8_t> GF;
|
||||
typedef CODE::BoseChaudhuriHocquenghemEncoder<6, 1, 5, GF> BCH;
|
||||
GF instance;
|
||||
BCH encode({0b10011, 0b11111, 0b00111});
|
||||
uint8_t code[15] = { 1, 1, 0, 0, 1 };
|
||||
uint8_t target[15] = { 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0 };
|
||||
encode(code);
|
||||
for (int i = 0; i < 15; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
}
|
||||
if (1) {
|
||||
// DVB-S2 FULL BCH(65535, 65343) T=12
|
||||
typedef CODE::GaloisField<16, 0b10000000000101101, uint16_t> GF;
|
||||
typedef CODE::BoseChaudhuriHocquenghemEncoder<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[65535];
|
||||
uint16_t *target = new uint16_t[65535];
|
||||
for (int i = 0, s = 0; i < 65343; ++i, s=(s*(s*s*51767+71287)+35149)&0xffffff)
|
||||
target[i] = code[i] = (s^=s>>7)&1;
|
||||
uint16_t parity[192] = { 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 < 192; ++i)
|
||||
target[65343+i] = parity[i];
|
||||
(*encode)(code);
|
||||
for (int i = 0; i < 65535; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
delete[] target;
|
||||
delete[] code;
|
||||
delete encode;
|
||||
delete instance;
|
||||
}
|
||||
std::cerr << "Bose Chaudhuri Hocquenghem Encoder test passed!" << std::endl;
|
||||
return 0;
|
||||
}
|
||||
|
||||
88
tests/rs_decoder_test.cc
Normal file
88
tests/rs_decoder_test.cc
Normal file
|
|
@ -0,0 +1,88 @@
|
|||
/*
|
||||
Test for the Reed Solomon Decoder
|
||||
|
||||
Copyright 2018 Ahmet Inan <inan@aicodix.de>
|
||||
*/
|
||||
|
||||
#include <cassert>
|
||||
#include <random>
|
||||
#include <iostream>
|
||||
#include "galois_field.hh"
|
||||
#include "reed_solomon_decoder.hh"
|
||||
|
||||
int main()
|
||||
{
|
||||
std::random_device rd;
|
||||
std::default_random_engine generator(rd());
|
||||
if (1) {
|
||||
// BBC WHP031 RS(15, 11) T=2
|
||||
typedef CODE::GaloisField<4, 0b10011, uint8_t> GF;
|
||||
typedef CODE::ReedSolomonDecoder<4, 0, GF> RS;
|
||||
GF instance;
|
||||
RS decode;
|
||||
uint8_t target[15] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 3, 3, 12, 12 };
|
||||
uint8_t code[15];
|
||||
for (int i = 0; i < 15; ++i)
|
||||
code[i] = target[i];
|
||||
std::uniform_int_distribution<uint8_t> distribution(0, 15);
|
||||
auto noise = std::bind(distribution, generator);
|
||||
for (int i = 0; i < 2; ++i)
|
||||
code[noise()] = noise();
|
||||
decode(code);
|
||||
for (int i = 0; i < 15; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
}
|
||||
if (1) {
|
||||
// DVB-T RS(255, 239) T=8
|
||||
typedef CODE::GaloisField<8, 0b100011101, uint8_t> GF;
|
||||
typedef CODE::ReedSolomonDecoder<16, 0, GF> RS;
|
||||
GF instance;
|
||||
RS decode;
|
||||
uint8_t target[255];
|
||||
for (int i = 0; i < 239; ++i)
|
||||
target[i] = i + 1;
|
||||
uint8_t parity[16] = { 1, 126, 147, 48, 155, 224, 3, 157, 29, 226, 40, 114, 61, 30, 244, 75 };
|
||||
for (int i = 0; i < 16; ++i)
|
||||
target[239+i] = parity[i];
|
||||
uint8_t code[255];
|
||||
for (int i = 0; i < 255; ++i)
|
||||
code[i] = target[i];
|
||||
std::uniform_int_distribution<uint8_t> distribution(0, 255);
|
||||
auto noise = std::bind(distribution, generator);
|
||||
for (int i = 0; i < 8; ++i)
|
||||
code[noise()] = noise();
|
||||
decode(code);
|
||||
for (int i = 0; i < 255; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
}
|
||||
if (1) {
|
||||
// FUN RS(65535, 65471) T=32
|
||||
typedef CODE::GaloisField<16, 0b10001000000001011, uint16_t> GF;
|
||||
typedef CODE::ReedSolomonDecoder<64, 1, GF> RS;
|
||||
GF *instance = new GF();
|
||||
RS *decode = new RS();
|
||||
uint16_t *target = new uint16_t[65535];
|
||||
for (int i = 0; i < 65471; ++i)
|
||||
target[i] = i + 1;
|
||||
uint16_t parity[64] = { 25271, 26303, 22052, 31318, 31233, 6076, 40148, 29468, 47507, 32655, 12404, 13265, 23901, 38403, 50967, 50433, 40818, 226, 62296, 23636, 56393, 12952, 11476, 44416, 518, 50014, 10037, 57582, 33421, 42654, 54025, 7157, 4826, 52148, 17167, 23294, 6427, 40953, 11168, 35305, 18209, 1868, 39971, 54928, 27566, 1424, 4846, 25347, 34710, 42190, 56452, 21859, 49805, 28028, 41657, 25756, 22014, 24479, 28758, 17438, 12976, 61743, 46735, 1557 };
|
||||
for (int i = 0; i < 64; ++i)
|
||||
target[65471+i] = parity[i];
|
||||
uint16_t *code = new uint16_t[65535];
|
||||
for (int i = 0; i < 65535; ++i)
|
||||
code[i] = target[i];
|
||||
std::uniform_int_distribution<uint16_t> distribution(0, 65535);
|
||||
auto noise = std::bind(distribution, generator);
|
||||
for (int i = 0; i < 32; ++i)
|
||||
code[noise()] = noise();
|
||||
(*decode)(code);
|
||||
for (int i = 0; i < 65535; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
delete[] target;
|
||||
delete[] code;
|
||||
delete decode;
|
||||
delete instance;
|
||||
}
|
||||
std::cerr << "Reed Solomon Decoder test passed!" << std::endl;
|
||||
return 0;
|
||||
}
|
||||
|
||||
66
tests/rs_encoder_test.cc
Normal file
66
tests/rs_encoder_test.cc
Normal file
|
|
@ -0,0 +1,66 @@
|
|||
/*
|
||||
Test for the Reed Solomon Encoder
|
||||
|
||||
Copyright 2018 Ahmet Inan <inan@aicodix.de>
|
||||
*/
|
||||
|
||||
#include <cassert>
|
||||
#include <iostream>
|
||||
#include "galois_field.hh"
|
||||
#include "reed_solomon_encoder.hh"
|
||||
|
||||
int main()
|
||||
{
|
||||
if (1) {
|
||||
// BBC WHP031 RS(15, 11) T=2
|
||||
typedef CODE::GaloisField<4, 0b10011, uint8_t> GF;
|
||||
typedef CODE::ReedSolomonEncoder<4, 0, GF> RS;
|
||||
GF instance;
|
||||
RS encode;
|
||||
uint8_t code[15] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 };
|
||||
uint8_t target[15] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 3, 3, 12, 12 };
|
||||
encode(code);
|
||||
for (int i = 0; i < 15; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
}
|
||||
if (1) {
|
||||
// DVB-T RS(255, 239) T=8
|
||||
typedef CODE::GaloisField<8, 0b100011101, uint8_t> GF;
|
||||
typedef CODE::ReedSolomonEncoder<16, 0, GF> RS;
|
||||
GF instance;
|
||||
RS encode;
|
||||
uint8_t code[255], target[255];
|
||||
for (int i = 0; i < 239; ++i)
|
||||
target[i] = code[i] = i + 1;
|
||||
uint8_t parity[16] = { 1, 126, 147, 48, 155, 224, 3, 157, 29, 226, 40, 114, 61, 30, 244, 75 };
|
||||
for (int i = 0; i < 16; ++i)
|
||||
target[239+i] = parity[i];
|
||||
encode(code);
|
||||
for (int i = 0; i < 255; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
}
|
||||
if (1) {
|
||||
// FUN RS(65535, 65471) T=32
|
||||
typedef CODE::GaloisField<16, 0b10001000000001011, uint16_t> GF;
|
||||
typedef CODE::ReedSolomonEncoder<64, 1, GF> RS;
|
||||
GF *instance = new GF();
|
||||
RS *encode = new RS();
|
||||
uint16_t *code = new uint16_t[65535];
|
||||
uint16_t *target = new uint16_t[65535];
|
||||
for (int i = 0; i < 65471; ++i)
|
||||
target[i] = code[i] = i + 1;
|
||||
uint16_t parity[64] = { 25271, 26303, 22052, 31318, 31233, 6076, 40148, 29468, 47507, 32655, 12404, 13265, 23901, 38403, 50967, 50433, 40818, 226, 62296, 23636, 56393, 12952, 11476, 44416, 518, 50014, 10037, 57582, 33421, 42654, 54025, 7157, 4826, 52148, 17167, 23294, 6427, 40953, 11168, 35305, 18209, 1868, 39971, 54928, 27566, 1424, 4846, 25347, 34710, 42190, 56452, 21859, 49805, 28028, 41657, 25756, 22014, 24479, 28758, 17438, 12976, 61743, 46735, 1557 };
|
||||
for (int i = 0; i < 64; ++i)
|
||||
target[65471+i] = parity[i];
|
||||
(*encode)(code);
|
||||
for (int i = 0; i < 65535; ++i)
|
||||
assert(code[i] == target[i]);
|
||||
delete[] target;
|
||||
delete[] code;
|
||||
delete encode;
|
||||
delete instance;
|
||||
}
|
||||
std::cerr << "Reed Solomon Encoder test passed!" << std::endl;
|
||||
return 0;
|
||||
}
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue