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

fast algorithm for moving target localisation using FDA-MIMO radar

JOURNAL OF ENGINEERING-JOE 2019年第19期2019卷 5749-5752页

作者： Xu, Jian Wang, Wen-Qin Cui, Can Huang, Bang Univ Elect Sci & Technol China Sch Informat & Commun Engn Chengdu Sichuan Peoples R China Nanjing Univ Sci & Technol Sch Elect Engn & Optoelect Technol Nanjing Jiangsu Peoples R China

Target localisation using frequency diverse array (FDA) has drawn much attention owing to the additional degree of freedom in the range dimension. However, the Doppler effect was often ignored in previous FDA works because of the stationary target assumption, and in contrast, even stationary target localisation could be of quite a high computational complexity. In this study, a method is proposed that can jointly estimate range, angle, and Doppler for FDA multiple-input-multiple-output radar with low computational complexity. First, Doppler is estimated independently by utilising unstructured maximum likelihood method. Next, traditional two-dimensional (2D) MUSIC is divided into multiple one-dimensional (1D) MUSIC to estimate the angle. Then substituting the estimated angle into the former 2D MUSIC results in a 1D searching over range dimension to get the range estimation. The advantage of the proposed method was verified by simulation results.

关键词： computational complexity direction-of-arrival estimation MIMO radar Doppler effect radar signal processing MIMO communication maximum likelihood estimation fast algorithm FDA-MIMO radar frequency diverse array range dimension Doppler effect previous FDA works stationary target assumption stationary target localisation high computational complexity FDA multiple-input-multiple-output radar low computational complexity maximum likelihood method two-dimensional MUSIC one-dimensional MUSIC estimated angle 2D MUSIC results range estimation

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for the measurement of stimulus frequency otoacoustic emission suppression tuning curves

引用

APPLIED ACOUSTICS 2018年第Jan.期129卷 173-180页

作者： Xing, Dongjia Gong, Qin Tsinghua Univ Sch Med Dept Biomed Engn Beijing 100084 Peoples R China Tsinghua Univ Res Ctr Biomed Engn Grad Sch Shenzhen Shenzhen 518055 Guangdong Peoples R China

Frequency selectivity is an important indicator of auditory function in the human ear. Stimulus frequency otoacoustic emission (SFOAE) suppression tuning curves (STCs) have great potential in the objective analysis of human auditory frequency selectivity but are costly to measure by the traditional algorithm using pure-tone adaptive method. To improve the measurement efficiency of the SFOAE STCs, a faster algorithm based on a suppressor with gradiently changing intensity and interpolation is proposed in this paper. Twelve subjects participated in this study by measuring their SFOAE STCs through the traditional and fast algorithm. The results shows that the average correlation coefficients of the SFOAE STCs measured using the fast and the traditional algorithms at different probe frequencies is 0.94. And the measurement speed of the fast algorithm was approximately 2.10 times higher than the traditional one. Also, the fast algorithm is more efficient than the algorithms of Keefe et al. (2008) and Charaziak et al. (2013). Experimental evidence is provided that the proposed fast algorithm greatly improves the measurement speed and reduces the processing time, exhibiting good accuracy and reliability. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Stimulus frequency otoacoustic emission Suppression tuning curves fast algorithm

来源：评论

学校读者我要写书评

暂无评论

Bottom-up Check and Temporal Rate Proportion based fast InterIMV algorithm in Versatile Video Coding

Bottom-up Check and Temporal Rate Proportion based Fast Inte...

引用

International Conference on Image, Video Processing and Artificial Intelligence

作者： Li, Yihang Zhao, Ziyan Liu, Qin Du, Songlin Ikenaga, Takeshi Waseda Univ Grad Sch Informat Prod & Syst Kitakyushu Fukuoka 8080135 Japan Nanjing Univ Software Inst 22 Hankou Rd Nanjing 210093 Jiangsu Peoples R China Southeast Univ Sch Automat Nanjing 210096 Peoples R China Minist Educ Key Lab Measurement & Control Complex Syst Engn Nanjing 210096 Peoples R China

ISBN: (数字)9781510639980

ISBN: (纸本)9781510639980

The latest video compression standard Versatile Video Coding (VVC/H.266) adopts many advanced encoding tools which achieve larger BD-rate reduction but bring much time consumption. Among all new tools, an inter- prediction mode called InterIMV mode is most time consuming for occupying 12.7% of entire encoding time, with 96.8% of its check redundant in depth level and coding unit (CU) level. Current depth level mode skip methods do early termination based on original top-down structure and skip mode check in lower depth, which brings large quality decrease. For CU level, the common features are not effective to correctly skip InterIMV check. Thus, fast InterIMV algorithm targeted to remove InterIMV mode redundancy is needed. This paper proposes bottom-up InterIMV check method on depth level and temporal rate-distortion relation based check skip method on CU level. Firstly, proposed method executes InterIMV mode in a bottom-up order after all depths are traversed. This method checks InterIMV mode from the lowest depth towards upper depths and finds the suitable depth for current area. Then, InterIMV check in depths above suitable depth is removed without bringing much quality damage, since only the suitable depth is used to encode current area. Secondly, for each CU, the proportion of rate in rate-distortion cost (RD-cost) of temporal best mode is used to judge whether to skip InterIMV check, since this relationship is strongly associated with InterIMV selection. While testing on VVC benchmark VTM5 under RandomAccess configuration, the proposed methods achieve 79.78% speed up in InterIMV process on average. The BD-rate increase of proposed methods is only 0.37% which brings no significant coding efficiency decrease.

