Ultra-dense networking is widely accepted as a promising enabling technology to realize high power and spectrum efficient communications in future 5G communication systems. Although joint resource allocation schemes p...Ultra-dense networking is widely accepted as a promising enabling technology to realize high power and spectrum efficient communications in future 5G communication systems. Although joint resource allocation schemes promise huge performance improvement at the cost of cooperation among base stations,the large numbers of user equipment and base station make jointly optimizing the available resource very challenging and even prohibitive. How to decompose the resource allocation problem is a critical issue. In this paper,we exploit factor graphs to design a distributed resource allocation algorithm for ultra dense networks,which consists of power allocation,subcarrier allocation and cell association. The proposed factor graph based distributed algorithm can decompose the joint optimization problem of resource allocation into a series of low complexity subproblems with much lower dimensionality,and the original optimization problem can be efficiently solved via solving these subproblems iteratively. In addition,based on the proposed algorithm the amounts of exchanging information overhead between the resulting subprob-lems are also reduced. The proposed distributed algorithm can be understood as solving largely dimensional optimization problem in a soft manner,which is much preferred in practical scenarios. Finally,the performance of the proposed low complexity distributed algorithm is evaluated by several numerical results.展开更多
In order to overcome the disadvantages of low accuracy rate, high complexity and poor robustness to image noise in many traditional algorithms of cloud image detection, this paper proposed a novel algorithm on the bas...In order to overcome the disadvantages of low accuracy rate, high complexity and poor robustness to image noise in many traditional algorithms of cloud image detection, this paper proposed a novel algorithm on the basis of Markov Random Field (MRF) modeling. This paper first defined algorithm model and derived the core factors affecting the performance of the algorithm, and then, the solving of this algorithm was obtained by the use of Belief Propagation (BP) algorithm and Iterated Conditional Modes (ICM) algorithm. Finally, experiments indicate that this algorithm for the cloud image detection has higher average accuracy rate which is about 98.76% and the average result can also reach 96.92% for different type of image noise.展开更多
LDPC codes are finding increasing use in applications requiring reliable and highly efficient information transfer over bandwidth. An LDPC code is defined by a sparse parity-check matrix and can be described by a bipa...LDPC codes are finding increasing use in applications requiring reliable and highly efficient information transfer over bandwidth. An LDPC code is defined by a sparse parity-check matrix and can be described by a bipartite graph called Tanner graph. Loops in Tanner graph prevent the sum-product algorithm from converging. Further, loops, especially short loops, degrade the performance of LDPC decoder, because they affect the independence of the extrinsic information exchanged in the iterative decoding. This paper, by graph theory, deduces cut-node tree graph of LDPC code, and depicts it with matrix. On the basis of tree matrix algorithm, whole depictions of loops can be figured out, providing of foundation for further research of relations between loops and LDPC codes’ performance.展开更多
基金supported by China Mobile Research Institute under grant [2014] 451National Natural Science Foundation of China under Grant No. 61176027+2 种基金Beijing Natural Science Foundation(4152047)the 863 project No.2014AA01A701111 Project of China under Grant B14010
文摘Ultra-dense networking is widely accepted as a promising enabling technology to realize high power and spectrum efficient communications in future 5G communication systems. Although joint resource allocation schemes promise huge performance improvement at the cost of cooperation among base stations,the large numbers of user equipment and base station make jointly optimizing the available resource very challenging and even prohibitive. How to decompose the resource allocation problem is a critical issue. In this paper,we exploit factor graphs to design a distributed resource allocation algorithm for ultra dense networks,which consists of power allocation,subcarrier allocation and cell association. The proposed factor graph based distributed algorithm can decompose the joint optimization problem of resource allocation into a series of low complexity subproblems with much lower dimensionality,and the original optimization problem can be efficiently solved via solving these subproblems iteratively. In addition,based on the proposed algorithm the amounts of exchanging information overhead between the resulting subprob-lems are also reduced. The proposed distributed algorithm can be understood as solving largely dimensional optimization problem in a soft manner,which is much preferred in practical scenarios. Finally,the performance of the proposed low complexity distributed algorithm is evaluated by several numerical results.
基金Supported by the National Natural Science Foundation of China (No. 61172047)
文摘In order to overcome the disadvantages of low accuracy rate, high complexity and poor robustness to image noise in many traditional algorithms of cloud image detection, this paper proposed a novel algorithm on the basis of Markov Random Field (MRF) modeling. This paper first defined algorithm model and derived the core factors affecting the performance of the algorithm, and then, the solving of this algorithm was obtained by the use of Belief Propagation (BP) algorithm and Iterated Conditional Modes (ICM) algorithm. Finally, experiments indicate that this algorithm for the cloud image detection has higher average accuracy rate which is about 98.76% and the average result can also reach 96.92% for different type of image noise.
文摘LDPC codes are finding increasing use in applications requiring reliable and highly efficient information transfer over bandwidth. An LDPC code is defined by a sparse parity-check matrix and can be described by a bipartite graph called Tanner graph. Loops in Tanner graph prevent the sum-product algorithm from converging. Further, loops, especially short loops, degrade the performance of LDPC decoder, because they affect the independence of the extrinsic information exchanged in the iterative decoding. This paper, by graph theory, deduces cut-node tree graph of LDPC code, and depicts it with matrix. On the basis of tree matrix algorithm, whole depictions of loops can be figured out, providing of foundation for further research of relations between loops and LDPC codes’ performance.
