面向亮室对比度测量应用的高精度可变环境照明条件控制系统设计

针对目前显示器的亮室对比度性能测试方法中照明条件设置难度大及可调整性差等问题,提出了一种采用积分球和大功率彩色LED的可变环境照明条件控制系统.大功率LED采用WRGB四种颜色,其中白光作为主光源提供照度,其他3种有色光源主要用来对模拟照明环境的相关色温进行修正,这4种LED通过一定比例混合,可在积分球内部形成指定照度和相关色温值的均匀漫反射光照条件,以此来模拟实际的环境照明条件.经过实验验证,本系统模拟光照条件照度的相对误差可控制在5％以内,相关色温的相列误差可控制在1％以内.     

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.     

一种MPEG2视频解码器的系统设计

对于设计像 MPEG2视频解码器的复杂系统 ,关键的难点是其系统结构的设计。文中设计了一种适合 VL SI实现的 MPEG2解码器的系统结构。它支持 MPEG2 (MP@ML)码流 ,并且兼容 MPEG1码流。为了设计和优化这个结构 ,采用硬件描述语言 VHDL 设计了系统级的 MPEG2视频解码器。此解码器在 Viewlogic系统中进行了模拟 ,并且对一些码流进行了测试验证。     

基于遗传算法的卷积码快速译码

本文提出基于遗传算法(GA)的卷积码快速译码,进行格图上的单向(U-GA)和双向(B-GA)搜索译码.它利用遗传算法的群体多样性好、搜索空间宽广,具有全局优化能力,提高译码质量.通过模拟计算,分析了单向和双向的译码算法和群体规模M对误比特性能P_b的影响.模拟结果表明:在相同译码复杂度下、P_b=10^-6时,与MA算法(编码约束度K=19)相比,该译码算法约有0.5dB性能增益;与VA算法(K=7)相比,B-GA大约有1dB增益.     

RS码类的构建及在数据链模拟系统中的应用

Reed-Solomon码(RS码)具有强大的纠错能力,在数据通信中得到了广泛的应用,如RS(31,15)码已经成为美军数据链系统的标准码。为了实现应用于数据链模拟系统中的RS编译码类,从分析RS纠错编译码原理入手,在研究了RS编译码模型的基础上,重点对RS编译码的编程实现方法进行了详细分析。以VC++为编程实现平台,采用面向对象的程序设计方法,构建且封装了RS编译码类,最后对RS编译码类的纠错性能进行了验证,结果表明,设计的RS编译码类能够有效纠错且正确恢复发端发送的信息,满足模拟系统的设计要求。     

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.     

一种改善Turbo乘积编码OFDM系统性能的新方法

本文提出一种利用对译码器软信息限幅来改善多径衰落信道中Turbo乘积编码OFDM(TPC-OFDM)系统性能的新方法。通过对不同多径衰落信道中QPSK映射和16QAM映射的TPC-OFDM系统性能的数值仿真，结果表明在10^-5误比特率下，这种新方法比传统的迭代译码大约有6～10dB的改进，对严重多径环境下TPC-OFDM系统的错误平底也有明显的改进。     

串并联式七段数码管译码电路比较分析

对最新专利成果串联式七段数码管译码电路与目前大量使用的并联式七段数码管译码电路从译码原理、译码效率、失效及译码电路等方面进行比较分析，并得出结论即两种译码电路特点不同、适用范围不同、各有优缺点，他们之间是相互补充的关系，而不是相互取代的的关系。     

一种新的MIMO无线通信空时分组码方案

从MIMO(多入多出)引出空时分组码背景;针对实际MIMO应用提出了一种利用广义复正交方法新设计的满分集的码率为1/2的6个发射天线4个接收天线(6×4)和8个发射天线4个接收天线(8×4)结构的空时分组码系统,仿真结果表明该系统具有良好性能。     

Zero forcing based sphere decoder for generalized spatial modulation systems

To reduce the number of radio frequency (RF) chains in multiple input multiple output (MIMO) systems, generalized spatial modulation (GSM) techniques have been proposed in the literature. In this paper, we propose a zero‐forcing (ZF)‐based detector, which performs an initial pruning of the search tree that will be considered as the initial condition in a sphere decoding (SD) algorithm. The proposed method significantly reduces the computational complexity of GSM systems while achieving a near maximum likelihood (ML) performance. We analyze the performance of the proposed method and provide an analytic performance difference between the proposed method and the ML detector. Simulation results show that the performance of the proposed method is very close to that of the ML detector, while achieving a significant computational complexity reduction in comparison with the conventional SD method, in terms of the number of visited nodes. We also present some simulations to assess the accuracy of our theoretical results.