关键词： Video compression Inter prediction InterIMV mode Versatile Video Coding (VVC) fast algorithm

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for radiative transport in isotropic media

引用

JOURNAL OF COMPUTATIONAL PHYSICS 2019年 399卷 108958-000页

作者： Ren, Kui Zhang, Rongting Zhong, Yimin Univ Texas Austin Dept Math Austin TX 78712 USA Univ Texas Austin Oden Inst Austin TX 78712 USA

Constructing efficient numerical solution methods for the equation of radiative transfer (ERT) remains as a challenging task in scientific computing despite of the tremendous development on the subject in recent years. We present in this work a simple fast computational algorithm for solving the ERT in isotropic media. The algorithm we developed has two steps. In the first step, we solve a volume integral equation for the angularly-averaged ERT solution using iterative schemes such as the GMRES method. The computation in this step is accelerated with a fast multipole method (FMM). In the second step, we solve a scattering-free transport equation to recover the angular dependence of the ERT solution. The algorithm does not require the underlying medium be homogeneous. We present numerical simulations under various scenarios to demonstrate the performance of the proposed numerical algorithm for both homogeneous and heterogeneous media. (C) 2019 Elsevier Inc. All rights reserved.

关键词： fast algorithm Equation of radiative transfer Volume integral equation Kernel-independent fast multipole method Low-rank approximation Diffusion approximation

来源：评论

学校读者我要写书评

暂无评论

Robust and fast algorithm for extracting the periodic feature from jet engine modulation signals

引用

JOURNAL OF ENGINEERING-JOE 2019年第20期2019卷 6507-6511页

作者： Sun, Jingming Yu, Junpeng Nanjing Res Inst Elect Technol Nanjing 210039 Jiangsu Peoples R China CETC Key Lab IntelliSense Technol Nanjing 210039 Jiangsu Peoples R China

Jet engine modulation (JEM), a modulation phenomenon induced by the rotating structure of jet engines, is a representative feature extracted from the radar returns for aircraft target recognition. As one of the most significant periodic characteristics of JEM, the chopping frequency plays an important role in aircraft target recognition. However, existing methods either need complicated logical algorithms to get an accurate estimation of the chopping frequency or exploit the chopping frequency as priori information for further feature extraction, and neither of these two scenarios is practical. Here, the authors propose a robust and fast algorithm for extracting the chopping frequency, which uses wavelet decomposition combined with autocorrelation to process the analytic form of the JEM signal. Application results of measured JEM signals demonstrate that the proposed algorithm is effective and practical for stable and accurate extraction of the periodic feature from JEM signals.

关键词： jet engines image processing low-pass filters radar target recognition Wigner distribution feature extraction wavelet transforms significant periodic characteristics chopping frequency logical algorithms feature extraction robust algorithm JEM signal measured JEM signals stable extraction accurate extraction aircraft target recognition radar returns representative feature jet engines rotating structure modulation phenomenon jet engine modulation signals periodic feature fast algorithm

来源：评论

学校读者我要写书评

暂无评论

fast algorithm for simulation of normal and oblique penetration into limestone targets

引用

Applied Mathematics and Mechanics(English Edition) 2017年第5期38卷 671-688页

作者： Xuguang CHEN Duo ZHANG Shujian YAO Fangyun LU College of Science National University of Defense TechnologyChangsha 410073China

A fast algorithm is proposed to predict penetration trajectory in simulation of normal and oblique penetration of a rigid steel projectile into a limestone target. The algorithm is designed based on the idea of isolation between the projectile and the target. Corresponding factors of influence are considered, including analytical load model, cratering effect, free surface effect, and separation-reattachment phenomenon. Besides, a method of cavity ring is used to study the process of cavity expansion. Further, description of the projectile＇s three-dimensional gesture is coded for fast calculation, named PENE3D. A presented. As a result, the algorithm is series of cases with selected normal and oblique penetrations are simulated by the algorithm. The predictions agree with the results of tests, showing that the proposed algorithm is fast and effective in simulation of the penetration process and prediction of the penetration trajectory.

关键词： fast algorithm isolation between projectile and target analytical loading model ogive-nosed projectile limestone target

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm of Correlation Dimension Estimation for Nonlinear Time Series 2

A Fast Algorithm of Correlation Dimension Estimation for Non...

引用

2nd European Conference on Electrical Engineering and Computer Science (EECS)

