The fault diameter of a graph G is the maximum of lengths of the shortest paths between all two vertices when there are $chi$(G) - 1 or less faulty vertices, where $chi$(G) is connectivity of G. In this paper, we analyze the fault diameter of recursive circulant $G(2^m,2^k)$ with $k{geq}3$. Let $ dia_{m.k}$ denote the diameter of $G(2^m,2^k)$. We show that if $2{leq}m,2{leq}k, the fault diameter of $G(2{leq}m,2{leq}k)$ is equal to $2^m-2$, and if m=k+1, it is equal to $2^k-1$. It is also shown that for m>k+1, the fault diameter is equal to di a_$m{ eq}1$(mod 2k); otherwise, it is less than or equal to$dia_{m.k+2}$.