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

PAPR Reduction Based on parallel tabu search for Tone Reservation in OFDM Systems

IEEE WIRELESS COMMUNICATIONS LETTERS 2019年第2期8卷 576-579页

作者： Wang, Yajun Zhang, Renjie Li, Jun Shu, Feng Jiangsu Univ Sci & Technol Dept Informat & Computat Sci Zhangjiagang 215600 Peoples R China Nanjing Univ Sci & Technol Sch Elect & Opt Engn Nanjing 210094 Jiangsu Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing Jiangsu Peoples R China Natl Res Tomsk Polytech Univ Sch Comp Sci & Robot Tomsk 634050 Russia

In this letter, we focus on the high peak to average power ratio (PAPR) reduction problem in tone reservation-based orthogonal frequency division multiplexing systems. We first propose a parallel tabu search (PTS)-based scheme to find a sub-optimal peak reduction tone (PRT) set. After finding the sub-optimal PRT set, we apply it in an adaptive iterative clipping and filtering (AICF) method for PAPR reduction. Furthermore, PAPR reduction and bit error rate (BER) performances are compared among the AICF method, the adaptive scaling, the adaptive amplitude clipping and the fast iterative shrinkage-thresholding algorithm schemes. Simulation results verify that the PTS-based PRT scheme can obtain better secondary peaks with lower computational complexity, and the AICF scheme effectively reduces PAPR with a faster convergence speed while its BER performance is only slightly worse than for the existing methods.

关键词： OFDM PAPR tone reservation parallel tabu search

来源：评论

学校读者我要写书评

暂无评论

Practical Train Crew Scheduling Problems Using parallel tabu search 57

Practical Train Crew Scheduling Problems Using Parallel Tabu...

引用

57th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE)

作者： Kokubo, Tatsuya Fukuyama, Yoshikazu Meiji Univ Grad Sch Adv Math Sci Tokyo Japan

ISBN: (纸本)9784907764609

This paper proposes parallel tabu search for practical train crew scheduling problems (CSPs). Especially for practical train CSPs and applications to train crew recovery problems, fast computation will be required. In order to obtain a solution quickly, the proposed method realizes parallelization of generation methods of neighborhood schedules and improved parallel tabu search using parallel computation is proposed for a practical CSP. The proposed method is applied to an actual timetable and it is verified that the method can speed up 4.6 times using 16 threads.

关键词： Train crew scheduling problem parallel tabu search combinatorial optimization problem

来源：评论

学校读者我要写书评

暂无评论

Practical Train Crew Scheduling Problems Using parallel tabu search

Practical Train Crew Scheduling Problems Using Parallel Tabu...

引用

SICE Annual Conference

作者： Tatsuya Kokubo Yoshikazu Fukuyama Graduate School of Advanced Mathematical Sciences Meiji University Tokyo Japan

关键词： Train crew scheduling problem parallel tabu search Combinatorial optimization problem

来源：评论

学校读者我要写书评

暂无评论

Solving the Resource Constrained Project Scheduling Problem using the parallel tabu search designed for the CUDA platform

引用

JOURNAL OF parallel AND DISTRIBUTED COMPUTING 2015年 77卷 58-68页

作者： Bukata, Libor Sucha, Premysl Hanzalek, Zdenek Czech Tech Univ Dept Control Engn Prague 12135 2 Czech Republic

The Resource Constrained Project Scheduling Problem, which is considered to be difficult to tackle even for small instances, is a well-known scheduling problem in the operations research domain. To solve the problem we have proposed a parallel tabu search algorithm to find high quality solutions in a reasonable time. We show that our parallel tabu search algorithm for graphics cards (GPUs) outperforms other existing tabu search approaches in terms of quality of solutions and the number of evaluated schedules per second. Moreover, the algorithm for graphics cards is about 10.5/42.7 times faster (J90 benchmark instances) than the optimized parallel/sequential algorithm for the Central Processing Unit (CPU). The same quality of solutions is achieved up to 5.4/22 times faster in comparison to the parallel/sequential CPU algorithm respectively. The advantages of the GPU version arise from the sophisticated data-structures and their suitable placement in the device memory, tailor-made methods, and last but not least the effective communication scheme. (C) 2014 Elsevier Inc. All rights reserved.

