The basis of one dimension CSAMT forward problem is the Hankel transformation. Now the main solution to this problem is numerical filtering method, which runs the process of solving the given length of filter coefficients for additive operations. Therefore, the selected filter coefficients affect the precision and speed of the forward calculation. In this paper, the authors use the Guptasarma linear filter coefficients and implement the algorithm. It’s verified by the models that it fits well with the forward models with a relatively short length of filter coefficients, which makes a good basis of the next work in inversion or quasi two-dimensional problem.