Blind SNR estimation for OFDM signals in cognitive radio by Ming-qian LIU, Bing-bing LI, Ning-jie TANG, Zhao LI

“…The traditional blind SNR estimation algorithms had problems of poor performance and high computation complexity for OFDM systems in cognitive radio with low signal to noise ratio(SNR)and multi-path channel conditions,in view of which a novel blind SNR estimation method for orthogonal frequency division multiplexing(OFDM)signals was proposed.Firstly,the channel order was roughly estimated by utilizing the characteristics of autocorrelation function to determine the data interval which was free of inter-symbol interference(ISI).Secondly,the signal average power was estimated by computing the autocorrelation values of data in the determined interval.Finally,the noise average power was estimated by utilizing the characteristics that the data in cyclic prefix which was replication of part useful data.So the SNR of the received signals could be estimated.The simulation results show that the proposed method doesn’t need any prior information and has better performance and lower computation complexity,which is more suitable for OFDM systems in cognitive radio.…”
Get full text

Low-Complexity Transmit Antenna Selection and Beamforming for Large-Scale MIMO Communications by Kun Qian, Wen-Qin Wang, Huaizong Shao

“…It is shown that the required antenna selection processing time of the proposed method does not increase along with the increase of selected antennas, but the computation complexity of conventional exhaustive search method will significantly increase when large-scale antennas are employed in the system. …”
Get full text

Design of a multistage anti-jam GPS receiver by DI Min-min, ZHANG Er-yang

“…Finally the simulation results presented prove it is of advantage in decreasing computation complexity and improve anti-jam capability.…”
Get full text

Cryptanalysis of the Vesta-2M stream cipher by GUAN Jie

