gf.h

在linux系统下开发研究移动通信的工具型代码

#ifndef _GF_H
#define _GF_H

/*
 * $Log: gf.h,v $
 * Revision 1.1  2000/05/03 14:30:04  bjc97r
 * Initial revision
 *
 */

#include "u2long.h"

/*
 * gf_table() calculates all the GF(2^r) elements and store them
 * in a table in ascending order. The element for a^n can be accessed
 * at (n+1)th index of the table. The index starts from 0.
 */
unsigned long * gf_table( unsigned M, unsigned long poly );

/*
 * gf_exp_table() stores only a^(R*n), where n=0..N-1 and R is 
 * the base exponent.
 */
unsigned long * gf_exp_table( unsigned M, unsigned long Poly,
			      unsigned R, unsigned N );
u2long * gfl_exp_table( unsigned M, u2long Poly, unsigned R, unsigned N );

/*
 * Find the generator polynomial for the sub m-sequence based on 
 * the main polynomial to generate a set of Kasami sequences.
 * It returns the generator polynomail for the sub m-sequence.
 */
unsigned long find_subpoly( unsigned L, unsigned long P );
unsigned long find_longsubpoly( unsigned L, char *P );


#endif  /* _GF_H */