块匹配约束下波束快速稀疏分解算法研究

Research on Fast Sparse Decomposition Algorithm Based on Block Matching Constraint

在块匹配约束环境下,对云计算的波束进行快速分解时,如果云计算受到多线程过程干扰,那末波束形成和稀疏分解效果不好。提出基于块匹配约束云计算波束快速稀疏算法。进行云计算的网络拓扑结构构建和云计算任务信息流的信号模型构造,提高信息预处理能力。采用块匹配约束方法进行云计算负载均衡设计,通过分段块匹配约束滤波,直接对分段后的云就按数据进行抗干扰设计,实现波束快速稀疏分解,提高了云计算的数据并行处理效率和能力。仿真结果表明,采用该算法实现云计算任务信息流的波束快速稀疏分解,提高云计算并行处理效率和能力。

In the environment of block matching constraint,when the beam of cloud computing is decomposed quickly,and the cloud computing is interfered by multi-thread process,the effect of beamforming and sparse decomposition is not good.A fast algorithm based on block matching constraint for cloud computing is proposed.We construct signal model of network topology construction of cloud computing and cloud computing tasks of information flow,and improve the ability of information preprocessing.The block matching constraint method is used for cloud computing load balancing design.Through the sub block matching constraint filtering,the segmented cloud data are directly designed according to the anti-jamming design,and the fast sparse decomposition of beams is then realized.It improves the cloud computing data parallel processing efficiency and ability.The simulation results show that the algorithm can achieve the fast beam sparse decomposition of the cloud computing task information flow,and improve the efficiency and capability of parallel processing.