局域网链路层数据帧识别算法的设计与实现

对局域网中几种典型的链路层数据帧进行了分析,基于数据帧中的特征位,提出了一种数据帧识别算法,并对算法进行了性能分析。该数据帧识别算法解决了局域网链路层协议类型的分析和数据帧的识别问题。     

一种改进的B3G MIMO-OFDM系统的帧同步方法

同步问题一直是MIMO-OFDM系统的关键问题。前人虽提出了一些经典同步算法,但对同步实现中的关键参数——同步判决门限很少涉及。在前人提出的经典帧同步算法基础上进行改进,提出一种有效的自适应门限的同步帧头判决方案。同时证明该方案能有效地对抗无线信道中的码间干扰和多径衰落。仿真结果表明,此方案能获得很好的性能,适用于高速MIMO-OFDM系统。     

基于中国医用体域网频段的物理层方案设计及干扰分析

该文基于中国医疗体域网的专用频段提出了采用扩频的OQPSK调制方案,并在多种干扰的背景下进行分析,仿真结果表明该方案对宽带干扰具有较好的抑制性能,但是由于接收端帧检测算法虚警率较高而对窄带干扰较为敏感。为此提出基于两次延迟自相关的帧检测算法,并验证该算法对宽带和窄带干扰都有较好的抑制性能。该文的研究成果可以为我国无线体域网标准制定提供技术参考,目前该调制方案已被IEEE802.15.4n采纳。     

一种基于固定长度的EPON动态带宽分配方案

文中介绍了以太无源光网络(EPON),在此基础上提出了EPON的上下行帧结构,以及基于固定长度的一种EPON动态带宽分配方案。该方案以APON为借鉴,将EPON中以太网帧长度固定下来,采用对业务分时延优先级的动态分配算法。并对此方案的性能进行了分析。     

一种微弱点运动目标的快速统计检测算法

本文提出一种新的从序列图像中检测微弱点状运动目标算法,该算法基于多帧检测技术,它首先累加多个差分帧,构成组合帧,然后在组合帧内对目标轨迹进行统计判别.与其它检测算法相比较,该算法在保证较高检测性能的同时,具有快速、实时的特点.本文还给出了该算法性能的理论分析结果及实验仿真结果.     

移动视频业务的快速频道切换方案研究

提出了一种基于间插切换帧的移动视频业务快速频道切换方案,通过合理增加切换帧减少频道切换中的主要时间,即等待参考帧时间.然后对所提方案进行了性能分析和验证,仿真结果表明该方案可有效减少移动视频业务的频道切换时间.     

一种基于固定长度的EPON动态带宽分配方案

中介绍了以太无源光网络(EPON)，在此基础上提出了EPON的上下行帧结构，以及基于固定长度的一种EPON动态带宽分配方案。该方案以。APON为借鉴，将EPON中以太网帧长度固定下来，采用对业务分时延优先级的动态分配算法。并对此方案的性能进行了分析。     

超宽带发射参考系统中的多级并行检测

针对超宽带技术中块发送结构下的发射参考技术,提出了一种新的多级并行检测算法.该方法利用少量参考帧与块内接收数据帧对理想接收波形进行多级联合估计,通过软判决逐级逼近理想接收波形,最大限度地利用了数据帧本身包含的脉冲接收波形信息,提高了误码性能.利用随机向量二次型的矩生成函数及其积分,推导了该检测算法在任意给定块结构时的性能下界.采用IEEE802.15.3a的室内多径信道模型仿真表明,与传统发射参考接收机和其他块发送结构下的检测方案相比,该检测算法具有更好的误码性能,并由仿真性能和分析下界得到了关于块结构和不同块长对性能影响的一系列结论.     

一种新的基于MR的移动网络越区覆盖判别算法

针对移动网络系统中普遍存在的越区覆盖问题,提出了一种新的低成本的越区覆盖判别的新算法,从而提高网络的性能指标.该算法通过在Iub接口中实时采集信令MR帧,并对其MR帧进行同步解析获取其帧结构中的相关数据,在考虑用户切换掉话的多种场景下提出了基于邻区判别的越区覆盖侦测方案.实验结果显示该方法可以有效解决越区覆盖问题.     

整帧丢失恢复算法的改进及其在分布式编码中的应用

针对传统视频编码中的整帧丢失恢复算法,提出了一种新的改善边信息的方法,即对该算法进行改进,使其适合图像非线性运动,并将其用于分布式编码中边信息进行估计。实验结果表明,该算法可以大幅提高边信息估计的准确性,从而降低分布式编码中的W-Z帧的码率,提高分布式编码的性能。     

一种有效的双矢量测试BIST实现方案

文章提出了一种简单有效的双矢量测试BIST。实现方案．其硬件主要由反馈网络可编程且种子可重置的LF—SR和映射逻辑两部分构成。给出了一种全新的LPSR最优种子及其反馈多项式组合求取算法，该算法具有计算简单且容易实现的特点。最后。使用这种BIST、方案实现了SoC中互联总线间串扰故障的激励检测，证明了该方案在计算量和硬件开销方面的优越性。     

