检索结果-内蒙古大学图书馆

LLR processing of Polar Codes in Concatenation Systems

China Communications 2019年第9期16卷 201-208页

作者： Ya Meng Yi Fang Chuan Zhang Liping Li Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education of China Anhui UniversityHefei 230031China School of Information Engineering Guangdong University of TechnologyGuangzhou 510006China National Mobile Communications Research Laboratory Southeast UniversityNanjingChina

This paper studies the decoding performance of low-density parity-check(LDPC)codes in a serial concatenation system with polar codes employing the successive cancellation(SC)*** is known that the absolute incorrect log-likelihood ratio(LLR)values from the SC decoding can be very *** phenomenon dramatically deteriorates the error correcting performance of the outer LDPC *** this paper,the LLR values of polar codes are regulated by a log processing before being sent to the LDPC *** results show that the log processing is an efficient approach with a low optimization complexity compared with the existing procedures to improve the performance of the serial concatenation systems.

关键词： polar codes SC decoding LDPCcodes concatenation

来源：评论

学校读者我要写书评

暂无评论

Simulating Maxwell-Schrodinger Equations by High-Order Symplectic FDTD Algorithm

引用

IEEE JOURNAL ON MULTISCALE AND MULTIPHYSICS COMPUTATIONAL TECHNIQUES 2019年 4卷 143-151页

作者： Xie, Guoda Huang, Zhixiang Fang, Ming Sha, Wei E., I Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China Key Laboratory of Micro-Nano Electronic Devices and Smart Systems of Zhejiang Province College of Information Science and Electronic Engineering Zhejiang University Hangzhou China

A novel symplectic algorithm is proposed to solve the Maxwell Schrodinger (M-S) system for investigating light-matter interaction. Using the fourth-order symplectic integration and fourth-order collocated differences, M-S equations are discretized in temporal and spatial domains, respectively. The symplectic finite-difference time-domain (SFDTD) algorithm is developed for accurate and efficient study of coherent interaction between electromagnetic fields and artificial atoms. Particularly, the Dirichlet boundary condition is adopted for modeling the Rabi oscillation problems under the semiclassical framework. To implement the Dirichlet boundary condition, image theory is introduced, tailored to the high-order collocated differences. For validating the proposed SFDTD algorithm, three-dimensional numerical studies of the population inversion in the Rabi oscillation are presented. Numerical results show that the proposed high-order SFDTD(4, 4) algorithm exhibits better numerical performance than the conventional FDTD(2, 2) approach at the aspects of accuracy and efficiency for the long-term simulation. The proposed algorithm opens up a promising way toward a high-accurate energy-conservation modeling and simulation of complex dynamics in nanoscale light-matter interaction.

关键词： Maxwell Schrodinger (M-S) equations nanoscale light-matter interaction Rabi oscillation symplectic finite-difference time-domain (SFDTD)

来源：评论

学校读者我要写书评

暂无评论

A Diversity Based Competitive Multi-objective PSO for Feature Selection 1

引用

15th International Conference on intelligent computing, ICIC 2019

作者： Qiu, Jianfeng Cheng, Fan Zhang, Lei Xu, Yi School of Computer Science and Technology Anhui University Hefei230039 China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei230039 China

ISBN: (数字)9783030269692

ISBN: (纸本)9783030269685

Multi-Objective Particle Swarm Optimization (MOPSO) for feature selection has attracted increasing attention of researchers recently. However, in the existing methods, quick convergence usually degrades the diversity of the population, especially when many irrelevant and redundant features involved in them. To this end, a diversity based competitive multi-objective particle swarm optimization for feature selection problem (named D-CMOPSO) is proposed. In D-CMOPSO, a diversified competition based learning mechanism is proposed to improve the quality of found feature subset, which consists of three parts: exemplar particle construction, pairwise competition, and diversified learning strategy. The proposed competition mechanism utilizes the above three parts to boost the diversity in the following generations. Moreover, in order to guide the initial population to evolve the promising area, a maximal information coefficient based initialization strategy is also suggested. The experimental results demonstrate that the proposed D-CMOPSO is competitive for feature selection problem. © 2019, Springer Nature Switzerland AG.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Hidden Attractors in a Delayed Memristive Differential System with Fractional Order and Chaos Synchronization

引用

Journal of Harbin Institute of Technology(New Series) 2020年第1期27卷 67-75页

作者： Dawei Ding Yecui Weng Nian Wang School of Electronics and Information Engineering Anhui UniversityHefei 230601China Key Laboratory of Intelligent Computing and Signal Processing Ministry of EducationAnhui UniversityHefei 230601China

As an important research branch,memristor has attracted a range of scholars to study the property of memristive chaotic ***,time⁃delayed systems are considered a significant and newly⁃developing field in modern *** combining memristor and time⁃delay,a delayed memristive differential system with fractional order is proposed in this paper,which can generate hidden ***,we discussed the dynamics of the proposed system where the parameter was set as the bifurcation parameter,and showed that with the increase of the parameter,the system generated rich chaotic phenomena such as bifurcation,chaos,and *** we derived adequate and appropriate stability criteria to guarantee the system to achieve ***,examples were provided to analyze and confirm the influence of parameter a,fractional order q,and time delayτon chaos *** simulation results confirm that the chaotic synchronization is affected by a,q andτ.

关键词： fractional order memristive time⁃delay hidden attractors chaos synchronization

来源：评论

学校读者我要写书评

暂无评论

A novel distributed machine learning method for classification: Parallel covering algorithm

A novel distributed machine learning method for classificati...

引用

7th International Conference on Rough Sets and Knowledge Technology, RSKT 2012

作者： Zhang, Yanping Wang, Yuehua Zhao, Shu Anhui University Computer Science and Technology Institute Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei Anhui Province 230039 China

