A novel spinal codes based on chaotic Kent mapping

Abstract

Spinal codes are a new class of rateless codes that can achieve the channel capacity over time-varying channel condition. Pseudo random hash function is the core of spinal codes, which is executed to generate spines in every encoding and decoding process. However, due to the complexity of hash function, the decoding of spinal codes is complicated. A method to decrease the computational complexity of spinal codes is proposed in this paper by using chaotic Kent map. Compared with hash function, the chaotic Kent map can significantly decrease the computational complexity of decoding process in bubble decoder. Simulation shows that the performance of Kent map is almost similar to that of hash function, but the complexity of chaotic Kent map is only 25% of that of the bubble decoder when the segment length is 8.