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

computation complexity of a ternary linear function

Journal of Applied and Industrial Mathematics 2012年第4期6卷 403-409页

作者： Avgustinovich, S.V. Vasil'ev, Yu. L. Rychkov, K.L. Sobolev Institute of Mathematics pr. Akad. Koptyuga 4 Novosibirsk 630090 Russia Novosibirsk State University ul. Pirogova 2 Novosibirsk 630090 Russia

关键词： computation complexity generalized π-scheme ternary linear function

来源：评论

学校读者我要写书评

暂无评论

computation complexity analysis and VLSI architectures of shape coding for MPEG-4

引用

Conference on Visual Communications and Image Processing

作者： Gong, DN He, Y Tsinghua Univ Dept Elect Engn State Key Lab Microwave & Digital Commun Beijing 100084 Peoples R China

ISBN: (纸本)0819437034

There are huge bit-level operations in shape coding algorithms for MPEG-4. These bit-level operations make it difficult to implement real-time MPEG-4 coding in the general-purpose processor without any hardware support. This paper first gives the analysis of computation complexity in MPEG-4 shape coding algorithms. Then a dedicated VLSI architecture to accelerate shape coding, which is called Shape Engine, is proposed. Shape Engine is composed of three dedicated but flexible processors element (PE) namely PB-PE, Filtering-PE and CAE-PE. The combination of RISC core and Shape Engine leads to a great speed up over pure software implementation of MPEG-4 shape coding.

关键词： MPEG-4 VLSI architectures shape coding computation complexity

来源：评论

学校读者我要写书评

暂无评论

computation complexity Evaluation of FastSLAM Algorithm for Unmanned Ground Vehicles 24

Computation Complexity Evaluation of FastSLAM Algorithm for ...

引用

24th International Conference on Methods and Models in Automation and Robotics (MMAR)

作者： Al-Tarras, Ahmed E. Yacoub, Mostafa I. Asfoor, Mostafa S. Sharaf, Al-Hussein Mil Tech Coll Automot Engn Dept Cairo Egypt

ISBN: (纸本)9781728109336

FastSLAM algorithm is commonly used in Unmanned Ground Vehicles (UGVs) recently. One of the main problems under research is the computation cost of this probabilistic algorithm. Since the speed of the UGV is limited by the latency of the algorithm, the computation complexity and its effect on the step time of the FastSLAM needs to be investigated. The present work addresses the effects of the number of particles and number of map features on the computation complexity of the FastSLAM algorithm. The study included the prediction, the observation, data association and resampling phase's complexities. Also, the correlation between the uncertainty of the UGV location and the number of particles was addressed. The simulation study was validated experimentally using hardware in the loop (HIL) setup. The analysis showed that when there is a prior knowledge of the average number of map features, an optimum number of particle filters could be set for that UGV in the given environment while maintaining an improved performance of the algorithm.

关键词： computation complexity FastSLAM particle filter UGV

来源：评论

学校读者我要写书评

暂无评论

Reducing computation complexity in Optimization of Nanophotonic Structures Using Pruning

引用

IEEE PHOTONICS TECHNOLOGY LETTERS 2024年第4期36卷 215-218页

作者： Javani, Mohammad Hadigheh Zandehshahvar, Mohammadreza Adibi, Ali Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA Clark Atlanta Univ Dept Cyber Phys Syst Atlanta GA 30314 USA

Inverse design of complex nanophotonic devices is a very computation-consuming task. Deep-learning-based approaches can facilitate this process. However, due to the lack of solid knowledge about the underlying complexity of the input-output relation for a selected class of nanostructures, it is common to select an over-parameterized neural network (NN) for modeling this relation. We present a novel pruning method based on removing weak nodes and connections in the original NN to simplify the input-output relation without imposing significant error. In addition to reducing the model complexity computations, the pruned network can be used to find valuable insight into the physics of device operation. To show the efficacy of our approach, we use it for modeling and inverse design of two classes of nanostructures with different complexities.

关键词： Artificial neural networks Nanostructures Metasurfaces Training Solid modeling Physics Computer architecture Inverse design nanophotonics computation complexity deep learning pruning

来源：评论

学校读者我要写书评

