期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Improved dichotomous search frequency offset estimator for burst-mode continuous phase modulation
1
作者 翟文超 李赞 +1 位作者 司江勃 柏均 《Chinese Physics B》 SCIE EI CAS CSCD 2015年第11期584-591,共8页
A data-aided technique for cartier frequency offset estimation with continuous phase modulation (CPM) in burst- mode transmission is presented. The proposed technique first exploits a special pilot sequence, or trai... A data-aided technique for cartier frequency offset estimation with continuous phase modulation (CPM) in burst- mode transmission is presented. The proposed technique first exploits a special pilot sequence, or training sequence, to form a sinusoidal waveform. Then, an improved dichotomous search frequency offset estimator is introduced to determine the frequency offset using the sinusoid. Theoretical analysis and simulation results indicate that our estimator is noteworthy in the following aspects. First, the estimator can operate independently of timing recovery. Second, it has relatively low outlier, i.e., the minimum signal-to-noise ratio (SNR) required to guarantee estimation accuracy. Finally, the most important property is that our estimator is complexity-reduced compared to the existing dichotomous search methods: it eliminates the need for fast Fourier transform (FFT) and modulation removal, and exhibits faster convergence rate without accuracy degradation. 展开更多
关键词 frequency offset estimation Cramer-Rao bound dichotomous search continuous phase modulation
下载PDF
Recent Advances in Automated Theorem Proving on Inequalities 被引量:21
2
作者 杨路 《Journal of Computer Science & Technology》 SCIE EI CSCD 1999年第5期434-446,共13页
Automated theorem proving on inequalities is always considered asa difficult topic in the area of automated reasoning. The relevallt algorithms dependfundamentally on real algebra and real geometry, and the computatio... Automated theorem proving on inequalities is always considered asa difficult topic in the area of automated reasoning. The relevallt algorithms dependfundamentally on real algebra and real geometry, and the computational complexityincreases very quickly with the dimension, that is, the number of parameters. Somewell-known algorithms are complete theoretically but inefficient in practice, whichcannot verify non-trivial propositions in batches. A dimension- decreasing algorit hmpresellted here can treat radicals efficiently and make the dimensions the lowest.Based upon this algorithm, a generic program called 'BOTTEMA' was implementedon a personal computer. More than 1000 algebraic and geometric inequalities includ-ing hundreds of open problems have been verified in this way. This makes it possibleto check a finite many inequalities instead of solving a globaloptimization problem. 展开更多
关键词 inequality with radicals RATIONALIZATION dichotomous search
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部