Resource Type

Journal Article 1141

Conference Videos 81

Conference Information 28

Conference Topics 3

Year

2024 2

2023 108

2022 126

2021 122

2020 91

2019 92

2018 78

2017 62

2016 39

2015 40

2014 15

2013 26

2012 24

2011 26

2010 33

2009 18

2008 31

2007 40

2006 45

2005 53

open ︾

Keywords

Artificial intelligence 8

Multi-agent system 8

Machine learning 7

Puguang Gas Field 7

simulation 7

system engineering 7

system integration 7

Multi-agent systems 6

Reinforcement learning 6

open complex giant system 6

system 6

sustainable development 5

Additive manufacturing 4

Deep learning 4

Intelligent manufacturing 4

Qian Xuesen 4

architecture 4

neural network 4

system science 4

open ︾

Search scope:

排序： Display mode:

Dynamic analysis, FPGA implementation, and cryptographic application of an autonomous 5D chaotic system Research Articles

Sifeu Takougang Kingni, Karthikeyan Rajagopal, Serdar Çiçek, Ashokkumar Srinivasan, Anitha Karthikeyan,stkingni@gmail.com

Frontiers of Information Technology & Electronic Engineering 2020, Volume 21, Issue 6,   Pages 809-962 doi: 10.1631/FITEE.1900167

Abstract: Using a field programmable gate array (FPGA), the proposed autonomous 5D system is implemented and the

Keywords： 混沌系统；霍普夫分岔；共存吸引子；偏置增强；FPGA实现；声音加密    

HTML PDF Collect

Bio-inspired cryptosystem on the reciprocal domain: DNA strands mutate to secure health data Research Articles

S. Aashiq Banu, Rengarajan Amirtharajan,aashiqbanu@sastra.ac.in,amir@ece.sastra.edu

Frontiers of Information Technology & Electronic Engineering 2021, Volume 22, Issue 7,   Pages 940-956 doi: 10.1631/FITEE.2000071

Abstract: Healthcare and telemedicine industries are relying on technology that is connected to the Internet. Digital health data are more prone to cyber attacks because of the treasure trove of personal data they possess. This necessitates protection of digital medical images and their secure transmission. In this paper, an encryption technique based on mutated with Lorenz and Lü is employed to generate high pseudo-random key streams. The proposed chaos- cryptic system operates on the integer wavelet transform (IWT) domain and a bio-inspired , unit for enhancing the confusion and diffusion phase in an approximation coefficient. Finally, an XOR operation is performed with a quantised chaotic set from the developed combined attractors. The algorithm attains an average entropy of 7.9973, near-zero correlation with an NPCR of 99.642%, a UACI of 33.438%, and a keyspace of 10. Further, the experimental analyses and NIST statistical test suite have been designed such that the proposed technique has the potency to withstand any statistical, differential, and brute force attacks.

Keywords： 医学图像加密；DNA；混沌吸引子；交叉；突变；电子医疗    

HTML PDF Collect

Bifurcation-based fractional-order PI None

Karima RABAH, Samir LADACI, Mohamed LASHAB

Frontiers of Information Technology & Electronic Engineering 2018, Volume 19, Issue 2,   Pages 180-191 doi: 10.1631/FITEE.1601543

Abstract: We propose a novel approach called the robust fractional-order proportional-integral-derivative (FOPID) controller, to stabilize a perturbed nonlinear chaotic system on one of its unstable fixed points. The stability analysis of the nonlinear chaotic system is made based on the proportional-integral-derivative actions using the bifurcation diagram. We extract an initial set of controller parameters, which are subsequently optimized using a quadratic criterion. The integral and derivative fractional orders are also identified by this quadratic criterion. By applying numerical simulations on two nonlinear systems, namely the multi-scroll Chen system and the Genesio-Tesi system, we show that the fractional PIλDμ controller provides the best closed-loop system performance in stabilizing the unstable fixed points, even in the presence of random perturbation.

Keywords： Fractional order system     Bifurcation diagram     Fractional PIλDμ controller     Multi-scroll Chen chaotic system     Genesio-Tesi chaotic system    

HTML PDF Collect

Chaotic digital cryptosystem using serial peripheral interface protocol and its dsPIC implementation None

Rodrigo MÉNDEZ-RAMÍREZ, Adrian ARELLANO-DELGADO, César CRUZ-HERNÁNDEZ, Fausto ABUNDIZ-PÉREZ, Rigoberto MARTÍNEZ-CLARK

Frontiers of Information Technology & Electronic Engineering 2018, Volume 19, Issue 2,   Pages 165-179 doi: 10.1631/FITEE.1601346