ISBN: (纸本)9783642318993

In this paper, we propose a novel distributed machine learning method: Parallel Covering Algorithm, which is inspired by the module feature of CA (Covering Algorithm). Classic method of CA is presented, and we analyze its independent part. Then we develop the Parallel CA by utilizing its modularity as well as data-set decomposition. Detailed implementation of the parallel computing process is described. In the experiment, three data sets are used to evaluate the Parallel CA, and the comparison with classic CA is also shown in the paper. Speedup and efficiency are two criterions to evaluate the performance of the algorithm. Both the analysis and the comparison indicate that the Parallel CA is more effective than CA. We also empirically compare the results obtained by Parallel SVM on a large data set, and it shows that our proposed algorithm is effective. © 2012 Springer-Verlag.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

A secure distributed key management scheme for ad hoc network

A secure distributed key management scheme for ad hoc networ...

引用

2010 IEEE International Conference on Information Theory and Information Security, ICITIS 2010

作者： Xu, Yan Zhong, Hong Yuan, Xianping Yu, Jia Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China College of Information Engineering Qingdao University Qingdao China

ISBN: (纸本)9781424469406

An identity-based threshold key management scheme without secure channel is proposed for ad hoc network. The master private key, which is shared among all nodes by the Shamir's secret sharing scheme, is produced by all nodes when network is formed. The nodes'public keys are derived from their identities. In order to get the private key, each node needs to prove their identity to distributed CAs using a zero-knowledge proof protocol to get the share of private key. Compared with former schemes, our scheme doesn't need any local registration authority(LRA), which is easy to be compromised by adversary. When a node leaves the network, shares of the master private key would be renewed. In the end, we prove our scheme is correct and secure. © 2010 IEEE.

关键词： Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

The quotient structure in granule computing

The quotient structure in granule computing

引用

2005 IEEE International Conference on Granular computing

作者： Zhao, Shu Zhang, Yan-Ping Zhang, Ling Chen, Jie Wan, Zhong Zhang, Ying-Chun Zhang, Chen-Xi Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 Institute of Artificial Intelligence Anhui University Hefei 230039

ISBN: (纸本)0780390172

The theory of granule computing based on the quotient space is one of the three main granule computing theories. The emphasis is on the structure of the quotient space theory in this paper. Comparing with Rough Set theory, the authors point out the importance of the structure in granule computing theory. A new method of constructing quotient space according to the structure is also presented in this paper. The differences between the quotient structure and structure-based method are proved. Finally, some examples show the rationality and feasibility of our methods. © 2005 IEEE.

关键词： Data processing

来源：评论

学校读者我要写书评

暂无评论

Optimal Tracking Control for Ship Course Using Approximate Dynamic Programming Method

Optimal Tracking Control for Ship Course Using Approximate D...

引用

第三十二届中国控制会议

作者： XIE Qingqing LUO Bin TAN Fuxiao School of Computer Science and Technology Anhui University Key Laboratory of Intelligent Computing ＆ Signal Processing Ministry of EducationAnhui University School of Computer and Information Fuyang Teachers college

ISBN: (纸本)9781479900305

Dynamic programming(DP) is not a useful tool for solving many control problems because of its complexity in computation. In this paper,we propose Approximate Dynamic Programming(ADP) optimal control strategy for ship course trajectory tracking control *** system transformation,we convert the optimal tracking problem into designing a infinite-horizon optimal regulator for the tracking error ***-dependent Heuristic Dynamic programming(ADHDP) technique,as one form of ADR is presented to obtain the infinite-horizon optimal tracking *** the ship course optimal tracking control simulation results,we can see that the ADHDP controller makes the performance index and the control sequence for the error dynamics converge to the optimal *** BP neural networks are used as parametric structures to implement ADHDP *** two neural networks aim at approximating the cost function and the control law,respectively.

关键词： Optimal Tracking Control Approximate Dynamic Programming ADHDP Ship Course

来源：评论

学校读者我要写书评

暂无评论

Global synchronization of delayed chaotic neural networks based on LMI approach

Global synchronization of delayed chaotic neural networks ba...

引用

2007 IEEE International Conference on Control and Automation, ICCA

作者： Qiao, Zong-Min Cheng, Jia-Xing Song, Jie Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China Department of Mathematics Hefei Normal University Hefei China

ISBN: (纸本)1424408180

In this paper, global synchronization approach is discussed for chaotic neural networks with time-varying delay. Under the feedback control of nonlinear state coupling, an effective control law in matrix inequality form has been derived for time-varying delayed chaotic neural networks based on Lyapunov method and LMI technique. The advantage of the proposed approach can be performed efficiently via numerical algorithms such as the interior-point algorithms for solving LMIs. Numerical simulations are carried out to demonstrate the effectiveness of the established synchronization law. © 2007 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Kernel Adaptive Filtering with Weibull M-transform Maximum Versoria Criterion 7

Kernel Adaptive Filtering with Weibull M-transform Maximum V...

引用

7th IEEE International Conference on Electronic Information and Communication Technology, ICEICT 2024

作者： Bi, Chenchong Li, Yingsong Li, Liping Zlatanov, Nikola Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education China Innopolis University Faculty of Computer and Engineering Sciences Innopolis Russia

ISBN: (纸本)9798350384437

A kernel Weibull M-transform maximum-versoria-criterion (KWMMVC) algorithm is constructed, which is to use for nonlinear system identification. The KWMMVC algorithm ingeniously integrates the Weibull M-transform scheme into the maximum-versoria-criterion to formulate a novel cost function. The ability of KWMMVC algorithm to identify nonlinear channels under various impulse noise environments is tested in the kernel adaptive filters, and the results proved its superior performance. © 2024 IEEE.

关键词： Adaptive filtering

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：