scholarly journals A Heuristic Algorithm for Rate-Profiling of Polarization Adjusted Convolutional (PAC) codes

2021 ◽  
Author(s):  
Samir Kumar Mishra ◽  
Digvijay Katyal ◽  
Sarvesha Anegundi Ganapathi
Keyword(s):  
Heuristic Algorithm ◽  
Minimum Distance ◽  
Information Theoretic ◽  
Simulation Results ◽  
Rate Profile

<div>In this paper, we propose a heuristic algorithm for rate-profile construction of Arikan's Polarization Assisted Convolutional (PAC) codes. This method can be used for any blocklength, rate and convolutional precoding polynomial. The proposed algorithm tries to create a rate-profile for which the corresponding PAC code is, in a sense, locally optimized for having maximum possible minimum distance.</div><div>Simulation results show that PAC codes constructed with the proposed algorithm perform better in terms of frame erasure rate (FER) compared to the PAC codes constructed with rate profiling designs in existing literature for various list lengths. Further, by using a (64, 32) PAC code as an example, it is shown that the choice of convolutional precoding polynomial can have a significant impact on FER performance. Finally, we demonstrate that for a target FER of $\mathbf{10^{-5}}$, (128, 72) PAC codes constructed with our proposed algorithm is just 0.35 dB away from the information theoretic limit at this blocklength.</div>

scholarly journals A Heuristic Algorithm for Rate-Profiling of Polarization Adjusted Convolutional (PAC) codes

2021 ◽  
Author(s):  
Samir Kumar Mishra ◽  
Digvijay Katyal ◽  
Sarvesha Anegundi Ganapathi
Keyword(s):  
Heuristic Algorithm ◽  
Minimum Distance ◽  
Information Theoretic ◽  
Simulation Results ◽  
Rate Profile

<div>In this paper, we propose a heuristic algorithm for rate-profile construction of Arikan's Polarization Assisted Convolutional (PAC) codes. This method can be used for any blocklength, rate and convolutional precoding polynomial. The proposed algorithm tries to create a rate-profile for which the corresponding PAC code is, in a sense, locally optimized for having maximum possible minimum distance.</div><div>Simulation results show that PAC codes constructed with the proposed algorithm perform better in terms of frame erasure rate (FER) compared to the PAC codes constructed with rate profiling designs in existing literature for various list lengths. Further, by using a (64, 32) PAC code as an example, it is shown that the choice of convolutional precoding polynomial can have a significant impact on FER performance. Finally, we demonstrate that for a target FER of $\mathbf{10^{-5}}$, (128, 72) PAC codes constructed with our proposed algorithm is just 0.35 dB away from the information theoretic limit at this blocklength.</div>

scholarly journals PENYELESAIAN MULTI TRAVELING SALESMAN PROBLEM DENGAN ALGORITMA GENETIKA

2017 ◽  
Vol 6 (1) ◽  
pp. 1
Author(s):  
NI KADEK MAYULIANA ◽  
EKA N. KENCANA ◽  
LUH PUTU IDA HARINI
Keyword(s):  
Genetic Algorithm ◽  
Traveling Salesman Problem ◽  
Heuristic Algorithm ◽  
Minimum Distance ◽  
Processing Time ◽  
Traveling Salesman ◽  
Running Time ◽  
Shortest Route ◽  
Time Required

Genetic algorithm is a part of heuristic algorithm which can be applied to solve various computational problems. This work is directed to study the performance of the genetic algorithm (GA) to solve Multi Traveling Salesmen Problem (multi-TSP). GA is simulated to determine the shortest route for 5 to 10 salesmen who travelled 10 to 30 cities. The performance of this algorithm is studied based on the minimum distance and the processing time required for 10 repetitions for each of cities-salesmen combination. The result showed that the minimum distance and the processing time of the GA increase consistently whenever the number of cities to visit increase. In addition, different number of sales who visited certain number of cities proved significantly affect the running time of GA, but did not prove significantly affect the minimum distance.

Pedestrian choice behavior analysis and simulation of ticket gate machine in rail transit station

