mirror of
https://github.com/saitohirga/WSJT-X.git
synced 2025-10-30 20:40:28 -04:00
12d5ec8902
git-svn-id: svn+ssh://svn.code.sf.net/p/wsjt/wsjt/branches/wsjtx@6241 ab8295b8-cf94-4d9e-aec4-7959e3be5d79
55 lines
1.6 KiB
C
55 lines
1.6 KiB
C
/* Include file to configure the RS codec for integer symbols
|
|
*
|
|
* Copyright 2002, Phil Karn, KA9Q
|
|
* May be used under the terms of the GNU General Public License (GPL)
|
|
*/
|
|
#define DTYPE int
|
|
|
|
/* Reed-Solomon codec control block */
|
|
struct rs {
|
|
unsigned int mm; /* Bits per symbol */
|
|
unsigned int nn; /* Symbols per block (= (1<<mm)-1) */
|
|
int *alpha_to; /* log lookup table */
|
|
int *index_of; /* Antilog lookup table */
|
|
int *genpoly; /* Generator polynomial */
|
|
unsigned int nroots; /* Number of generator roots = number of parity symbols */
|
|
unsigned int fcr; /* First consecutive root, index form */
|
|
unsigned int prim; /* Primitive element, index form */
|
|
unsigned int iprim; /* prim-th root of 1, index form */
|
|
};
|
|
|
|
static inline int modnn(struct rs *rs,int x){
|
|
while (x >= rs->nn) {
|
|
x -= rs->nn;
|
|
x = (x >> rs->mm) + (x & rs->nn);
|
|
}
|
|
return x;
|
|
}
|
|
#define MODNN(x) modnn(rs,x)
|
|
|
|
#define MM (rs->mm)
|
|
#define NN (rs->nn)
|
|
#define ALPHA_TO (rs->alpha_to)
|
|
#define INDEX_OF (rs->index_of)
|
|
#define GENPOLY (rs->genpoly)
|
|
#define NROOTS (rs->nroots)
|
|
#define FCR (rs->fcr)
|
|
#define PRIM (rs->prim)
|
|
#define IPRIM (rs->iprim)
|
|
#define A0 (NN)
|
|
|
|
#define ENCODE_RS encode_rs_int
|
|
#define DECODE_RS decode_rs_int
|
|
#define INIT_RS init_rs_int
|
|
#define FREE_RS free_rs_int
|
|
|
|
void ENCODE_RS(void *p,DTYPE *data,DTYPE *parity);
|
|
int DECODE_RS(void *p,DTYPE *data,int *eras_pos,int no_eras, int calc_syn);
|
|
void *INIT_RS(unsigned int symsize,unsigned int gfpoly,unsigned int fcr,
|
|
unsigned int prim,unsigned int nroots);
|
|
void FREE_RS(void *p);
|
|
|
|
|
|
|
|
|