Fast algorithm to search for the minimum number of active S-boxes of block cipher by Zhengbin LIU, Yongqiang LI, Chaoxi ZHU

“…To solve the problem of fast calculation of the minimum number of active S-boxes in cryptographic design, the difference and mask propagation of the diffusion layer were investigated, and a method was proposed to compute the difference (resp.mask) pattern distribution table of MDS (maximum distance separable) matrices and binary matrices.A lower bound on the computation complexity of the proposed method was also given.Based on the difference (resp.mask) pattern distribution table of diffusion matrix, a fast algorithm to search for the minimum number of active S-boxes of block cipher was proposed.The proposed algorithm is applied to some SPN (substitution permutation network) block ciphers, and finds the minimum number of active S-boxes for the full round of LED, SKINNY, CRAFT and FIDES.…”
Get full text

Energy-efficient object tracking algorithm in wireless sensor networks by REN Qian-qian1, LI Jian-zhong1, LI Jin-bao2, ZHU Jing-hua1

“…An energy efficient tracking algorithm（EETA） was proposed,which reduced energy consumption in sensor network by introducing an event-driven sleep scheduling mechanism.EETA gave tradeoffs between real time and energy efficiency by letting a maximum number of sensor nodes outside tracing area stay asleep,and reduced the computation complexity to O（N） by formulating the location predication of an object as a state estimation problem of sensor node,in-stead of building a complex model of its trajectory.Meanwhile,EETA located the object by using adaptive weighted cen-troid algorithm with complexity of O（N）.The method was evaluated with a network of 64 sensor nodes,as well as an analytical probabilistic model.The results demonstrate the effectiveness of the method.…”
Get full text

Blind interference suppression for MC-CDMA system with transmit diversity by HU Bing, LI Ping-an, YU Bian-zhang

“…The algorithm has low computation complexity. It can provide efficient interference suppression with low input signal-to-interference-and-noise ratio （SINR）, and shows robust performance with high input SINR.…”
Get full text

Multi-source localization with binary sensor networks by CHENG Long1, WU Cheng-dong1, ZHANG Yun-zhou1, JIA Zi-xi1, JI Peng1

“…A new multi-source detection model was proposed based on Neyman-Pearson criterion to reduce the computa-tional complexity caused in the multi-source localization.The Fisher criterion was employed to divide sensors into two parts,where two sources were present and each part corresponds to one of the sources.The WSNAP（weighted subtract on negative add on positive） multi-source location algorithm was applied to localize the multiple sources.The simulation results show that Fisher criterion is able to divide the alarmed sensor into two parts with relatively higher accuracy.The proposed WSNAP has better estimation accuracy than AP（add positive） algorithm and CE（centroid estimator） algorithm under the circumstance of lower computation complexity.Finally,the results are verified using the database of distributed wireless sensor networks.…”
Get full text

Study on a multi-satellite constrained space-time anti-jam algorithm by Guo-sheng HUANG, Zheng-rong YI, Tao SHUAI, Zhen-cai ZHU

“…A multi-satellite constrained space-time anti-jam algorithm was proposed for global navigation satellite system(GNSS)receivers.Firstly the equivalent GSC structure of multi-satellite constrained LCMV principle was considered and its forward decomposition process was simplified and improved,so the computation complexity was reduced to approach single-satellite constrained problem.Then the Householder multi-stage Wiener filtering(MWF)algorithm was proposed to solve the classical Wiener filtering problem in the GSC structure,and an efficient order-recursive implementation structure was obtained by improving the backward recursive process using the decomposition property of MWF,so the real-time performance was greatly promoted and the reduced rank could be adaptively estimated from the output of MSE.The complete procedure of the proposed algorithm is summed up and its validation is verified by simulations.…”
Get full text

Low-complexity signal detection algorithm based on preconditioned conjugate gradient method by Hua QU, Jing LIANG, Jihong ZHAO, Weihua WANG

“…The simulation results show that the proposed algorithm can achieve the near-optimal bit error rate performance of minimum mean square error detection algorithm with a small number of iterations，and computation complexity reduces a order of magnitude. Compared with the conjugate gradient method，the proposed algorithm can quickly converge to the optimum value.…”
Get full text

Implementation Aspects in Simulation Extrapolation-Based Stocking–Lord Linking by Alexander Robitzsch

“…However, the original SIMEX approach can be computationally complex. This article evaluates two computational shortcuts to SIMEX-based SL linking through a simulation study: a quasi-Monte Carlo method that replicates items and a proposal using an approximate noniterative estimation instead of the iterative one in the SIMEX application of SL linking. …”
Get full text

Communication-radar coexistence design based on block diagonalization by Kaifeng HAN, Litao HUANG, Li CHEN, Zhiqin WANG

“…Aiming at the problem of coexistence of communication and radar at the same frequency， a block diagonalization design scheme was proposed.Firstly， an optimization problem was established to maximum the communication system’s sum rate subject to no interference at the radar side and the power budget.To solve this problem， the constraint that the interference between communication users is zero was introduced， so that the non-convex original problem could have a closed-form solution.Then， based on the restriction on the number of base station’s transmit antennas caused by introducing the constraint， two other algorithms were proposed to further consider the block diagonalization design when the constraint was not met.The simulation results show that the proposed algorithms can introduce the constraint to solve the original problem in various scenarios with relative-low computation complexity， which can be implemented in practice.…”
Get full text

