For a given compactly supported scaling fun ct ion supported over [0,3]×[0,3], we present an algorithm to construct compac t ly supported orthogonal wavelets. By this algorithm, the symbol function of the associa...For a given compactly supported scaling fun ct ion supported over [0,3]×[0,3], we present an algorithm to construct compac t ly supported orthogonal wavelets. By this algorithm, the symbol function of the associated wavelets can be constructed explicitly.展开更多
In this paper, a quasi-Newton method fbr semi-blind estimation is derived for channel estimation in uplink cloud radio access networks （C-RANs）. Different from traditional pilot-aided estimation, semiblind estimatio...In this paper, a quasi-Newton method fbr semi-blind estimation is derived for channel estimation in uplink cloud radio access networks （C-RANs）. Different from traditional pilot-aided estimation, semiblind estimation utilizes the unknown data symbols in addition to the known pilot symbols to estimate the channel. An initial channel state information （CSI） obtained by least-squared （LS） estimation is needed in semi-blind estimation. BFGS （Brayben, Fletcher, Goldfarb and Shanno） algorithm, which employs data as well as pilot symbols, estimates the CSI though solving the problem provided by maximum-likelihood （ML） principle. In addition, mean-square-error （MSE） used to evaluate the estimation performance can be further minimized with an optimal pilot design. Simulation results show that the semi-blind estimation achieves a significant improvement in terms of MSE performance over the conventional LS estimation by utilizing data symbols instead of increasing the number of pilot symbols, which demonstrates the estimation accuracy and spectral efficiency are both improved by semiblind estimation for C-RANs.展开更多
Feedforward symbol timing recovery techniques are particularly important for initial acquisition in burst modems. However, these techniques either have large calculation burden or sensitive to frequency offsets. In th...Feedforward symbol timing recovery techniques are particularly important for initial acquisition in burst modems. However, these techniques either have large calculation burden or sensitive to frequency offsets. In this paper, we proposed an efficient symbol timing recovery algorithm of MPSK signals named OMQ(Ordered Maximum power using Quadratic approximation partially) algorithm which is based on the Quadratic Approximation(QA) algorithm. We used ordered statistic sorting method to reduce the computational complexity further, meanwhile maximum mean power principle was used to decrease frequency offset sensitivity. The proposed algorithm adopts estimation-down sampling structure which is suitable for small packet size transmission. The results show that, while comparing with the QA algorithm, the computational complexity is reduced by 75% at most when 8 samples per symbol are used. The proposed algorithm shows better performance in terms of the jitter variance and sensitivity to frequency offsets.展开更多
In the execution of method invocation sequences to test component security,abnormal or normal information is generated and recorded in a monitor log. By searching abnormal information from monitor log,the exceptions t...In the execution of method invocation sequences to test component security,abnormal or normal information is generated and recorded in a monitor log. By searching abnormal information from monitor log,the exceptions that the component has can be determined. To facilitate the searching process,string searching methods could be employed. However,current approaches are not effective enough to search long pattern string. In order to mine the specific information with less number of matches,we proposed an improved Sunday string searching algorithm in this paper. Unlike Sunday algorithm which does not make use of the already matched characters,the proposed approach presents two ideas — utilizing and recycling these characters. We take advantage of all matched characters in main string,if they are still in the matchable interval compared with pattern string,to increase the distance that pattern string moves backwards. Experimental analysis shows that,compared to Sunday algorithm,our method could greatly reduce the matching times,if the scale of character set constituting both main string and pattern string is small,or if the length of pattern string is long. Also,the proposed approach can improve the search effectiveness for abnormal information in component security testing.展开更多
文摘For a given compactly supported scaling fun ct ion supported over [0,3]×[0,3], we present an algorithm to construct compac t ly supported orthogonal wavelets. By this algorithm, the symbol function of the associated wavelets can be constructed explicitly.
基金supported in part by the the National High Technology Research and Devel-opment Program of China(Grant No.2014AA01A701)National Natural Science Foundation of China(Grant No.61361166005)+2 种基金the State Major Science and Technology Special Projects(Grant No.2016ZX03001020006)the National Program for Support of Top-notch Young Pro-fessionalsthe Science and Technology Development Project of Beijing Municipal Education Commission of China(Grant No.KZ201511232036)
文摘In this paper, a quasi-Newton method fbr semi-blind estimation is derived for channel estimation in uplink cloud radio access networks （C-RANs）. Different from traditional pilot-aided estimation, semiblind estimation utilizes the unknown data symbols in addition to the known pilot symbols to estimate the channel. An initial channel state information （CSI） obtained by least-squared （LS） estimation is needed in semi-blind estimation. BFGS （Brayben, Fletcher, Goldfarb and Shanno） algorithm, which employs data as well as pilot symbols, estimates the CSI though solving the problem provided by maximum-likelihood （ML） principle. In addition, mean-square-error （MSE） used to evaluate the estimation performance can be further minimized with an optimal pilot design. Simulation results show that the semi-blind estimation achieves a significant improvement in terms of MSE performance over the conventional LS estimation by utilizing data symbols instead of increasing the number of pilot symbols, which demonstrates the estimation accuracy and spectral efficiency are both improved by semiblind estimation for C-RANs.
基金supported by the National Natural Science Foundation of China(NSFC.NO.61303253)
文摘Feedforward symbol timing recovery techniques are particularly important for initial acquisition in burst modems. However, these techniques either have large calculation burden or sensitive to frequency offsets. In this paper, we proposed an efficient symbol timing recovery algorithm of MPSK signals named OMQ(Ordered Maximum power using Quadratic approximation partially) algorithm which is based on the Quadratic Approximation(QA) algorithm. We used ordered statistic sorting method to reduce the computational complexity further, meanwhile maximum mean power principle was used to decrease frequency offset sensitivity. The proposed algorithm adopts estimation-down sampling structure which is suitable for small packet size transmission. The results show that, while comparing with the QA algorithm, the computational complexity is reduced by 75% at most when 8 samples per symbol are used. The proposed algorithm shows better performance in terms of the jitter variance and sensitivity to frequency offsets.
基金supported by National Natural Science Foundation of China (NSFC grant number:61202110,61401180 and 61502205)the Postdoctoral Science Foundation of China (Grant number:2015M571687 and 2015M581739)the Graduate Research Innovation Project of Jiangsu Province(KYLX15_1079 and KYLX16_0900)
文摘In the execution of method invocation sequences to test component security,abnormal or normal information is generated and recorded in a monitor log. By searching abnormal information from monitor log,the exceptions that the component has can be determined. To facilitate the searching process,string searching methods could be employed. However,current approaches are not effective enough to search long pattern string. In order to mine the specific information with less number of matches,we proposed an improved Sunday string searching algorithm in this paper. Unlike Sunday algorithm which does not make use of the already matched characters,the proposed approach presents two ideas — utilizing and recycling these characters. We take advantage of all matched characters in main string,if they are still in the matchable interval compared with pattern string,to increase the distance that pattern string moves backwards. Experimental analysis shows that,compared to Sunday algorithm,our method could greatly reduce the matching times,if the scale of character set constituting both main string and pattern string is small,or if the length of pattern string is long. Also,the proposed approach can improve the search effectiveness for abnormal information in component security testing.
