Fixed complexity error pattern estimation
Juhee Yun, Jaekwon Kim · 2015 International Conference on Computing, Networking and Communications (ICNC) · 2015
Recently, various techniques using cyclic redundancy check (CRC) codes for error correction have been proposed. In previous techniques, a small number of unreliable bits in a packet were toggled in order to change negative acknowledgement (NAK) into acknowledgement (ACK). The difficulty of using these techniques is that the worst case complexity is still high because the number of possible error patterns is 2NURwhere Nurdenotes the number of the unreliable bits. In this paper, we define the optimality of a set of error patterns when the set size as well as the number of unreliable bits is fixed. We then show that the optimal set of error patterns can be found with feasible computational complexity even when Nuris in the order of hundreds.