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

arXiv 2019年

作者： Song, Wei Shen, Yifei Li, Liping Niu, Kai Zhang, Chuan Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China National Mobile Communications Research Laboratory Southeast University Nanjing China Key Laboratory of Universal Wireless Communication Ministry of Education Beijing Univer- sity of Posts and Telecommunications Beijing100876 China

Similar to existing codes, puncturing and shortening are two general ways to obtain an arbitrary code length and code rate for polar codes. When some of the coded bits are punctured or shortened, it is equivalent to a situation in which the underlying channels of the polar codes are different. Therefore, the quality of bit channels with puncturing or shortening differ from the original qualities, which can greatly affect the construction of polar codes. In this paper, a general construction of polar codes is studied in two aspects: 1) the theoretical foundation of the construction;and 2) the hardware implementation of polar codes encoders. In contrast to the original identical and independent binary-input, memoryless, symmetric (BMS) channels, these underlying BMS channels can be different. For binary erasure channel (BEC) channels, recursive equations can be employed assuming independent BMS channels. For all other channel types, the proposed general construction of polar codes is based on the existing Tal-Vardy's procedure. The symmetric property and the degradation relationship are shown to be preserved under the general setting, rendering the possibility of a modification of Tal-Vardy's procedure. Simulation results clearly show improved error performance with re-ordering using the proposed new procedures. In terms of hardware, a novel pruned folded encoder architecture is proposed which saves the computation for the beginning frozen bits. Implementation results show the pruned encoder achieve 28% throughput improvement. Copyright © 2019, The Authors. All rights reserved.

关键词： signal encoding

来源：评论

学校读者我要写书评

暂无评论

Hybrid Control of Delay Induced Hopf Bifurcation of Dynamical Small-World Network

引用

Journal of Shanghai Jiaotong university(Science) 2017年第2期22卷 206-215页

作者：丁大为张肖芸王年梁栋 Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Electronics and Information Engineering Anhui University

In this paper, we focus on the Hopf bifurcation control of a small-world network model with time-delay. With emphasis on the relationship between the Hopf bifurcation and the time-delay, we investigate the effect of time-delay by choosing it as the bifurcation parameter. By using tools from control and bifurcation theory, it is proved that there exists a critical value of time-delay for the stability of the model. When the time-delay passes through the critical value, the model loses its stability and a Hopf bifurcation occurs. To enhance the stability of the model, we propose an improved hybrid control strategy in which state feedback and parameter perturbation are used. Through linear stability analysis, we show that by adjusting the control parameter properly, the onset of Hopf bifurcation of the controlled model can be delayed or eliminated without changing the equilibrium point of the model. Finally, numerical simulations are given to verify the theoretical analysis. © 2017, Shanghai Jiaotong University and Springer-Verlag Berlin Heidelberg.

关键词： Hopf bifurcation hybrid control small-world network bifurcation control

来源：评论

学校读者我要写书评

暂无评论

Fast Frequency Sweep Analysis of a Dielectric Rough Surface by Maehly Approximation

引用

IEEE Journal on Multiscale and Multiphysics Computational Techniques 2017年 2卷 224-227页

作者： Bao, Ran Wang, Anqi Huang, Zhixiang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China

An efficient method for simulating electromagnetic scattering from a dielectric rough surface over a frequency band is proposed. The method is based on the Chebyshev series and the Maehly approximation. The tapered plane wave is chosen as the incident wave to avoid the artificial edge diffraction caused by the finite length of the simulated rough surface. The Gaussian rough surface is considered. Good agreement between the Maehly approximation and the exact results obtained by the method of moments (MoM) is found. The numerical results show that the Maehly approximation is superior to the MoM in terms of the CPU time required. © 2017 IEEE.

关键词： Method of moments

来源：评论

学校读者我要写书评

暂无评论

Channel estimation with systematic polar codes

arXiv

引用

arXiv 2018年

作者： Li, Liping Xu, Zuzheng Hu, Yanjun Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education of China Anhui University China

Study of polar codes in fading channels is of great importance when applying polar codes in wireless communications. Channel estimation is a fundamental step for communication to be possible in fading channels. For both systematic and non-systematic polar codes, construction of them is based on an information set and the known frozen bits. Efficient implementation of systematic and non-systematic polar codes exists. When it comes to channel estimation or channel tracking, additional pilot symbols are inserted in the codeword traditionally. In this paper, to improve the performance of polar codes in the finite domain, pilot symbols are selected from the coded symbols themselves. In order to keep the existing efficient structure of polar code encoding, pilot selection is critical since not all selections can reuse the existing structure. In this paper, two pilot selections denoted as Uneven Pilot Selection (UEPS) and Even Pilot Selection (EPS) are proposed, which do not change the efficient polar encoding structure. The proposed UEPS and EPS is proven to satisfy the efficient construction condition. The performance of EPS is shown in this paper to outperform both the UEPS and the traditional pilot insertion scheme. Simulation results are provided which verify the performance of the proposed pilot selection schemes. Copyright © 2018, The Authors. All rights reserved.

