From: An advanced low-complexity decoding algorithm for turbo product codes based on the syndrome
The number of required SISO decoding
SBDA-I
S1=Iave×n×(1−λzero)
SBDA-II
S2=Iave×n×(λDESS+λSESS)
Proposed
S3=Iave×n×(λDESS+λSESS)