To overcome the limitations of conventional speech enhancement methods, such as inaccurate voice activity detector(VAD) and noise estimation, a novel speech enhancement algorithm based on the approximate message passi...To overcome the limitations of conventional speech enhancement methods, such as inaccurate voice activity detector(VAD) and noise estimation, a novel speech enhancement algorithm based on the approximate message passing(AMP) is adopted. AMP exploits the difference between speech and noise sparsity to remove or mute the noise from the corrupted speech. The AMP algorithm is adopted to reconstruct the clean speech efficiently for speech enhancement. More specifically, the prior probability distribution of speech sparsity coefficient is characterized by Gaussian-model, and the hyper-parameters of the prior model are excellently learned by expectation maximization(EM) algorithm. We utilize the k-nearest neighbor(k-NN) algorithm to learn the sparsity with the fact that the speech coefficients between adjacent frames are correlated. In addition, computational simulations are used to validate the proposed algorithm, which achieves better speech enhancement performance than other four baseline methods-Wiener filtering, subspace pursuit(SP), distributed sparsity adaptive matching pursuit(DSAMP), and expectation-maximization Gaussian-model approximate message passing(EM-GAMP) under different compression ratios and a wide range of signal to noise ratios(SNRs).展开更多
For data association in multisensor and multitarget tracking, a novel parallel algorithm is developed to improve the efficiency and real-time performance of FGAs-based algorithm. One Cluster of Workstation （COW） wit...For data association in multisensor and multitarget tracking, a novel parallel algorithm is developed to improve the efficiency and real-time performance of FGAs-based algorithm. One Cluster of Workstation （COW） with Message Passing Interface （MPI） is built. The proposed Multi-Deme Parallel FGA （MDPFGA） is run on the platform. A serial of special MDPFGAs are used to determine the static and the dynamic solutions of generalized m-best S-D assignment problem respectively, as well as target states estimation in track management. Such an assignment-based parallel algorithm is demonstrated on simulated passive sensor track formation and maintenance problem. While illustrating the feasibility of the proposed algorithm in multisensor multitarget tracking, simulation results indicate that the MDPFGAs-based algorithm has greater efficiency and speed than the FGAs-based algorithm.展开更多
Message passing algorithms,whose iterative nature captures complicated interactions among interconnected variables in complex systems and extracts information from the fixed point of iterated messages,provide a powerf...Message passing algorithms,whose iterative nature captures complicated interactions among interconnected variables in complex systems and extracts information from the fixed point of iterated messages,provide a powerful toolkit in tackling hard computational tasks in optimization,inference,and learning problems.In the context of constraint satisfaction problems(CSPs),when a control parameter(such as constraint density)is tuned,multiple threshold phenomena emerge,signaling fundamental structural transitions in their solution space.Finding solutions around these transition points is exceedingly challenging for algorithm design,where message passing algorithms suffer from a large message fiuctuation far from convergence.Here we introduce a residual-based updating step into message passing algorithms,in which messages with large variation between consecutive steps are given high priority in the updating process.For the specific example of model RB(revised B),a typical prototype of random CSPs with growing domains,we show that our algorithm improves the convergence of message updating and increases the success probability in finding solutions around the satisfiability threshold with a low computational cost.Our approach to message passing algorithms should be of value for exploring their power in developing algorithms to find ground-state solutions and understand the detailed structure of solution space of hard optimization problems.展开更多
军事卫星通信由于需满足信息实时性、传输速率高、通信容量大以及符合星间链路信道的时变特性等要求,通常采用高编码增益、高吞吐量的信道编码方案。低密度奇偶校验(Low-Density Parity-Check,LDPC)码由于具备接近Shannon极限的优异纠...军事卫星通信由于需满足信息实时性、传输速率高、通信容量大以及符合星间链路信道的时变特性等要求,通常采用高编码增益、高吞吐量的信道编码方案。低密度奇偶校验(Low-Density Parity-Check,LDPC)码由于具备接近Shannon极限的优异纠错性能和可并行计算的特性成为卫星通信主导信道编码标准之一。目前卫星通信接收机的译码器模块设计仍存在诸如无法实时在线判断迭代停止、系统吞吐量受限、大量判决电路影响核心译码电路的低功耗和实时性等问题。考虑上述问题,以因子图模型为基础,针对空间数据系统咨询委员会(Consultative Committee for Space Data Systems,CCSDS)标准深空通信码型,将校验节点归一化满足概率进化图案与LDPC译码器状态紧密耦合,给出可实时在线判断迭代停止的最优停止准则,实现高性能、低复杂度的停止准则译码算法设计。当优先考虑高吞吐量时,误码率(Bit Error Rate,BER)性能退化0.13 dB,中低信噪比平均迭代次数(Average Number of Iteration,ANI)降低50%以上;当优先考虑纠错性能时,BER性能仅退化0.02 dB,同时大幅降低ANI。该译码算法为高效低复杂度LDPC译码器设计提供有效解决方案。展开更多
基金supported by National Natural Science Foundation of China(NSFC)(No.61671075)Major Program of National Natural Science Foundation of China(No.61631003)。
文摘To overcome the limitations of conventional speech enhancement methods, such as inaccurate voice activity detector(VAD) and noise estimation, a novel speech enhancement algorithm based on the approximate message passing(AMP) is adopted. AMP exploits the difference between speech and noise sparsity to remove or mute the noise from the corrupted speech. The AMP algorithm is adopted to reconstruct the clean speech efficiently for speech enhancement. More specifically, the prior probability distribution of speech sparsity coefficient is characterized by Gaussian-model, and the hyper-parameters of the prior model are excellently learned by expectation maximization(EM) algorithm. We utilize the k-nearest neighbor(k-NN) algorithm to learn the sparsity with the fact that the speech coefficients between adjacent frames are correlated. In addition, computational simulations are used to validate the proposed algorithm, which achieves better speech enhancement performance than other four baseline methods-Wiener filtering, subspace pursuit(SP), distributed sparsity adaptive matching pursuit(DSAMP), and expectation-maximization Gaussian-model approximate message passing(EM-GAMP) under different compression ratios and a wide range of signal to noise ratios(SNRs).
基金Supported by National Defence Scientific Research Foundation
文摘For data association in multisensor and multitarget tracking, a novel parallel algorithm is developed to improve the efficiency and real-time performance of FGAs-based algorithm. One Cluster of Workstation （COW） with Message Passing Interface （MPI） is built. The proposed Multi-Deme Parallel FGA （MDPFGA） is run on the platform. A serial of special MDPFGAs are used to determine the static and the dynamic solutions of generalized m-best S-D assignment problem respectively, as well as target states estimation in track management. Such an assignment-based parallel algorithm is demonstrated on simulated passive sensor track formation and maintenance problem. While illustrating the feasibility of the proposed algorithm in multisensor multitarget tracking, simulation results indicate that the MDPFGAs-based algorithm has greater efficiency and speed than the FGAs-based algorithm.
基金supported by Guangdong Major Project of Basic and Applied Basic Research No.2020B0301030008Science and Technology Program of Guangzhou No.2019050001+2 种基金the Chinese Academy of Sciences Grant QYZDJ-SSWSYS018the National Natural Science Foundation of China(Grant No.12171479)supported by the National Natural Science Foundation of China(Grant Nos.11301339 and 11491240108)。
文摘Message passing algorithms,whose iterative nature captures complicated interactions among interconnected variables in complex systems and extracts information from the fixed point of iterated messages,provide a powerful toolkit in tackling hard computational tasks in optimization,inference,and learning problems.In the context of constraint satisfaction problems(CSPs),when a control parameter(such as constraint density)is tuned,multiple threshold phenomena emerge,signaling fundamental structural transitions in their solution space.Finding solutions around these transition points is exceedingly challenging for algorithm design,where message passing algorithms suffer from a large message fiuctuation far from convergence.Here we introduce a residual-based updating step into message passing algorithms,in which messages with large variation between consecutive steps are given high priority in the updating process.For the specific example of model RB(revised B),a typical prototype of random CSPs with growing domains,we show that our algorithm improves the convergence of message updating and increases the success probability in finding solutions around the satisfiability threshold with a low computational cost.Our approach to message passing algorithms should be of value for exploring their power in developing algorithms to find ground-state solutions and understand the detailed structure of solution space of hard optimization problems.
文摘军事卫星通信由于需满足信息实时性、传输速率高、通信容量大以及符合星间链路信道的时变特性等要求,通常采用高编码增益、高吞吐量的信道编码方案。低密度奇偶校验(Low-Density Parity-Check,LDPC)码由于具备接近Shannon极限的优异纠错性能和可并行计算的特性成为卫星通信主导信道编码标准之一。目前卫星通信接收机的译码器模块设计仍存在诸如无法实时在线判断迭代停止、系统吞吐量受限、大量判决电路影响核心译码电路的低功耗和实时性等问题。考虑上述问题,以因子图模型为基础,针对空间数据系统咨询委员会(Consultative Committee for Space Data Systems,CCSDS)标准深空通信码型,将校验节点归一化满足概率进化图案与LDPC译码器状态紧密耦合,给出可实时在线判断迭代停止的最优停止准则,实现高性能、低复杂度的停止准则译码算法设计。当优先考虑高吞吐量时,误码率(Bit Error Rate,BER)性能退化0.13 dB,中低信噪比平均迭代次数(Average Number of Iteration,ANI)降低50%以上;当优先考虑纠错性能时,BER性能仅退化0.02 dB,同时大幅降低ANI。该译码算法为高效低复杂度LDPC译码器设计提供有效解决方案。