2019 ◽  
Vol 30 (04) ◽  
pp. 1950027 ◽  
Author(s):  
Yongxing Li ◽  
David Z.W. Wang ◽  
Yanyan Chen ◽  
Chengcheng Song ◽  
Hongfei Jia ◽  
...  
Keyword(s):  
Simulation Model ◽  
Minimum Distance ◽  
Choice Behavior ◽  
Simulation Software ◽  
Rail Transit ◽  
Matlab Simulation ◽  
Behavior Simulation ◽  
Minimum Number ◽  
Simulation Results ◽  
Pedestrian Simulation

Considering pedestrian preferences for the minimum distance, the minimum number of queuing pedestrians and the shortest estimated time, three pedestrian choice strategies of ticket gate machine are proposed. Pedestrian choice strategies of ticket gate machine are added into pedestrian simulation model which is based on cellular automata, and pedestrian choice behavior simulation model of ticket gate machine is obtained. On the platform of MATLAB simulation software, pedestrian choice behavior is simulated. Simulation results indicate that choice strategies of ticket gate machine proposed in this paper describe pedestrian choice behavior well, and it needs to consider the ratio of bidirectional pedestrian generation rate in the process of setting ticket gate machines in the bidirectional passage.

Service Requirements Distribution Algorithms in Carpooling Problem

2013 ◽  
Vol 409-410 ◽  
pp. 1296-1302
Author(s):  
Shu Xia Dong ◽  
Zeng Zhen Shao
Keyword(s):  
Heuristic Algorithm ◽  
Traffic Congestion ◽  
Clustering Algorithm ◽  
Utilization Rate ◽  
Vehicle Simulation ◽  
Total Vehicle ◽  
Matching Degree ◽  
Simulation Results ◽  
Distribution Algorithms ◽  
Heuristic Clustering

The traffic congestion problem and logistics costs are becoming more and more serious. There is no doubt that carpooling may not only improve vehicle utilization rate but also reduce logistics costs. In multi-vehicle environment, how to distribute service requirements to a proper vehicle is to be solved firstly. In this paper, a heuristic clustering algorithm is introduced to solve grouping progress in deterministic carpooling problem. Based on characteristics of service requirements and vehicles, the conception matching degree and heuristic algorithm are proposed in order to distribute requirements into one specific vehicle. Simulation results show that the algorithm can improve the success ride rate greatly and reduce total vehicle costs.

Accumulate-Repeat-Delay-Partial-Delay Codes

2011 ◽  
Vol 135-136 ◽  
pp. 167-170
Author(s):  
Zhong Liang Li ◽  
Guo Jiang Xia
Keyword(s):  
Channel Coding ◽  
Iterative Decoding ◽  
Minimum Distance ◽  
Ldpc Codes ◽  
Node Degree ◽  
Coding Scheme ◽  
Variable Node ◽  
Partial Delay ◽  
Irregular Ldpc Codes ◽  
Simulation Results

Inspired by Accumulate-Repeat-Accumulate (ARA) codes, in this letter we propose a new channel coding scheme called Accumulate-Repeat-Delay-Partial-Delay (ARDPD) codes. Contrary to ARA codes, ARDPD codes simultaneously achieve good threshold and linear minimum distance. Based on EXIT for LDPC codes, we show that for maximum variable node degree 5, the threshold of ARDPD codes outperforms the best known unstructured irregular LDPC codes. Iterative decoding simulation results show that the proposed codes perform as predicted.

Design and Simulation of Optical 4-Channel Demultiplexer Using Photonic Crystals

2019 ◽  
Vol 40 (1) ◽  
pp. 17-20 ◽  
Author(s):  
Abdulhamid Zahedi ◽  
Fariborz Parandin ◽  
Mohammad Mehdi Karkhanehchi ◽  
Hosein Habibi Shams ◽  
Sahbasadat Rajamand
Keyword(s):  
Photonic Crystals ◽  
Minimum Distance ◽  
Ring Resonator ◽  
Size Reduction ◽  
Band Spectrum ◽  
Pass Band ◽  
Simulation Results

Abstract In this paper, a 4-channel demultiplexer for WDM systems is designed by using 2-dimensional photonic crystals with square structure. Various wavelengths can be conducted in the certain paths of crystals using defects that look like ring resonator. The characteristic of this demultiplexer can be analyzed by obtaining the pass band spectrum. The property of this designation relative to previous works can be stated as size reduction, minimum crosstalk in output channels, minimum distance (about nm) for distinct wavelengths in output bands and bandwidth increasing in consequence. These improvements have been verified by simulation results.

