LOWER_BOUND

作品数：171被引量：329H指数：8
导出分析报告
相关作者：王强郭涛王洪浩王军虎王永生更多>>
相关机构：西北工业大学东南大学长沙铁道学院广西大学更多>>
相关期刊：更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划国家教育部博士点基金高等学校学科创新引智计划更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Chinese Journal of Electronicsx
共 条 记 录，以下是1-5
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Improving the Lower Bound on Linear Complexity of the Sequences Generated by Ndnlinear Filtering被引量：1
《Chinese Journal of Electronics》2012年第3期519-522,共4页ZHANG Yin LIN Dongdai LIU Meicheng 
Manuscript Received Mar. 2011; Accepted Nov. 2011. This work is supported by the National Basic Research Program of China （973 Program） （No.2011CB302400）, the National Natural Science Foundation of China （No.60970152, No.61173134）, the Grand Project of Institute of Software （No.YOCX285056） and the CAS Special Grant for Postgraduate Research, Innovation and Practice.
Linear complexity is an important prop- erty for secure keystream sequences. In this paper, we study binary sequences generated by nonlinear filters on u-sequences with the method of Discrete Fourier trans- form （DFT...
关键词：Linear feedback shift register （LFSR） u-sequence Linear complexity Discrete Fourier transformDFT） Equidistant filter Spectral immunity. 
Resampling from the Niching Genetic Algorithm Applicated in Extended Kalman Particle Filter被引量：2
《Chinese Journal of Electronics》2011年第3期553-559,共7页QIN Honglei LI Ziyu CONG Li 
Two serious problems existing in Particle filter （PF） are the degeneracy phenomenon and the sam- ple impoverishment caused by simple random resampling. In this paper, based on the Extended Kalman particle fil- ter ...
关键词：Extended Kalman particle filter （EKPF） RESAMPLING Niching genetic algorithm （NGA） CramerRao lower bound （CRLB）. 
An Exact Algorithm with Tight Lower Bounds for the Capacitated Minimum Spanning Tree Problem
《Chinese Journal of Electronics》2008年第4期640-645,共6页HAN Jun LI Zhaoguo GE Sheng LEI Ming 
This work is supported by the National Natural Science Foundation of China （No.60473010） and China 863 High-tech Programme （No.2006AA01Z19A and No.2007AA010301）.
A solution method using branch and bound technique for the CMST problem is introduced in this paper. Techniques for finding tighter lower bounds are emphasized. On the basis of a constraint relaxed MST bound, a penalt...
关键词：Lower bound Branch and bound Penalty cost. 
Lower Bound Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
《Chinese Journal of Electronics》2006年第1期85-90,共6页LIU Min ZHU Chongjun WU Cheng 
This work is supported by National Key Basic Research and Development Program （No.2002CB312200） and by the National Natural Science Foundation of China （No.60004010, No.60274045, No.60443009）.
The Capacitated vehicle routing problem （CVRP） with unsplit demands is a kind of special VRP which exists in many technical fields, such as vehicle scheduling in logistics optimization and intelligent transportation...
关键词：Capacitated vehicle routing problem withunsplit demands Vehicle routing problem （VRP） Lower bound OPTIMIZATION 
Impact of Feedback Channel on Measured MIMO Systems and Its Lower Bound
《Chinese Journal of Electronics》2005年第2期304-308,共5页ZHANGDuo WEIGuo ZHUJinkang 
A lower bound of the rate in feedback channel from a receiver to a transmitter is presented for measured Multiple-input-multiple-output (MIMO) systems based on the formulae of the open-loop and the closedloop MIMO cap...
关键词：MIMO 反馈系数 注水容量 下限 开环容量 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部