“…The author point out the mistake of attack introduced by the paper [1], and introduce a known plaintext attack method where only a small segment of known plaintext（about hundreds of bits） , the upper bound of the compute complexity is）2(372O.…”
Get full text

Construction of LDPC codes for higher burst-error detecting by YAO Chun-guang1, GE Xin2, LIU Ying-nan3, ZHANG Jian2

“…The coding of LDPC codes is focused on several aspects: high error-correction,low coding complexity and so on.All the construction methods do not give much consideration on hamming-distance and its distribution because of computation complexity.A suboptimal scheme which is with emphasis on hamming-distance and its distribution was presented.The codes introduced from this scheme can detect all burst-errors within the length of check matrix’s rank and has no loss in performance of random-error-correction.…”
Get full text

Eavesdropping against wireless spatial scrambling secure communication: hyperplane clustering by Lu LIU, Liang JIN, Kai-zhi HUANG, Zhou ZHONG

“…Simulation results show that the HC algorithm, compared with the existing MUSIC-like algorithms, holds the advantages of better anti-noise performance and lower computing complexity.…”
Get full text

New key management scheme of wireless sensor networks based on key relation table by HUANG Hai-ping1, WANG Ru-chuan1, SUN Li-juan1, CHEN Zhi1

“…Aimed at some security properties on key management for multicast such as forward confidentiality,backward confidentiality,resisting conspiracy-analysis,expansibility and robustness,and furthermore the obvious character of en-ergy-constraint,a new key management scheme based on threshold mechanism ＆ key relation table was proposed,which mapped keys’ value onto the three-dimensional curves and surfaces.Although computing complexity increases within a little scale,the performance optimization of memory complexity as well as communication complexity were proposed.…”
Get full text

Efficient inter mode selection algorithm for H.264 by LU Lu, ZHOU Wei

“…However, this comes at the greatly increased computing complexity at the encoder. A method was proposed to eliminate some redundant coding modes that contribute very little coding gain based on analysis of macroblock detail-level and texture directions. …”
Get full text

Lightweight authentication method for network interconnection control protocols by Bo LU, Yun LIU, Jie ZHANG, Yueming LU

“…As network interconnection controls are required for the space-earth integrated network and the limited resources are not suitable for high computing complexity degree authentication methods,a lightweight authentication method for network interconnection control protocols is proposed.Through the calculation of limited resources,using the idea of random fill,It design and implement public key encryption and signature algorithm which is components of the networks interconnection control authentication protocol.Formal analysis tool Scyther is used to analyze the security of the protocol.Comparing with other secure communication protocols,the method can meet the requirements of resource-constrained networks and ensure the safety.…”
Get full text

Research on end-to-end network link delay inference based on link reconstruction-destruction by Yong-sheng LIANG, Bo GAO, Yue ZOU, Ji-hong ZHANG, Nai-tong ZHANG

“…Based on two assumptions,inference model and end-to-end delay data acquisition,an approach to end-to-end network internal link delay inference based on link reconstruction-deconstruction (LRD) was proposed.Pseudo likelihood estimation (PLE) was adopted and the inference problem was divided into independent sub-problems.Inference units with definite solution are determined by LRD.By means of controlling average sampling precision and decreasing inference unit links,the computation complexity of link delay inference was significantly lowered.Experimental study was performed based on model computation and NS2 simulation platform.Theoretical analysis and experimental results show that the approach is accurate and effective.…”
Get full text

Low Complexity Cyclic Feature Recovery Based on Compressed Sampling by Zhuo Sun, Jia Hou, Siyuan Liu, Sese Wang, Xuantong Chen

“…In this paper, we propose a new cyclic feature recovery approach based on the reconstruction of autocorrelation sequence from sub-Nyquist samples, which can reduce the computation complexity and memory consumption significantly, while the recovery performance remains well in the same compressive ratio. …”
Get full text

Research on correlation noise modeling of a generalized Gamma distribution in distributed coding by Jie-ping LIU, Qin-ling WANG, Yue-sheng HE, Gang WEI

“…Due to the inaccuracy of modeling the correlated noise (CN) with Laplacian distribution,the rate-distortion performance of DVC is relatively low.CN modeling via generalized Gamma (GGA)distribution was proposed for pix-el-domain DVC.Statistical features of the CN modeling were analyzed.It was found that Laplacian distribution peak was lower than actual CN distribution.GGA distribution was exploited to fit CN and the GGA distribution parameters were estimated online.The simulation results indicate that the proposed model can more accurately reflect the statistics fea-tures of CN,improve rate distortion performance,and reduce computation complexity.…”
Get full text

Hierarchical Newton Iterative Parameter Estimation of a Class of Input Nonlinear Systems Based on the Key Term Separation Principle by Cheng Wang, Kaicheng Li, Shuai Su

“…In order to improve the computation complexity, the key term separation principle is introduced to avoid the redundant parameter estimation. …”
Get full text

Low-complexity and QoS-awared scheduling algorithm for LTE by Fei-long ZHAO

“…Based on the relaxation based linearization principle and the greedy algorithm,a scheduling algorithm named QPF was designed with low complexity and full QoS-awared.It is divided into two parts:time and frequency domain,which can allocate all resources at once according to two service types:GBR and Non-GBR service.By this way the computation complexity decreases from O(M^N)to O(M lb N).The proposed algorithm has a balanced performance in si-mulation,which can get 10% improvement in some dimensions compared with the references with high load and provide a nice trade-off between the performance and complexity.…”
Get full text

Joint Relay Assignment and Power Allocation in Multi-Pairs Multi-Relays Two-Way Decode-and-Forward Network by Sijia Lou, Longxiang Yang

“…A joint power allocation and relay assignment algorithm for multi-pairs multi-relays two-way cooperative networks to improve system performance and decrease computation complexity was proposed. The proposed algorithm select best relays for each pair, then the selected relays use network coding to assist users exchanging signals. …”
Get full text

Novel adaptive generalized principal component analysis algorithm based on Hebbian rule by Yingbin GAO, Xiangyu KONG, Qiaohua CUI, Haidi DONG

“…In order to adaptively estimate the generalized principal component from input signals,a novel generalized principal component analysis algorithm was proposed based on the Hebbian linear neuron model.Since the autocorrelation matrices of the signals were estimated directly from the sampled data at the current time,the proposed algorithm had low computation complexity.Trough analyzing all of the equilibrium points by Lyapunov method,it is proven that if and only if the weight vector in the neuron had the same direction with the generalized principal component,the proposed algorithm attains the convergence status.Simulation results shows that compared with some same type algorithms,the proposed algorithm has faster convergence speed.…”
Get full text

New TDOA algorithm based on Taylor series expansion in cellular networks by ZHANG Ling-wen, TAN Zhen-hui

“…TDOA is the most potential positioning technique in cellular mobile telecommunication systems.Taylor series expansion method has been widely used in solving nonlinear equations for its high accuracy and good robustness.However,the performance of Taylor’s method depends highly on the initial estimation.Therefore one new algorithm（HOA,hybrid optimizing algorithm） was proposed which combines the Taylor series expansion method with steepest decent method.Steepest decent method is with the properties of fast convergence at the initial iterativeness and small computation complexity.HOA takes great advantages of both methods.Simulation results show that HOA has achieved better performance on positioning accuracy and efficiency.…”
Get full text

Collaborative probability based multimodel target identification in wireless sensor networks by SUN Xin-yao, WANG Xue, WANG Sheng

“…A collaborative probability based multimodel target identification method for the applications in wireless sen-sor networks was proposed.Wavelet package was used to extract the features of the target information sample,and in or-der to decrease the computing complexity and reserve the key information as well,feature compaction,which achieved by principal components analysis,was carried out before learning.Different types of Gaussian classifier were developed for classifier learning.To gain global optimal results,committee decision was employed to select and combine individual decisions with dynamically adjusted weights.The experiment results verified that the method introduced can adapt to the interference factor of the environment and can implement target identification accurately and stably.…”
Get full text

Cooperative service caching and peer offloading in Internet of vehicles based on multi-agent meta-reinforcement learning by Zhaolong NING, Kaiyuan ZHANG, Xiaojie WANG, Lei GUO

“…In order to reduce computation complexity, a two-layer mutli-RSU (road side unit) service caching and peer offloading algorithm (MPO) was proposed to decouple the optimization problem.In the designed MPO, the outer layer utilized multi-agent meta-reinforcement learning, which established long short-term memory (LSTM) network as the meta-agent to balance decisions of local agents and accelerate learning progress.The inner layer utilized lagrange multiplier method to achieve optimal decision for RSU peer offloading.Experimental results based on real traffic data in Hangzhou demonstrate that the proposed method outperforms other methods and remains robust under large-scale workloads.…”
Get full text

Study on the multistage iterative rank-reduced method by GUO Yi1, ZHANG Er-yang1, SHEN Rong-jun2

“…On the background of joint space-time anti-jammer processing for GPS receiver,multistage Wiener filter-ing（MWF）algorithm and auxiliary vector filtering（AVF）algorithm was deeply analyzed as two typical multistage itera-tive rank-reduced method in this article and their immanent relationship was pointed out.A new algorithm was proposed which has a forward recursion on the data level and a backward iterative.Compared with MWF and AVF,the proposed algorithm has a better performance,reduces the computation complexity and selects the filter rank more easily.It suits with practical realization of joint space-time anti-jammer processing for GPS receiver.Numerical simulation demon-strates that the proposed method is effect and efficient.…”
Get full text