Weighted Subspace Fitting DOA Estimation Based on Shuffled Frog Leaping Algorithm

2013 ◽  
Vol 411-414 ◽  
pp. 1049-1052
Author(s):  
Zhi Cheng Zhang ◽  
Xiao Hui Yu ◽  
Hai Xin Sun
Keyword(s):  
Heuristic Algorithm ◽  
Optimization Problem ◽  
Doa Estimation ◽  
Heuristic Methods ◽  
Multimodal Optimization ◽  
Shuffled Frog Leaping Algorithm ◽  
Subspace Fitting ◽  
Shuffled Frog Leaping ◽  
Simulation Results ◽  
Computation Load

In this paper, shuffled frog leaping algorithm (SFLA) is used to reduce the computation load of weighted subspace fitting (WSF) method for DOA estimation. As a recently proposed meta-heuristic algorithm, SFLA is suitable to solve the nonlinear multimodal optimization problem which WSF method encounters, so it offers an excellent alternative to the conventional methods in WSF-DOA estimation. Thus, the feasibility of SFLA applying to WSF-DOA estimation is analyzed, and its performance is compared with other popular meta-heuristic methods. Simulation results demonstrate that the proposed method is more efficient in computation and statistical performance.

scholarly journals Obstacle Avoidance of Semi-Trailers Based on Nonlinear Model Predictive Control

2019 ◽  
Vol 10 (4) ◽  
pp. 72
Author(s):  
Guoxing Bai ◽  
Chen Liang ◽  
Yu Meng ◽  
Li Liu ◽  
Weidong Luo ◽  
...  
Keyword(s):  
Obstacle Avoidance ◽  
Predictive Control ◽  
Minimum Distance ◽  
Safety Margin ◽  
Autonomous Driving ◽  
Nonlinear Model Predictive Control ◽  
Middle Line ◽  
Road Vehicles ◽  
Simulation Results ◽  
Core Part

Obstacle avoidance is a core part of the autonomous driving of off-road vehicles, such as semi-trailers. Due to the long length of semi-trailers, the traditional obstacle avoidance controller based on the circumcircle model can ensure that there is no collision between the semi-trailer and the obstacle, but it also greatly reduces the passable area. To solve this problem, we propose a new obstacle avoidance model. In this model, the distance between the obstacle and the middle line of semi-trailers is used as the indicator of obstacle avoidance. Based on this model, we design a new obstacle avoidance controller for semi-trailers. The simulation results show that the proposed controller can ensure that no collision occurs between the semi-trailer and the obstacle. The minimum distance between the obstacle center and the semi-trailer body trajectory is greater than the sum of the obstacle radius and the safety margin. Compared with the traditional obstacle avoidance controller based on the circumcircle model, the proposed controller greatly reduces the error between the semi-trailer and the reference path during obstacle avoidance.

scholarly journals UNIQUE ALGORITHM FOR SOLVING OPTIMAL REACTIVE POWER DISPATCH PROBLEM

2017 ◽  
Vol 5 (2) ◽  
pp. 122-134
Author(s):  
K. Lenin
Keyword(s):  
Minimum Distance ◽  
Antarctic Krill ◽  
Reactive Power ◽  
Test System ◽  
Krill Herd Algorithm ◽  
Optimal Reactive Power Dispatch ◽  
Power Dispatch ◽  
Krill Herd ◽  
Reactive Power Dispatch ◽  
Simulation Results

In this paper, a new algorithm based on krill herd actions, named as Antarctic krill Herd Algorithm (AKHA) is proposed for solving optimal reactive power dispatch problem. The AKHA algorithm is based on behavior of krill individuals. The minimum distance of each individual krill from food and from uppermost density of the herd are deliberated as the foremost mission for the krill movement. Projected AKHA algorithm has been tested in standard IEEE 30 bus test system and simulation results shows clearly about the good performance of the proposed algorithm in reducing the real power loss and voltage stability also improved.

Sign in / Sign up

Export Citation Format

Share Document