Algorithm of protocol header recovery based on iteration between layers

Efficient protocol header recovery algorithm based on iterative decoding between layers

“…As more residual redundancy has been exploited, a better header recovery performance than min‐DIS can be achieved. Further, the case that error‐detection codes of different layers provide repeat protection for the same critical fields simultaneously has been studied in our previous work [18]. For this instance of residual protocol redundancy between layers, a header recovery algorithm based on iterative decoding between layers (IL‐CRC) has been designed, where the iterative decoding scheme in [7, 19] was extended to the error‐detection codes in different protocol layers.…”

“…However, Robust CRC and our previous proposed IL‐CRC all have to estimate and store the combination probability of each verification state during decoding, which makes the computational complexity and storage consumption much too high. As a result the permeable protocol layer mechanism in [20, 14, 15], which can utilise the soft channel information, has to be deactivated in [18] to alleviate the pressure of computational complexity, causing the header recovery performance degradation. To cope with these problems, an effective header recovery algorithm based on iterative decoding between layers (eIL‐CRC) is proposed in this paper to obtain the goal of a comparable header recovery performance compared to IL‐CRC with low complexity.…”

“…Hence, the obstacle is how to get the optimum estimation of with such redundant information. Inspired by the Robust‐CRC [14] and turbo decoding [21], the IL‐CRC is put forward in [18], making use of the extrinsic information from Robust‐CRC decoder of each layer (Fig. 2).…”