Git-Mirrors/portapack-mayhem
1
0
Fork 0
mirror of https://github.com/eried/portapack-mayhem.git synced 2025-08-09 15:12:35 -04:00
Code Issues Projects Releases Packages Wiki Activity

Formatted code (#1007)

Browse source 
* Updated style

* Updated files

* fixed new line

* Updated spacing

* File fix WIP

* Updated to clang 13

* updated comment style

* Removed old comment code
This commit is contained in:
jLynx 2023-05-19 08:16:05 +12:00 • committed by GitHub
parent 7aca7ce74d
commit 033c4e9a5b
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
599 changed files with 70746 additions and 66896 deletions
Download patch file Download diff file Expand all files Collapse all files

56
firmware/common/bch_code.hpp
View file

@ -3,7 +3,7 @@
* Copyright (C) 2016 Furrtek
*
* BCH Encoder/Decoder - Adapted from GNURadio
*
*
* This file is part of PortaPack.
*
* This program is free software; you can redistribute it and/or modify
@ -28,34 +28,34 @@
#include <vector>
class BCHCode {
public:
BCHCode(std::vector<int> p_init, int m, int n, int k, int t);
~BCHCode();
BCHCode(const BCHCode&) = delete;
BCHCode(BCHCode&&) = delete;
BCHCode& operator=(const BCHCode&) = delete;
BCHCode& operator=(BCHCode&&) = delete;
public:
BCHCode(std::vector<int> p_init, int m, int n, int k, int t);
~BCHCode();
int * encode(int data[]);
int decode(int recd[]);
private:
void gen_poly();
void generate_gf();
bool valid { false };
BCHCode(const BCHCode&) = delete;
BCHCode(BCHCode&&) = delete;
BCHCode& operator=(const BCHCode&) = delete;
BCHCode& operator=(BCHCode&&) = delete;
int d { };
int * p { }; // coefficients of primitive polynomial used to generate GF(2**5)
int m { }; // order of the field GF(2**5) = 5
int n { }; // 2**5 - 1 = 31
int k { }; // n - deg(g(x)) = 21 = dimension
int t { }; // 2 = error correcting capability
int * alpha_to { }; // log table of GF(2**5)
int * index_of { }; // antilog table of GF(2**5)
int * g { }; // coefficients of generator polynomial, g(x) [n - k + 1]=[11]
int * bb { }; // coefficients of redundancy polynomial ( x**(10) i(x) ) modulo g(x)
int* encode(int data[]);
int decode(int recd[]);
private:
void gen_poly();
void generate_gf();
bool valid{false};
int d{};
int* p{}; // coefficients of primitive polynomial used to generate GF(2**5)
int m{}; // order of the field GF(2**5) = 5
int n{}; // 2**5 - 1 = 31
int k{}; // n - deg(g(x)) = 21 = dimension
int t{}; // 2 = error correcting capability
int* alpha_to{}; // log table of GF(2**5)
int* index_of{}; // antilog table of GF(2**5)
int* g{}; // coefficients of generator polynomial, g(x) [n - k + 1]=[11]
int* bb{}; // coefficients of redundancy polynomial ( x**(10) i(x) ) modulo g(x)
};
#endif/*__BCHCODE_H__*/
#endif /*__BCHCODE_H__*/