登录

双语推荐:低密度生成矩阵码

设计了一种可用于加密的块结构低密度生成矩阵Block-LDGM.该生成矩阵由一组交织子矩阵组成,且这些交织子矩阵可以用二次交织多项式来描述.以这些二次交织多项式的系数作为密钥,可实现对交织子矩阵的随机化,从而实现对Block-LDGM的加密.基于三分图,提出多边缘置信度传播算法和滤波衰减消解方法,实现基于Block-LDGM复杂度信息压缩编.仿真结果表明:设计的可加密BlockLDGM,具有近香农限的压缩性能,同时具有较高的保密能力.
An encrypting block low density generator matrix (Block-LDGM ) code was proposed in this paper .The generator matrix of the encrypting Block-LDGM code was composed of a group of permu-tation submatrices ,corresponded to quadratic permutation polynomials (QPPs) .The coefficients of the QPPs ,which were served as secret keys ,were used to randomize the permutation submatrices and encrypt the codes .Based on the multi-edge type bipartite graph of the Block-LDGM code ,the corre-sponding multi-edge type belief propagation (M TBP) algorithm with a filter-damping decimation was developed for the source compression .Simulation results show that the proposed scheme achieves close to state-of-the-art performance with a high level security .
基于等差矩阵的性质特征,提出了一种QC-LDPC(准循环低密度奇偶校验)的新颖构造方法。该构造方法易于有效编译,具有良好的围长特性,可有效避免四环,使生成字不受短环的干扰,且在硬件实现方面可节省存储空间。仿真结果表明:当误率达到10-7时,该构造方法造出的高率QC-LDPC(3780,3542)与ITU-T G.975中的RS(255,239)相比,其净编增益提高了约2.1dB,具有更好的纠错性能;与QC-LDPC(4221,3956)相比,净编增益提高了0.35dB。
On the basis of the property and features of equideviate matrixes,a novel method for constructing Quasi-Cyclic Low-Density Parity-Check (QC-LDPC)codes is presented in this paper.The LDPC codes constructed in this method are easy for ef-fective encoding and decoding,have good girth properties and can avoid the girth-4 effectively,which prevents the generated codes from short cycle interference.Furthermore,it can save the storage space in terms of hardware implementation.The sim-ulation results show that when the bit error rate reaches 10-7 ,the net coding gain of the high code-rate QC-LDPC (3780, 3542)constructed this way is improved by about 2.1 dB as compared with that of the RS (255,239)code in ITU-T G.975, proving that the code has a better error correcting performance,and by 0.35 dB as compared with that of regular QC-LDPC (4221,3956)code.

[ 可能符合您检索需要的词汇 ]

从酉群SU(R)典型生成元的构造出发,证明了生成元的性质,并利用该性质给出了单粒子量子态密度矩阵的具体表示形式及其表示系数所满足的关系式.
Under the construction of the classical generators of the unitary group SU(R),we proved an important property of these generators.Using the property,we also established the representation of the single-particle quantum state and showed the relationship of the coefficients.

[ 可能符合您检索需要的词汇 ]

螺栓松动是一种常见且具有潜在危害的机械故障。考虑到螺栓松动会导致被联接件结合部动力参数发生变化,提出了一种基于两被联接件振动信号的松动识别方法。所提方法首先计算两信号的概率密度,并对概率密度曲线进行网格化处理生成概率矩阵,继而对概率矩阵进行主元分析(PCA),在合并两路信号经主元分析后所得投影矩阵之后,再次进行主元分析和投影。设计了两种识别方式,方式1首先按上述过程进行已知样本训练以得到各松动状态投影点,识别时根据所得投影点与各状态投影点间的欧式距离进行判断;方式2使用螺栓紧固状态时所得样本数据和现场实测数据直接按上述过程进行计算,并根据 PCA 特性设计了松动判别条件。试验验证表明所提方法能够准确区分不同松动状态,且识别方式2操作简便,无需故障样本,易于实际应用。
Considering that the bolt looseness induces the variation of dynamic parameters of joint of bolt connection,a detection method was proposed based on vibration signals of two connected parts.The probability densities of the two signals were calcuated,the probability density curves were processed by a mesh to obtain probability matrixes, and were the probability matrixes were transformed by using principal component analysis (PCA)method.After PCA,two projection matrixes of the probability matrixes were merged to one matrix.To this matrix,PCA and projection were implemented again.According to the peculiarity of bolt looseness,tow detection modes are designed based on the proposed method.The mode 1 carries out training work using foregone samples to generate projection points of each looseness condition employing the proposed method,then in detection,Euclidean distance between projection point and each foregone projection point was used as estimation criterion.The mode 2 directly

