Efficient protocol header recovery algorithm based on iterative decoding between layers

The iterative header recovery algorithm holds the potential of improving the performance of wireless communication, yet it has to face the challenge of reducing the high complexity. In this study, a method of constructing a candidate set around the observation sequence is proposed to approximate the original code space, by exploiting the channel measurement information. This approximation method narrows the decoding processing scope resulting in an effective estimation of the extrinsic information and a significant reduction of the computational complexity. The extrinsic information in soft form is derived to exploit the soft input and promote header recovery performance. Simulation results and analysis show that the approximation method not only has a comparable performance, but also decreases the computational complexity and the storage consumption, which are of great importance of practical application.