Fast discrete Fourier transform on local fields of positive characteristic

For the discrete Fourier transform with respect to the system of characters of a local field with positive characteristic, we propose a fast algorithm. We find the complexity of the algorithm.