关键词： Fading channels

来源：评论

学校读者我要写书评

暂无评论

A Method of Channel Capacity Optimization Based on Dynamically Adjusted Inertia Weight Acceleration Factor in Cognitive Sensing Network

A Method of Channel Capacity Optimization Based on Dynamical...

引用

International Conference on Software Engineering Research, Management and Applications (SERA)

作者： Yanjun Hu Dongdong Wei Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China

ISBN: (纸本)9781538658871

The optimization of channel capacity in cognitive sensor networks is a complicated optimization problem. The traditional gradient search method based on the analysis has more restrictions on the objective function, and high complexity, and can not determine the convergence. Aiming at the inherent problems of the traditional gradient search algorithm, the particle swarm optimization(PSO) with simple and easy to implement, distributed computing and fast convergence speed can be used to solve the problem of channel capacity optimization. It is difficult to balance the global search with the local search by adopting a standard particle swarm algorithm with fixed algorithm parameters, which can not solve the premature convergence problem that may occur. The specific meaning of each parameter of the algorithm is analyzed in this paper, and an improved particle swarm optimization algorithm based on dynamic adjustment of inertia weight acceleration factor(DWAPSO) is proposed, and the improved particle swarm optimization algorithm is applied to the optimization of channel capacity in cognitive sensor networks. The simulation results show that the improved channel capacity optimization algorithm(DWAPSO-CA) can speed up the convergence rate, increase the system capacity and get a lower bit error rate.

关键词： Channel capacity particle swarm algorithm Bit error rate system capacity Particle swarm optimization Inertial forces speedup factor Search methods SEARCHING ALGORITHM Converge Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Social Routing Based on Location Preference Prediction in DTN 11

Social Routing Based on Location Preference Prediction in DT...

引用

2017 11th IEEE International Conference on Anti-counterfeiting,Security,and Identification(ASID)

作者： GuiZhu Wang LuJie Yan Lei Zheng Jian Tao Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University

ISBN: (纸本)9781538605349;9781538605332

In modern society, with the pad, smart phones and other wireless devices have a large number of wireless communication interface, people carry these devices that act as network nodes, the random movement of such a network has many characteristics of social networks. The social DTN also has many human social characteristics, such as high predictability and high similarity, so in this paper, we focus on effective routing among different regions. As for the real world, we can adjust the Spray strategy according to the regional prediction and the similarity of the encounter nodes to reduce the noneffective duplicate and decrease the consumption of networks *** results show that compared with spray and wait routing, this algorithm could not only improve the delivery rate but also significantly reduce the average latency of network.

关键词： DTN spray and wait routing social network location preference prediction

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Routing Algorithm Based on Transmission Capability of Nodes in DTN 11

Probabilistic Routing Algorithm Based on Transmission Capabi...

引用

2017 11th IEEE International Conference on Anti-counterfeiting,Security,and Identification(ASID)

作者： Guizhu Wang Lei Zheng Lujie Yan Hui Zhang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University

ISBN: (纸本)9781538605349;9781538605332

Delay Tolerant Network(DTN) is a network of intermittent connectivity, and for most of the time there is no end-to-end full path between nodes. This is a huge challenge for the efficient transmission of packets from the source to the destination node. In order to solve this problem, we combine the actually situation of the network, consider the difference of nodes,and propose the concept of node transmission *** a reasonable assessment of node transmission capacity and combined with the traditional probabilistic routing, this paper proposes a probabilistic routing algorithm based on the node transmission capability(PROPHET-TC), which makes the selection of the next hop node more reasonable and efficient, and compensate the deficiency of the traditional probabilistic routing in selecting the next hop node. Simulation results show that compared with Epidemic routing and probabilistic routing, the proposed algorithm can improve the delivery rate and reduce the overhead of the network.

关键词： Delay Tolerant Networks Node difference Probabilistic routing Transmission capacity

来源：评论

学校读者我要写书评

暂无评论

Deep Adaptive Fusion Network for High Performance RGBT Tracking

Deep Adaptive Fusion Network for High Performance RGBT Track...

引用

International Conference on Computer Vision Workshops (ICCV Workshops)

