期刊文献+
共找到7篇文章
< 1 >
每页显示 20 50 100
模块组配型条码编码容量研究
1
作者 刘向东 《浙江大学学报(工学版)》 EI CAS CSCD 北大核心 2004年第1期90-92,共3页
阐述了模块组配型条码的概念及其最大编码容量的计算方法.采用组合数学中典型的 型分配问题的求解方法,得到求取分配数的实用递推公式,从而提出针对(n,k)码的兼容最大编码容量的小量模块编码容量计算方法.基于对模块数的选择,对几种模... 阐述了模块组配型条码的概念及其最大编码容量的计算方法.采用组合数学中典型的 型分配问题的求解方法,得到求取分配数的实用递推公式,从而提出针对(n,k)码的兼容最大编码容量的小量模块编码容量计算方法.基于对模块数的选择,对几种模块组配型国际标准条码编码字符集的设计准则进行了讨论,验证了计算方法的正确性. 展开更多
关键词 模块组配型条 容量 字符集 分配数 (n k) 模块数
下载PDF
Novel K-best detection algorithms for MIMO system
2
作者 向星宇 仲文 《Journal of Southeast University(English Edition)》 EI CAS 2009年第1期1-5,共5页
Aiming at the optimum path excluding characteristics and the full constellation searching characteristics of the K-best detection algorithm, an improved-performance K-best detection algorithm and several reduced-compl... Aiming at the optimum path excluding characteristics and the full constellation searching characteristics of the K-best detection algorithm, an improved-performance K-best detection algorithm and several reduced-complexity K-best detection algorithms are proposed. The improved-performance K-best detection algorithm deploys minimum mean square error (MMSE) filtering of a channel matrix before QR decomposition. This algorithm can decrease the probability of excluding the optimum path and achieve better performance. The reducedcomplexity K-best detection algorithms utilize a sphere decoding method to reduce searching constellation points. Simulation results show that the improved performance K-best detection algorithm obtains a 1 dB performance gain compared to the K- best detection algorithm based on sorted QR decomposition (SQRD). Performance loss occurs when K = 4 in reduced complexity K-best detection algorithms. When K = 8, the reduced complexity K-best detection algorithms require less computational effort compared with traditional K-best detection algorithms and achieve the same performance. 展开更多
关键词 sorted QR decomposition k-best sphere decoding maximum-likelihood detection minimum mean square error
下载PDF
Sparse constrained encoding multi-source full waveform inversion method based on K-SVD dictionary learning 被引量:1
3
作者 Guo Yun-dong Huang Jian-Ping +3 位作者 Cui Chao LI Zhen-Chun LI Qing-Yang Wei Wei 《Applied Geophysics》 SCIE CSCD 2020年第1期111-123,169,共14页
Full waveform inversion(FWI)is an extremely important velocity-model-building method.However,it involves a large amount of calculation,which hindsers its practical application.The multi-source technology can reduce th... Full waveform inversion(FWI)is an extremely important velocity-model-building method.However,it involves a large amount of calculation,which hindsers its practical application.The multi-source technology can reduce the number of forward modeling shots during the inversion process,thereby improving the efficiency.However,it introduces crossnoise problems.In this paper,we propose a sparse constrained encoding multi-source FWI method based on K-SVD dictionary learning.The phase encoding technology is introduced to reduce crosstalk noise,whereas the K-SVD dictionary learning method is used to obtain the basis of the transformation according to the characteristics of the inversion results.The multiscale inversion method is adopted to further enhance the stability of FWI.Finally,the synthetic subsag model and the Marmousi model are set to test the effectiveness of the newly proposed method.Analysis of the results suggest the following:(1)The new method can effectively reduce the computational complexity of FWI while ensuring inversion accuracy and stability;(2)The proposed method can be combined with the time-domain multi-scale FWI strategy flexibly to further avoid the local minimum and to improve the stability of inversion,which is of significant importance for the inversion of the complex model. 展开更多
关键词 k-SVD dictionary sparsity constraint polarity encoding MULTI-SOURCE full waveform inversion
下载PDF
二元叠加码M_q(n,k,d)码的平均汉明距离和均方差 被引量:8
4
作者 魏会贤 胡海燕 《数学的实践与认识》 北大核心 2017年第6期292-296,共5页
根据二元叠加码(Binary Superimposed Code)M_q(n,k,d)的定义及有限域F_q上n维向量空间的k维子空间的维数性质定义了一个高斯组合函数,利用这个组合函数研究了M_q(n,k,d)码的平均汉明(Hamming)距离和它的均方差问题,给出了计算公式.
关键词 Mq(n k d) 平均汉明距离 均方差
原文传递
二元叠加码M(m,k,d)的平均汉明距离和均方差 被引量:3
5
作者 阙凤珍 温少挺 崔俊明 《数学的实践与认识》 北大核心 2019年第6期311-315,共5页
根据二元叠加码(Binary Superimposed Code)M(m,k,d)的定义及完全图K_(2m)的性质,研究了M(m,k,d)码的平均汉明(Hamming)距离和它的均方差问题,给出了它们的计算公式.
关键词 M(m k d) 平均汉明距离 均方差
原文传递
Bag-of-visual-words model for artificial pornographic images recognition
6
作者 李芳芳 罗四伟 +1 位作者 刘熙尧 邹北骥 《Journal of Central South University》 SCIE EI CAS CSCD 2016年第6期1383-1389,共7页
It is illegal to spread and transmit pornographic images over internet,either in real or in artificial format.The traditional methods are designed to identify real pornographic images and they are less efficient in de... It is illegal to spread and transmit pornographic images over internet,either in real or in artificial format.The traditional methods are designed to identify real pornographic images and they are less efficient in dealing with artificial images.Therefore,criminals turn to release artificial pornographic images in some specific scenes,e.g.,in social networks.To efficiently identify artificial pornographic images,a novel bag-of-visual-words based approach is proposed in the work.In the bag-of-words(Bo W)framework,speeded-up robust feature(SURF)is adopted for feature extraction at first,then a visual vocabulary is constructed through K-means clustering and images are represented by an improved Bo W encoding method,and finally the visual words are fed into a learning machine for training and classification.Different from the traditional BoW method,the proposed method sets a weight on each visual word according to the number of features that each cluster contains.Moreover,a non-binary encoding method and cross-matching strategy are utilized to improve the discriminative power of the visual words.Experimental results indicate that the proposed method outperforms the traditional method. 展开更多
关键词 artificial pornographic image bag-of-words (BoW) speeded-up robust feature (SURF) descriptors visual vocabulary
下载PDF
A MACWILLIAMS TYPE IDENTITY ON LEE WEIGHT FOR LINEAR CODES OVER F_2+uF_2 被引量:3
7
作者 Shixin ZHU Yongsheng TANG 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2012年第1期186-194,共9页
In this paper, the MacWilliams type identity for the m-ply Lee weight enumerator for linear codes over F2 +uF2 is determined. As an application of this identity, the authors obtain a MacWilliams type identity on Lee ... In this paper, the MacWilliams type identity for the m-ply Lee weight enumerator for linear codes over F2 +uF2 is determined. As an application of this identity, the authors obtain a MacWilliams type identity on Lee weight for linear codes over F2m + uF2m. Furthermore, the authors prove a duality for the m-ply Lee weight distributions by taking advantage of the Krawtchouk polynomials. 展开更多
关键词 Lee weight linear codes MacWilliams type identity m-ply weight enumerator.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部