Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2019 | Vol. 68, nr 3 | 595--609
Tytuł artykułu

Spinal code based on lightweight hash function

Treść / Zawartość
Warianty tytułu
Języki publikacji
A spinal code is the type of rateless code, which has been proved to be capacity-achieving over both a binary symmetric channel (BSC) and an additive white Gaussian noise (AWGN) channel. Rateless spinal codes employ a hash function as a coding kernel to generate infinite pseudo-random symbols. A good hash function can improve the performance of spinal codes. In this paper, a lightweight hash function based on sponge structure is designed. A permutation function of registers is a nonlinear function. Feedback shift registers are used to improve randomness and reduce bit error rate (BER). At the same time, a pseudo-random number generator adopts a layered and piecewise combination mode, which further encrypts signals via the layered structure, reduces the correlation between input and output values, and generates the piecewise random numbers to compensate the shortcoming of the mixed linear congruence output with fixed length. Simulation results show that the designed spinal code with the lightweight hash function outperforms the original spinal code in aspects of the BER, encoding time and randomness.

Opis fizyczny
Bibliogr. 21 poz., rys., wz.
  • School of Computer and Communication Engineering University of Science and Technology Beijing (USTB) 100083, Beijing, P.R. China,
  • School of Computer and Communication Engineering University of Science and Technology Beijing (USTB) 100083, Beijing, P.R. China
  • [1] Chen S., Zhang Z., Zhang L. et al., Belief propagation with gradual edge removal for Raptor codes over AWGN channel, Proceeding of the 24th International Symposium on the Personal Indoor and Mobile Radio Communications (PIMRC), London, UK, pp. 380–385 (2013).
  • [2] Erez U., Trott M.,Wornell G., Rateless coding for Gaussian channels, IEEE Transactions on Information Theory, vol. 58, no. 2, pp. 530–547 (2012).
  • [3] Yang W., Li Y., Yu X. Sun Y., Rateless Superposition Spinal coding scheme for half-duplex relay channel, IEEE Transactions on Wireless Communications, vol. 15, no. 9, pp. 6259–6272 (2016).
  • [4] Chen P., Li Q., Li Q., Bai B., Design and performance of spinal codes over fading channels, High Mobility Wireless Communications (HMWC), International Workshop on High Mobility Wireless Communications, Beijing, China, pp. 140–145 (2014).
  • [5] Tai Y., Guilloud F., Laot C., Le Bidan R.,Wang H., Joint equalization and decoding scheme using modified spinal codes for underwater communications, OCEANS 2016 MTS/IEEE Monterey, Monterey, CA, USA, pp. 1–6 (2016).
  • [6] Balakrishnan H., Iannucci P., Perry J. et al., De-randomizing Shannon: the design and analysis of a capacity-achieving rateless codes, eprint arXiv:1206.0418 (2012).
  • [7] Shun O., Koji I., On dynamic cooperative diversity based on dual-spinal codes, IEICE Technical Report Wideband System, vol. 113, pp. 181–186 (2014).
  • [8] QU Xiaoxu, Yang Liming, Miao Quanqiang, CRC-assisted multivariate backtracking decoding algorithm for Spinal codes, Computer Engineering, vol. 43, no. 12, pp. 120–123–129 (2017).
  • [9] Yang W., Li Y., Yu X., Performance of spinal codes with sliding window decoding, 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, pp. 2203–2207 (2017).
  • [10] YangW., Li Y., Yu X., Li J., A low complexity sequential decoding algorithm for rateless spinal codes, IEEE Communications Letters, vol. 19, no. 7, pp. 1105–1108 (2015).
  • [11] Dong D.,Wu S., Jiang X., Jiao J., Zhang Q., Towards high performance short polar codes: concatenated with the spinal codes, 2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), Montreal, QC, Canada, pp. 1–5 (2017).
  • [12] Tashiro H., Morishima Y., Oka I., Ata S., PAPR control of OFDM signals using spinal codes, 2016 International Symposium on Information Theory and Its Applications (ISITA), Monterey, CA, USA, pp. 753–756 (2016).
  • [13] Yu X., Li Y., Yang W., Superposition Spinal Codes With Unequal Error Protection Property, IEEE Access, vol. 5, pp. 6589–6599 (2017).
  • [14] Allard J.L., Dobell A.R., Hull T.E., Mixed congruential random number generators for decimal machines, Journal of the ACM, vol. 10, no. 2, pp. 131–141 (1963).
  • [15] Shuai C., Fast linear congruence generator, 2010 5th International Conference on Computer Science and Education, Hefei, China, pp. 1906–1908 (2010).
  • [16] Yu X., Li Ying, YangWeiqiang, Rateless spinal code for decode-and-forward relay channel, 2015 International Workshop on High Mobility Wireless Communications (HMWC), Xi’an, China, pp. 71–75 (2015).
  • [17] Kunhu A., Al-Ahmad H., Taher F., Medical images protection and authentication using hybrid DWT-DCT and SHA256-MD5 hash functions, 2017 24th IEEE International Conference on Electronics, Circuits and Systems (ICECS), Batumi, Georgia, pp. 397–400 (2017).
  • [18] Saraiva J.P. et al., Calculation of sensitivity index using one-at-a-time measures based on graphical analysis, 2017 18th International Scientific Conference on Electric Power Engineering (EPE), Kouty and Desnou, Czech Republic, pp. 1–6 (2017).
  • [19] Sowndharya G., Vasuki A., Reducing bit error rate using CRC verification in turbo codes, 2017 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET), Chennai, India, pp. 627–631 (2017).
  • [20] Megha Mukundan P., Manayankath S., Srinivasan C., Sethumadhavan M., Hash-One: a lightweight cryptographic hash function, in IET Information Security, vol. 10, no. 5, pp. 225-231 (2016).
  • [21] LiW., Liao G.,WenY., Gong Z., SpongeMPH: ANew Multivariate Polynomial Hash Function based on the Sponge Construction, 2017 IEEE Second International Conference on Data Science in Cyberspace (DSC), Shenzhen, China, pp. 516–520 (2017).
Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2019).
Typ dokumentu
Identyfikator YADDA
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.