Related-Key Cryptanalysis on the Full PRINTcipher Suitable for IC-Printing by Yuseop Lee, Kitae Jeong, Changhoon Lee, Jaechul Sung, Seokhie Hong

“…To recover the 80-bit secret key of PRINTcipher-48, our attack requires 2 47 related-key chosen plaintexts with a computational complexity of 2 60 · 62 . In the case of PRINTcipher-96, we require 2 95 related-key chosen plaintexts with a computational complexity of 2 107 . …”
Get full text

QoS routing algorithm based on multiple domain architecture of SDN by Wei HUANG, Ran LU, Cuncai LIU, Sibo QI

“…Traditional distributed network architecture constraints the innovation of routing algorithm.Software-defined network (SDN) provides a new solution for the optimization of routing algorithm.Previous researches show that the quality of service (QoS) routing issues are based on heuristic algorithm mostly,but these methods cannot be applied in large networks due to their high computing complexity.However,other algorithms have a lot of problems,which are high complexity or poor QoS performance,such as shortest path algorithm.This paper proposes A new QoS routing algorithm:LC-LD routing algorithm was proposed.LC-LD was based on SDN west-east interface and binds both delay constraint and cost constraint.keeping a good balance between computational complexity and algorithm performance.Finally,the simulation results show that LC-LD can possess both low computational complexity and high QoS routing performance.…”
Get full text

Approaching the general quantification of functional information by Robert Kudelić

“…We have also made first steps of placing functional information in a computational complexity framework, which will potentially foster algorithmics around it, especially in terms of optimality or degeneracy, and possibly even in terms of work around classes of computational complexity.…”
Get full text

A reduced-complexity compressed sensing channel estimation for underwater acoustic channel by Xuan YU, Xuan GENG

“…Aiming at the sparse characteristics of underwater acoustic channels for shallow seas, a reduced-complexity look-ahead backtracking orthogonal matching pursuit (RC-LABOMP) channel estimation algorithm was proposed.Firstly, two types of support sets of orthogonal matching pursuit and subspace pursuit channel estimation algorithms were calculated, and then prior information based on the intersection and union of the two support sets were preprocessed.At last, the preprocessed prior information was used to complete look-ahead backtracking orthogonal matching pursuit channel estimation.The preprocessed prior information leads to the decrease of the iteration number of original LABOMP, and reduction of the atom index range, thus the proposed algorithm can reduce the computational complexity of original LABOMP significantly.In addition, combining the proposed algorithm with the underwater acoustic Turbo equalization system is more suitable for underwater acoustic communication systems.Simulation results show that the proposed algorithm demonstrates high estimation accuracy and low bit error rate performance under both conditions of random channels and underwater acoustic channels.It also reduces the computational complexity of the LABOMP algorithm.Therefore, it is an effective method for shallow seas underwater acoustic channels estimation algorithm.…”
Get full text

Unsupervised intrusion detection model based on temporal convolutional network by LIAO Jinju, DING Jiawei, FENG Guanghui

“…However, LSTM’s sequential data processing significantly increases computational complexity and memory consumption during training. …”
Get full text

A Novel Decentralized Scheme for Cooperative Compressed Spectrum Sensing in Distributed Networks by Huang Jijun, Zha Song

“…The superior performance of the proposed scheme is demonstrated by comparing with several existing decentralized schemes in terms of detection performance, communication overhead, and computational complexity.…”
Get full text

Swin Transformer lightweight: an efficient strategy that combines weight sharing, distillation and pruning by HAN Bo, ZHOU Shun, FAN Jianhua, WEI Xianglin, HU Yongyang, ZHU Yanping

“…However, its high computational complexity limits its applicability on devices with constrained computational resources. …”
Get full text

Proportional Fair Power Allocation for Secondary Transmitters in the TV White Space by Konstantinos Koufos, Riku Jäntti

“…When the number of secondary transmitters is high, the computational complexity of the proposed algorithm becomes high too. …”
Get full text

Historical information based iterative soft Kalman time-varying channel estimation method by Lu CHENG, Lihua YANG, Zenghao WANG, Jie ZHANG, Yan LIANG

“…For high-speed mobile MIMO-OFDM systems,a historical information based iterative soft-Kalman filter time-varying channel estimation method was proposed.Considering that the channels experienced by different trains in the high-speed railway environment have strong correlation,the channel information of the historical train was firstly used to obtain the optimal basis function,which can be employed to model the channel.By the optimal basis function,the computational complexity was reduced and the channel estimation accuracy was improved for the proposed method.Secondly,the soft-Kalman filter and data detection were jointed to estimate the base coefficient in each iteration.To reduce the effect of data detection error propagation on the channel estimation,the soft data detection scheme was employed and the soft detection error was treated as noise in each iteration.In addition,the soft-Kalman filter used in the proposed method does not involve the AR model tracking factor,thereby avoiding the computational complexity introduced by the estimated tracking factor.The simulation results show that the proposed method has better estimation performance,and is more suitable for time-varying channel acquisition of actual high-speed mobile scenarios.…”
Get full text

Step-by-step classification detection algorithm of SPPM based on K-means clustering by Huiqin WANG, Wenbin HOU, Qingbin PENG, Minghua CAO, Rui HUANG, Ling LIU

