We develop a new constraint-reduced infeasible predictor-corrector interior point method for semidefinite programming, and we prove that it has polynomial global convergence and superlinear local convergence. While the new algorithm uses HKM direction in predictor step, it adopts AHO direction in corrector step to obtain faster approach to the central path. In contrast to the previous constraint-reduced algorithm, the proposed algorithm can accomplish superlinear convergence without repeated corrector step due to the fast centering effect of AHO direction.