Digital signature scheme based on factoring and discrete logarithms

A digital signature scheme based on two well-known assumptions is presented. The security of the proposed scheme is based on the difficulties of simultaneously solving the factoring and discrete logarithms problems with almost the same sizes of arithmetic moduli. Each user in the system uses common arithmetic moduli and only requires one public key and one private key     

Conditional arithmetic coding of tree structured vectorquantisation indices with reduced memory

The authors propose an efficient conditional arithmetic coding scheme for tree structured vector quantisation (TSVQ) systems which effectively exploits interblock correlation. A memory reduction method for the conditional arithmetic coding scheme is also presented. Simulation results show that the proposed scheme provides remarkable bit-rate reduction performance     

基于帧间去相关的超光谱图像压缩方法

针对超光谱图像的特点和硬件实现的实际需要,提出了一种基于小波变换的前向预测帧间去相关超光谱图像压缩算法。通过图像匹配和帧间去相关,消除超光谱图像帧间的冗余,对残差图像的压缩采用基于小波变换的快速位平面结合自适应算术编码的压缩算法,按照率失真准则控制输出码流,实现了对超光谱图像的高保真压缩。通过实验证明了该方案的有效性,基于小波变换的快速位平面结合自适应算术编码的压缩算法速度优于SPIHT,而且易于硬件实现。     

Iterative decoding of serially concatenated arithmetic and channel codes with JPEG 2000 applications.

In this paper, an innovative joint-source channel coding scheme is presented. The proposed approach enables iterative soft decoding of arithmetic codes by means of a soft-in soft- out decoder based on suboptimal search and pruning of a binary tree. An error-resilient arithmetic coder with a forbidden symbol is used in order to improve the performance of the joint source/channel scheme. The performance in the case of transmission across the AWGN channel is evaluated in terms of word error probability and compared to a traditional separated approach. The interleaver gain, the convergence property of the system, and the optimal source/channel rate allocation are investigated. Finally, the practical relevance of the proposed joint decoding approach is demonstrated within the JPEG 2000 coding standard. In particular, an iterative channel and JPEG 2000 decoder is designed and tested in the case of image transmission across the AWGN channel.     

基于OMAP-L137的电能质量监测仪的研制

提出了基于OMAP-L137的电能质量监测仪的设计方案。在此基础上,介绍了本仪器的软、硬件结构及算法。针对谐波检测中的动态扰动的存在,采用了一种加窗插值修正算法来提高测量准确度;同时通过Delphi编程工具,设计了良好的人机交互界面,并通过实验验证了系统的可靠性与实用性。     

Highly efficient coding schemes for contour lines based on chaincode representations

The encoding schemes utilize the first- and second-order Markov models to describe the source structure. Two coding techniques, Huffman encoding and arithmetic encoding, are used to achieve a high coding efficiency. Universal code tables which match the statistics of contour line drawings obtained from 64 contour maps are presented and can be applied to encode all contour line drawings with chain code representations. Experiments have shown about a 50% improvement on the code amount over the conventional chain encoding scheme with arithmetic coding schemes, and also have shown a compression rate comparable to that obtained by T. Kaneko and M. Okudaira (1985) with Huffman coding schemes, while this implementation is substantially simpler     

Joint lossless-source and channel coding using automatic repeatrequest

The susceptibility of arithmetic coding to errors is utilized for channel error recovery using an automatic repeat request (ARQ) scheme. The presented scheme optimizes the tradeoff between the redundancy added to overcome channel errors and detection capability. With this approach, the type of error pattern introduced by the channel does not affect the receiver's detection capability. This scheme is suitable for transmitting long files over low bit error rate channels, and it provides the assurance of reconstructing the original data, free from catastrophic errors     

On entropy-constrained vector quantization using gaussian mixture models

A flexible and low-complexity entropy-constrained vector quantizer (ECVQ) scheme based on Gaussian mixture models (GMMs), lattice quantization, and arithmetic coding is presented. The source is assumed to have a probability density function of a GMM. An input vector is first classified to one of the mixture components, and the Karhunen-Lo`eve transform of the selected mixture component is applied to the vector, followed by quantization using a lattice structured codebook. Finally, the scalar elements of the quantized vector are entropy coded sequentially using a specially designed arithmetic coder. The computational complexity of the proposed scheme is low, and independent of the coding rate in both the encoder and the decoder. Therefore, the proposed scheme serves as a lower complexity alternative to the GMM based ECVQ proposed by Gardner, Subramaniam and Rao [1]. The performance of the proposed scheme is analyzed under a high-rate assumption, and quantified for a given GMM. The practical performance of the scheme was evaluated through simulations on both synthetic and speech line spectral frequency (LSF) vectors. For LSF quantization, the proposed scheme has a comparable performance to [1] at rates relevant for speech coding (20-28 bits per vector) with lower computational complexity.