Accelerated computational implementation of reconciliation for continuous variable quantum key distribution on GPU

For the low computing speed of reconciliation for current continuous variable quantum key distribution， CPU&GPU-parallel reconciliation algorithms was designed based on LDPC of SEC protocol to speed up decoding computing.In order to raise decoding speed without sacrifice reconciliation efficiency,a static two-way cross linked list to efficiently store large scale sparse parity matrix was employed.The simulation experimental results show that the speed of the decoding rate reaches 16.4 kbit/s when the channel SNR is over 4.9 dB and the reliability of the 2×10⁵continuous variable quantum sequence,with reconciliation efficiency of 91.71%.The experimental based on the Geforce GT 650 MB GPU and the 2.5 GHz and 8 GB memory CPU hardware platform.Relative to the only CPU platform,computing speed increased by more than 15 times.     

无线双模数字对讲机的设计与实现

传统模拟对讲机由于频谱利用率低、抗干扰性能差、频道开放、不具有保密性等原因已经很难满足需求。文章介绍的无线双模对讲机用于改善传统模拟对讲机抗干扰及保密性差的缺点,所提双模对讲机设计方案综合了集群和无中心两种工作模式功能,具有灵活设置与抗干扰性强的优点。文中重点设计了对讲机的软硬件结构,还对音频编解码进行了讨论分析。     

ENIG焊点的失效机理及镀层重工方法研究

采用显微形貌、微观结构和元素成分分析等物理分析方法,以不同类型的化镍浸金(electroless nickel/immersion gold,ENIG)基板为对象,分析了其焊点在不同情形下的失效模式和失效机理,阐述了"黑盘"缺陷的主要失效特征,研究了具有黑盘缺陷的化镍浸金基板的重工工艺.研究结果显示,Ni层断裂表面单一的高P含量或轻微Ni层腐蚀不能作为黑盘缺陷的唯一依据,已形成良好金属间化合物(intermetallic compound,IMC)层的Ni层腐蚀位置的焊接界面仍具有良好的机械结合强度,采用喷锡工艺(hot air solder level,HASL)对具有黑盘缺陷的化镍浸金基板进行重新处理切实可行.     

A New Class of Efficient Block-Iterative Interference Cancellation Techniques for Digital Communication Receivers

A new and efficient class of nonlinear receivers is introduced for digital communication systems. These iterated-decision receivers use optimized multipass algorithms to successively cancel interference from a block of received data and generate symbol decisions whose reliability increases monotonically with each iteration. Two variants of such receivers are discussed: the iterated-decision equalizer and the iterated-decision multiuser detector. Iterated-decision equalizers, designed to equalize intersymbol interference (ISI) channels, asymptotically achieve the performance of maximum-likelihood sequence detection (MLSD), but only have a computational complexity on the order of a linear equalizer (LE). Even more importantly, unlike the decision-feedback equalizer (DFE), iterated-decision equalizers can be readily used in conjunction with error-control coding. Similarly, iterated-decision multiuser detectors, designed to cancel multiple-access interference (MAI) in typical wireless environments, approach the performance of the optimum multiuser detector in uncoded systems with a computational complexity comparable to a decorrelating detector or a linear minimum mean-square error (MMSE) multiuser detector.     

Cohen–Macaulay Multi–Rees Algebras

Let A be a local ring, and let I ₁,...,I _r A be ideals of positive height. In this article we compare the Cohen–Macaulay property of the multi–Rees algebra R _A (I ₁,...,I _r ) to that of the usual Rees algebra R _A (I ₁ ··· I _r ) of the product I ₁ ··· I _r . In particular, when the analytic spread of I ₁ ··· I _r is small, this leads to necessary and sufficient conditions for the Cohen–Macaulayness of R _A (I ₁,...,I _r ). We apply our results to the theory of joint reductions and mixed multiplicities.     

The independence of initial vectors in the subdivision schemes

Starting with an initial vector λ = (λ(κ))κ∈z ∈ ep(Z), the subdivision scheme generates asequence (Snaλ)∞n=1 of vectors by the subdivision operator Saλ(κ) = ∑λ(j)a(k - 2j), k ∈ Z. j∈zSubdivision schemes play an important role in computer graphics and wavelet analysis. It is very interesting tounderstand under what conditions the sequence (Snaλ)∞n=1 converges to an Lp-function in an appropriate sense.This problem has been studied extensively. In this paper we show that the subdivision scheme converges forany initial vector in ep(Z) provided that it does for one nonzero vector in that space. Moreover, if the integertranslates of the refinable function are stable, the smoothness of the limit function corresponding to the vectorλ is also independent of λ.     

Iterative multi-user detection and decoding for space-time block coding systems

1 Introduction Recently space–time coding (STC) techniques [1] are designed to combat fading in wireless links by utilizing multiple antenna systems, in which transmit diversity and coding gains can be exploited without sacrificing additional power and b…     

Soft-Decision Decoding of Punctured Convolutional Codes in Asynchronous-CDMA Communications Under Perfect Phase-Tracking Conditions

In this paper, the performance of punctured convolutional codes of short constraint lengths is discussed. The punctured codes are used to provide error protection to a particular user in an asynchronous CDMA system. A perfect phase reference is assumed to be available throughout this paper. A slow fading Rician channel is assumed. Maximum likelihood decoding through a Viterbi algorithm is used to decode the information symbols. Soft-decision decoding of punctured convolutional codes is considered in this paper. The upper bounds with Viterbi decoding are derived and plotted for the various punctured codes considered. The simulated results are found to agree very well with their upper and lower bounds.     

并行级联LDPC码译码迭代终止准则研究

提出了两种低复杂度的终止准则,以用于降低PCGC（并行级联Gallager码,parallel concatenated gallagercode）的译码器运算量.这两种准则通过观察边信息方差的改变情况,来判断是否终止译码器迭代.计算机仿真结果证明,这些终止准则可有效地降低译码器运算量,且不影响译码器误比特率性能.     

卫星通信协议中卷积码序列译码的计算机模拟

主要研究卫星通信协议IESS 309协议中的系统卷积码的编码及其序列译码的计算机模拟。用C语言实现了码率为1／2的36位的系统卷积码的编码，然后模拟高斯噪声信道生成一个Fano度量表，最后用Fano算法实现该卷积码的软判决序列译码，并进行了性能分析，为以后的工程应用打下一个良好的基础。