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

A tree search algorithm for low multiplicative complexity logic design

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2018年 83卷 132-143页

作者： Tay, Jia Jun Wong, M. L. Dennis Wong, Ming Ming Zhang, Cishen Hijazin, Ismat Swinburne Univ Technol Fac Engn Comp & Sci Sarawak Campus Sarawak Malaysia Heriot Watt Univ Malaysia Putrajaya Malaysia Nanyang Technol Univ Sch Comp Sci & Engn Nanyang Ave Singapore Singapore Swinburne Univ Technol Fac Sci Engn & Technol Hawthorn Vic Australia

Low multiplicative complexity logic design is a useful heuristic to achieve low gate count implementation of logic circuit. In this work, we propose a deterministic approach based on the currently known lower and upper bounds of multiplicative complexity for logic minimization problems with not more than five inputs. The proposed tree search algorithm achieves circuit minimization through decomposition of Positive Polarity Reed-Muller expressions. This approach allows low multiplicative complexity logic design to be executed without the consistency issue associated with the randomized approach in the original algorithm. Experimental results show over 85% improvement in computation time compared to solving the same problems using the previous randomized approach. We also demonstrate that the quality of results produce by the proposed algorithm is comparable, and in some cases, better than the results reported in previous works using the same heuristic. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Logic design Multiplicative complexity Function decomposition tree search algorithm

来源：评论

学校读者我要写书评

暂无评论

An algorithm based on valuation forecasting for game tree search

引用

INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS 2021年第4期12卷 1083-1095页

作者： Tan, Guangyun Wei, Peipei He, Yongyi Xu, Huahu Shi, Xinxin Yi, Ping Shanghai Univ Sch Mechatron Engn & Automat Shanghai Peoples R China Shanghai Qiansi Network Technol Ltd Liabil Co 800 Naxian Rd Shanghai 201210 Peoples R China Shanghai Univ Sch Comp Engn & Sci Shanghai Peoples R China

This study proposes a novel best-first search algorithm, called Valuation Increment search algorithm (VIS), which applies the increment of exploratory value change to predict the valuation and guide the selection of the game tree. The proposed method can effectively use node valuation and game tree size information to solve the game tree by fewer exploration steps. The relevant assumptions and search principles of the proposed algorithm are detailed. Moreover, comparative experiments with Alpha-Beta search (alpha-beta search), Proof-Number search (PNS) and Monte-Carlo tree search (MCTS) in the domain of Dou Dizhu has been performed to verify the performance. Result demonstrate that VIS is superior to alpha-beta search, PNS and MCTS algorithm in solving the game tree and finding the best move for some game scenarios by consuming less time and few memory resources. The improvement effect of the average Increment, magnitude of Increment, and the number of visits to node on the original VIS was validated. Also, a new selection strategy is defined for the improved VIS algorithm combined with these factors. The experimental comparison results show that improved VIS has a better performance in solving game tree with less nodes generated and expanded than original VIS.

关键词： tree search algorithm Best-first Dou Dizhu Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A Novel algorithm for Lane Detection based on Iterative tree search 1

A Novel Algorithm for Lane Detection based on Iterative Tree...

引用

1st IEEE International Workshop on Metrology for Automotive (MetroAutomotive)

作者： Terlizzi, Mario Russo, Luigi Picariello, Enrico Glielmo, Luigi Univ Sannio Dept Engn Benevento Italy

ISBN: (纸本)9781665439060

An important module in driver assistance systems is the lane departure warning which warns the driver when the vehicle begins to cross out of its lane inadvertently. A novel lane detection algorithm designed for lane departure warning system is presented in this paper. The proposed approach exploits the advantages offered by tree search to set up an intuitive and lightweight lane detection solution compared to existing ones. The algorithm is capable to work with poor light conditions, e.g., tunnel road, irrelevant markings on the road and the inherent long and thin property of lanes, scenarios with night conditions. Furthermore, the algorithm has a low time complexity which allows to he used on small and cheap hardware systems. An experimental setup containing a low cost front-facing camera sensor and an embedded computing board are used to implement the algorithm. A testing in a real highway scenario is carried out to validate the effectiveness of the proposed algorithm.

关键词： Lane departure warning system advanced driver assistance system image processing tree search algorithm

来源：评论

学校读者我要写书评

暂无评论

tree search Based Configurable Joint Detection and Decoding algorithms for MIMO Systems

Tree Search Based Configurable Joint Detection and Decoding ...

引用

International Conference on Computing, Networking and Communications (ICNC)