[ 可能符合您检索需要的词汇 ]

经典竞争凝聚(CA)算法具有自动寻找聚类总数的特性,避免了预判参数对聚类结果的影响,但在聚类过程中,该算法并未利用样本数据中普遍存在的少量已知信息,而这些已知信息往往能够对整个聚类过程提供有益的帮助;此外算法在相似度度量函数上采用了最为常见的欧氏距离,该距离仅适用于球状的聚类,且存在等划分的趋势,这就制约了算法的应用范围.针对上述问题,通过引入具有半监督学习能力的半监督项,增强隶属度矩阵的划分能力,并利用样本数据的点密度信息,生成距离调节因子修正欧氏距离,最终得到了基于点密度的半监督CA算法.在人造模拟图像和真实图像上的聚类分割结果,以及与其它算法的性能比较,表明了所得算法,能得到较为准确的中心值,有更佳的聚类效果.
The competitive agglomeration(CA)is a very classic algorithm in clustering algorithm.The algorithm has the ability to get cluster number automatically.It j udges and gives up the false clustering centers during iterative process of continuous until the last number of cluster is most appropriate for sample date.Through this way it avoids the influence on the clustering results by anticipating parameters incorrectly,and does not need to set precise clustering number for sample date.But during its clustering,it fails to take into account the known information, which is little but prevalent in the sample data.However those known informations are important for the clustering results.Obviously,making proper use of the information is conducive to improve the clustering rate.Moreover,the algorithm uses the Euclidean distance as the similarity function.Even though the distance formula has the advantages in calculation and is wildly used in common algorithms,the distance is only applic

[ 可能符合您检索需要的词汇 ]

科研活动里的合作现象越来越成为一种全球范围内的大趋势,表现在论文产出中是作者间的合著率在过去的100多年内越来越高,同时这种活动中的合作关系也越来越复杂。本文以图书馆与情报学领域内的论文合著为例,主要针对科研合作网络展开研究,生成了以合著论文里文献生产者共现为特征的合作矩阵与网络,并验证了作者合作网络的无标度特征。本文将合作网络具体细化为三种类型:作者合作网络、机构合作网络和国家合作网络,并将这三种网络使用复杂网络与社会网络技术结合进行分析并作了横向对比。结果发现图书馆与情报学领域内的作者合作网络是非连通的稀疏网络,科学家之间已成多个研究社团,机构与国家合作网络都有较短的平均路径、较高的网络密度和集聚系数。论文最后还对目前常用的合作网络研究方法进行了反思和展望。
Collaboration efforts in research activities is increasingly becoming a worldwide trend,which was reflected in the ratio for collaborators proportions in all the research papers communities higher and higher in the past one hundred years, while the relationship in such activities becomes increasingly complex. In this paper, taking the cooperation phenomenon in the field of library and information science as an example, the scientific collaboration networks was mainly explored, the cooccurrence matrix characterized by cooperation networks was produced, and the author scalefree networks phenomena was verified. Then the knowledge networks were defined clearly as author cooperation networks, institutions cooperation networks and national cooperation networks, all these three networks were studied with complex networks and social network technologies analysis under a comparison perspective. The results showed that the cooperation networks in the field of library and information sc

[ 可能符合您检索需要的词汇 ]