Algorithm 1: Successive Decoding for $2-$state channel
1:	input$(h_1^2,\dots ,h_N^2)$, k
2:	for$\ell \in \{0,\dots ,k\}$
3:	if $\ell =0$
4:	In stage 1 successively decode ${\left\{U_{10}^i\right\}}_{i=1}^N$
5:	else if $\ell \in \{1,\dots ,k\}$
6:	(1) In stage $4\ell -2$ successively decode ${\mathcal{Q}}_{1(k-\ell +1)}$
7:	(2) In stage $4\ell -1$ successively decode ${\mathcal{P}}_{1\ell }$
8:	(3) In stage $4\ell$ successively decode ${\mathcal{Q}}_{2(k-\ell )}$
9:	(4) In stage $4\ell +1$ successively decode ${\mathcal{P}}_{2\ell }$
10:	end if
11:	end for