暂无评论

Recursive bit loading scheme with low computation complexity

引用

FREQUENZ 2008年第11-12期62卷 285-287页

作者： Bui, Duc Anh Rohling, Hermann Hamburg Univ Technol TUHH Dept Telecommun D-21073 Hamburg Germany

Bit loading is a powerful technique to enhance the performance of multi-carrier systems, In this paper, a bit loading scheme with low computation complexity is addressed in all technical details. The algorithm uses the measured signal-to-noise-ratio of each subcarrier directly to start the bit-by-bit loading procedure. The results show a good bit error rate (BER) performance and a low computation complexity compared to other bit loading algorithms.

关键词： OFDM bit loading Bit Error Rate (BER) Signal-to-Noise Ratio computation complexity number of bits per subcarrier

来源：评论

学校读者我要写书评

暂无评论

A novel method for chromatic dispersion estimation with lower computation complexity in fractional domain

A novel method for chromatic dispersion estimation with lowe...

引用

International Conference on Optical Instruments and Technology - Optoelectronic Devices and Optical Signal Processing

作者： Ma, Yiwen Guo, Peng Yang, Aiying Lu, Yueming Qiao, Yaojun Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China Beijing Inst Technol Sch Optoelect Beijing 100081 Peoples R China Beijing Univ Posts & Telecommun Key Lab Trustworthy Distributed Comp & Serv Beijing 100876 Peoples R China

ISBN: (数字)9781510617469

ISBN: (纸本)9781510617469;9781510617452

The optimal order in fractional Fourier transform (FrFT) can be used to estimate chromatic dispersion (CD) and nonlinearity in an optical fiber transmission system. In this paper, we propose a novel method to estimate CD with lower computation complexity in fractional domain. The computation complexity can be reduced by 10 3 times with the same measurement accuracy compared with one step method when the number of samples is 8192 and search step is 0.0001. The correctness of the novel method for optimal order searching is proved by chirp parameter estimation for linear frequency modulation (LFM) signals. The measurement relative error is only 0.02%. For CD estimation, the maximum estimation error ratio is 0.338% and 0.564% for 28GBaud quadrature phase-shift keying (QPSK) and 16 quadrature amplitude modulation (16QAM) optical fiber transmission systems over 100 km similar to 2000 km SSMF.

关键词： Fractional Fourier Transform (FrFT) computation complexity Chromatic Dispersion Estimation

来源：评论

学校读者我要写书评

暂无评论

A Review of FPGA-Based Custom Computing Architecture for Convolutional Neural Network Inference

引用

Chinese Journal of Electronics 2021年第1期30卷 1-17页

作者： PENG Xiyuan YU Jinxiang YAO Bowen LIU Liansheng PENG Yu School of Electronics and Information Engineering Harbin Institute of Technology

Convolutional neural network(CNN)has been widely adopted in many tasks. Its inference process is usually applied on edge devices where the computing resources and power consumption are *** present, the performance of general processors cannot meet the requirement for CNN models with high computation complexity and large number of parameters. Field-programmable gate array(FPGA)-based custom computing architecture is a promising solution to further enhance the CNN inference *** software/hardware co-design can effectively reduce the computing overhead, and improve the inference performance while ensuring accuracy. In this paper, the mainstream methods of CNN structure design, hardwareoriented model compression and FPGA-based custom architecture design are summarized, and the improvement of CNN inference performance is demonstrated through an example. Challenges and possible research directions in the future are concluded to foster research efforts in this domain.

关键词： inference mechanisms computing resources hardware-oriented model compression CNN structure design computing overhead convolutional neural nets electronic engineering computing field-programmable gate array-based custom computing architecture computation complexity FPGA-based custom computing architecture design computational complexity convolutional neural network inference CNN inference performance power consumption field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Modeling the bit-level stochastic correlation for turbo decoding

引用

COMPUTER COMMUNICATIONS 2006年第18期29卷 3856-3862页

作者： Lin, Yi-Nan Hung, Wei-Wen Chen, Tsan-Jieh Lu, Erl-Huei Mingchi Univ Technol Dept Elect Engn Taipei Taiwan Chang Gung Univ Dept Elect Engn Tao Yuan Taiwan

