We analyze the performance of quantized min-sum
decoding of low-density parity-check codes under unreliable message computation. To this end, we introduce a simple bit-level error model and show that decoder symmetry is preserved under this model. Subsequently, we formulate the corresponding density
evolution equations to predict the average bit error probability under faulty min-sum decoding. Finally, we present numerical threshold and bit error probability results for some regular code ensembles.