Based on the quicksorting algorithm, this paper uses verilog language to implement the RTL design of the ID sorting module applied to the CAN bus controller, and performs functional simulation on the module. Simulati...
详细信息
ISBN:
(纸本)9781728189789
Based on the quicksorting algorithm, this paper uses verilog language to implement the RTL design of the ID sorting module applied to the CAN bus controller, and performs functional simulation on the module. Simulation results show that the ID sorting module designed in this paper can quickly sort up to 64 different ID numbers and output correct sequence to meet the design requirements. Using a parametric design strategy, the ID sorting module designed in this paper can configure parameters to achieve the function of sorting a larger number of random sequences to meet different needs, and has high scalability and practicality.
Compared with traditional HVDC transmission, modular multilevel converter(MMC) does not have the problems of reactive compensation and commutation failure. Besides, MMC has advantages over low harmonic components, whi...
详细信息
ISBN:
(纸本)9781538664612
Compared with traditional HVDC transmission, modular multilevel converter(MMC) does not have the problems of reactive compensation and commutation failure. Besides, MMC has advantages over low harmonic components, which is more suitable to establish the multiterminal DC transmission system. As for MMC, sorting all of the capacitors' voltages is used to achieve capacitor voltage balancing. However, if there are plenty of sub-modules (SMs) for each bridge arm, calculation amount increases a lot and sort time may lead to the failure of the capacitor voltage balancing. This paper proposes an optimization algorithm through the improvement of quick sort algorithm, aiming to reduce the calculation amount. By means of averaging the capacitors' voltages with time, it is available that all of the data only needs to be divided into two parts according to the number of triggering IGBT instead of sorting all of the sub-modules. In brief, it reduces the calculation amount and switching frequency a lot theoretically. By building a bipolar MMC-HVDC model with 401-level on PSCAD/EMTDC, the feasibility of this optimization algorithm can be tested and the corresponding time complexity can be analyzed as well.
value is introduced, quick sort algorithm is considered thoroughly, and a new IQSelect algorithm based on incomplete quick sort algorithms is proposed to quickly search the kth value of any randomly given sequence. In...
详细信息
value is introduced, quick sort algorithm is considered thoroughly, and a new IQSelect algorithm based on incomplete quick sort algorithms is proposed to quickly search the kth value of any randomly given sequence. In the new IQSelect algorithm, only parts of the items in sequence need to be sorted. More important, the number of items to be sorted is reduced greatly after every quicksort step by step. Then many data comparison and item swap operations are reduced, and the efficiency of finding the kth value is improved greatly. algorithm analysis shows that the time complexity of the new algorithm is 2n, much better than that of the existing algorithm, whose core module has time complexity 6.09n. At last, lots of experiments are done to compare the performance of IQSelect algorithm based on incomplete quick sort algorithm and the existing popular algorithm for finding the kth value of randomly given sequence. All Experiment results give the same conclusion as the algorithm analysis. The IQSelect algorithm gives a new idea for the kth value searching and the study of sortalgorithm, and is of great significance.
as random algorithm can assure fairness, moreover, it can solve some of the problems which the definite algorithm can't solve;the random algorithm has wide spread use. In this paper, it designed an algorithm with ...
详细信息
ISBN:
(纸本)9781424469772
as random algorithm can assure fairness, moreover, it can solve some of the problems which the definite algorithm can't solve;the random algorithm has wide spread use. In this paper, it designed an algorithm with time complexity of Theta(NlgN) to solve the probability weight oriented permutation problem, further, the algorithm need no extra space. The probability weight oriented random permutation algorithm does not only guarantee that the permutation is random, but it also guarantees that the element with higher weight has higher probability of ranking in the front of the permutation, and vice versa. Basically, there are two types of algorithms for random permutation, one for the same possibilities and the other for different possibilities. Compare the result of the test and the original probability weight, It shows that the permutation is random and the permutation embodies the probability weight of each element.
暂无评论