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.展开更多
The solubility, metastable zone width, and induction time of analgin for unseeded batch cooling crystallization in ethanol–aqueous system were experimentally determined. The solubility data could be well described by...The solubility, metastable zone width, and induction time of analgin for unseeded batch cooling crystallization in ethanol–aqueous system were experimentally determined. The solubility data could be well described by the van't Hoff equation model. The metastable zone width at various cooling rates was measured, and some parameters of nucleation kinetic were calculated using the Ny'vlt theory. Furthermore, the induction period of various temperatures and supersaturation ratios was also measured. According to classical nucleation theory, some nucleation parameters and interfacial energy was calculated through the induction time(t_(ind)) data. Homogeneous nucleation tended to occur when the supersaturation is high, whereas heterogeneous nucleation was more likely to occur when the supersaturation is low.展开更多
The transformation of basic functions is one of the most commonly used techniques for seismic denoising,which employs sparse representation of seismic data in the transform domain. The choice of transform base functio...The transformation of basic functions is one of the most commonly used techniques for seismic denoising,which employs sparse representation of seismic data in the transform domain. The choice of transform base functions has an influence on denoising results. We propose a learning-type overcomplete dictionary based on the K-singular value decomposition( K-SVD) algorithm. To construct the dictionary and use it for random seismic noise attenuation,we replace fixed transform base functions with an overcomplete redundancy function library. Owing to the adaptability to data characteristics,the learning-type dictionary describes essential data characteristics much better than conventional denoising methods. The sparsest representation of signals is obtained by the learning and training of seismic data. By comparing the same seismic data obtained using the learning-type overcomplete dictionary based on K-SVD and the data obtained using other denoising methods,we find that the learning-type overcomplete dictionary based on the K-SVD algorithm represents the seismic data more sparsely,effectively suppressing the random noise and improving the signal-to-noise ratio.展开更多
This paper explores brain CT slices segmentation technique and some related problems, including contours segmentation algorithms, edge detector, algorithm evaluation and experimental results. This article describes a ...This paper explores brain CT slices segmentation technique and some related problems, including contours segmentation algorithms, edge detector, algorithm evaluation and experimental results. This article describes a method for contour-based segmentation of anatomical structures in 3D medical data sets. With this method, the user manually traces one or more 2D contours of an anatomical structure of interest on parallel planes arbitrarily cutting the data set. The experimental results showes the segmentation based on 3D brain volume and 2D CT slices. The main creative contributions in this paper are: (1) contours segmentation algorithm; (2) edge detector; (3) algorithm evaluation.展开更多
The current massive use of digital communications demands a secure link by using an embedded system（ES） with data encryption at the protocol level. The serial peripheral interface（SPI） protocol is commonly used by...The current massive use of digital communications demands a secure link by using an embedded system（ES） with data encryption at the protocol level. The serial peripheral interface（SPI） protocol is commonly used by manufacturers of ESs and integrated circuits for applications in areas such as wired and wireless communications. We present the design and experimental implementation of a chaotic encryption and decryption algorithm applied to the SPI communication protocol. The design of the chaotic encryption algorithm along with its counterpart in the decryption is based on the chaotic Hénon map and two methods for blur and permute（in combination with DNA sequences）. The SPI protocol is configured in 16 bits to synchronize a transmitter and a receiver considering a symmetric key. Results are experimentally proved using two low-cost dsPIC microcontrollers as ESs. The SPI digital-to-analog converter is used to process, acquire, and reconstruct confidential messages based on its properties for digital signal processing. Finally, security of the cryptogram is proved by a statistical test. The digital processing capacity of the algorithm is validated by dsPIC microcontrollers.展开更多
Motivated by Sasaki＇s work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynom...Motivated by Sasaki＇s work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynomial over the rational number field. Another feature of the factorization algorithm presented in this article is a new recombination method, which can solve the extraneous factor problem before lifting based on numerical linear algebra. Both theoretical analysis and experimental data show that the algorithm is etIicient, especially for sparse bivariate polynomials.展开更多
基金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 the National Natural Science Foundation of China(21206109)China Ministry of Science and Major National Scientific Instrument Development Project(21527812)
文摘The solubility, metastable zone width, and induction time of analgin for unseeded batch cooling crystallization in ethanol–aqueous system were experimentally determined. The solubility data could be well described by the van't Hoff equation model. The metastable zone width at various cooling rates was measured, and some parameters of nucleation kinetic were calculated using the Ny'vlt theory. Furthermore, the induction period of various temperatures and supersaturation ratios was also measured. According to classical nucleation theory, some nucleation parameters and interfacial energy was calculated through the induction time(t_(ind)) data. Homogeneous nucleation tended to occur when the supersaturation is high, whereas heterogeneous nucleation was more likely to occur when the supersaturation is low.
基金Supported by the National"863"Project(No.2014AA06A605)
文摘The transformation of basic functions is one of the most commonly used techniques for seismic denoising,which employs sparse representation of seismic data in the transform domain. The choice of transform base functions has an influence on denoising results. We propose a learning-type overcomplete dictionary based on the K-singular value decomposition( K-SVD) algorithm. To construct the dictionary and use it for random seismic noise attenuation,we replace fixed transform base functions with an overcomplete redundancy function library. Owing to the adaptability to data characteristics,the learning-type dictionary describes essential data characteristics much better than conventional denoising methods. The sparsest representation of signals is obtained by the learning and training of seismic data. By comparing the same seismic data obtained using the learning-type overcomplete dictionary based on K-SVD and the data obtained using other denoising methods,we find that the learning-type overcomplete dictionary based on the K-SVD algorithm represents the seismic data more sparsely,effectively suppressing the random noise and improving the signal-to-noise ratio.
文摘This paper explores brain CT slices segmentation technique and some related problems, including contours segmentation algorithms, edge detector, algorithm evaluation and experimental results. This article describes a method for contour-based segmentation of anatomical structures in 3D medical data sets. With this method, the user manually traces one or more 2D contours of an anatomical structure of interest on parallel planes arbitrarily cutting the data set. The experimental results showes the segmentation based on 3D brain volume and 2D CT slices. The main creative contributions in this paper are: (1) contours segmentation algorithm; (2) edge detector; (3) algorithm evaluation.
基金Project supported by the CONACYT,México(No.166654)
文摘The current massive use of digital communications demands a secure link by using an embedded system（ES） with data encryption at the protocol level. The serial peripheral interface（SPI） protocol is commonly used by manufacturers of ESs and integrated circuits for applications in areas such as wired and wireless communications. We present the design and experimental implementation of a chaotic encryption and decryption algorithm applied to the SPI communication protocol. The design of the chaotic encryption algorithm along with its counterpart in the decryption is based on the chaotic Hénon map and two methods for blur and permute（in combination with DNA sequences）. The SPI protocol is configured in 16 bits to synchronize a transmitter and a receiver considering a symmetric key. Results are experimentally proved using two low-cost dsPIC microcontrollers as ESs. The SPI digital-to-analog converter is used to process, acquire, and reconstruct confidential messages based on its properties for digital signal processing. Finally, security of the cryptogram is proved by a statistical test. The digital processing capacity of the algorithm is validated by dsPIC microcontrollers.
基金supported by National Natural Science Foundation of China(GrantNos.91118001 and 11170153)National Key Basic Research Project of China(Grant No.2011CB302400)Chongqing Science and Technology Commission Project(Grant No.cstc2013jjys40001)
文摘Motivated by Sasaki＇s work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynomial over the rational number field. Another feature of the factorization algorithm presented in this article is a new recombination method, which can solve the extraneous factor problem before lifting based on numerical linear algebra. Both theoretical analysis and experimental data show that the algorithm is etIicient, especially for sparse bivariate polynomials.
