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

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Yang, Peixiang Mao, Wendong Wang, Zhongfeng Lin, Jun Nanjing Univ Sch Elect Sci & Engn Nanjing Peoples R China

ISBN: (纸本)9781665484855

Recently, deconvolutional neural network (DeCNN) has attracted widespread attention in various applications. The deconvolution (DeConv), as the main operation in DeCNN, has become the bottleneck of acceleration, due to its high computational complexity. Previous works have introduced fast algorithms such as the cascaded fast FIR algorithm (CFFA) and the Winograd algorithm to reduce the computational complexity of DeConv for the applications on mobile devices. Since these fast algorithms need different computing parameters to accelerate various operations, directly applying these methods to process DeCNNs with different kernels usually causes limited flexibility. To address this problem, we propose a reconfigurable scheme based on the fast transformation algorithm (FTA) to accelerate multiple types of DeConvs, minimizing the hardware overhead for reconfigurability. Based on this scheme, a reconfigurable hardware architecture is developed to support several types of DeConvs. In addition, an adaptive dataflow is proposed to handle different convolutional layers. The presented design can support several types of operations and achieve up to 222.54 GOPS under 210 MHz on the Intel Arria 10SX FPGA platform, which shows our design can obtain better flexibility and computational efficiency compared with prior arts.

关键词： Deconvolutional neural network deconvolution transposed convolution hardware architecture acceleration reconfigurable design fast algorithm

来源：评论

学校读者我要写书评

暂无评论

The SVPWM fast algorithm for three-phase inverters

The SVPWM fast algorithm for three-phase inverters

引用

IPEC 2007 Meeting

作者： Wen, Xiaoling Yin, Xianggen Wuhan Inst Technol Sch Elect & Informat Engn Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Coll Elect & Elect Engn Wuhan 430074 Peoples R China

In this paper, a zero-vector distribution variable k(1), which changes from zero to one, is introduced. The continuous SVPWM is generated when 0<k(1)<1, and several typical kinds of discontinuous SVPWM are gener... 详细信息

ISBN: (纸本)9789810594237

In this paper, a zero-vector distribution variable k(1), which changes from zero to one, is introduced. The continuous SVPWM is generated when 0fast algorithm suitable for the digital implementation of all continuous and discontinuous SVPWM strategies is proposed according to the relationship between carrier-based PWM and SVPWM methods. Compared with the SVPWM conventional algorithm, the proposed algorithm can be more easily implemented with a microprocessor because it calculates the actual gating times for each inverter leg directly using three-phase reference voltages and needn't complex coordinate transformations, trigonometric function calculations, sector number identification, and the recombination of actual gating times. At last, the influence of the zero-vector distribution factor and modulation index on the voltage harmonic characteristics of all SVPWM strategies is investigated. The simulation and experimental results show that the proposed method is valid and feasible.

关键词： carrier-based PWM space vector PWM fast algorithm harmonic analysis

来源：评论

学校读者我要写书评

暂无评论

Development of Embedded Temperature Regulator Based on DMC fast algorithm 34

Development of Embedded Temperature Regulator Based on DMC F...

引用

34th Chinese Control and Decision Conference (CCDC)

作者： Wu, Zhen-He Zhao, Thong Beijing Univ Chem Technol Coll Informat Sci & Technol Beijing 100029 Peoples R China

ISBN: (纸本)9781665478960

A fast Dynamic Matrix Control (DMC) algorithm is proposed to satisfy the requirements of the embedded temperature regulator. There exists online high-dimension matrix inversion in the DMC control algorithm, so it is difficult to apply to the embedded temperature regulator with limited computing capacity. In this work, the high-dimension matrix is decomposed into the product of a triangular matrix and its transpose matrix by Cholesky decomposition, and the inversion of the matrix calculation could be calculated recursively. Based on the proposed algorithm, an embedded temperature regulator has been developed. Therefore, the computation cost of the fast algorithm is greatly reduced compared to the traditional DMC algorithm. The experimental results have verified that the algorithm can be applied to the embedded temperature regulator and provides better regulation effect than that with the PID control algorithm.

关键词： Dynamic Matrix Control fast algorithm Embedded Regulator Temperature Control

来源：评论

学校读者我要写书评

暂无评论

fast algorithm for high resolution frequency estimation of multiple real sinusoids

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2003年第11期E86A卷 2891-2893页