Abstract: The current massive use of digital communications demands a secure link by using an embedded system (ES) with data encryption at the protocol level. The serial peripheral interface (SPI) protocol is commonly used by manufacturers of ESs and integrated circuits for applications in areas such as wired and wireless communications. We present the design and experimental implementation of a chaotic encryption and decryption algorithm applied to the SPI communication protocol. The design of the chaotic encryption algorithm along with its counterpart in the decryption is based on the chaotic Hénon map and two methods for blur and permute (in combination with DNA sequences). The SPI protocol is configured in 16 bits to synchronize a transmitter and a receiver considering a symmetric key. Results are experimentally proved using two low-cost dsPIC microcontrollers as ESs. The SPI digital-to-analog converter is used to process, acquire, and reconstruct confidential messages based on its properties for digital signal processing. Finally, security of the cryptogram is proved by a statistical test. The digital processing capacity of the algorithm is validated by dsPIC microcontrollers.

Keywords： Chaotic systems     Statistical tests     Embedded systems     dsPIC microcontroller     Serial peripheral interface (SPI) protocol    

HTML PDF Collect

Design and implementation of various datapath architectures for the ANU lightweight cipher on an FPGA Personal View

Vijay DAHIPHALE, Gaurav BANSOD, Ankur ZAMBARE, Narayan PISHAROTY

Frontiers of Information Technology & Electronic Engineering 2020, Volume 21, Issue 4,   Pages 615-628 doi: 10.1631/FITEE.1800681

