This paper proposes a simplified forced-convergence (SFC) algorithm to reduce the computational complexity for low-density parity-check (LDPC) decoding. To reduce the computational complexity, the proposed algorithm uses the modified check node (CN) operation that does not use a condition for deactivating CNs. Therefore, the proposed SFC algorithm uses only one threshold value while the existing forced-convergence (FC) algorithm uses two threshold values. The simulation results show that SFC achieves a bit error rate (BER) performance close to min-sum (MS) algorithm. SFC can reduce the computational complexity of check node by approximately 22.21% compared to FC.