关键词： Resource Constrained Project Scheduling Problem parallel tabu search CUDA Homogeneous model GPU

来源：评论

学校读者我要写书评

暂无评论

A parallel tabu search for solving the primal buffer allocation problem in serial production systems

引用

COMPUTERS & OPERATIONS REsearch 2015年 64卷 97-112页

作者： Costa, A. Alfieri, A. Matta, A. Fichera, S. Univ Catania DII I-95125 Catania Italy Politecn Torino DIGEP I-10129 Turin Italy Shanghai Jiao Tong Univ Sch Mech Engn Shanghai 200030 Peoples R China

This paper presents a novel parallel tabu search (PTS) algorithm equipped with a proper adaptive neighborhood generation mechanism to solve the primal buffer allocation problem, which consists of minimizing the total buffer capacity of a serial production system under a minimum throughput rate constraint. An evaluative method based on a specific algorithm has been implemented to simulate the system behavior. In order to validate the effectiveness of the proposed PTS a mixed integer linear programming-based simulation/optimization approach and several metaheuristics from the relevant literature have been implemented. Since most metaheuristics are sensitive to the parameter setting, a proper calibration analysis based on a non-parametric test has been performed. Then, a comprehensive comparison analysis, concerning with both quality of solutions and computational efficiency, has been carried out. Finally, through the numerical results obtained from PTS, a multi-factorial experimental analysis has been developed to analyze the influencing factors of the problem under investigation. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Differential evolution Genetic algorithm Binary search Flow lines Design parallel tabu search

来源：评论

学校读者我要写书评

暂无评论

A parallel tabu search Algorithm with Solution Space Partition for Cohesive Clustering Problems 15th

A Parallel Tabu Search Algorithm with Solution Space Partiti...

引用

15th International Conference on Algorithms and Architectures for parallel Processing (ICA3PP)

作者： Xu, Zheng Cao, Buyang Tongji Univ Sch Software Engn Shanghai 201804 Peoples R China Tongji Univ China Intelligent Urbanizat Cocreat Ctr High Dens Shanghai 200092 Peoples R China

ISBN: (纸本)9783319271613;9783319271606

Clustering analysis plays an important role in a wide range of fields including data mining, pattern recognition, machine learning and many other areas. In this paper, we present a parallel tabu search algorithm for clustering problems. A permanent tabu list is proposed to partition the solution space for parallelization. Moreover, this permanent tabu list can also reduce the neighborhood space and constrain the election of candidates. The proposed approach is evaluated by clustering some specific dataset. And experimental results and speedups obtained show the efficiency of the parallel algorithm.

关键词： Combinatorial optimization tabu search Clustering analysis parallel tabu search parallel clustering Solution space partition

来源：评论

学校读者我要写书评

暂无评论

Solving Multi-criteria Vehicle Routing Problem by parallel tabu search on GPU

引用

Procedia Computer Science 2013年 18卷 2529-2532页

作者： Jagiełło Szymon Żelazny Dominik Institute of Computer Engineering Control and Robotics Wroclaw University of Technology Janiszewskiego 11-17 50-372 Wroclaw Poland

Transportation plays a crucial role in both production and service industry. In modern times, the importance of supplying the goods on time to warehouses, production units and finally to the customers is not lost on logistic companies. Vehicle Routing Problems (VRP) models evolved to be more advanced, which led to the growth of computational complexity. Optimizing transportation routes for companies means performing complex computations and doing so in the shortest possible amounts of time. Graphics Processing Units (GPUs) provide massive computation when the needed operations are properly parallelized. nVidia GPUs are equipped with Compute Unified Device Architecture (CUDA), so applying parallel algorithms is not lim- ited to complex workstations or specialized computers. This work emphasizes the value of using parallel tabu search (TS) algorithm over sequential TS algorithm and its application to multicriteria discrete optimization of Distance-constrained VRP.