“…In view of the high computational complexity in spatial pulse position modulation systems when using maximum likelihood detection algorithm, a step-by-step classification detection algorithm based on K-means clustering was proposed according to the characteristics of signal matrix with spatial pulse position modulation.The signal vector detection algorithm was utilized to detect the index of light source in the training samples.The on K-means clustering algorithm was utilized to acquire the mapping rule between centroid of samples and modulated symbol by offline training.Subsequently, online detection of modulated symbols was achieved based on the mapping rule, and then the index of light sources was detected by exhaustive search.In addition, Monte Carlo method was used to investigate the effects of key parameters such as the number of clusters and initialization times on the system bit error rate (BER) performance.Simulation results demonstrate that the proposed algorithm can achieve an approximate BER performance as the maximum likelihood algorithm on the basis of greatly reducing the computational complexity.Compared with the linear decoding algorithms, the proposed algorithm is also applicable to scenarios where the number of detectors is less than the number of light sources.…”
Get full text

Efficient Hybrid Iterative Method for Signal Detection in Massive MIMO Uplink System over AWGN Channel by Zelalem Melak Gebeyehu, Ram Sewak Singh, Satyasis Mishra, Davinder Singh Rathee

“…Although the ZF and MMSE algorithms perform well, their computational complexity is high due to direct matrix inversion. …”
Get full text

Computation of Graph Fourier Transform Centrality Using Graph Filter by Chien-Cheng Tseng, Su-Ling Lee

“…To reduce the computational complexity of GFTC, a linear algebra method based on Frobenius norm of error matrix is applied to convert the spectral-domain GFTC computation task to vertex-domain one such that GFTC can be computed by using polynomial graph filtering method. …”
Get full text

TPMS Interference Suppression Based on Beamforming Technology by Cheol Park, Seong-min Kim, Suk-seung Hwang

“…Although the MVDR beamformer effectively suppresses the interference, it has high computational complexity because of the calculation of an autocorrelation matrix. …”
Get full text

SSCANL decoder based joint iterative detection and decoding algorithm by Chongyang LIU, Rui GUO

“…In order to improve the receiver performance of the sparse code multiple access (SCMA) system based on polar codes, the cyclic redundancy check (CRC) aided joint iterative detection and decoding receiver scheme based on simplify soft cancellation list (SSCANL) decoder (C-JIDD-SSCANL) was proposed.A polar code decoder in the C-JIDD-SSCANL receiver used the SSCANL algorithm.In this algorithm, decoding node deletion technology was used to simplify L times of soft cancellation (SCAN) decoding required by soft cancellation list (SCANL) algorithm by deleting frozen bit nodes, then the computational process of soft information update between nodes was simplified, and the computational complexity of decoding algorithm was reduced.The simulation results show that the SSCANL algorithm can obtain the same performance as the SCANL algorithm, and its computational complexity is reduced compared with the SCANL algorithm.Compared with the joint iterative detection and decoding scheme based on SCAN decoder (JIDD-SCAN) and the CRC aided joint iterative detection and decoding scheme based on SCAN decoder (C-JIDD-SCAN), the performance of C-JIDD-SSCANL receiver scheme based on SSCANL decoder is improved by about 0.65 dB and 0.59 dB respectively when the bit error rate is 10^-4.…”
Get full text

A Hybrid Genetic Algorithm with Tabu Search Using a Layered Process for High-Order QAM in MIMO Detection by Taehyoung Kim, Gyuyeol Kong

“…Especially, in the 1024-QAM MIMO system, the LHGA has less than 10% of computational complexity but a 6 dB signal-to-noise ratio (SNR) gain compared to the conventional GA-based MIMO detection scheme.…”
Get full text

A comparative analysis of LSTM models aided with attention and squeeze and excitation blocks for activity recognition by Murad Khan, Yousef Hossni

“…Additionally, imbalanced datasets and computational complexity hinder the performance of these systems in real-world applications. …”
Get full text

A Low Complexity Dual-Phase Alternating Scheme is Used With the PTS Method to Reduce PAPR for B5G Systems by Yung-Ping Tu, Chen-Wei Hsu

“…Simulation results show that the proposed scheme achieves better PAPR performance and computational complexity regardless of the waveform than previous well-known techniques, such as PTS, selective mapping (SLM), etc. …”
Get full text

Block Compressed Sensing of Images Using Adaptive Granular Reconstruction by Ran Li, Hongbing Liu, Yu Zeng, Yanling Li

“…Besides, our method has still a low computational complexity of reconstruction.…”
Get full text

Multisegment Mapping Network for Massive MIMO Detection by Yongzhi Yu, Jianming Wang, Limin Guo

“…Because of the large number of massive MIMO antennas, the computational complexity of detection has increased significantly, which poses a significant challenge to traditional detection algorithms. …”
Get full text

A Vortex Identification Method Based on Extreme Learning Machine by Jun Wang, Lei Guo, Yueqing Wang, Liang Deng, Fang Wang, Tong Li

“…Global vortex identification methods are of high computational complexity and time-consuming. Machine learning methods are related to the size and shape of the flow field, which are weak in versatility and scalability. …”
Get full text