HomeSort by relevance Sort by last modified time
    Searched refs:MODNN (Results 1 - 8 of 8) sorted by null

  /external/fec/
encode_rs.c 40 feedback = MODNN(NN - GENPOLY[NROOTS] + feedback);
43 bb[j] ^= ALPHA_TO[MODNN(feedback + GENPOLY[NROOTS-j])];
48 bb[NROOTS-1] = ALPHA_TO[MODNN(feedback + GENPOLY[0])];
encode_rs.h 18 * MODNN - a function to reduce its argument modulo NN. May be inline or a macro.
46 feedback = MODNN(NN - GENPOLY[NROOTS] + feedback);
49 parity[j] ^= ALPHA_TO[MODNN(feedback + GENPOLY[NROOTS-j])];
54 parity[NROOTS-1] = ALPHA_TO[MODNN(feedback + GENPOLY[0])];
decode_rs.h 17 * MODNN - a function to reduce its argument modulo NN. May be inline or a macro.
50 #if !defined(MODNN)
51 #error "MODNN not defined"
90 s[i] = data[j] ^ ALPHA_TO[MODNN(INDEX_OF[s[i]] + (FCR+i)*PRIM)];
114 lambda[1] = ALPHA_TO[MODNN(PRIM*(NN-1-eras_pos[0]))];
116 u = MODNN(PRIM*(NN-1-eras_pos[i]));
120 lambda[j] ^= ALPHA_TO[MODNN(u + tmp)];
133 for (i = 1,k=IPRIM-1; i <= NN; i++,k = MODNN(k+IPRIM)) {
137 reg[j] = MODNN(reg[j] + j);
174 discr_r ^= ALPHA_TO[MODNN(INDEX_OF[lambda[i]] + s[r-i-1])]
    [all...]
decode_rs.c 54 s[i] = data[j] ^ ALPHA_TO[MODNN(INDEX_OF[s[i]] + (FCR+i)*PRIM)];
78 lambda[1] = ALPHA_TO[MODNN(PRIM*(NN-1-eras_pos[0]))];
80 u = MODNN(PRIM*(NN-1-eras_pos[i]));
84 lambda[j] ^= ALPHA_TO[MODNN(u + tmp)];
97 for (i = 1,k=IPRIM-1; i <= NN; i++,k = MODNN(k+IPRIM)) {
101 reg[j] = MODNN(reg[j] + j);
138 discr_r ^= ALPHA_TO[MODNN(INDEX_OF[lambda[i]] + s[r-i-1])];
151 t[i+1] = lambda[i+1] ^ ALPHA_TO[MODNN(discr_r + b[i])];
162 b[i] = (lambda[i] == 0) ? A0 : MODNN(INDEX_OF[lambda[i]] - discr_r + NN);
182 for (i = 1,k=IPRIM-1; i <= NN; i++,k = MODNN(k+IPRIM))
    [all...]
char.h 8 #define MODNN(x) modnn(rs,x)
fixed.h 17 #define MODNN(x) mod255(x)
int.h 8 #define MODNN(x) modnn(rs,x)
encode_rs_av.c 29 table[i].c[16-j-1] = CCSDS_alpha_to[MODNN(CCSDS_poly[j+1] + CCSDS_index_of[i])];

Completed in 807 milliseconds