The traditional control methods are not able to keep control performance in a high level because response speed becomes more important for industrial control. This paper presented a fast predictive control algorithm, ...
详细信息
ISBN:
(纸本)9781479958252
The traditional control methods are not able to keep control performance in a high level because response speed becomes more important for industrial control. This paper presented a fast predictive control algorithm, which was easy and simple to calculate and the principle of algorithm was very clear and greatly improved the speed of response and calculation, as well as demonstrated the principles of fast algorithms and operation process of the algorithm. Finally, we analyzed the stability, dynamic characteristics and steady state characteristics of system, and used lead-lag correction link to improve the performance of system. The results of simulation demonstrated that all of methods and improved algorithms were feasibility.
Adaptive resource allocation is an important issue in OFDM systems. In this paper, a new bandwidth optimization method to search for all unusable sub-channels is proposed. The new method proposed in this paper can be ...
详细信息
ISBN:
(纸本)9780819495884
Adaptive resource allocation is an important issue in OFDM systems. In this paper, a new bandwidth optimization method to search for all unusable sub-channels is proposed. The new method proposed in this paper can be applied conveniently to different optimization problems (RA or MA) only by changing the initial value of the water-filling level and the formula when update the water-filling level. Simulation results show that the improved algorithm proposed based on the new method also can achieve the optimal solution to that of the well-known optimal algorithm - Greedy algorithm with lower computational complexity.
A new fast matrix multiplication algorithm is proposed, which, as compared to the Winograd algorithm, has a lower multiplicative complexity equal to WM ≈0.437n3 multiplication operations. Based on a goal-directed tra...
详细信息
Despite the remarkable coding gains exhibited by the recently released new-generation video coding standards, their serious computational complexity will pose a significant challenge in coding latency to practical app...
详细信息
ISBN:
(纸本)9798400701085
Despite the remarkable coding gains exhibited by the recently released new-generation video coding standards, their serious computational complexity will pose a significant challenge in coding latency to practical applications. Therefore, the corresponding low-complexity optimizations assume paramount importance. To facilitate the research in this field, the first open source software library for video coding fast algorithm implementation, namely OpenfastVC, is proposed in this paper. Specifically, OpenfastVC offers the outputting and processing of the intermediate coding information, e.g., the CU partitioning results, which is indispensable to fast algorithm design. To facilitate the integration of the designed algorithms, OpenfastVC also provides application programming interfaces (APIs) for direct control over the encoding process. Moreover, the existing typical fast algorithms are further implemented in OpenfastVC, enabling researchers to evaluate the performance of their algorithm effortlessly. The release of this library is highly favorable for the design, implementation, and evaluation of video coding fast algorithms, thereby fostering the widespread adoption of the new coding standards. The open source library for OpenfastVC is available at https://***/OpenCompression/OpenfastV C.
In order to relax need of the optimal regularization parameter to be estimated, a cooperative recurrent neural network (CRNN) algorithm for image restoration was presented by solving a generalized least absolute devia...
详细信息
ISBN:
(纸本)9781424467129
In order to relax need of the optimal regularization parameter to be estimated, a cooperative recurrent neural network (CRNN) algorithm for image restoration was presented by solving a generalized least absolute deviation ( GLAD) problem. This paper proposes a fast algorithm for solving a constrained l(1)-norm problem which contains the GLAD problem as its special case. The proposed iterative algorithm is guaranteed to converge globally to an optimal estimate under a fixed step length. Compared with the CRNN algorithm being continuous time, the proposed iterative algorithm has a fast convergence speed. Illustrative examples with application to image restoration show that the proposed iterative algorithm has a much faster convergence rate than the CRNN algorithm.
Pentadiagonal Toeplitz systems of linear equations arise in many application areas. Because of the structure and many good properties of pentadiagonal Toeplitz matrices, they have been applied in Mechanical Control. B...
详细信息
ISBN:
(纸本)9783037850992
Pentadiagonal Toeplitz systems of linear equations arise in many application areas. Because of the structure and many good properties of pentadiagonal Toeplitz matrices, they have been applied in Mechanical Control. Based on [1], in this paper, we present an improved fast algorithm for solving symmetric pentadiagonal Toeplitz systems.
This paper presents a new fast algorithm for fuzzy clustering problem, based on the properties of fuzzy similarity relations and fuzzy equivalency relations. The fast algorithm has been validated under matlab, with th...
详细信息
ISBN:
(纸本)9780769538044
This paper presents a new fast algorithm for fuzzy clustering problem, based on the properties of fuzzy similarity relations and fuzzy equivalency relations. The fast algorithm has been validated under matlab, with the operation amount less than half and speeds faster 2 times than the traditional algorithm at least.
Nowadays, the emergence of online social networks have empowered people to easily share information and media with friends. Interacting users of social networks with similar users and their friends form community stru...
详细信息
ISBN:
(纸本)9781509043354
Nowadays, the emergence of online social networks have empowered people to easily share information and media with friends. Interacting users of social networks with similar users and their friends form community structures of networks. Uncovering communities of the online users in social networks plays an important role in network analysis with many applications such as finding a set of expert users, finding a set of users with common activities, finding a set of similar people for marketing goals, to mention a few. Although, several algorithms for disjoint community detection have been presented in the literature, online users simultaneously interact with their friends having different interests. Also users are able to join more than one group at the same time which leads to the formation of overlapping communities. Thus, finding overlapping communities can realize a realistic analysis of networks. In this paper, we propose a fast algorithm for overlapping community detection. In the proposed algorithm, in the first phase, the Louvain method is applied to the given network and in the second phase a belonging matrix is updated where an each element of belonging matrix determines how much a node belongs to a community. Finally, some of the found communities are merged based on the modularity measure. The performance of the proposed algorithm is studied through the simulation on the popular networks which indicates that the proposed algorithm outperforms several well-known overlapping community detection algorithms.
It is well known that the circulant matrices are very important and special matrix. In recent years, various type of circulant matrices have been applied in such as signal dealing and oil exploration, and so on. In th...
详细信息
ISBN:
(纸本)9780769538921
It is well known that the circulant matrices are very important and special matrix. In recent years, various type of circulant matrices have been applied in such as signal dealing and oil exploration, and so on. In this paper, motivated by In we give a fast algorithm for evaluating the m-th Power of level- k(r(1),r(2),...,r(k)) -circulant matrices of type (n(1),n(2),...,n(k)). By [5] and [10], we can see the complexity of computation can reduce n times.
The complexity of hardware implementation of the third generation audio video coding standard (AVS3) has been significantly improved due to more flexible intra prediction methods. In this paper, an efficient intra mod...
详细信息
ISBN:
(纸本)9781728192017
The complexity of hardware implementation of the third generation audio video coding standard (AVS3) has been significantly improved due to more flexible intra prediction methods. In this paper, an efficient intra mode decision algorithm for parallel hardware architecture of the AVS3 intra encoder is presented. The key idea is to process coding units (CUs) in parallel, including intra prediction and estimating Rate-Distortion (RD) cost for mode decision. Specially, regression tree-based fast algorithm is adopted to decide several preselected modes, together with sufficient consideration into the tradeoff between RD-cost and complexity of prediction engines. In order to obtain the optimal intra mode and improve throughput, prediction module and Hadamard-cost module are devised to process all the candidate modes in parallel. To the best of our knowledge, this is the first parallel hardware architecture of AVS3 intra prediction. Compared with the HPM-6.0 reference software, the proposed algorithm leads to a reduction of 78% in computation workload, while the average BD-PSNR is -0.40 dB for the common test videos. When implemented on the Vertex UltraScale VU440 targeting at 300MHz, the proposed design can support the real-time encoding of 4K videos at 30fps.
暂无评论