Soft output Viterbi algorithm （SOVA） is a turbo decoding algorithm that is suitable for hardware implementation. But its performance is not so good as maximum a posterior probability（MAP） algorithm. So it is very ...Soft output Viterbi algorithm （SOVA） is a turbo decoding algorithm that is suitable for hardware implementation. But its performance is not so good as maximum a posterior probability（MAP） algorithm. So it is very important to improve its performance. The non-correlation between minimum and maximum likelihood paths in SOVA is analyzed. The metric difference of both likelihood paths is used as iterative soft information, which is not the same as the traditional SOVA. The performance of the proposed SOVA is demonstrated by the simulations. For 1 024-bit frame size and 9 iterations with signal to noise ratio from 1 dB to 4 dB, the experimental results show that the new SOVA algorithm obtains about more 0. 4 dB and 0. 2 dB coding gains more than the traditional SOVA and Bi-SOVA algorithms at bit error rate（BER） of 1 × 10^-4 , while the latency is only half of the Bi-direction SOVA decoding.展开更多
The idea of the inverse optimization problem is to adjust the values of the parameters so that the observed feasible solutions are indeed optimal.The modification cost is measured by different norms,such asl1,l2,l∞no...The idea of the inverse optimization problem is to adjust the values of the parameters so that the observed feasible solutions are indeed optimal.The modification cost is measured by different norms,such asl1,l2,l∞norms and the Hamming distance,and the goal is to adjust the parameters as little as possible.In this paper,we consider the inverse maximum flow problem under the combination of the weighted l2 norm and the weighted Hamming distance,i.e.,the modification cost is fixed in a given interval and depends on the modification out of the given interval.We present a combinatorial algorithm which can be finished in O(nm)to solve it due to the minimum cut of the residual network.展开更多
Recently, space time block codes (STBCs) are proposed for multi-input and multi-output (MIMO) antenna systems. Designing an STBC with both low decoding complexity and non-vanishing property for the Long Term Evolution...Recently, space time block codes (STBCs) are proposed for multi-input and multi-output (MIMO) antenna systems. Designing an STBC with both low decoding complexity and non-vanishing property for the Long Term Evolution Advanced (LTE-A) remains an open issue. In this paper, first our previously proposed STBC’s non-vanishing property will be completely described. The proposed STBC scheme has some interesting properties: 1) the scheme can achieve full rate and full diversity;2) its maximum likelihood (ML) decoding requires a joint detection of three real symbols;3) the minimum determinant values (MDVs) do not vanish by increasing signal constellation sizes;4) compatible with the single antenna transmission mode. The sentence has been dropped. Second, in order to improve BER performance, we propose a variant of proposed STBC. This scheme further decreases the detection complexity with a rate reduction of 33%;moreover, non-vanishing MDVs property is preserved. The simulation results show the second proposed STBC has better BER performance compared with other schemes.展开更多
The goal of the present paper is to expand already published works in the frame of＂Banded speed cosmology＂ （BSC）. In particular this paper gives validated values for physical quantities not so far investigated in ...The goal of the present paper is to expand already published works in the frame of＂Banded speed cosmology＂ （BSC）. In particular this paper gives validated values for physical quantities not so far investigated in previous publications, i.e., the number of individual physical entity in the universe, as well as the maximum value for acceleration. Validates values mean identical quantities from a numerical point of view obtained with different theoretical procedures, additionally compared with data based on NASA observations with Planck probe.展开更多
为解决由于固定温度SAC(Soft Actor Critic)算法中存在的Q函数高估可能会导致算法陷入局部最优的问题,通过深入分析提出了一个稳定且受限的SAC算法(SCSAC:Stable Constrained Soft Actor Critic)。该算法通过改进最大熵目标函数修复固...为解决由于固定温度SAC(Soft Actor Critic)算法中存在的Q函数高估可能会导致算法陷入局部最优的问题,通过深入分析提出了一个稳定且受限的SAC算法(SCSAC:Stable Constrained Soft Actor Critic)。该算法通过改进最大熵目标函数修复固定温度SAC算法中的Q函数高估问题,同时增强算法在测试过程中稳定性的效果。最后,在4个OpenAI Gym Mujoco环境下对SCSAC算法进行了验证,实验结果表明,稳定且受限的SAC算法相比固定温度SAC算法可以有效减小Q函数高估出现的次数并能在测试中获得更加稳定的结果。展开更多
针对雾霾天气下交通信号灯定位准确率较低、图像增强时出现图像亮度不均匀的问题,该文提出一种基于改进的带色彩恢复的多尺度视网膜增强(Multi-Scale Retinex with Color Restoration,MSRCR)的雾霾天气下信号灯识别算法。首先利用改进的...针对雾霾天气下交通信号灯定位准确率较低、图像增强时出现图像亮度不均匀的问题,该文提出一种基于改进的带色彩恢复的多尺度视网膜增强(Multi-Scale Retinex with Color Restoration,MSRCR)的雾霾天气下信号灯识别算法。首先利用改进的MSRCR算法对有雾图像进行预处理,校正图像亮度并丰富图像细节;再利用最大稳定极值区域(Maximally Stable Extremal Regions,MSER)算法以及信号灯的背板信息确定信号灯的位置;最后将定位区域转换至HSV空间进行信号灯识别。结果表明,该方法能够在雾霾条件下有效地定位及识别交通信号灯。展开更多
Scott formulated his version of Boolean-valued models in 1967, He proved that the V<sup>（B）</sup> is a Boolean-valued model of ZFC, i. e. every axiom of ZFC has Boolean value 1, and assumed the GCH. Then...Scott formulated his version of Boolean-valued models in 1967, He proved that the V<sup>（B）</sup> is a Boolean-valued model of ZFC, i. e. every axiom of ZFC has Boolean value 1, and assumed the GCH. Then, if B satisfies ccc and |B|=2<sup>No</sup>, V<sup>（B）</sup> GCH （see [1]）. In this note we construct the model △<sup>（B）</sup> on the basis of V<sup>（B）</sup>. Our main results are:（1）△<sup>（B）</sup>) is a Booleanvalued model of GB. （2） Assume the GCH. Then, if B satisfies ccc and |B|=2<sup>No</sup>, △<sup>（B）</sup> GCH. （3） The maximum and minimum principle is true in △<sup>（B）</sup>. （4） △<sup>（B）</sup>（B≠{0, 1}） is a Boolean-valued model of QM.展开更多
基金Guangzhou Science and Technology Project(2004Z3 -D0321) Guangdong Science and Technology Project(200510101013)
文摘Soft output Viterbi algorithm （SOVA） is a turbo decoding algorithm that is suitable for hardware implementation. But its performance is not so good as maximum a posterior probability（MAP） algorithm. So it is very important to improve its performance. The non-correlation between minimum and maximum likelihood paths in SOVA is analyzed. The metric difference of both likelihood paths is used as iterative soft information, which is not the same as the traditional SOVA. The performance of the proposed SOVA is demonstrated by the simulations. For 1 024-bit frame size and 9 iterations with signal to noise ratio from 1 dB to 4 dB, the experimental results show that the new SOVA algorithm obtains about more 0. 4 dB and 0. 2 dB coding gains more than the traditional SOVA and Bi-SOVA algorithms at bit error rate（BER） of 1 × 10^-4 , while the latency is only half of the Bi-direction SOVA decoding.
基金This research is supported by the Fundamental Research Funds for the Central Universities(No.20720190068)the China Scholarship Council(No.201706315073).
文摘The idea of the inverse optimization problem is to adjust the values of the parameters so that the observed feasible solutions are indeed optimal.The modification cost is measured by different norms,such asl1,l2,l∞norms and the Hamming distance,and the goal is to adjust the parameters as little as possible.In this paper,we consider the inverse maximum flow problem under the combination of the weighted l2 norm and the weighted Hamming distance,i.e.,the modification cost is fixed in a given interval and depends on the modification out of the given interval.We present a combinatorial algorithm which can be finished in O(nm)to solve it due to the minimum cut of the residual network.
文摘Recently, space time block codes (STBCs) are proposed for multi-input and multi-output (MIMO) antenna systems. Designing an STBC with both low decoding complexity and non-vanishing property for the Long Term Evolution Advanced (LTE-A) remains an open issue. In this paper, first our previously proposed STBC’s non-vanishing property will be completely described. The proposed STBC scheme has some interesting properties: 1) the scheme can achieve full rate and full diversity;2) its maximum likelihood (ML) decoding requires a joint detection of three real symbols;3) the minimum determinant values (MDVs) do not vanish by increasing signal constellation sizes;4) compatible with the single antenna transmission mode. The sentence has been dropped. Second, in order to improve BER performance, we propose a variant of proposed STBC. This scheme further decreases the detection complexity with a rate reduction of 33%;moreover, non-vanishing MDVs property is preserved. The simulation results show the second proposed STBC has better BER performance compared with other schemes.
文摘The goal of the present paper is to expand already published works in the frame of＂Banded speed cosmology＂ （BSC）. In particular this paper gives validated values for physical quantities not so far investigated in previous publications, i.e., the number of individual physical entity in the universe, as well as the maximum value for acceleration. Validates values mean identical quantities from a numerical point of view obtained with different theoretical procedures, additionally compared with data based on NASA observations with Planck probe.
文摘为解决由于固定温度SAC(Soft Actor Critic)算法中存在的Q函数高估可能会导致算法陷入局部最优的问题,通过深入分析提出了一个稳定且受限的SAC算法(SCSAC:Stable Constrained Soft Actor Critic)。该算法通过改进最大熵目标函数修复固定温度SAC算法中的Q函数高估问题,同时增强算法在测试过程中稳定性的效果。最后,在4个OpenAI Gym Mujoco环境下对SCSAC算法进行了验证,实验结果表明,稳定且受限的SAC算法相比固定温度SAC算法可以有效减小Q函数高估出现的次数并能在测试中获得更加稳定的结果。
文摘针对雾霾天气下交通信号灯定位准确率较低、图像增强时出现图像亮度不均匀的问题,该文提出一种基于改进的带色彩恢复的多尺度视网膜增强(Multi-Scale Retinex with Color Restoration,MSRCR)的雾霾天气下信号灯识别算法。首先利用改进的MSRCR算法对有雾图像进行预处理,校正图像亮度并丰富图像细节;再利用最大稳定极值区域(Maximally Stable Extremal Regions,MSER)算法以及信号灯的背板信息确定信号灯的位置;最后将定位区域转换至HSV空间进行信号灯识别。结果表明,该方法能够在雾霾条件下有效地定位及识别交通信号灯。
文摘Scott formulated his version of Boolean-valued models in 1967, He proved that the V<sup>（B）</sup> is a Boolean-valued model of ZFC, i. e. every axiom of ZFC has Boolean value 1, and assumed the GCH. Then, if B satisfies ccc and |B|=2<sup>No</sup>, V<sup>（B）</sup> GCH （see [1]）. In this note we construct the model △<sup>（B）</sup> on the basis of V<sup>（B）</sup>. Our main results are:（1）△<sup>（B）</sup>) is a Booleanvalued model of GB. （2） Assume the GCH. Then, if B satisfies ccc and |B|=2<sup>No</sup>, △<sup>（B）</sup> GCH. （3） The maximum and minimum principle is true in △<sup>（B）</sup>. （4） △<sup>（B）</sup>（B≠{0, 1}） is a Boolean-valued model of QM.