After passing a systematic bit through a turbo encoder, the encoding process will introduce some extent of correlation between a systematic bit and its associated parity bits. However, this correlation is neglected in the subsequent turbo decoding process so as to reduce its computational complexity. In this paper, we try to explore the feasibility of modeling the bit-level stochastic correlation for the iterative turbo decoding. By properly adjusting the parameter of the correlation model, we can approximate various degrees of the underlying correlation within the received codewords. Reduction in bit error rate (BER) then may benefit from a more accurate capture of the correlation information at the cost of requiring only a small additional computation complexity. Experimental results indicate that incorporating the correlation model into the turbo decoding process can achieve better BER performance than that of conventional turbo decoders over AWGN channels. (C) 2006 Elsevier B.V. All rights reserved.

关键词： turbo encoder/decoder bit-level stochastic correlation model bit error rate (BER) computation complexity AWGN channel

来源：评论

学校读者我要写书评

暂无评论

Temporal Netgrid Model-Based Dynamic Routing in Large-Scale Small Satellite Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2019年第6期68卷 6009-6021页

作者： Li, Jian Lu, Hancheng Xue, Kaiping Zhang, Yongdong Univ Sci & Technol China Dept Elect Engn & Informat Sci Hefei 230027 Anhui Peoples R China

In recent years, Small Satellite Networks (SSNs) are attracting increasing attention due to its economical prospects and advantages in high bandwidth and low latency. More and more companies and organizations are planning to construct large-scale SSNs to provide global services. In this way, the traffic pattern is more complicated because of random transmission requirements and stochastic packet generations/arrivals, and routing faces more challenges due to network scale and limited resource in small satellites. Traditional satellite routing algorithms, which attempt to exploit the predictable satellite's trajectory with time-discrete graph models, cannot handle these challenges. In this paper, we propose a novel Temporal Netgrid Model (TNM) to portray the time-varying topology of large-scale SSNs. In TNM, the whole space is divided into small cubes (i.e., netgrids) and then, satellites can be located by netgrids instead of coordinates. By doing so, we can construct a network topology for random traffic routing. Furthermore, an efficient Netgrid-based Shortest Path Routing (NSR) algorithm is proposed based on TNM;NSR attempts to find the optimal path from source netgrid to any other reachable netgrids. In this way, the routing complexity is significantly reduced. We also develop a Large-scale Satellite Network Simulator (LSNS) to validate our study. The results show that NSR achieves a significant reduction in computational complexity as well as near-optimal routing performance in terms of end-to-end delay and packet drop rate in scenarios of large-scale SSNs compared with existing satellite routing algorithms.

关键词： Large-scale small satellite networks temporal netgrid model dynamic routing computation complexity

来源：评论

学校读者我要写书评

暂无评论

Attribute-based hierarchical file encryption for efficient retrieval of files by DV index tree from cloud using crossover genetic algorithm

引用

SOFT COMPUTING 2019年第8期23卷 2561-2574页

作者： Naresh, R. Sayeekumar, M. Karthick, G. M. Supraja, P. SRM Inst Sci & Technol Dept Comp Sci & Engn Kattankulathur 603203 Tamil Nadu India SRM Inst Sci & Technol Dept Informat Technol Kattankulathur 603203 Tamil Nadu India

File storing as well as retrieving is the most important security-related research area in cloud. Based on our literature survey, many researchers have developed several searchable encryption protocols. Among the several protocols, only minimum number of protocols satisfies the efficient file retrieval from the cloud. Previous research papers support the file encryption based on the keyword, secret key and random number. But in this research paper, we have proposed attribute-based encryption based on the hierarchical manner. The collections of files are encrypted under one common access layer. Compared to earlier researches, our attribute-based hierarchical file encryption scheme supports very less computation as well as storage complexity. We have constructed a new index model named data vector (DV) tree using crossover genetic algorithm which is a component of the soft computing. The DV tree is built based on the term frequency, inverse document frequency and attributes of the file. We have also developed a new key generation, encryption and decryption function for efficient retrieval of files towards the data users.

关键词： computation complexity Storage complexity Index tree Privacy Attributes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：