作者： Yuan Gao Chenglong Li Yabin Zhu Jin Tang Tao He Futian Wang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei China Institute of Physical Science and Information Technology Anhui University Hefei China Key Laboratory of Industrial Image Processing and Analysis of Anhui Province Hefei China Anhui COWAROBOT CO. Ltd Wuhu China

ISBN: (数字)9781728150239

ISBN: (纸本)9781728150246

Due to the complementarity of RGB and thermal data, RGBT tracking has received more and more attention in recent years because it can effectively solve the degradation of tracking performance in dark environments and bad weather conditions. How to effectively fuse the information from RGB and thermal modality is the key to give full play to their complementarities for effective RGBT tracking. In this paper, we propose a high performance RGBT tracking framework based on a novel deep adaptive fusion network, named DAFNet. Our DAFNet consists of a recursive fusion chain that could adaptively integrate all layer features in an end-to-end manner. Due to simple yet effective operations in DAFNet, our tracker is able to reach the near-real-time speed. Comparing with the state-of-the-art trackers on two public datasets, our DAFNet tracker achieves the outstanding performance and yields a new state-of-the-art in RGBT tracking.

关键词： Feature extraction Target tracking Robustness Fuses Convolution Adaptive systems

来源：评论

学校读者我要写书评

暂无评论

Mapping Heavy Metals in Cultivated Soils Based on Land Use Types and Cokriging 5th

Mapping Heavy Metals in Cultivated Soils Based on Land Use T...

引用

5th International Conference on Geo-Spatial Knowledge and Intelligence, GSKI 2017

作者： Zhao, Jinling Liu, Chuang Song, Qixiang Jiang, Yan Hong, Qi Huang, Linsheng Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230039 China Anhui Engineering Laboratory of Agro-Ecological Big Data Anhui University Hefei230601 China Information Engineering Institute Suzhou University Suzhou234000 China

ISBN: (纸本)9789811308925

It is extremely important to explore the heavy metal content and spatial distribution in different cultivated soils. In our study, cokriging (COK) method was used to investigate the relationship between heavy metals and land use types. A total of six heavy metals including Zn, Fe, Cu, Mn, B, S were selected to forecast the heavy metals in cultivated soils. Five types of cultivated land were considered in the study area, including vegetable land, irrigated land, irrigated paddy field, dry land, orchard. Test of normality was firstly carried out to assure that higher prediction accuracy can be obtained, and then correlation analysis and analysis of variance (ANOVA) were performed to find out the most sensitive heavy metals for spatial interpolation. The analysis results showed that Zn, Cu and Fe were the primary heavy metals in soil of the study area. It was obvious that the effect of Mn and Fe were much greater caused by land use types, while they were smaller for B and S. Three errors of mean standard (MS), root mean square error (RMSE), and root mean square standardized error (RMSSE) were derived to assess the prediction accuracy. In comparison with ordinary kriging (OK), the MS of COK approached to 1, the RMSE was much smaller and the RMSSE also approached to 1, which showed that COK can make better predictions than OK. © 2018, Springer Nature Singapore Pte Ltd.

关键词： Heavy metals

来源：评论

学校读者我要写书评

暂无评论

Secure Edge Caching Placement and Delivery for Ultra-Reliable and Low-Latency Vehicular Networks

Secure Edge Caching Placement and Delivery for Ultra-Reliabl...

引用

IEEE Globecom Workshops

作者： Haojun Yang Kuan Zhang Kan Zheng Yi Qian Intelligent Computing and Communications (IC) Lab Wireless Signal Processing and Networks (WSPN) Lab Key Laboratory of Universal Wireless Communications Ministry of Education Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering University of Nebraska-Lincoln Omaha NE USA

ISBN: (数字)9781728109602

ISBN: (纸本)9781728109619

To meet the urgent requirements of ultra-reliable and low-latency communications (URLLCs) in vehicular networks, vehicular edge caching (VEC) becomes a promising solution to reduce backhaul costs and mitigate network congestion. However, the data requested by vehicular users may be maliciously tampered by attackers during the caching delivery phase. In this paper, we investigate the problem of secure caching placement and delivery for a VEC URLLC system. Specifically, we first analyze the lower bound of spectral efficiency for URLLCs and security metric, i.e., vulnerability. Then, an optimization problem of minimizing the maximum vulnerability among all vehicular users is formulated based on the analysis. Subsequently, we propose a secure caching placement and delivery algorithm to obtain the solutions of our formulated problem by reasonable complexity. Simulation results show that the proposed algorithm can significantly improve the performance of security for the VEC URLLC system.

关键词： Security Optimization Roads Reliability Fading channels signal to noise ratio Antennas

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：