作者： So, HC Wu, YT City Univ Hong Kong Dept Comp Engn & Informat Technol Kowloon Hong Kong Peoples R China Xidian Univ Lab Radar Signal Proc Xian 710071 Peoples R China

The propagator method (PM) belongs to a class of subspace based methods for direction-of-arrival estimation which only requires linear operations but does not involve any eigendecomposition or singular value decomposition as in common subspace techniques. In this paper, we apply the PM for estimating the frequencies of multiple real sinusoids in noise and a computationally simple as well as high resolution multiple frequency estimation algorithm is developed. The estimation accuracy of the proposed method is contrasted with the conventional MUSIC and Cramer-Rao lower bound under different noise conditions.

关键词： subspace method fast algorithm frequency estimation

来源：评论

学校读者我要写书评

暂无评论

fast algorithm designs for low-complexity 4 x 4 discrete cosine transform

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2005年第11期E88A卷 3225-3229页

作者： Fan, CP Natl Chung Hsing Univ Dept Elect Engn Taichung 402 Taiwan

In the letter, the fast one-dimensional (I-D) and two-dimensional (2-D) algorithms for realizing low-complexity 4 x 4 discrete cosine transform (DCT) for H.264 applications are developed. Through applying matrix utilizations with Kronecker product and direct sum, the efficient fast 2-D 4 x 4 DCT algorithm can be developed from the proposed fast 1-D 4 x 4 DCT algorithm by matrix decompositions. The fast 1-D and 2-D low-complexity 4 x 4 DCT algorithms requires fewer multiplications and additions than other fast DCT algorithms. Owing to regular modularity, the proposed fast algorithms can achieve real-time H.264 video signal processing with VLSI implementation.

关键词： discrete cosine transform fast algorithm digital signal processing

来源：评论

学校读者我要写书评

暂无评论

Barnes–Hut/Multipole fast algorithm in Lagrangian Vortex Method 49th

Barnes–Hut/Multipole Fast Algorithm in Lagrangian Vortex Me...

引用

Advanced Problem in Mechanics III - Proceedings of the 49th International Summer School-Conference "Advanced Problems in Mechanics", 2021

作者： Chernyh, Julia Marchevsky, Ilia Ryatina, Evgeniya Kolganova, Alexandra Bauman Moscow State Technical University Moscow105005 Russia Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow109004 Russia

ISBN: (纸本)9783031372452

New modification of the fast algorithm based on the Barnes–Hut (BH) and multipole (FMM) methods is developed for the problem of velocities calculation in vortex particle method. It provides a quasilinear computational complexity and allows for the accuracy flexible adjustment, similarly to the classical Barnes–Hut method. Four schemes are developed with different number of terms being hold in multipole and local expansions. All the necessary formulae are presented, expressed in terms of operations with complex numbers. If extremely high accuracy is not required, the proposed algorithm is more efficient in comparison to the traditional FMM methods. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： fast algorithm Multipoles n-body problem The barnes–hut algorithm Vortex method

来源：评论

学校读者我要写书评

暂无评论

Overview of fast algorithm in 3D dynamic holographic display

Overview of fast algorithm in 3D dynamic holographic display

引用

5th International Symposium on Photoelectronic Detection and Imaging (ISPDI) - Optical Storage and Display Technology

作者： Liu, Juan Jia, Jia Pan, Yijie Wang, Yongtian Beijing Inst Technol Sch Opt & Elect Minist Educ China Key Lab Photoelect Imaging Technol & Syst Beijing 100081 Peoples R China

ISBN: (纸本)9780819497826

3D dynamic holographic display is one of the most attractive techniques for achieving real 3D vision with full depth cue without any extra devices. However, huge 3D information and data should be preceded and be computed in real time for generating the hologram in 3D dynamic holographic display, and it is a challenge even for the most advanced computer. Many fast algorithms are proposed for speeding the calculation and reducing the memory usage, such as: look-up table (LUT), compressed look-up table (C-LUT), split look-up table (S-LUT), and novel look-up table (N-LUT) based on the point-based method, and full analytical polygon-based methods, one-step polygon-based methodbased on the polygon-based method. In this presentation, we overview various fast algorithms based on the point-based method and thepolygon-based method, and focus on the fast algorithm (C-LUT) with low memory usage and one-step polygon-based method by the 2D Fourier analysis of the 3D affine transformation. The numerical simulations and the optical experiments are presented, and several other algorithms are compared. The results show that the C-LUT algorithm and the one-step polygon-based method are efficient methods for saving calculation time. It is believed that those methods could be used in the real-time 3D holographic display in the future.

