To decrease the complexity of MAP algorithm, reduced state or reduced search techniques can be applied. In this paper we propose a reduced search soft output detection algorithm fully based on the principle of M a...To decrease the complexity of MAP algorithm, reduced state or reduced search techniques can be applied. In this paper we propose a reduced search soft output detection algorithm fully based on the principle of M algorithm for turbo equalization, which is a suboptimum version of the Lee algorithm. This algorithm is called soft output M algorithm (denoted as SO M algorithm), which applies the M strategy to both the forward recursion and the extended forward recursion of the Lee algorithm. Computer simulation results show that, by properly selecting and adjusting the breadth parameter and depth parameter during the iteration of turbo equalization, this algorithm can obtain good performance and complexity trade off.展开更多
Platform planning is one of the important problems in the command and control(C2) field. Hereto, we analyze the platform planning problem and present nonlinear optimal model aiming at maximizing the task completion qu...Platform planning is one of the important problems in the command and control(C2) field. Hereto, we analyze the platform planning problem and present nonlinear optimal model aiming at maximizing the task completion qualities. Firstly, we take into account the relation among tasks and build the single task nonlinear optimal model with a set of platform constraints. The Lagrange relaxation method and the pruning strategy are used to solve the model. Secondly, this paper presents optimization-based planning algorithms for efficiently allocating platforms to multiple tasks. To achieve the balance of the resource assignments among tasks, the m-best assignment algorithm and the pair-wise exchange(PWE)method are used to maximize multiple tasks completion qualities.Finally, a series of experiments are designed to verify the superiority and effectiveness of the proposed model and algorithms.展开更多
We consider the inverse problem of finding cavities within some object from electrostatic measurements on the boundary. By a cavity we understand any object with a different electrical conductivity from the background...We consider the inverse problem of finding cavities within some object from electrostatic measurements on the boundary. By a cavity we understand any object with a different electrical conductivity from the background material of the body. We give an algorithm for solving this inverse problem based on the output nonlinear least-square formulation and the regularized Newton-type iteration. In particular, we present a number of numerical results to highlight the potential and the limitations of this method.展开更多
QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD...QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD-M algorithm for MIMO Orthogonal Frequency Division Multiplexing(MIMO-OFDM) systems.In the proposed scheme,each surviving path is expanded only to partial branches in order to carry out a limited tree search.The nodes are expanded on demand and sorted in a distributed manner,based on the novel expansion scheme which can pre-determine the children's ascending order by their local distances.Consequently,the proposed scheme can significantly decrease the complexity compared with conventional QRD-M algorithm.Hence,it is especially attractive to VLSI implementation of the high-throughput MIMO-OFDM systems.Simulation results prove that the proposed scheme can achieve a performance very close to the conventional QRD-M algorithm.展开更多
An adaptive MIMO detection algorithm for LTE-A system which is based on sphere detection is proposed in this paper. The proposed algorithm uses M-algorithm for reference to remove unreliable constellation candidates b...An adaptive MIMO detection algorithm for LTE-A system which is based on sphere detection is proposed in this paper. The proposed algorithm uses M-algorithm for reference to remove unreliable constellation candidates before search, and the number of constellation reservation is adaptively adjusted according to SNR. Simulations of LTE-A downlink show that the BER performance of the proposed detection algorithm is nearly the same as maximum likelihood (ML) detection algorithm. However, the complexity is reduced by about 30% compared with full constellation sphere detection.展开更多
A Leverrier-like algorithm is presented which allows the computation of the transfer function of a linear regular system from its m-D state-space description,without inverting a multivariable polynomial matrix. This a...A Leverrier-like algorithm is presented which allows the computation of the transfer function of a linear regular system from its m-D state-space description,without inverting a multivariable polynomial matrix. This algorithm is an extension of the classic Leverrier's algorithm for 1-D system and it reduces the computational cost.ra-D Cayley-Hamilton theorem is also shown by the algorithm.展开更多
In this paper, we propose a novel idea for improvement performances of the leader M-BCJR algorithm functioning in low complexity. The basic idea consists to localize error instant possibility, and then increase the co...In this paper, we propose a novel idea for improvement performances of the leader M-BCJR algorithm functioning in low complexity. The basic idea consists to localize error instant possibility, and then increase the complexity around this moment. We also propose an easy and important idea for early localisation of erroneous moments. We call this new algorithm Z-MAP. The simulations show that the improvement of performances is significant. The performances of Z-MAP turbo decoding are so close to full MAP-BCJR performances. Furthermore, the complexity is the same that of the M-BCJR. So, Z-MAP is an optimal version of M-BCJR algorithm.展开更多
A direct algorithm is proposed by which one can distinguish whether a matrix is an M-matrix (or H-matrix) or not quickly and effectively. Numerical examples show that it is effective and convincible to distinguish M-m...A direct algorithm is proposed by which one can distinguish whether a matrix is an M-matrix (or H-matrix) or not quickly and effectively. Numerical examples show that it is effective and convincible to distinguish M-matrix (or H-matrix) by using the algorithm.展开更多
Let A be m by n matrix, M and N be positive definite matrices of order in and n respectively. This paper presents an efficient method for computing (M-N) singular value decomposition((M-N) SVD) of A on a cube connecte...Let A be m by n matrix, M and N be positive definite matrices of order in and n respectively. This paper presents an efficient method for computing (M-N) singular value decomposition((M-N) SVD) of A on a cube connected single instruction stream-multiple data stream(SIMD) parallel computer. This method is based on a one-sided orthogonalization algorithm due to Hestenes. On the cube connected SIMD parallel computer with o(n) processors, the (M -- N) SVD of a matrix A requires a computation time of o(m3 log m/n).展开更多
轨道交通LTE-M(Long Term Evolution-Metro,基于轨道交通的长期演进)同频干扰检测关乎列控信号传输的可靠性,提出一种基于INFO(weIghted meaNoFvectOrs,基于向量加权平均)算法的盲源分离方法,即INFO-BSS。该方法以混合信号的最大化负熵...轨道交通LTE-M(Long Term Evolution-Metro,基于轨道交通的长期演进)同频干扰检测关乎列控信号传输的可靠性,提出一种基于INFO(weIghted meaNoFvectOrs,基于向量加权平均)算法的盲源分离方法,即INFO-BSS。该方法以混合信号的最大化负熵为目标函数,用INFO优化算法替代牛顿迭代法,解决了牛顿迭代法初始参数易设置不当以及容易陷入局部最优的问题。仿真结果对比表明,在不同分辨率带宽、不同信干比等条件下,INFO-BSS的检测性能都要优于常规算法。展开更多
铂电阻传感器的温度测量系统为动态测量系统,其参数处于时变状态,传统不确定度评定方法的静态假设并不适用。因此,本文提出了一种基于马尔科夫蒙特卡洛(MCMC)的贝叶斯统计的铂电阻传感器动态不确定度评定方法,构建了云边端协同的在线计...铂电阻传感器的温度测量系统为动态测量系统,其参数处于时变状态,传统不确定度评定方法的静态假设并不适用。因此,本文提出了一种基于马尔科夫蒙特卡洛(MCMC)的贝叶斯统计的铂电阻传感器动态不确定度评定方法,构建了云边端协同的在线计量系统对动态测量系统进行实时监测;基于贝叶斯信息融合原理实现动态测量系统信息的动态更新;基于Metropolis-Hastings(M-H)算法求解贝叶斯信息融合后验分布的唯一收敛马氏链,有效减少了参数间的相关性,实现了动态测量系统的不确定度动态评定。实验对比GUM法(Guide to the Uncertainty in Measurement)、传统贝叶斯法和改进贝叶斯法的不确定度评定结果,结果表明,本文方法可有效提高温度测量动态系统的不确定度评定结果的精度,解决了铂电阻温度测量动态系统量值可靠性无法估计的问题。展开更多
文摘To decrease the complexity of MAP algorithm, reduced state or reduced search techniques can be applied. In this paper we propose a reduced search soft output detection algorithm fully based on the principle of M algorithm for turbo equalization, which is a suboptimum version of the Lee algorithm. This algorithm is called soft output M algorithm (denoted as SO M algorithm), which applies the M strategy to both the forward recursion and the extended forward recursion of the Lee algorithm. Computer simulation results show that, by properly selecting and adjusting the breadth parameter and depth parameter during the iteration of turbo equalization, this algorithm can obtain good performance and complexity trade off.
基金supported by the National Natural Science Foundation of China(61573017 61703425)+2 种基金the Aeronautical Science Fund(20175796014)the Shaanxi Province Natural Science Foundation Research Project(2016JQ6062 2017JM6062)
文摘Platform planning is one of the important problems in the command and control(C2) field. Hereto, we analyze the platform planning problem and present nonlinear optimal model aiming at maximizing the task completion qualities. Firstly, we take into account the relation among tasks and build the single task nonlinear optimal model with a set of platform constraints. The Lagrange relaxation method and the pruning strategy are used to solve the model. Secondly, this paper presents optimization-based planning algorithms for efficiently allocating platforms to multiple tasks. To achieve the balance of the resource assignments among tasks, the m-best assignment algorithm and the pair-wise exchange(PWE)method are used to maximize multiple tasks completion qualities.Finally, a series of experiments are designed to verify the superiority and effectiveness of the proposed model and algorithms.
文摘We consider the inverse problem of finding cavities within some object from electrostatic measurements on the boundary. By a cavity we understand any object with a different electrical conductivity from the background material of the body. We give an algorithm for solving this inverse problem based on the output nonlinear least-square formulation and the regularized Newton-type iteration. In particular, we present a number of numerical results to highlight the potential and the limitations of this method.
基金Supported by the ‘Transformation of Scientific and Technological Achievements Project’ funded by the Department of Science and Technology of Jiangsu province,P.R. China (BA2006076)
文摘QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD-M algorithm for MIMO Orthogonal Frequency Division Multiplexing(MIMO-OFDM) systems.In the proposed scheme,each surviving path is expanded only to partial branches in order to carry out a limited tree search.The nodes are expanded on demand and sorted in a distributed manner,based on the novel expansion scheme which can pre-determine the children's ascending order by their local distances.Consequently,the proposed scheme can significantly decrease the complexity compared with conventional QRD-M algorithm.Hence,it is especially attractive to VLSI implementation of the high-throughput MIMO-OFDM systems.Simulation results prove that the proposed scheme can achieve a performance very close to the conventional QRD-M algorithm.
文摘An adaptive MIMO detection algorithm for LTE-A system which is based on sphere detection is proposed in this paper. The proposed algorithm uses M-algorithm for reference to remove unreliable constellation candidates before search, and the number of constellation reservation is adaptively adjusted according to SNR. Simulations of LTE-A downlink show that the BER performance of the proposed detection algorithm is nearly the same as maximum likelihood (ML) detection algorithm. However, the complexity is reduced by about 30% compared with full constellation sphere detection.
基金Supported by NSFC Project 19971057, Science and Technology Foundation of Shanhai Higher Eduction Project 03DZ04, and The Special Funds for Major Specialities of Shanghai Eduction Committee. Partly supported by Chinese Scholarship Council.
文摘A Leverrier-like algorithm is presented which allows the computation of the transfer function of a linear regular system from its m-D state-space description,without inverting a multivariable polynomial matrix. This algorithm is an extension of the classic Leverrier's algorithm for 1-D system and it reduces the computational cost.ra-D Cayley-Hamilton theorem is also shown by the algorithm.
文摘In this paper, we propose a novel idea for improvement performances of the leader M-BCJR algorithm functioning in low complexity. The basic idea consists to localize error instant possibility, and then increase the complexity around this moment. We also propose an easy and important idea for early localisation of erroneous moments. We call this new algorithm Z-MAP. The simulations show that the improvement of performances is significant. The performances of Z-MAP turbo decoding are so close to full MAP-BCJR performances. Furthermore, the complexity is the same that of the M-BCJR. So, Z-MAP is an optimal version of M-BCJR algorithm.
基金Foundation item: This work is supported by the Science Foundations of the Education Department of Yunnan Province (03Z169A)the Science Foundatons of Yunnan University (2003Z013B).
文摘A direct algorithm is proposed by which one can distinguish whether a matrix is an M-matrix (or H-matrix) or not quickly and effectively. Numerical examples show that it is effective and convincible to distinguish M-matrix (or H-matrix) by using the algorithm.
文摘Let A be m by n matrix, M and N be positive definite matrices of order in and n respectively. This paper presents an efficient method for computing (M-N) singular value decomposition((M-N) SVD) of A on a cube connected single instruction stream-multiple data stream(SIMD) parallel computer. This method is based on a one-sided orthogonalization algorithm due to Hestenes. On the cube connected SIMD parallel computer with o(n) processors, the (M -- N) SVD of a matrix A requires a computation time of o(m3 log m/n).
文摘轨道交通LTE-M(Long Term Evolution-Metro,基于轨道交通的长期演进)同频干扰检测关乎列控信号传输的可靠性,提出一种基于INFO(weIghted meaNoFvectOrs,基于向量加权平均)算法的盲源分离方法,即INFO-BSS。该方法以混合信号的最大化负熵为目标函数,用INFO优化算法替代牛顿迭代法,解决了牛顿迭代法初始参数易设置不当以及容易陷入局部最优的问题。仿真结果对比表明,在不同分辨率带宽、不同信干比等条件下,INFO-BSS的检测性能都要优于常规算法。
文摘铂电阻传感器的温度测量系统为动态测量系统,其参数处于时变状态,传统不确定度评定方法的静态假设并不适用。因此,本文提出了一种基于马尔科夫蒙特卡洛(MCMC)的贝叶斯统计的铂电阻传感器动态不确定度评定方法,构建了云边端协同的在线计量系统对动态测量系统进行实时监测;基于贝叶斯信息融合原理实现动态测量系统信息的动态更新;基于Metropolis-Hastings(M-H)算法求解贝叶斯信息融合后验分布的唯一收敛马氏链,有效减少了参数间的相关性,实现了动态测量系统的不确定度动态评定。实验对比GUM法(Guide to the Uncertainty in Measurement)、传统贝叶斯法和改进贝叶斯法的不确定度评定结果,结果表明,本文方法可有效提高温度测量动态系统的不确定度评定结果的精度,解决了铂电阻温度测量动态系统量值可靠性无法估计的问题。
