Open AccessMultiplicative repetition‐based spinal codes with low computational complexity
Author(s) -
Chen Peiyao,
Bai Baoming,
Li Qiong,
Zhang Rui
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.1401
Subject(s) - computational complexity theory , computer science , encoder , decoding methods , algorithm , additive white gaussian noise , hash function , theoretical computer science , white noise , telecommunications , computer security , operating system
Spinal codes, a new class of rateless codes, have received considerable attention for their capacity‐approaching performance over noisy channels. Hash function is the core of a spinal encoder to generate infinite coded symbols, which has higher hardware complexity. In this study, the authors propose a multiplicative repetition‐based method instead of the hash function to generate innumerable symbols with low encoding complexity. Furthermore, both frozen‐aided and cyclic redundancy check‐aided decoding methods are proposed to improve the spectral efficiency. Simulation results show that the proposed spinal codes have lower computational complexity and can achieve higher spectral efficiency in the high signal‐to‐noise ratio region compared with the conventional ones over both additive white Gaussian noise and Rayleigh fading channels.