Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied through a bipartite graph whose characteristi...
详细信息
Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied through a bipartite graph whose characteristics affect the performance. This paper proposes a low-complexity method to improve the performance of LDPC codes by selectively removing some cycles from the associated bipartite graph. The method is based on a modified version of the breadthfirstsearch (BFS) algorithm that we call modified BFS (MBFS), which is applied to find cycles, and a greedy procedure to eliminate them. Throughout the paper we will give a detailed description of the algorithm proposed and analytically study its complexity. Simulation results show that this girth conditioning method applied to some classes of codes, whose structure allows further optimization, can lead to a significative complexity reduction and a performance improvements with respect to other methods.
The Internet of Things (IoT) has become widely popular due to its rapid progress and broad range of practical uses, which have significantly impacted our daily lives. One such key utilization of IoT is making consumer...
详细信息
The Internet of Things (IoT) has become widely popular due to its rapid progress and broad range of practical uses, which have significantly impacted our daily lives. One such key utilization of IoT is making consumer electronics interactive, interconnected and self-responsible by means of sensors and Internet. Sensors play a crucial role as the primary technology that enables the Internet of Things (IoT) and its various applications. The inherent difficulty hinders the further growth of IoT. One such problem is utilizing minimum number of sensors to achieve maximum coverage and connectivity in the network. The most accurate method to encounter this issue is optimal Sensor Placement (OSP). OSP predetermines the sensor's position for its deployment to attain maximum network coverage and connectivity. Hence, this paper proposes a coverage and connectivity-preserving hierarchical algorithm based on discrete Haar wavelet transform for optimal sensor placement algorithm. The proposed algorithm utilizes discrete Haar wavelet transform, for identifying sensor's position and to ensure connectivity breadth first search algorithm is used. Further, to enhance the coverage, proposed algorithm determines redundant sensors and redeploy it in determined spots. The results obtained from the proposed algorithm effectively address the research problem and attain better results compared with the existing efficient methods.
In recent years,more and more attention has been paid to the research and application of graph *** the most typical representative of graph structure algorithm,breadth first search algorithm is widely used in many ***...
详细信息
In recent years,more and more attention has been paid to the research and application of graph *** the most typical representative of graph structure algorithm,breadth first search algorithm is widely used in many ***,the performance of traditional serial breadthfirstsearch(BFS)algorithm is often very low in specific areas,especially in large-scale graph structure ***,it is very common to deal with large-scale graph structure in scientific *** the same time,the computing performance of supercomputer has also made great ***’s self-developed supercomputer system Sunway TaihuLight(SW)has won the top 500 list for three consecutive *** huge computing performance of supercomputer is the key to solve this *** can be seen that if we use the computing power of supercomputing to solve the problem of large-scale graph structure traversal,the efficiency of graph structure traversal will be greatly *** paper expounds how to realize the breadth first search algorithm of graph structure on the Sunway TaihuLight,and achieved some *** this way,MPI and thread library called athread of SW platform are used,and the traversal performance is improved dozens of times through the above related technologies and some partition methods of graph structure.
暂无评论