作者： Fan, Zhenyan Dong, Shumin Chi, Jieru Zhuang, Xiaodong Mastorakis, Nikos E. Qingdao Univ Elect Informat Coll Qingdao Peoples R China Tech Univ Sofia English Language Fac Engn Sofia Bulgaria

ISBN: (纸本)9781728119298

The computation cost of traditional correlation dimension algorithm is large, which prevents its real-time application. The fast algorithm of correlation dimension computation is proposed in this paper. The distance between signal sequence points is compared with a given threshold and the results are transformed into a binary neighbor matrix. Then the binary nearest neighbor matrix of high dimensional signal vector is recurred by the binary nearest neighbor matrix of low dimensional signal vector. The real operations are converted into a logical AND operation and a logical summation operation. Difference-comparison operations of correlation integral are reduced. The results show that the fast algorithm can greatly improve the calculating speed of correlation dimension.

关键词： Phase Space Reconstruction Correlation Dimension fast algorithm

来源：评论

学校读者我要写书评

暂无评论

A fast approximate algorithm for determining bond orders in large polycyclic structures

引用

JOURNAL OF MOLECULAR GRAPHICS & MODELLING 2019年 86卷 52-65页

作者： Trepalin, Sergey Gurke, Sasha Akhukov, Mikhail Knizhnik, Andrey Potapkin, Boris Russian Acad Sci Inst Physiol Act Cpds Chernogolovka 142432 Moscow Region Russia Elsevier Inc 230 Pk Ave8th Floor New York NY 10169 USA Kintech Lab 12 3rd Khoroshevskaya Str Moscow 123298 Russia

Novel logarithmic time algorithm is proposed for determining the order of chemical bonds from known valences of the atoms. The algorithm has the order of complexity N log(N) and is applicable to polycyclic compounds containing a combination of the cycles of any size and the atoms with the valences <= 4 in cycle nodes. The algorithm is applicable to structures containing triple and cumulene bonds in the cycles. It was tested for graphene, C[12,12] nanotubes, graphyne-GY1, graphyne-GY7, graphyne-like nanotube, fullerenes C20, C60, C70, C80, C82 and their aza-analogs, polypentadienes, as well as for porphine. Determining the order of bonds in graphene, graphynes or nanotubes, containing >10(7) atoms, took less than 2 min on a personal computer. For the compounds containing aromatic cycles with an odd number of atoms, this algorithm becomes probabilistic and successful determination of bond orders is not guaranteed. However, the probability of successful determination of bond order is significant, and Kekule structures, if they existed, were generated for all studied fullerenes and their aza-analogs. (C) 2018 Elsevier Inc. All rights reserved.

关键词： Kekule structure fast algorithm Nanotube Graphene Graphyne Fullerene

来源：评论

学校读者我要写书评

暂无评论

fast algorithm Based on Iterative Generalized Inverse for Image Deblurring 9

Fast Algorithm Based on Iterative Generalized Inverse for Im...

引用

9th International Conference on Digital Image Processing (ICDIP)

作者： Qiao, Tiantian Huang, Sining China Univ Petr Coll Sci Qingdao 266580 Peoples R China China Univ Petr Coll Pipeline & Civil Engn Qingdao 266580 Peoples R China

In this paper, a fast algorithm for image deblurring is discussed. The algorithm is based on generalized inverse iteration, and linearized Bregman iteration for the basis pursuit problem. Numerical experiments show th... 详细信息

ISBN: (纸本)9781510613058;9781510613041

关键词： image deblurring fast algorithm iterative generalized inverse

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for simulation of periodic flows using discrete vortex particles

引用

JOURNAL OF THE BRAZILIAN SOCIETY OF MECHANICAL SCIENCES AND ENGINEERING 2017年第11期39卷 4555-4570页

作者： Ricciardi, Tulio R. Wolf, William R. Bimbato, Alex M. Univ Estadual Campinas BR-13083860 Campinas SP Brazil Sao Paulo State Univ BR-12516410 Guaratingueta SP Brazil

We present a novel fast algorithm for flow simulations using the discrete vortex method, DVM, for problems with periodic boundary conditions. In the DVM, the solution of the velocity field induced by interactions among N discrete vortex particles is governed by the Biot-Savart law and, therefore, leads to a computational cost proportional to O(). The proposed algorithm combines exponential and power series expansions implemented using a divide and conquer strategy to accelerate the calculation of the cotangent kernel that models periodic boundary conditions. The fast multipole method, FMM, is applied for the solution of singular terms appearing in the power series expansion and also for the exponential series expansion. Error and computational cost analyses are performed for the individual steps of the algorithm for double and quadruple machine precision. The current method presents more accurate solutions when compared to those obtained by periodic domain replication using the free-field FMM kernel. The novel algorithm provides computational savings of nearly 240 times for double-precision simulations with one million particles when compared to the direct calculation of the Biot-Savart law.

关键词： fast algorithm Cotangent kernel Periodic boundary conditions Discrete vortex method fast multipole method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：