Service function chain deployment algorithm based on optimal weighted graph matching by Dan LI, Julong LAN, Peng WANG, Yuxiang HU

“…Service function chain can support flexible network service requirement by linking virtual network functions.Aiming at the problem of service function chain deployment in a resource-constrained network,an algorithm for service function chain deployment based on optimal weighted graph matching was proposed.The service function chains was composed into graphs of functional topography,and the optimal matching results between graphs of functional topology and physical topology was obtained using eigendecomposition approach,and furtherly the matching results by hill-climbing method was optimized.Simulation results show that,the proposed algorithm can reduce the required bandwidth to deploy service function chains,balance the load of nodes and bandwidth of links,and support more service requests.What is more,the algorithm has a lower computation complexity and higher time efficience.…”
Get full text

A Computational Approach to the Perimeter-Area Inequality in a Triangle by Tomás Recio, Carlos Ueno, María Pilar Vélez

“…Focusing on the computational complex and real algebraic geometry methods behind these tools, this study analyzes a geometric construction involving a triangle with arbitrary side lengths and area, investigating the automated derivation of the relationship between the area and perimeter of a triangle, and showing that only equilateral triangles satisfy the exact perimeter-area equality. …”
Get full text

Joint reduction of peak-to-average power ratio and out-of-band power based on subcarrier weighting in OFDM systems by Qing LI, Han-ying HU

“…Considering the conflict of PAPR and OBP reductions in OFDM systems,a new method based on subcarrier weighting was proposed for the joint reduction.The symbols on subcarriers were multiplied by optimal weighting vector to reduce PAPR and OBP jointly,and an improved GA was used to calculate the optimal weighting vector for lower complexity.It was more effective in spectrum utility and did not need any transmission of side information.Furthermore,with trade-off parameter,it offered more flexibility to control the reduction by changing the relative weighting of the two optimization criteria.The simulation results indicate that,compared with a system that performs two separate optimization steps,the proposed method can significantly enhance the amount of PAPR and OBP reduction with lower computation complexity.It is simple to implement,which makes it very practical.…”
Get full text

Pd/S cooperativity: from stoichiometric activation of Si−H bonds to catalytic hydrosilylation by Arnaud Clerc, Marceline Humbert, Sonia Mallet‐Ladeira, Dr. Karinne Miqueu, Dr. Julien Monot, Prof. Blanca Martín‐Vaca, Dr. Didier Bourissou

“…The resulting mononuclear Pd(II) hydride [(PNSSiR3)Pd(II)H]+ VI was characterized by multi‐nuclear NMR spectroscopy and the Si−H bond coordination/activation was studied computationally. Complex IV2 was found to efficiently catalyze the hydrosilylation of alkynes, internal as well as terminal, with good stereo and regioselectivity.…”
Get full text

A Multiuser Subcarrier and Power Allocation Scheme to Improve the Performance of Cell Edge Users by Jianwu Zhang, Fang Li, Fangmin Xu

“…Besides，the proposed scheme reduces the computation complexity.…”
Get full text

Low complexity decoder over time-selective fading channels by ZHANG Bi-jun, ZHU Guang-xi, SUN Jun, LIU Wen-ming

“…The intra symbol interferences within the all groups were firstly sup-pressed in virtue of the construction of orthogonal matrices and then obtained the all groups’ transmitted symbols based on the group detection technique using the simplified matrix inverse algorithm. The computational complexities of the proposed decoder were decreased greatly compared with the existed conversational decoding scheme. …”
Get full text

A Benders Decomposition Algorithm for the Passenger Train Service Planning by Song Pu

“…In addition, we analyze the computational complexities of the model and develop a Benders decomposition algorithm with valid inequalities to solve this problem. …”
Get full text

A Fast and Robust Key Frame Extraction Method for Video Copyright Protection by Yunyu Shi, Haisheng Yang, Ming Gong, Xiang Liu, Yongxiang Xia

“…Compared with the previous methods, the proposed method has advantage in computation complexity and robustness on several video formats, video resolution, and so on.…”
Get full text

A tags’ arrival rate estimation method using weighted grey model(1,1) and sliding window in mobile radio frequency identification systems by Liqian Zhang, Xueliang Fu, Honghui Li

“…The experimental results show that the proposed method has lower estimation error rate, lower computation complexity, and high system stability.…”
Get full text

Iterative Linear Quadratic Optimization for Nonlinear Control: Differentiable Programming Algorithmic Templates by Roulet, Vincent, Srinivasa, Siddhartha, Fazel, Maryam, Harchaoui, Zaid

“…Furthermore, we present line-search strategies and regularized variants of these algorithms, along with a comprehensive analysis of their computational complexities. We study the performance of the aforementioned algorithms on various nonlinear control benchmarks, including autonomous car racing simulations using a simplified car model. …”
Get full text

A novel lightweight Machine Learning framework for IoT malware classification based on matrix block mean Downsampling by Mahmoud E. Farfoura, Ibrahim Mashal, Ahmad Alkhatib, Radwan M. Batyha, Didi Rosiyadi

“…Despite that machine learning is incredibly successful at detecting malware, it cannot be deployed in IoT environment due to its computation complexity and high processing resources it demands. …”
Get full text

A novel framework for face recognition using robust local representation–based classification by Aihua Yu, Gang Li, Beiping Hou, Hongan Wang, Gaoya Zhou

“…A dimension reduction is then adopted in order to reduce the computation complexity via an optimized projection matrix. …”
Get full text