mirror of
https://github.com/lwvmobile/dsd-fme.git
synced 2026-11-12 16:57:23 -05:00
Refactored implementation of p25p1_ldu1.c and p25p1_ldu2.c. There are less duplicities now and hopefully is easier to read and maintain. Added a unit test for the Hamming algorithm.
89 lines
2.2 KiB
C++
89 lines
2.2 KiB
C++
|
|
#include "p25p1_check_hdu.h"
|
|
#include "ReedSolomon.hpp"
|
|
#include "Golay24.hpp"
|
|
|
|
//#define __CHECK_HDU_DEBUG__
|
|
|
|
int check_and_fix_golay24(char* hex, char* parity, int* fixed_errors)
|
|
{
|
|
static DSDGolay24 golay24;
|
|
|
|
#ifdef __CHECK_HDU_DEBUG__
|
|
printf("[");
|
|
for(unsigned int i=0; i<6; i++) {
|
|
printf("%c", (hex[i] != 0)? 'X': ' ');
|
|
}
|
|
printf("] [");
|
|
for(unsigned int i=12; i<24; i++) {
|
|
printf("%c", (parity[i-12] != 0)? 'X': ' ');
|
|
}
|
|
printf("]");
|
|
#endif
|
|
|
|
int irrecoverable_errors = golay24.decode(hex, parity, fixed_errors);
|
|
|
|
#ifdef __CHECK_HDU_DEBUG__
|
|
printf(" -> [");
|
|
for(unsigned int i=0; i<6; i++) {
|
|
printf("%c", (hex[i] != 0)? 'X': ' ');
|
|
}
|
|
printf("]");
|
|
if (irrecoverable_errors) {
|
|
printf(" Errors: >4");
|
|
} else {
|
|
printf(" Errors: %i", *fixed_errors);
|
|
}
|
|
printf("\n");
|
|
#endif
|
|
|
|
return irrecoverable_errors;
|
|
}
|
|
|
|
int check_and_fix_redsolomon_36_20_17(char* data, char* parity)
|
|
{
|
|
static DSDReedSolomon_36_20_17 reed_solomon_36_20_17;
|
|
|
|
#ifdef __CHECK_HDU_DEBUG__
|
|
char original[20][6];
|
|
for (int i = 0; i < 20; i++) {
|
|
for (int j = 0; j < 6; j++) {
|
|
original[i][j] = data[i*6+j];
|
|
}
|
|
}
|
|
#endif
|
|
|
|
int irrecoverable_errors = reed_solomon_36_20_17.decode(data, parity);
|
|
|
|
#ifdef __CHECK_HDU_DEBUG__
|
|
printf("Results for Reed-Solomon code (36,20,17)\n\n");
|
|
if (irrecoverable_errors == 0) {
|
|
printf(" i original fixed\n");
|
|
for (int i = 0; i < 20; i++) {
|
|
printf("%3d [", i);
|
|
for (int j = 0; j < 6; j++) {
|
|
printf("%c", (original[i][j] == 1)? 'X' : ' ');
|
|
}
|
|
printf("] [");
|
|
for (int j = 0; j < 6; j++) {
|
|
printf("%c", (data[i*6+j] == 1)? 'X' : ' ');
|
|
}
|
|
printf("]\n");
|
|
}
|
|
} else {
|
|
printf("Irrecoverable errors found\n");
|
|
printf(" i original fixed\n");
|
|
for (int i = 0; i < 20; i++) {
|
|
printf("%3d [", i);
|
|
for (int j = 0; j < 6; j++) {
|
|
printf("%c", (original[i][j] == 1)? 'X' : ' ');
|
|
}
|
|
printf("]\n");
|
|
}
|
|
}
|
|
printf("\n");
|
|
#endif
|
|
|
|
return irrecoverable_errors;
|
|
}
|