Contraposing the shortcoming of “flooding schedule” in the standard LDPC(low-density parity-check) decoding algorithm, this paper presents a serial decoding schedule， which shuffles the massage passing schedule of standard LDPC decoding algorithm. The new schedule processes and propagates messages according to a serial update order of bit nodes. Each bit node receives check messages and sends bit messages in the same iteration so that the updated messages could join iterative process immediately. As a result, the convergence property is improved. Simulation results show that, under the same decoding complexity, the proposed version is optimal in the sense of MAP decoding and converges faster than the flooding schedule. Meanwhile, it keeps the appropriate decoding complexity, so it is a good method that can offer better trade-offs between performance and complexity.