关键词： 3D holographic display Computer generated holograms fast algorithm

来源：评论

学校读者我要写书评

暂无评论

fast algorithm for constructing neighbor-joining phylogenetic trees

引用

Journal of Southeast University(English Edition) 2006年第2期22卷 176-179页

作者：陈宁涛王能超施保昌华中科技大学计算机科学与技术学院武汉430074 华中科技大学并行计算研究所武汉430074

To improve the performance of Saitou and Nei＇s algorithm （SN） and Studier and Keppler＇s improved algorithm （SK） for constructing neighbor-joining phylogenetic trees and reduce the time complexity of the computation, a fast algorithm is proposed. The proposed algorithm includes three techniques. First, a linear array A[N] is introduced to store the sum of every row of the distance matrix （the same as SK）, which can eliminate many repeated computations. Secondly, the value of A [i] is computed only once at the beginning of the algorithm, and is updated by three elements in the iteration. Thirdly, a very compact formula for the sum of all the branch lengths of operational taxonomic units （OTUs） i and j is designed, and the correctness of the formula is proved. The experimental results show that the proposed algorithm is from tens to hundreds times faster than SN and roughly two times faster than SK when N increases, constructing a tree with 2 000 OTUs in 3 min on a current desktop computer. To earn the time with the cost of the space and reduce the computations in the innermost loop are the basic solutions for algorithms with many loops.

关键词： phylogenetic tree neighbor-joining method fast algorithm progressive multiple alignment

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for maximum-minimum image filtering

引用

SYSTEMS AND COMPUTERS IN JAPAN 1996年第13期27卷 74-85页

作者： Miyatake, T Ejiri, M Matsushima, H HITACHI LTD TELECOMMUN DIVYOKOHAMAKANAGAWA 244JAPAN

This paper proposes a method for fast operation by software for a certain kind of filtering, e.g., maximum, minimum, logical sum and logical product, among the nonlinear filtering for the image. The computation time of the proposed filtering is independent of the filter size or the content of the image. The computation for an output for the two-dimensional gray-scale image can be completed by at most two times of 2-term operations. When the image to be processed is a binary image. Then, the computation time can be reduced by a factor of more than 20 by the actual measurement of the computation time for the whole image, compared to the case of the gray-scale image. In the proposed method, the ring-type buffer is connected in multistages, so that the computation can be executed without storing the whole image in the main memory. This property is suited to the large-scale image filtering, as in the cases of a satellite image or drawn diagram. The proposed method is actually programmed. Using the gray-scale and binary images, the method is compared by experiment to the conventional method, and the high speed of the proposed method is verified.

关键词： filtering binary image gray-scale image dilation erosion maximum filter minimum filter pipeline processing fast algorithm

来源：评论

学校读者我要写书评

暂无评论

fast algorithm for nonlocal Allen-Cahn equation with scalar auxiliary variable approach

引用

APPLIED MATHEMATICS LETTERS 2022年第0期126卷 107805-107805页

作者： Yao, Changhui Fan, Huijun Zhao, Yanmin Shi, Yanhua Wang, Fenling Zhengzhou Univ Sch Math & Stat Zhengzhou 450001 Peoples R China Xuchang Univ Sch Sci Xuchang 461000 Peoples R China

Numerical analysis is presented for the nonlocal Allen-Cahn equation, which contains spatial nonlocal operator and time-fractional derivative. By employing the spatial quadrature-based finite difference method and the nonuniform L1 formula jointed with the scalar auxiliary variable (SAV) approach in temporal discretization, a nonuniform numerical scheme is established. The nonlinear solver can be transformed into linear one effectively due to the SAV approach. And, the proposed scheme is proven to be energy stable by use of the positive definiteness of the kernel function. Moreover, the fast algorithm based on the nonuniform L1 formula is applied in the numerical example to improving computational efficiency. Finally, the numerical results demonstrate the temporal convergence of numerical scheme, energy property, comparisons with the nonlocal cases and local cases and maximum principle of the numerical solution. (C) 2021 Elsevier Ltd. All rights reserved.

关键词： Nonlocal Allen-Cahn equation SAV approach Energy stable fast algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：