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.展开更多
Differential spatial modulation(DSM)is a multiple-input multiple-output(MIMO)transmission scheme.It has attracted extensive research interest due to its ability to transmit additional data without increasing any radio...Differential spatial modulation(DSM)is a multiple-input multiple-output(MIMO)transmission scheme.It has attracted extensive research interest due to its ability to transmit additional data without increasing any radio frequency chain.In this paper,DSM is investigated using two mapping algorithms:Look-Up Table Order(LUTO)and Permutation Method(PM).Then,the bit error rate(BER)performance and complexity of the two mapping algorithms in various antennas and modulation methods are verified by simulation experiments.The results show that PM has a lower BER than the LUTO mapping algorithm,and the latter has lower complexity than the former.展开更多
The purpose of this article is to propose a new hybrid projection method for a quasi-nonexpansive mapping. The strong convergence of the algorithm is proved in real Hilbert spaces. A numerical experiment is also inclu...The purpose of this article is to propose a new hybrid projection method for a quasi-nonexpansive mapping. The strong convergence of the algorithm is proved in real Hilbert spaces. A numerical experiment is also included to explain the effectiveness of the proposed methods. The results of this paper are interesting extensions of those known results.展开更多
Being as unique nonlinear components of block ciphers,substitution boxes(S-boxes) directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes th...Being as unique nonlinear components of block ciphers,substitution boxes(S-boxes) directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes that simultaneously meet with multiple cryptographic criteria such as bijection,non-linearity,strict avalanche criterion(SAC),bits independence criterion(BIC),differential probability(DP) and linear probability(LP).To deal with this problem,a chaotic S-box based on the artificial bee colony algorithm(CSABC) is designed.It uses the S-boxes generated by the six-dimensional compound hyperchaotic map as the initial individuals and employs ABC to improve their performance.In addition,it considers the nonlinearity and differential uniformity as the fitness functions.A series of experiments have been conducted to compare multiple cryptographic criteria of this algorithm with other algorithms.Simulation results show that the new algorithm has cryptographically strong S-box while meeting multiple cryptographic criteria.展开更多
巡检机器人对室内场景进行自主导航监测时,采用视觉同时定位与地图构建(simultaneous localization and mapping,SLAM)方法构建的三维深度地图存在实时性不高、定位精度下降的问题。对此,提出了一种基于RGB-D相机和优化RTAB-Map(real ti...巡检机器人对室内场景进行自主导航监测时,采用视觉同时定位与地图构建(simultaneous localization and mapping,SLAM)方法构建的三维深度地图存在实时性不高、定位精度下降的问题。对此,提出了一种基于RGB-D相机和优化RTAB-Map(real time appearance based mapping)算法的巡检机器人视觉导航方法。首先,通过重新配置RTAB-Map点云更新频率,实现算法优化,构建稠密的点云地图后;采用启发式A*算法、动态窗口法(dynamic window approach,DWA)分别制定全局与局部巡检路径,通过自适应蒙特卡罗定位(adaptive Monte Carlo localization,AMCL)方法更新机器人的实时位姿信息,再将搭建好的实体巡检机器人在软件、硬件平台上完成视觉导航测试实验。结果表明:优化后的RTAB-Map算法运行时的内存占比稍有增加,但获得与真实环境一致性更高的三维深度地图,在一定程度上提高视觉导航的准确性与实用性。展开更多
With the Riemann solver to the scalar hyperbolic conservation law with a spatially varying flux, a δ-mapping algorithm was proposed. The algorithm and its prospective application in traffic flow problems were briefed...With the Riemann solver to the scalar hyperbolic conservation law with a spatially varying flux, a δ-mapping algorithm was proposed. The algorithm and its prospective application in traffic flow problems were briefed in the paper.展开更多
The layered maximum a posteriori (L-MAP) algorithm has been proposed to detect signals under frequency selective fading multiple input multiple output (MIMO) channels. Compared to the optimum MAP detector, the L-M...The layered maximum a posteriori (L-MAP) algorithm has been proposed to detect signals under frequency selective fading multiple input multiple output (MIMO) channels. Compared to the optimum MAP detector, the L-MAP algorithm can efficiently identify signal bits, and the complexity grows linearly with the number of input antennas. The basic idea of L-MAP is to operate on each input sub-stream with an optimum MAP sequential detector separately by assuming the other streams are Gaussian noise. The soft output can also be forwarded to outer channel decoder for iterative decoding. Simulation results show that the proposed method can converge with a small number of iterations under different channel conditions and outperforms other sub-optimum detectors for rank-deficient channels.展开更多
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.展开更多
In this paper, we use resolvent operator technology to construct a viscosity approximate algorithm to approximate a common solution of split variational inclusion problem and split fixed point problem for an averaged ...In this paper, we use resolvent operator technology to construct a viscosity approximate algorithm to approximate a common solution of split variational inclusion problem and split fixed point problem for an averaged mapping in real Hilbert spaces. Further, we prove that the sequences generated by the proposed iterative method converge strongly to a common solution of split variational inclusion problem and split fixed point problem for averaged mappings which is also the unique solution of the variational inequality problem. The results presented here improve and extend the corresponding results in this area.展开更多
文摘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.
基金supported by the National Natural Science Foundation of China(NSFC)under Grant No.62061024the Project of Gansu Province Science and Technology Department under Grant No.22ZD6GA055.
文摘Differential spatial modulation(DSM)is a multiple-input multiple-output(MIMO)transmission scheme.It has attracted extensive research interest due to its ability to transmit additional data without increasing any radio frequency chain.In this paper,DSM is investigated using two mapping algorithms:Look-Up Table Order(LUTO)and Permutation Method(PM).Then,the bit error rate(BER)performance and complexity of the two mapping algorithms in various antennas and modulation methods are verified by simulation experiments.The results show that PM has a lower BER than the LUTO mapping algorithm,and the latter has lower complexity than the former.
基金The NSF(11071053)of ChinaNatural Science Basic Research Plan(2014JM2-1003)in Shaanxi Province of ChinaScientific Research Project(YD2016-12)of Yan’an University
文摘The purpose of this article is to propose a new hybrid projection method for a quasi-nonexpansive mapping. The strong convergence of the algorithm is proved in real Hilbert spaces. A numerical experiment is also included to explain the effectiveness of the proposed methods. The results of this paper are interesting extensions of those known results.
基金supported by the National Natural Science Foundation of China(6060309260975042)
文摘Being as unique nonlinear components of block ciphers,substitution boxes(S-boxes) directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes that simultaneously meet with multiple cryptographic criteria such as bijection,non-linearity,strict avalanche criterion(SAC),bits independence criterion(BIC),differential probability(DP) and linear probability(LP).To deal with this problem,a chaotic S-box based on the artificial bee colony algorithm(CSABC) is designed.It uses the S-boxes generated by the six-dimensional compound hyperchaotic map as the initial individuals and employs ABC to improve their performance.In addition,it considers the nonlinearity and differential uniformity as the fitness functions.A series of experiments have been conducted to compare multiple cryptographic criteria of this algorithm with other algorithms.Simulation results show that the new algorithm has cryptographically strong S-box while meeting multiple cryptographic criteria.
文摘巡检机器人对室内场景进行自主导航监测时,采用视觉同时定位与地图构建(simultaneous localization and mapping,SLAM)方法构建的三维深度地图存在实时性不高、定位精度下降的问题。对此,提出了一种基于RGB-D相机和优化RTAB-Map(real time appearance based mapping)算法的巡检机器人视觉导航方法。首先,通过重新配置RTAB-Map点云更新频率,实现算法优化,构建稠密的点云地图后;采用启发式A*算法、动态窗口法(dynamic window approach,DWA)分别制定全局与局部巡检路径,通过自适应蒙特卡罗定位(adaptive Monte Carlo localization,AMCL)方法更新机器人的实时位姿信息,再将搭建好的实体巡检机器人在软件、硬件平台上完成视觉导航测试实验。结果表明:优化后的RTAB-Map算法运行时的内存占比稍有增加,但获得与真实环境一致性更高的三维深度地图,在一定程度上提高视觉导航的准确性与实用性。
文摘With the Riemann solver to the scalar hyperbolic conservation law with a spatially varying flux, a δ-mapping algorithm was proposed. The algorithm and its prospective application in traffic flow problems were briefed in the paper.
基金the National Natural Science Foundation of China (90604035)
文摘The layered maximum a posteriori (L-MAP) algorithm has been proposed to detect signals under frequency selective fading multiple input multiple output (MIMO) channels. Compared to the optimum MAP detector, the L-MAP algorithm can efficiently identify signal bits, and the complexity grows linearly with the number of input antennas. The basic idea of L-MAP is to operate on each input sub-stream with an optimum MAP sequential detector separately by assuming the other streams are Gaussian noise. The soft output can also be forwarded to outer channel decoder for iterative decoding. Simulation results show that the proposed method can converge with a small number of iterations under different channel conditions and outperforms other sub-optimum detectors for rank-deficient channels.
文摘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.
文摘In this paper, we use resolvent operator technology to construct a viscosity approximate algorithm to approximate a common solution of split variational inclusion problem and split fixed point problem for an averaged mapping in real Hilbert spaces. Further, we prove that the sequences generated by the proposed iterative method converge strongly to a common solution of split variational inclusion problem and split fixed point problem for averaged mappings which is also the unique solution of the variational inequality problem. The results presented here improve and extend the corresponding results in this area.