For $k-1>d\ge k/2$,  Kuhn, Osthus, and Townsend gave an asymptotic  minimum $d$-degree threshold for fractional perfect matchings in $k$-uniform

hypergraphs. We give the exact $d$-degree threshold when $d\ge k/2$ by proving the following result: Let $n$, $k$, and $d$ be positive integers such that $d\geq k/2$, and let $H$ be a $k$-unifrom hypergraph with order $n$. If $\delta_d(H)>{n-d\choose k-d} -{n-d-(\lceil n/k\rceil-1)\choose k-d}$, then $H$ contains a fractional perfect  matching. Moreover, I will introduce how to obatin a large matching from fractional perfect matching.