作者： Huang, Chien-Hao Yu, Chia-Po Shen, Chung-An Natl Taiwan Univ Sci & Technol Dept Elect & Comp Engn Taipei Taiwan

ISBN: (纸本)9781467385794

It has been shown that the Configurable Joint Detection-Decoding (CJDD) algorithms in MIMO systems can effectively reduce the complexity and improve the signal quality. Since the CJDD approach is based on the tree search algorithms and there exists various kinds of such methods with different characteristics, it is of great importance to explore the trade-offs between each algorithm and their impacts on different aspects of system performances. In this paper, we study the CJDD algorithm based on three types of tree search approaches: breadth-first search, depth-first search, and the Fano algorithm. We explicitly elucidate the advantages and disadvantages of each algorithm on the basis of timing complexity, area complexity, and run-time variability. Our goal is to shed more lights on the design and application of tree search type approaches on the MIMO wireless communication systems for different system design considerations.

关键词： MIMO joint detection and decoding tree search algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimization of Linear Phase FIR Filters in Dynamically Expanding Subexpression Space

引用

CIRCUITS SYSTEMS AND SIGNAL PROCESSING 2010年第1期29卷 65-80页

作者： Yu, Ya Jun Lim, Yong Ching Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore

The most advanced techniques in the design of multiplierless finite impulse response (FIR) filters explore common subexpression sharing when the filter coefficients are optimized. Existing techniques, however, either suffer from a heavy computational overhead, or have no guarantees on the minimal hardware cost in terms of the number of adders. A recent technique capable of designing long filters optimizes filter coefficients in pre-specified subexpression spaces. The pre-specified subexpression spaces determine if a filter with fewer adders may be achieved. Unfortunately, there is no known technique that can find subexpression spaces that can guarantee the solution with the minimum number of adders in the implementation. In this paper, a tree search algorithm is proposed to update and expand the subexpression spaces dynamically, and thus, to achieve the maximum subexpression sharing during the optimization. Numerical examples show that the proposed algorithm generates filters using fewer adders than other non-optimum algorithms. On the other hand, as a consequence of its efficiency, our proposed technique is able to design longer filters than the global optimum algorithm.

关键词： FIR filters Common subexpression sharing Subexpression space tree search algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Joint Channel Estimation and Data Detection for Massive SIMO Wireless Systems: A Polynomial Complexity Solution

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第3期66卷 1822-1844页

作者： Xu, Weiyu Alshamary, Haider Ali Jasim Al-Naffouri, Tareq Zaib, Alam Univ Iowa Dept Elect & Comp Engn Iowa City IA 52242 USA Univ Diyala Dept Commun Engn Baqubah *** Iraq King Abdullah Univ Sci & Technol Elect Engn Program Thuwal 23955 Saudi Arabia King Abdullah Univ Sci & Technol Thuwal 23955 Saudi Arabia COMSATS Univ Islamabad Dept Elect & Comp Engn Abbottabad Campus Abbottabad 22060 Pakistan

By exploiting large antenna arrays, massive MIMO (multiple input multiple output) systems can greatly increase spectral and energy efficiency over traditional MIMO systems. However, increasing the number of antennas at the base station (BS) makes the uplink joint channel estimation and data detection (JED) challenging in massive MIMO systems. In this paper, we consider the JED problem for massive SIMO (single input multiple output) wireless systems, which is a special case of wireless systems with large antenna arrays. We propose exact Generalized Likelihood Ratio Test (GLRT) optimal JED algorithms with low expected complexity, for both constant-modulus and nonconstant-modulus constellations. We show that, despite the large number of unknown channel coefficients, the expected computational complexity of these algorithms is polynomial in channel coherence time (T) and the number of receive antennas (N), even when the number of receive antennas grows polynomially in the channel coherence time (N = O(T-11) suffices to guarantee an expected computational complexity cubic in T and linear in N). Simulation results show that the GLRT-optimal JED algorithms achieve significant performance gains (up to 5 dB improvement in energy efficiency) with low computational complexity.

关键词： MIMO communication Receiving antennas Computational complexity Channel estimation Wireless communication Coherence Joint channel estimation and data detection massive SIMO generalized likelihood ratio test tree search algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Memory-Bounded Optimal Detection for GSM-MIMO Systems

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2022年第7期70卷 4359-4372页

