The aim of the paper is to propose an efficient and stable algorithm that is quite accurate and fast for numerical evaluation of the Fourier-Bessel transform of order ], ] > −1, using wavelets. The philosophy behind the proposed algorithm is to replace the part ( ) of the integral by its wavelet decomposition obtained by using CAS wavelets thus representing ] ( ) as a Fourier-Bessel series with coefficients depending strongly on the input function ( ). The wavelet method indicates that the approach is easy to implement and thus computationally very attractive.