The key to narrow-band interference excision in frequency domain is to determine the excision thresh- old in direct-sequence spread-spectrum （DS-SS） systems. The excision threshold is a non-linear function related t...The key to narrow-band interference excision in frequency domain is to determine the excision thresh- old in direct-sequence spread-spectrum （DS-SS） systems. The excision threshold is a non-linear function related to the number and the power of interference, and attempting to get the exact relation of threshold related to the number and the power of interference is almost impossible. The N-sigma algorithm determines the excision threshold using subsection function; however, the excision threshold determined by this method is not exact. A new method to determine the threshold of N-sigma algorithm is proposed. The new method modifies the scale factor N by use of the membership function. The threshold determined by this method is consecutive and smooth, and it is closer to the fact than that of the initial N-sigma algorithm. The GPS signal and single-tone （CW） interference （that is, typical narrow-band interference） are implemented in the simulation, and the results are presented to demonstrate the validity of the new algorithm.展开更多
An improved method of generating the self-balanced chaotic spread-spectrum code is presented. The chaotic-map pseudorandom sequence is used as the generated source. After a series of processing two-valued quantization...An improved method of generating the self-balanced chaotic spread-spectrum code is presented. The chaotic-map pseudorandom sequence is used as the generated source. After a series of processing two-valued quantization, inversion, all upside down, radix-S block upside down and shift combination, the proposed code is achieved. Theory analysis and simulation performance of the improved code are illustrated. And the results indicate that the suggested method gains a better performance than the traditional one by reasonable choices of the initial value and the S parameter in the im- proved method. Meanwhile the chaotic sequence＇ s characteristic of large addresses is inherited when the chaotic-map is used as the source. This advantage makes this improved code very suitable for the multiple access application in communication system.展开更多
This paper presents a secure spread-spectrum watermarking algorithm for digital images in discrete wavelet transform (DWT) domain. The algorithm is applied for embedding watermarks like patient identification /source ...This paper presents a secure spread-spectrum watermarking algorithm for digital images in discrete wavelet transform (DWT) domain. The algorithm is applied for embedding watermarks like patient identification /source identification or doctors signature in binary image format into host digital radiological image for potential telemedicine applications. Performance of the algorithm is analysed by varying the gain factor, subband decomposition levels, size of watermark, wavelet filters and medical image modalities. Simulation results show that the proposed method achieves higher security and robustness against various attacks.展开更多
针对通信中软扩频信号伪码序列盲估计困难的问题,提出一种奇异值分解(singular value decomposition,SVD)和K-means聚类相结合的方法。该方法先对接收信号按照一倍伪码周期进行不重叠分段构造数据矩阵。其次对数据矩阵和相似性矩阵分别...针对通信中软扩频信号伪码序列盲估计困难的问题,提出一种奇异值分解(singular value decomposition,SVD)和K-means聚类相结合的方法。该方法先对接收信号按照一倍伪码周期进行不重叠分段构造数据矩阵。其次对数据矩阵和相似性矩阵分别进行SVD完成对伪码序列集合规模数的估计、数据降噪、粗分类以及初始聚类中心的选取。最后通过K-means算法优化分类结果,得到伪码序列的估计值。该算法在聚类之前事先确定聚类数目,大大减少了迭代次数。同时实验结果表明,该算法在信息码元分组小于5 bit,信噪比大于-10 dB时可以准确估计出软扩频信号的伪码序列,性能较同类算法有所提升。展开更多
文摘The key to narrow-band interference excision in frequency domain is to determine the excision thresh- old in direct-sequence spread-spectrum （DS-SS） systems. The excision threshold is a non-linear function related to the number and the power of interference, and attempting to get the exact relation of threshold related to the number and the power of interference is almost impossible. The N-sigma algorithm determines the excision threshold using subsection function; however, the excision threshold determined by this method is not exact. A new method to determine the threshold of N-sigma algorithm is proposed. The new method modifies the scale factor N by use of the membership function. The threshold determined by this method is consecutive and smooth, and it is closer to the fact than that of the initial N-sigma algorithm. The GPS signal and single-tone （CW） interference （that is, typical narrow-band interference） are implemented in the simulation, and the results are presented to demonstrate the validity of the new algorithm.
文摘An improved method of generating the self-balanced chaotic spread-spectrum code is presented. The chaotic-map pseudorandom sequence is used as the generated source. After a series of processing two-valued quantization, inversion, all upside down, radix-S block upside down and shift combination, the proposed code is achieved. Theory analysis and simulation performance of the improved code are illustrated. And the results indicate that the suggested method gains a better performance than the traditional one by reasonable choices of the initial value and the S parameter in the im- proved method. Meanwhile the chaotic sequence＇ s characteristic of large addresses is inherited when the chaotic-map is used as the source. This advantage makes this improved code very suitable for the multiple access application in communication system.
文摘This paper presents a secure spread-spectrum watermarking algorithm for digital images in discrete wavelet transform (DWT) domain. The algorithm is applied for embedding watermarks like patient identification /source identification or doctors signature in binary image format into host digital radiological image for potential telemedicine applications. Performance of the algorithm is analysed by varying the gain factor, subband decomposition levels, size of watermark, wavelet filters and medical image modalities. Simulation results show that the proposed method achieves higher security and robustness against various attacks.
文摘针对通信中软扩频信号伪码序列盲估计困难的问题,提出一种奇异值分解(singular value decomposition,SVD)和K-means聚类相结合的方法。该方法先对接收信号按照一倍伪码周期进行不重叠分段构造数据矩阵。其次对数据矩阵和相似性矩阵分别进行SVD完成对伪码序列集合规模数的估计、数据降噪、粗分类以及初始聚类中心的选取。最后通过K-means算法优化分类结果,得到伪码序列的估计值。该算法在聚类之前事先确定聚类数目,大大减少了迭代次数。同时实验结果表明,该算法在信息码元分组小于5 bit,信噪比大于-10 dB时可以准确估计出软扩频信号的伪码序列,性能较同类算法有所提升。