关键词： Multi-criteria parallel tabu search Distance-constrained VRP OpenCL

来源：评论

学校读者我要写书评

暂无评论

Tone Injection for PAPR Reduction Using parallel tabu search Algorithm in OFDM Systems

Tone Injection for PAPR Reduction Using Parallel Tabu Search...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Hou, Jun Tellambura, Chintha Ge, Jianhua Xidian Univ State Key Lab Integrated Serv Networks Xian Peoples R China

ISBN: (纸本)9781467309219;9781467309202

The main drawback of orthogonal frequency division multiplexing (OFDM) systems is the high peak-to-average power ratio (PAPR), which leads to performance degradation and power inefficiency. Tone injection (TI) is a distortionless technique that can reduce PAPR efficiently without incurring data rate loss or extra side information. However, optimal TI requires an exhaustive search over all combinations of possible constellations, which is an NP-hard problem. Suboptimal algorithms, achieving different tradeoffs between the PAPR reduction and complexity, have thus been developed. In this paper, we introduce a novel parallel tabu search algorithm for TI. Simulation results show that the proposed algorithm achieves significant PAPR reduction while maintaining low complexity.

关键词： orthogonal frequency division multiplexing tone injection (TI) parallel tabu search peak-to-average power ratio

来源：评论

学校读者我要写书评

暂无评论

Tone Injection for PAPR Reduction Using parallel tabu search Algorithm in OFDM Systems

Tone Injection for PAPR Reduction Using Parallel Tabu Search...

引用

IEEE Global Communications Conference

作者： Jun Hou Chintha Tellambura Jianhua Ge The State Key Lab. of Integrated Service Networks Xidian University Department of Electrical and Computer Engineering University of Alberta

ISBN: (纸本)9781467309202

The main drawback of orthogonal frequency division multiplexing (OFDM) systems is the high peak-to-average power ratio (PAPR), which leads to performance degradation and power inefficiency. Tone injection (TI) is a distortionless technique that can reduce PAPR efficiently without incurring data rate Joss or extra side information. However, optimal TI requires an exhaustive search over all combinations of possible constellations, which is an NP-hard problem. Suboptimal algorithms, achieving different tradeoffs between the PAPR reduction and complexity, have thus been developed. In this paper, we introduce a novel parallel tabu search algorithm for TI. Simulation results show that the proposed algorithm achieves significant PAPR reduction while maintaining low complexity.

关键词： Orthogonal frequency division multiplexing Tone injection (TI) parallel tabu search Peak-to-average power ratio Peak to average power ratio Orthogonal frequency division multiplexing searchING ALGORITHM tabu search Titanium Thallium

来源：评论

学校读者我要写书评

暂无评论

Partial Transmit Sequences for PAPR Reduction Using parallel tabu search Algorithm in OFDM Systems

引用

IEEE COMMUNICATIONS LETTERS 2011年第9期15卷 974-976页

作者： Taspinar, Necmi Kalinli, Adem Yildirim, Mahmut Erciyes Univ Dept Elect & Elect Engn Kayseri Turkey Erciyes Univ Kayseri Vocat Tech Sch Kayseri Turkey Bozok Univ Dept Elect & Elect Engn Yozgat Turkey

In this letter, partial transmit sequences (PTS) based on parallel tabu search (parallel TS-PTS) scheme is proposed to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. PTS is a distortionless PAPR reduction technique, but its high search complexity for finding optimal phase factors must be reduced for usable applications. parallel TS-PTS is compared to different PTS schemes for PAPR reduction and search complexity performances. The simulation results show that the proposed parallel TS-PTS method provides good PAPR reduction and bit-error-rate (BER) performances.

关键词： OFDM PAPR PTS parallel tabu search tabu search high power amplifier (HPA)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：