Non-uniform quantization for messages in Low-Density Parity-Check(LDPC)decoding canreduce implementation complexity and mitigate performance loss.But the distribution of messagesvaries in the iterative decoding.This l...Non-uniform quantization for messages in Low-Density Parity-Check(LDPC)decoding canreduce implementation complexity and mitigate performance loss.But the distribution of messagesvaries in the iterative decoding.This letter proposes a variable non-uniform quantized Belief Propaga-tion(BP)algorithm.The BP decoding is analyzed by density evolution with Gaussian approximation.Since the probability density of messages can be well approximated by Gaussian distribution,by theunbiased estimation of variance,the distribution of messages can be tracked during the iteration.Thusthe non-uniform quantization scheme can be optimized to minimize the distortion.Simulation resultsshow that the variable non-uniform quantization scheme can achieve better error rate performance andfaster decoding convergence than the conventional non-uniform quantization and uniform quantizationschemes.展开更多
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.展开更多
Gaussian belief propagation algorithm(GaBP) is one of the most important distributed algorithms in signal processing and statistical learning involving Markov networks. It is well known that the algorithm correctly co...Gaussian belief propagation algorithm(GaBP) is one of the most important distributed algorithms in signal processing and statistical learning involving Markov networks. It is well known that the algorithm correctly computes marginal density functions from a high dimensional joint density function over a Markov network in a finite number of iterations when the underlying Gaussian graph is acyclic. It is also known more recently that the algorithm produces correct marginal means asymptotically for cyclic Gaussian graphs under the condition of walk summability(or generalised diagonal dominance). This paper extends this convergence result further by showing that the convergence is exponential under the generalised diagonal dominance condition,and provides a simple bound for the convergence rate. Our results are derived by combining the known walk summability approach for asymptotic convergence analysis with the control systems approach for stability analysis.展开更多
机械钻速(rate of penetration,ROP)是钻井作业优化和减少成本的关键因素,钻井时有效地预测ROP是提升钻进效率的关键。由于井下钻进时复杂多变的情况和地层的非均质性,通过传统的ROP方程和回归分析方法来预测钻速受到了一定的限制。为...机械钻速(rate of penetration,ROP)是钻井作业优化和减少成本的关键因素,钻井时有效地预测ROP是提升钻进效率的关键。由于井下钻进时复杂多变的情况和地层的非均质性,通过传统的ROP方程和回归分析方法来预测钻速受到了一定的限制。为了实现对钻速的高精度预测,对现有BP (back propagation)神经网络进行优化,提出了一种新的神经网络模型,即动态自适应学习率的粒子群优化BP神经网络,利用录井数据建立目标井预测模型来对钻速进行预测。在训练过程中对BP神经网络进行优化,利用启发式算法,即附加动量法和自适应学习率,将两种方法结合起来形成动态自适应学习率的BP改进算法,提高了BP神经网络的训练速度和拟合精度,获得了更好的泛化性能。将BP神经网络与遗传优化算法(genetic algorithm,GA)和粒子群优化算法(particle swarm optimization,PSO)结合,得到优化后的动态自适应学习率BP神经网络。研究利用XX8-1-2井的录井数据进行实验,对比BP神经网络、PSO-BP神经网络、GA-BP神经网络3种不同的改进后神经网络的预测结果。实验结果表明:优化后的PSO-BP神经网络的预测性能最好,具有更高的效率和可靠性,能够有效的利用工程数据,在有一定数据采集量的区域提供较为准确的ROP预测。展开更多
基金the Aerospace Technology Support Foun-dation of China(No.J04-2005040).
文摘Non-uniform quantization for messages in Low-Density Parity-Check(LDPC)decoding canreduce implementation complexity and mitigate performance loss.But the distribution of messagesvaries in the iterative decoding.This letter proposes a variable non-uniform quantized Belief Propaga-tion(BP)algorithm.The BP decoding is analyzed by density evolution with Gaussian approximation.Since the probability density of messages can be well approximated by Gaussian distribution,by theunbiased estimation of variance,the distribution of messages can be tracked during the iteration.Thusthe non-uniform quantization scheme can be optimized to minimize the distortion.Simulation resultsshow that the variable non-uniform quantization scheme can achieve better error rate performance andfaster decoding convergence than the conventional non-uniform quantization and uniform quantizationschemes.
基金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(61633014,61803101,U1701264)。
文摘Gaussian belief propagation algorithm(GaBP) is one of the most important distributed algorithms in signal processing and statistical learning involving Markov networks. It is well known that the algorithm correctly computes marginal density functions from a high dimensional joint density function over a Markov network in a finite number of iterations when the underlying Gaussian graph is acyclic. It is also known more recently that the algorithm produces correct marginal means asymptotically for cyclic Gaussian graphs under the condition of walk summability(or generalised diagonal dominance). This paper extends this convergence result further by showing that the convergence is exponential under the generalised diagonal dominance condition,and provides a simple bound for the convergence rate. Our results are derived by combining the known walk summability approach for asymptotic convergence analysis with the control systems approach for stability analysis.