作者： He, Ke He, Le Fan, Lisheng Lei, Xianfu Deng, Yansha Karagiannidis, George K. Guangzhou Univ Sch Comp Sci & Cyber Engn Guangzhou 510006 Peoples R China Univ Luxembourg Interdisciplinary Ctr Secur Reliabil & Trust SnT Signal Proc & Satellite Commun Res Grp SIGCOM L-1855 Esch Sur Alzette Luxembourg Southwest Jiaotong Univ Sch Informat Sci & Technol Inst Mobile Commun Chengdu 610031 Peoples R China Kings Coll London Dept Engn London WC2R 2LS England Aristotle Univ Thessaloniki Dept Elect Comp Engn Thessaloniki 54636 Greece

We investigate the optimal signal detection problem in large-scale multiple-input multiple-output (MIMO) system with the generalized spatial modulation (GSM) scheme, which can be formulated as a closest lattice point search (CLPS). To identify invalid signals, an efficient pruning strategy is needed while searching on the GSM decision tree. However, the existing algorithms have exponential complexity, whereas they are infeasible in large-scale GSM-MIMO systems. In order to tackle this problem, we propose a memory-efficient pruning strategy by leveraging the combinatorial nature of the GSM signal structure. Thus, the required memory size is squared to the number of transmit antennas. We further propose an efficient memory-bounded maximum likelihood (ML) search (EM-MLS) algorithm by jointly employing the proposed pruning strategy and the memory-bounded best-first algorithm. Theoretical and simulation results show that our proposed algorithm can achieve the optimal bit error rate (BER) performance, while its memory size can be bounded. Moreover, the expected time complexity decreases exponentially with increasing the signal-to-noise ratio (SNR) as well as the system's excess degree of freedom, and it often converges to squared time under practical scenarios.

关键词： GSM MIMO communication Transmitting antennas Symbols Modulation Maximum likelihood detection Indexes Signal detection MIMO maximum likelihood detection generalized spatial modulation tree search algorithm sphere decoding

来源：评论

学校读者我要写书评

暂无评论

Finite-wordlength design of 2-D FIR digital filters for sampling structure conversion

引用

SIGNAL PROCESSING 1996年第3期55卷 305-311页

作者： Shyu, JJ Pei, SC Lin, YC [a] Department of Computer Science Engineering Tatung Institute of Technology 40 Chungshan N. Rd. 3rd Sec. Taipei Taiwan Republic of China [b] Department of Electrical Engineering National Taiwan University Taipei Taiwan Republic of China

In this paper, an effective approach is proposed for designing discrete coefficient 2-D FIR digital filters for sampling structure conversion. After obtaining the initial continuous solution, the conventional Lagrange multiplier approach associated with an appropriate tree search algorithm is used iteratively to optimize the remaining unquantized coefficients of the designed filter in the least-squares sense when one or more of the coefficients take on discrete values, till all of the filter coefficients are quantized. The method is simple and the performance is comparable with that of the existing methods.

关键词： sampling structure conversion Lagrange multiplier approach tree search algorithm

来源：评论

学校读者我要写书评

暂无评论

algorithms for set stabilisation of Boolean control networks

引用

IET CONTROL THEORY AND APPLICATIONS 2018年第10期12卷 1527-1532页

作者： Ma, Yilin Han, Ruizhu Southeast Univ Sch Econ & Management Nanjing 210096 Jiangsu Peoples R China

This study addresses two algorithms for set stabilisation of Boolean control networks (BCNs). Based on the semi-tensor product tool, the dynamics of BCNs can be characterised by its labelled digraph, which derived an graphical expression for the set stabilisation of BCNs. Then, two tree-search algorithms, namely, generalised breadth-first search and generalised depth-first search, are proposed for the first time to decide the controllers for the set stabilisation of BCNs. In addition, some properties concerning the tree search algorithm are proposed. Finally, an example is employed to show the application of the presented algorithms.

关键词： tensors set theory tree searching Boolean functions directed graphs network theory (graphs) stability set stabilisation Boolean control networks semitensor product tool tree-search algorithms generalised breadth-first search generalised depth-first search tree search algorithm BCN labelled digraph

来源：评论

学校读者我要写书评

暂无评论

tree search Based Configurable Joint Detection and Decoding algorithms for MIMO Systems

Tree Search Based Configurable Joint Detection and Decoding ...

引用

International Conference on Computing, Networking and Communications

作者： Chien-Hao Huang Chia-Po Yu Chung-An Shen Department of Electronic and Computer Engineering National Taiwan University of Science and Technology

ISBN: (纸本)9781467385800

关键词： MIMO Joint detection and decoding tree search algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：