For EDITORS

For READERS

All Issues

Vol.9, 2019
Vol.8, 2018
Vol.7, 2017
Vol.6, 2016
Vol.5, 2015
Vol.4, 2014
Vol.3, 2013
Vol.2, 2012
Vol.1, 2011
Volume 5, Number 2, 2015, Pages 262-272                                                                DOI:10.11948/2015024
Improving the complexity of chaotic sequence based on the PCA algorithm
Wei Xu,Qun Ding,Xiaogang Zhang
Keywords:Chaos, complexity, permutation entropy, principal component analysis.
Abstract:
      The principal component analysis (PCA) is an effective statistical analysis method in statistical data analysis, feature extraction and data compression. The method simplifies multiple related variables into a linear combination of several irrelevant variables, through the less-comprehensive index as far as possible to replace many of the original data, and can reflect the information provided by the original data. This paper studies the signal feature extraction algorithm based on PCA, and extracts sequences’ feature which generated by Logistic mapping. Then we measured the complexity of the reconstructed chaotic sequences by the permutation entropy algorithm. The testing results show that the complexity of the reconstruction sequences is significantly higher than the original sequences.
PDF      Download reader