Abstract: implemented at 4-, 8-, 16-, and 32-bit datapath sizes on four different field-programmable gate array (FPGA

Keywords： Lightweight cryptography     Internet of Things (IoT)     Embedded security     Encryption     FPGA     Datapath design    

HTML PDF Collect

Cellular automata based multi-bit stuck-at fault diagnosis for resistive memory Research Article

Sutapa SARKAR, Biplab Kumar SIKDAR, Mousumi SAHA

Frontiers of Information Technology & Electronic Engineering 2022, Volume 23, Issue 7,   Pages 1110-1126 doi: 10.1631/FITEE.2100255

Abstract: This paper presents a group-based dynamic scheme intended for resistive random-access memory (ReRAM). Traditional static random-access memory, dynamic random-access memory, NAND, and NOR flash memory are limited by their scalability, power, package density, and so forth. Next-generation memory types like ReRAMs are considered to have various advantages such as high package density, non-volatility, scalability, and low power consumption, but has been a problem. Unreliable memory operation is caused by permanent stuck-at faults due to extensive use of write- or memory-intensive workloads. An increased number of stuck-at faults also prematurely limit chip lifetime. Therefore, a cellular automaton (CA) based dynamic stuck-at fault-tolerant design is proposed here to combat unreliable cell functioning and variable cell lifetime issues. A scalable, block-level fault diagnosis and recovery scheme is introduced to ensure readable data despite multi-bit stuck-at faults. The scheme is a novel approach because its goal is to remove all the restrictions on the number and nature of stuck-at faults in general fault conditions. The proposed scheme is based on Wolfram's null boundary and periodic boundary CA theory. Various special classes of CAs are introduced for 100% fault tolerance: (SACAs), (TACAs), and (MACAs). The target micro-architectural unit is designed with optimal space overhead.

Keywords： Resistive memory     Cell reliability     Stuck-at fault diagnosis     Single-length-cycle single-attractor cellular automata     Single-length-cycle two-attractor cellular automata     Single-length-cycle multiple-attractor cellular automata    

HTML PDF Collect

A novel color image encryption algorithm based on a fractional-order discrete chaotic neural network and DNA sequence operations Research Articles

Li-ping Chen, Hao Yin, Li-guo Yuan, António M. Lopes, J. A. Tenreiro Machado, Ran-chao Wu,lip_chenhut@126.com

Frontiers of Information Technology & Electronic Engineering 2020, Volume 21, Issue 6,   Pages 809-962 doi: 10.1631/FITEE.1900709

Abstract: A novel algorithm based on dynamic deoxyribonucleic acid (DNA) encoding and chaos is presented. A three-neuron fractional-order discrete Hopfield neural network (FODHNN) is employed as a pseudo-random chaotic sequence generator. Its initial value is obtained with the secret key generated by a five-parameter external key and a hash code of the plain image. The external key includes both the FODHNN discrete step size and order. The hash is computed with the SHA-2 function. This ensures a large secret key space and improves the algorithm sensitivity to the plain image. Furthermore, a new three-dimensional projection confusion method is proposed to scramble the pixels among red, green, and blue color components. DNA encoding and diffusion are used to diffuse the image information. Pseudo-random sequences generated by FODHNN are employed to determine the encoding rules for each pixel and to ensure the diversity of the encoding methods. Finally, confusion II and XOR are used to ensure the security of the encryption. Experimental results and the security analysis show that the proposed algorithm has better performance than those reported in the literature and can resist typical attacks.

Keywords： 分数阶离散系统；神经网络；DNA加密；彩色图像加密    

HTML PDF Collect

Optimal one-bit perturbation in Boolean networks based on cascading aggregation Research Articles

Jin-feng PAN, Min MENG

Frontiers of Information Technology & Electronic Engineering 2020, Volume 21, Issue 2,   Pages 294-303 doi: 10.1631/FITEE.1900411

Abstract: We investigate the problem of finding optimal one-bit perturbation that maximizes the size of the basin of attractions (BOAs) of desired attractors and minimizes the size of the BOAs of undesired attractors for large-scale Boolean networks by cascading aggregation. First, via the aggregation, a necessary and sufficient condition is given to ensure the invariance of desired attractors after one-bit perturbation. Second, an algorithm is proposed to identify whether the one-bit perturbation will cause the emergence of new attractors or not. Next, the change of the size of BOAs after one-bit perturbation is provided in an algorithm. Finally, the efficiency of the proposed method is verified by a T-cell receptor network.

Keywords： Large-scale Boolean network     Attractor     Cascading aggregation     One-bit perturbation    

HTML PDF Collect

A New Adaptive Frame Rate Upconversion Algorithm for Scan Rate Conversion and Its FPGA Implementation

Wu Yong,Zhang Guanglie,Zheng Nanning,Zhang Xia

Strategic Study of CAE 2001, Volume 3, Issue 4,   Pages 56-62

Abstract: By using a look-up table that corresponds to the adjustable parameter and employing FPGA, the algorithm

Keywords： scan format conversion     frame rate up-conversion     block-matching     motion compensation    

HTML PDF Collect

Implementation of PRINCE with resource-efficient structures based on FPGAs Research Articles

Lang Li, Jingya Feng, Botao Liu, Ying Guo, Qiuping Li,lilang911@126.com,fengjyk@126.com

Frontiers of Information Technology & Electronic Engineering 2021, Volume 22, Issue 11,   Pages 1505-1516 doi: 10.1631/FITEE.2000688

Abstract: In this era of pervasive computing, low-resource devices have been deployed in various fields. is a designed for low latency, and is suitable for pervasive computing applications. In this paper, we propose new circuit structures for components by sharing and simplifying logic circuits, to achieve the goal of using a smaller number of logic gates to obtain the same result. Based on the new circuit structures of components and the best sharing among components, we propose three new hardware architectures for . The architectures are simulated and synthesized on different programmable gate array devices. The results on Virtex-6 show that compared with existing architectures, the resource consumption of the unrolled, , and two-cycle architectures is reduced by 73, 119, and 380 slices, respectively. The architecture costs only 137 slices. The unrolled architecture costs 409 slices and has a throughput of 5.34 Gb/s. To our knowledge, for the hardware implementation of , the new architecture sets new area records, and the new unrolled architecture sets new throughput records. Therefore, the newly proposed architectures are more resource-efficient and suitable for lightweight, latency-critical applications.

Keywords： 轻量级分组密码；现场可编程门阵列（FPGA）；低成本；PRINCE；嵌入式安全    

HTML PDF Collect

BORON: an ultra-lightweight and low power encryption design for pervasive computing Article

Gaurav BANSOD,Narayan PISHAROTY,Abhijit PATIL

Frontiers of Information Technology & Electronic Engineering 2017, Volume 18, Issue 3,   Pages 317-331 doi: 10.1631/FITEE.1500415

Abstract: We propose an ultra-lightweight, compact, and low power block cipher BORON. BORON is a substitution and permutation based network, which operates on a 64-bit plain text and supports a key length of 128/80 bits. BORON has a compact structure which requires 1939 gate equivalents (GEs) for a 128-bit key and 1626 GEs for an 80-bit key. The BORON cipher includes shift operators, round permutation layers, and XOR operations. Its unique design helps generate a large number of active S-boxes in fewer rounds, which thwarts the linear and differential attacks on the cipher. BORON shows good performance on both hardware and software platforms. BORON consumes less power as compared to the lightweight cipher LED and it has a higher throughput as compared to other existing SP network ciphers. We also present the security analysis of BORON and its performance as an ultra-lightweight compact cipher. BORON is a well-suited cipher design for applications where both a small footprint area and low power dissipation play a crucial role.

Keywords： Lightweight cryptography     SP network     Block cipher     Internet of Things (IoT)     Encryption     Embedded security    

HTML PDF Collect

An Approximate Analytical Method for a Slot Ring Radome Article

Kang Luo, Jin Meng, Jiangfeng Han, Danni Zhu

Engineering 2023, Volume 30, Issue 11,   Pages 75-82 doi: 10.1016/j.eng.2023.07.015

Abstract:

In this paper, an in-band and out-of-band microwave wireless power-transmission characteristic analysis of a slot ring radome based on an approximate analytical method is proposed. The main contribution of this paper is that, in the approximate analysis of the ring radome, a unified expression of the incident field on the radome surface is derived with E-plane and H-plane scanning, and the ring is approximated as 30 segments of straight strips. Solving the corresponding 60 × 60 linear equations yields the electric current distribution along the ring strip. The magnetic current along the complementary slot ring is obtained by duality. Thanks to the fully analytical format of the current distribution, the microwave wireless power-transmission characteristics are efficiently calculated using Munk's scheme. An example of a slot ring biplanar symmetric hybrid radome is used to verify the accuracy and efficiency of the proposed scheme. The central processing unit (CPU) time is about 690 s using Ansys HFSS software versus 2.82 s for the proposed method.

Keywords： Approximate analytical     Ring     Radome     Kirchhoff-type circuit    

HTML PDF Collect

The Generating Lock P<G，X，X'>and Its Central Encrypting System

Shi Kaiquan,Chen Zexiong

Strategic Study of CAE 2000, Volume 2, Issue 2,   Pages 41-46

Abstract:

The conception of the generating lock  P <G ,X, X´> and the central encrypting system composed of P<G ,X, X´>with data generating technology are proposed in this paper[3〜6]. These systems include the generating lock P<G ,X, X´> and single-tooth central encrypting system, and the generating lock P <G ,X, X´> and multi-tooth central encrypting system. The single-tooth encrypting-decrypting algorithm multi-tooth encrypting-decrypting algorithm, multi-tooth static encrypting-decrypting algorithm, multi-tooth dynamic encrypting-decrypting algorithm as well as the structure character of central encrypting system are provided. The paper points out that arbitrary two persons A and B can choose irregular distributed positive integer sets, XA={x1, x2, …，xn}, XB ={x1,x2,…xm}, m≥4, n≥4, XA≠XB , respectively and complete their secret communication with P < G, X, X´>. The experiment result shows that the method proposed has good application character and security character.

Keywords： the generating lock     the central encrypting system     multi-tooth encrypting-decrypting algorithm     P    X     X'     > existence theorem     digital signature uniqueness theorem    

HTML PDF Collect

Synchronization of two different chaotic systems using Legendre polynomials with applications in secure communications None

Saeed KHORASHADIZADEH, Mohammad-Hassan MAJIDI

Frontiers of Information Technology & Electronic Engineering 2018, Volume 19, Issue 9,   Pages 1180-1190 doi: 10.1631/FITEE.1601814

Abstract:

In this study, a new controller for chaos synchronization is proposed. It consists of a state feedback controller and a robust control term using Legendre polynomials to compensate for uncertainties. The truncation error is also considered. Due to the orthogonal functions theorem, Legendre polynomials can approximate nonlinear functions with arbitrarily small approximation errors. As a result, they can replace fuzzy systems and neural networks to estimate and compensate for uncertainties in control systems. Legendre polynomials have fewer tuning parameters than fuzzy systems and neural networks. Thus, their tuning process is simpler. Similar to the parameters of fuzzy systems, Legendre coefficients are estimated online using the adaptation rule obtained from the stability analysis. It is assumed that the master and slave systems are the Lorenz and Chen chaotic systems, respectively. In secure communication systems, observer-based synchronization is required since only one state variable of the master system is sent through the channel. The use of observer-based synchronization to obtain other state variables is discussed. Simulation results reveal the effectiveness of the proposed approach. A comparison with a fuzzy sliding mode controller shows that the proposed controller provides a superior transient response. The problem of secure communications is explained and the controller performance in secure communications is examined.

Keywords： Observer-based synchronization     Chaotic systems     Legendre polynomials     Secure communications    

HTML PDF Collect

Parameter value selection strategy for complete coverage path planning based on the Lü system to perform specific types of missions Research Article

Caihong LI, Cong LIU, Yong SONG, Zhenying LIANG

Frontiers of Information Technology & Electronic Engineering 2023, Volume 24, Issue 2,   Pages 231-244 doi: 10.1631/FITEE.2200211

Abstract: We propose a novel for the ; to construct a chaotic robot to accomplish the task. The algorithm can meet the requirements of high randomness and coverage rate to perform specific types of missions. First, we roughly determine the value range of the parameter of the ; to meet the requirement of being a dissipative . Second, we calculate the s to narrow the value range further. Next, we draw the phase planes of the to approximately judge the topological distribution characteristics of its trajectories. Furthermore, we calculate the of the variable for those good ones to judge its random characteristics. Finally, we construct a chaotic robot using variables with the determined parameter values and simulate and test the coverage rate to study the relationship between the coverage rate and the random characteristics of the variables. The above selection strategy gradually narrows the value range of the parameter according to the randomness requirement of the coverage trajectory. Using the proposed strategy, proper variables can be chosen with a larger to construct a chaotic robot with a higher coverage rate. Another chaotic , the Lorenz , is used to verify the feasibility and effectiveness of the designed strategy. The proposed strategy for enhancing the coverage rate of the mobile robot can improve the efficiency of accomplishing CCPP tasks under specific types of missions.

Keywords： Chaotic mobile robot     Lü     system     Complete coverage path planning (CCPP)     Parameter value selection strategy     Lyapunov exponent     Pearson correlation coefficient    

HTML PDF Collect

Title Author Date Type Operation

Dynamic analysis, FPGA implementation, and cryptographic application of an autonomous 5D chaotic system

Sifeu Takougang Kingni, Karthikeyan Rajagopal, Serdar Çiçek, Ashokkumar Srinivasan, Anitha Karthikeyan,stkingni@gmail.com

Journal Article

Bio-inspired cryptosystem on the reciprocal domain: DNA strands mutate to secure health data

S. Aashiq Banu, Rengarajan Amirtharajan,aashiqbanu@sastra.ac.in,amir@ece.sastra.edu

Journal Article

Bifurcation-based fractional-order PI

Karima RABAH, Samir LADACI, Mohamed LASHAB

Journal Article

Chaotic digital cryptosystem using serial peripheral interface protocol and its dsPIC implementation

Rodrigo MÉNDEZ-RAMÍREZ, Adrian ARELLANO-DELGADO, César CRUZ-HERNÁNDEZ, Fausto ABUNDIZ-PÉREZ, Rigoberto MARTÍNEZ-CLARK

Journal Article

Design and implementation of various datapath architectures for the ANU lightweight cipher on an FPGA

Vijay DAHIPHALE, Gaurav BANSOD, Ankur ZAMBARE, Narayan PISHAROTY

Journal Article

Cellular automata based multi-bit stuck-at fault diagnosis for resistive memory

Sutapa SARKAR, Biplab Kumar SIKDAR, Mousumi SAHA

Journal Article

A novel color image encryption algorithm based on a fractional-order discrete chaotic neural network and DNA sequence operations

Li-ping Chen, Hao Yin, Li-guo Yuan, António M. Lopes, J. A. Tenreiro Machado, Ran-chao Wu,lip_chenhut@126.com

Journal Article

Optimal one-bit perturbation in Boolean networks based on cascading aggregation

Jin-feng PAN, Min MENG

Journal Article

A New Adaptive Frame Rate Upconversion Algorithm for Scan Rate Conversion and Its FPGA Implementation

Wu Yong,Zhang Guanglie,Zheng Nanning,Zhang Xia

Journal Article

Implementation of PRINCE with resource-efficient structures based on FPGAs

Lang Li, Jingya Feng, Botao Liu, Ying Guo, Qiuping Li,lilang911@126.com,fengjyk@126.com

Journal Article

BORON: an ultra-lightweight and low power encryption design for pervasive computing

Gaurav BANSOD,Narayan PISHAROTY,Abhijit PATIL

Journal Article

An Approximate Analytical Method for a Slot Ring Radome

Kang Luo, Jin Meng, Jiangfeng Han, Danni Zhu

Journal Article

The Generating Lock P<G，X，X'>and Its Central Encrypting System

Shi Kaiquan,Chen Zexiong

Journal Article

Synchronization of two different chaotic systems using Legendre polynomials with applications in secure communications

Saeed KHORASHADIZADEH, Mohammad-Hassan MAJIDI

Journal Article

Parameter value selection strategy for complete coverage path planning based on the Lü system to perform specific types of missions

Caihong LI, Cong LIU, Yong SONG, Zhenying LIANG

Journal Article