Pub Date : 2024-03-01DOI: 10.23919/cje.2023.00.251
Yuhong Huang;Yongming Huang
The integrated sensing and communications (ISAC) technology has been perceived as a key feature of 5G-Advanced and beyond mobile communication networks. Compared with sensing in millimeter-wave bands, sensing at sub-6 GHz band is an exceptional incentive to promote the industrialization process of ISAC due to its incomparable advantages in industrial development, especially for intelligent transportation and smart drone networks. This paper elaborates on the top challenges of sub-6 GHz ISAC technologies, as well as the potential solutions to improve the sensing capability.
{"title":"Challenges and Opportunities of Sub-6 GHz Integrated Sensing and Communications for 5G-Advanced and Beyond","authors":"Yuhong Huang;Yongming Huang","doi":"10.23919/cje.2023.00.251","DOIUrl":"https://doi.org/10.23919/cje.2023.00.251","url":null,"abstract":"The integrated sensing and communications (ISAC) technology has been perceived as a key feature of 5G-Advanced and beyond mobile communication networks. Compared with sensing in millimeter-wave bands, sensing at sub-6 GHz band is an exceptional incentive to promote the industrialization process of ISAC due to its incomparable advantages in industrial development, especially for intelligent transportation and smart drone networks. This paper elaborates on the top challenges of sub-6 GHz ISAC technologies, as well as the potential solutions to improve the sensing capability.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10488076","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140342733","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A new structural-electromagnetic coupling (SEC) analysis based on quadratic elements is proposed to solve the mismatch problem between structural elements and electromagnetic grids of the electrostatically controlled deployable membrane antenna (ECDMA). Firstly, the ECDMA reflector surface is meshed and redefined by a series of quadratic elements. Without grid transformation, the calculating formulas for the far-field pattern of ECDMA are derived by the physical-optics method. Then the structural deformation of ECDMA is analyzed and the far-field pattern calculating formulas including deformation errors are developed. Simulation and experiment results show that the quadratic elements are effective and efficient in SEC analysis of the ECDMA, moreover, the electromagnetic grid size demand and the grid discretization error are reduced greatly.
{"title":"The Establishment and Analysis of the Structural-Electromagnetic Coupling Model of the Electrostatically Controlled Deployable Membrane Antenna","authors":"Shunji Zhang;Yongzhen Gu;Wang Zhong;Qinggang Zhang;Meisong Tong","doi":"10.23919/cje.2022.00.328","DOIUrl":"https://doi.org/10.23919/cje.2022.00.328","url":null,"abstract":"A new structural-electromagnetic coupling (SEC) analysis based on quadratic elements is proposed to solve the mismatch problem between structural elements and electromagnetic grids of the electrostatically controlled deployable membrane antenna (ECDMA). Firstly, the ECDMA reflector surface is meshed and redefined by a series of quadratic elements. Without grid transformation, the calculating formulas for the far-field pattern of ECDMA are derived by the physical-optics method. Then the structural deformation of ECDMA is analyzed and the far-field pattern calculating formulas including deformation errors are developed. Simulation and experiment results show that the quadratic elements are effective and efficient in SEC analysis of the ECDMA, moreover, the electromagnetic grid size demand and the grid discretization error are reduced greatly.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10488079","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140342773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Cloud storage is now widely used, but its reliability has always been a major concern. Cloud block storage (CBS) is a famous type of cloud storage. It has the closest architecture to the underlying storage and can provide interfaces for other types. Data modifications in CBS have potential risks such as null reference or data loss. Formal verification of these operations can improve the reliability of CBS to some extent. Although separation logic is a mainstream approach to verifying program correctness, the complex architecture of CBS creates some challenges for verifications. This paper develops a proof system based on separation logic for verifying the CBS data modifications. The proof system can represent the CBS architecture, describe the properties of the CBS system state, and specify the behavior of CBS data modifications. Using the interactive verification approach from Coq, the proof system is implemented as a verification tool. With this tool, the paper builds machine-checked proofs for the functional correctness of CBS data modifications. This work can thus analyze the reliability of cloud storage from a formal perspective.
云存储现已得到广泛应用，但其可靠性一直是人们关注的焦点。云块存储（CBS）是一种著名的云存储类型。它拥有最接近底层存储的架构，并能为其他类型的存储提供接口。CBS 中的数据修改存在潜在风险，如空引用或数据丢失。对这些操作进行形式化验证可以在一定程度上提高 CBS 的可靠性。虽然分离逻辑是验证程序正确性的主流方法，但 CBS 的复杂架构给验证带来了一些挑战。本文开发了一个基于分离逻辑的证明系统，用于验证 CBS 的数据修改。该证明系统可以表示 CBS 体系结构，描述 CBS 系统状态的属性，并指定 CBS 数据修改的行为。利用 Coq 的交互式验证方法，该证明系统被作为一个验证工具来实现。利用该工具，本文建立了 CBS 数据修改功能正确性的机器校验证明。因此，这项工作可以从形式的角度分析云存储的可靠性。
{"title":"Formal Verification of Data Modifications in Cloud Block Storage Based on Separation Logic","authors":"Bowen Zhang;Zhao Jin;Hanpin Wang;Yongzhi Cao;Ju Ren","doi":"10.23919/cje.2022.00.116","DOIUrl":"https://doi.org/10.23919/cje.2022.00.116","url":null,"abstract":"Cloud storage is now widely used, but its reliability has always been a major concern. Cloud block storage (CBS) is a famous type of cloud storage. It has the closest architecture to the underlying storage and can provide interfaces for other types. Data modifications in CBS have potential risks such as null reference or data loss. Formal verification of these operations can improve the reliability of CBS to some extent. Although separation logic is a mainstream approach to verifying program correctness, the complex architecture of CBS creates some challenges for verifications. This paper develops a proof system based on separation logic for verifying the CBS data modifications. The proof system can represent the CBS architecture, describe the properties of the CBS system state, and specify the behavior of CBS data modifications. Using the interactive verification approach from Coq, the proof system is implemented as a verification tool. With this tool, the paper builds machine-checked proofs for the functional correctness of CBS data modifications. This work can thus analyze the reliability of cloud storage from a formal perspective.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10410590","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139572666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-22DOI: 10.23919/cje.2022.00.396
Ruru Zhang;E Haihong;Meina Song;Xun Cao
The ability to learn incrementally is critical to the long-term operation of AI systems. Benefiting from the power of few-shot class-incremental learning (FSCIL), deep learning models can continuously recognize new classes with only a few samples. The difficulty is that limited instances of new classes will lead to overfitting and exacerbate the catastrophic forgetting of the old classes. Most previous works alleviate the above problems by imposing strong constraints on the model structure or parameters, but ignoring embedding network transferability and classifier adaptation (CA), failing to guarantee the efficient utilization of visual features and establishing relationships between old and new classes. In this paper, we propose a simple and novel approach from two perspectives: embedding bias and classifier bias. The method learns an embedding augmented (EA) network with cross-class transfer and class-specific discriminative abilities based on self-supervised learning and modulated attention to alleviate embedding bias. Based on the adaptive incremental classifier learning scheme to realize incremental learning capability, guiding the adaptive update of prototypes and feature embeddings to alleviate classifier bias. We conduct extensive experiments on two popular natural image datasets and two medical datasets. The experiments show that our method is significantly better than the baseline and achieves state-of-the-art results.
{"title":"FSCIL-EACA: Few-Shot Class-Incremental Learning Network Based on Embedding Augmentation and Classifier Adaptation for Image Classification","authors":"Ruru Zhang;E Haihong;Meina Song;Xun Cao","doi":"10.23919/cje.2022.00.396","DOIUrl":"https://doi.org/10.23919/cje.2022.00.396","url":null,"abstract":"The ability to learn incrementally is critical to the long-term operation of AI systems. Benefiting from the power of few-shot class-incremental learning (FSCIL), deep learning models can continuously recognize new classes with only a few samples. The difficulty is that limited instances of new classes will lead to overfitting and exacerbate the catastrophic forgetting of the old classes. Most previous works alleviate the above problems by imposing strong constraints on the model structure or parameters, but ignoring embedding network transferability and classifier adaptation (CA), failing to guarantee the efficient utilization of visual features and establishing relationships between old and new classes. In this paper, we propose a simple and novel approach from two perspectives: embedding bias and classifier bias. The method learns an embedding augmented (EA) network with cross-class transfer and class-specific discriminative abilities based on self-supervised learning and modulated attention to alleviate embedding bias. Based on the adaptive incremental classifier learning scheme to realize incremental learning capability, guiding the adaptive update of prototypes and feature embeddings to alleviate classifier bias. We conduct extensive experiments on two popular natural image datasets and two medical datasets. The experiments show that our method is significantly better than the baseline and achieves state-of-the-art results.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10410591","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139572667","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-22DOI: 10.23919/cje.2022.00.114
Yufei Wang;Jun Liu;Shengnan Zhang;Sai Xu;Jingyi Wang;Shangguang Wang
With the diversification of space-based information network task requirements and the dramatic increase in demand, the efficient scheduling of various tasks in space-based information network becomes a new challenge. To address the problems of a limited number of resources and resource heterogeneity in the space-based information network, we propose a bilateral pre-processing model for tasks and resources in the scheduling pre-processing stage. We use an improved fuzzy clustering method to cluster tasks and resources and design coding rules and matching methods to match similar categories to improve the clustering effect. We propose a space-based information network task scheduling strategy based on an ant colony simulated annealing algorithm for the problems of high latency of space-based information network communication and high resource dynamics. The strategy can efficiently complete the task and resource matching and improve the task scheduling performance. The experimental results show that our proposed task scheduling strategy has less task execution time and higher resource utilization than other algorithms under the same experimental conditions. It has significantly improved scheduling performance.
{"title":"A Task Scheduling Algorithm Based on Clustering Pre-Processing in Space-Based Information Network","authors":"Yufei Wang;Jun Liu;Shengnan Zhang;Sai Xu;Jingyi Wang;Shangguang Wang","doi":"10.23919/cje.2022.00.114","DOIUrl":"https://doi.org/10.23919/cje.2022.00.114","url":null,"abstract":"With the diversification of space-based information network task requirements and the dramatic increase in demand, the efficient scheduling of various tasks in space-based information network becomes a new challenge. To address the problems of a limited number of resources and resource heterogeneity in the space-based information network, we propose a bilateral pre-processing model for tasks and resources in the scheduling pre-processing stage. We use an improved fuzzy clustering method to cluster tasks and resources and design coding rules and matching methods to match similar categories to improve the clustering effect. We propose a space-based information network task scheduling strategy based on an ant colony simulated annealing algorithm for the problems of high latency of space-based information network communication and high resource dynamics. The strategy can efficiently complete the task and resource matching and improve the task scheduling performance. The experimental results show that our proposed task scheduling strategy has less task execution time and higher resource utilization than other algorithms under the same experimental conditions. It has significantly improved scheduling performance.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10410592","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139572672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-22DOI: 10.23919/cje.2021.00.428
Juhan Wang;Ying Gao;Yuan Cao;Tao Tang;Yemei Zhu
The pressure data of the train air braking system is of great significance to accurately evaluate its operation state. In order to overcome the influence of sensor fault on the pressure data of train air braking system, it is necessary to design a set of sensor fault-tolerant voting mechanism to ensure that in the case of a pressure sensor fault, the system can accurately identify and locate the position of the faulty sensor, and estimate the fault data according to other normal data. A fault-tolerant mechanism based on multi-classification support vector machine (SVM) and adaptive network-based fuzzy inference system (ANFIS) is introduced. Multi-classification SVM is used to identify and locate the system fault state, and ANFIS is used to estimate the real data of the fault sensor. After estimation, the system will compare the real data of the fault sensor with the ANFIS estimated data. If it is similar, the system will recognize that there is a false alarm and record it. Then the paper tests the whole mechanism based on the real data. The test shows that the system can identify the fault samples and reduce the occurrence of false alarms.
{"title":"The Investigation of Data Voting Algorithm for Train Air-Braking System Based on Multi-Classification SVM and ANFIS","authors":"Juhan Wang;Ying Gao;Yuan Cao;Tao Tang;Yemei Zhu","doi":"10.23919/cje.2021.00.428","DOIUrl":"https://doi.org/10.23919/cje.2021.00.428","url":null,"abstract":"The pressure data of the train air braking system is of great significance to accurately evaluate its operation state. In order to overcome the influence of sensor fault on the pressure data of train air braking system, it is necessary to design a set of sensor fault-tolerant voting mechanism to ensure that in the case of a pressure sensor fault, the system can accurately identify and locate the position of the faulty sensor, and estimate the fault data according to other normal data. A fault-tolerant mechanism based on multi-classification support vector machine (SVM) and adaptive network-based fuzzy inference system (ANFIS) is introduced. Multi-classification SVM is used to identify and locate the system fault state, and ANFIS is used to estimate the real data of the fault sensor. After estimation, the system will compare the real data of the fault sensor with the ANFIS estimated data. If it is similar, the system will recognize that there is a false alarm and record it. Then the paper tests the whole mechanism based on the real data. The test shows that the system can identify the fault samples and reduce the occurrence of false alarms.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10410583","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139572669","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-22DOI: 10.23919/cje.2022.00.161
Li Zhao;Yi Ren;Qi Wang;Lange Deng;Feng Zhang;Xizheng Ke
Visible-light indoor positioning is a new generation of positioning technology that can be integrated into smart lighting and optical communications. The current received signal strength (RSS)-based visible-light positioning systems struggle to overcome the interferences of background and indoor-reflected noise. Meanwhile, when ensuring the lighting, it is impossible to use the superposition of each light source to accurately distinguish light source information; furthermore, it is difficult to achieve accurate positioning in complex indoor environments. This study proposes an indoor positioning method based on a combination of power spectral density detection and a neural network. The system integrates the mechanism for visible-light radiation detection with RSS theory, to build a back propagation neural network model fitting for multiple reflection channels. Different frequency signals are loaded to different light sources at the beacon end, and the characteristic frequency and power vectors are obtained at the location end using the Pisarenko harmonic decomposition method. Then, a complete fingerprint database is established to train the neural network model and conduct location tests. Finally, the location effectiveness of the proposed algorithm is verified via actual positioning experiments. The simulation results show that, when four groups of sinusoidal waves with different frequencies are superimposed with white noise, the maximum frequency error is 0.104 Hz and the maximum power error is 0.0362 W. For the measured positioning stage, a $0.8 mathrm{m}times 0.8 mathrm{m}times 0.8$ m solid wood stereoscopic positioning model is constructed, and the average error is 4.28 cm. This study provides an effective method for separating multi-source signal energies, overcoming background noise, and improving indoor visible-light positioning accuracies.
{"title":"Visible Light Indoor Positioning System Based on Pisarenko Harmonic Decomposition and Neural Network","authors":"Li Zhao;Yi Ren;Qi Wang;Lange Deng;Feng Zhang;Xizheng Ke","doi":"10.23919/cje.2022.00.161","DOIUrl":"https://doi.org/10.23919/cje.2022.00.161","url":null,"abstract":"Visible-light indoor positioning is a new generation of positioning technology that can be integrated into smart lighting and optical communications. The current received signal strength (RSS)-based visible-light positioning systems struggle to overcome the interferences of background and indoor-reflected noise. Meanwhile, when ensuring the lighting, it is impossible to use the superposition of each light source to accurately distinguish light source information; furthermore, it is difficult to achieve accurate positioning in complex indoor environments. This study proposes an indoor positioning method based on a combination of power spectral density detection and a neural network. The system integrates the mechanism for visible-light radiation detection with RSS theory, to build a back propagation neural network model fitting for multiple reflection channels. Different frequency signals are loaded to different light sources at the beacon end, and the characteristic frequency and power vectors are obtained at the location end using the Pisarenko harmonic decomposition method. Then, a complete fingerprint database is established to train the neural network model and conduct location tests. Finally, the location effectiveness of the proposed algorithm is verified via actual positioning experiments. The simulation results show that, when four groups of sinusoidal waves with different frequencies are superimposed with white noise, the maximum frequency error is 0.104 Hz and the maximum power error is 0.0362 W. For the measured positioning stage, a \u0000<tex>$0.8 mathrm{m}times 0.8 mathrm{m}times 0.8$</tex>\u0000 m solid wood stereoscopic positioning model is constructed, and the average error is 4.28 cm. This study provides an effective method for separating multi-source signal energies, overcoming background noise, and improving indoor visible-light positioning accuracies.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10410593","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139572799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-22DOI: 10.23919/cje.2022.00.007
Hongning Li;Tonghui Hu;Jiexiong Chen;Xiuqiang Wu;Qingqi Pei;Debiao He
The scarcity of spectrum resources fails to meet the increasing throughput demands of vehicular networks. There is an urgent need to maximize the utilization of spectrum bands in mobile networks. To ascertain the availability of spectrum bands, users should engage in wireless channel sensing and collaboration. However, spectrum sensing data always involves users' privacy, such as their location. This paper first introduces sensing trajectory inference attack in cognitive vehicular networks and then proposes a data confusion-based privacy-preserving algorithm and a cryptonym array-based privacy-preserving aggregation scheme for spectrum sensing in cognitive vehicular networks. Unlike existing methods, the proposed schemes transmit confused data during the aggregation process. This deliberate obfuscation makes it almost impossible to infer users' location from the transmitted data. The analysis demonstrates the resilience of the proposed schemes against sensing trajectory inference attack.
{"title":"Privacy Preserving Algorithm for Spectrum Sensing in Cognitive Vehicle Networks","authors":"Hongning Li;Tonghui Hu;Jiexiong Chen;Xiuqiang Wu;Qingqi Pei;Debiao He","doi":"10.23919/cje.2022.00.007","DOIUrl":"https://doi.org/10.23919/cje.2022.00.007","url":null,"abstract":"The scarcity of spectrum resources fails to meet the increasing throughput demands of vehicular networks. There is an urgent need to maximize the utilization of spectrum bands in mobile networks. To ascertain the availability of spectrum bands, users should engage in wireless channel sensing and collaboration. However, spectrum sensing data always involves users' privacy, such as their location. This paper first introduces sensing trajectory inference attack in cognitive vehicular networks and then proposes a data confusion-based privacy-preserving algorithm and a cryptonym array-based privacy-preserving aggregation scheme for spectrum sensing in cognitive vehicular networks. Unlike existing methods, the proposed schemes transmit confused data during the aggregation process. This deliberate obfuscation makes it almost impossible to infer users' location from the transmitted data. The analysis demonstrates the resilience of the proposed schemes against sensing trajectory inference attack.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10410608","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139573393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-22DOI: 10.23919/cje.2022.00.209
Huihui Sun;Xiaofeng Zhang;Lin Wang
As an extension of permutation entropy (PE), coded permutation entropy (CPE) improves the performance of PE by making a secondary division for ordinal patterns defined in PE. In this study, we provide an exploration of the statistical properties of CPE using a finite length Gaussian white noise time series theoretically. By means of the Taylor series expansion, the approximate expressions of the expected value and variance of CPE are deduced and the Cramér-Rae low bound (CRLB) is obtained to evaluate the performance of the CPE estimator. The results indicate that CPE is a biased estimator, but the bias only depends on relevant parameters of CPE and it can be easily corrected for an arbitrary time series. The variance of CPE is related to the encoding patterns distribution, and the value converges to the CRLB of the CPE estimator when the time series length is large enough. For a finite-length Gaussian white noise time series model, the predicted values can match well with the actual values, which further validates the statistic theory of CPE. Using the theoretical expressions of CPE, it is possible to better understand the behavior of CPE for most of the time series.
{"title":"Study on Coded Permutation Entropy of Finite Length Gaussian White Noise Time Series","authors":"Huihui Sun;Xiaofeng Zhang;Lin Wang","doi":"10.23919/cje.2022.00.209","DOIUrl":"https://doi.org/10.23919/cje.2022.00.209","url":null,"abstract":"As an extension of permutation entropy (PE), coded permutation entropy (CPE) improves the performance of PE by making a secondary division for ordinal patterns defined in PE. In this study, we provide an exploration of the statistical properties of CPE using a finite length Gaussian white noise time series theoretically. By means of the Taylor series expansion, the approximate expressions of the expected value and variance of CPE are deduced and the Cramér-Rae low bound (CRLB) is obtained to evaluate the performance of the CPE estimator. The results indicate that CPE is a biased estimator, but the bias only depends on relevant parameters of CPE and it can be easily corrected for an arbitrary time series. The variance of CPE is related to the encoding patterns distribution, and the value converges to the CRLB of the CPE estimator when the time series length is large enough. For a finite-length Gaussian white noise time series model, the predicted values can match well with the actual values, which further validates the statistic theory of CPE. Using the theoretical expressions of CPE, it is possible to better understand the behavior of CPE for most of the time series.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10410594","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139572800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-22DOI: 10.23919/cje.2022.00.313
Yiyi Han;Caibing Wang;Zhongfeng Niu;Lei Hu;Debiao He
Boolean satisfiability problem (SAT) is now widely applied in differential cryptanalysis and linear cryptanalysis for various cipher algorithms. It generated many excellent results for some ciphers, for example, Salsa20. In this research, we study the differential and linear propagations through the operations of addition, rotation and XOR (ARX), and construct the SAT models. We apply the models to CRAX to search differential trails and linear trails automatically. In this sense, our contribution can be broadly divided into two parts. We give the bounds for differential and linear cryptanalysis of Alzette both up to 12 steps, by which we present a 3-round differential attack and a 3-round linear attack for CRAX. We construct a 4-round key-recovery attack for CRAX with time complexity 2 89 times of 4-round encryption and data complexity 225.
{"title":"SAT-Based Automatic Searching for Differential and Linear Trails: Applying to CRAX","authors":"Yiyi Han;Caibing Wang;Zhongfeng Niu;Lei Hu;Debiao He","doi":"10.23919/cje.2022.00.313","DOIUrl":"https://doi.org/10.23919/cje.2022.00.313","url":null,"abstract":"Boolean satisfiability problem (SAT) is now widely applied in differential cryptanalysis and linear cryptanalysis for various cipher algorithms. It generated many excellent results for some ciphers, for example, Salsa20. In this research, we study the differential and linear propagations through the operations of addition, rotation and XOR (ARX), and construct the SAT models. We apply the models to CRAX to search differential trails and linear trails automatically. In this sense, our contribution can be broadly divided into two parts. We give the bounds for differential and linear cryptanalysis of Alzette both up to 12 steps, by which we present a 3-round differential attack and a 3-round linear attack for CRAX. We construct a 4-round key-recovery attack for CRAX with time complexity 2\u0000<sup>89</sup>\u0000 times of 4-round encryption and data complexity 225.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10410597","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139572797","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：