A novel lossless data compression scheme based on the error correcting Hamming codes

This paper introduces a novel lossless binary data compression scheme that is based on the error correcting Hamming codes, namely the HCDC scheme. In this scheme, the binary sequence to be compressed is divided into blocks of n bits length. To utilize the Hamming codes, the block is considered as a Hamming codeword that consists of p parity bits and d data bits (n=d+p). Then each block is tested to find if it is a valid or a non-valid Hamming codeword. For a valid block, only the d data bits preceded by 1 are written to the compressed file, while for a non-valid block all n bits preceded by 0 are written to the compressed file. These additional 1 and 0 bits are used to distinguish the valid and the non-valid blocks during the decompression process. An analytical formula is derived for computing the compression ratio as a function of block size, and fraction of valid data blocks in the sequence. The performance of the HCDC scheme is analyzed, and the results obtained are presented in tables and graphs. Finally, conclusions and recommendations for future works are pointed out.     

Burrows–Wheeler compression with variable length integer codes

The final coder in Burrows–Wheeler compression is usually either an adaptive Huffman coder (for speed) or a complex of arithmetic coders for better compression. This article describes the use of conventional pre‐defined variable length codes or universal codes and shows that they too can give excellent compression. The paper also describes a ‘sticky Move‐to‐Front’ modification which gives a useful improvement in compression for most files. Copyright © 2002 John Wiley & Sons, Ltd.     

A fast algorithm for constructing nearly optimal prefix codes

Huffman algorithm allows for constructing optimal prefix‐codes with O(n·logn) complexity. As the number of symbols ngrows, so does the complexity of building the code‐words. In this paper, a new algorithm and implementation are proposed that achieve nearly optimal coding without sorting the probabilities or building a tree of codes. The complexity is proportional to the maximum code length, making the algorithm especially attractive for large alphabets. The focus is put on achieving almost optimal coding with a fast implementation, suitable for real‐time compression of large volumes of data. A practical case example about checkpoint files compression is presented, providing encouraging results. Copyright © 2015 John Wiley & Sons, Ltd.     

Design of efciently encodable nonbinary LDPC codes for adaptive coded modulation

This paper is concerned with constructions of nonbinary low-density parity-check(LDPC)codes for adaptive coded modulations(ACM).A new class of efciently encodable structured nonbinary LDPC codes are proposed.The defining parity-check matrices are composed of scalar circulant sub-matrices which greatly reduce the storage requirement when compared with random LDPC codes.With this special structure of paritycheck matrix,an efcient encoding algorithm is presented.Based on the proposed codes,a family of variablerate/variable-field nonbinary LDPC codes is designed for the ACM system.When combined with matched-size signal constellations,the family of constructed codes can achieve a wide range of spectral efciency.Furthermore,the resultant ACM system can be implemented via a set of encoder and decoder.Simulation results show that the proposed nonbinary LDPC codes for the ACM system perform well.     

基于TMS320C6701 DSP的线性调频信号的数字脉冲压缩

线性调频信号可以获得较大的压缩比,有着良好的距离分辨率和径向速度分辨率,是目前雷达信号采用的主要形式。详述了如何利用TI公司的TMS320C6701DSP实现线性调频信号的频域数字脉冲压缩,给出了系统的实现框图和脉压结果。     

基于三个自对偶码的S-链和量子码构造

用随机搜索算法和典型群理论,研究了双循环形自对偶码D3,D4和D5的对偶距离d⊥满足3≤d⊥≤7的子码,确立了这些子码构成的自正交子码链及它们的对偶构成的S-链。利用得到的S-链,由Steane构造法构造出新的量子纠错码。     

Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation

This paper is concerned with constructions of nonbinary low-density parity-check （LDPC） codes for adaptive coded modulations （ACM）. A new class of efficiently encodable structured nonbinary LDPC codes are proposed. The defining parity-check matrices are composed of scalar circulant sub-matrices which greatly reduce the storage requirement when compared with random LDPC codes. With this special structure of parity- check matrix, an efficient encoding algorithm is presented. Based on the proposed codes, a family of variable- rate/variable-field nonbinary LDPC codes is designed for the ACM system. When combined with matched-size signal constellations, the family of constructed codes can achieve a wide range of spectral efficiency. Furthermore, the resultant ACM system can be implemented via a set of encoder and decoder. Simulation results show that the proposed nonbinary LDPC codes for the ACM system perform well.     

基于部分相关的LFM脉冲全参数估计

针对线性调频（LFM）脉冲信号的侦察问题,提出了调频率、中心频率、信号到达时间、脉宽全套参数集的估计方法。首先,使用分数阶傅里叶变换（FrFT）对信号的调频率与时频关系进行估计;紧接着选取部分相关脉冲对信号进行积累,利用自相关处理完成中心频率、信号到达时间、脉宽参数的估计;然后推导了估计参数的克拉美劳下界（CRLB）,分析了信噪比对估计误差的影响;最后分析了部分积累脉宽对估计误差的影响,给出了积累脉宽的选择范围。仿真分析表明,调频率估计误差几乎达到CRLB,在信噪比0 dB、基带与调制参数均未知的条件下,中心频率估计均方根误差约为10^-1MHz数量级,信号到达时间和脉宽估计均方根误差约在10^-1 μs数量级。参数估计误差受到相关脉冲宽度的影响,随着相关脉冲宽度的增加,估计误差呈现先减小后增大的趋势。所提方法特别适用于脉压、合成孔径等新体制雷达的侦察。     

基于TMS系列DSP实现LFM信号的实时脉冲压缩

研究了以定点通用型DSP芯片TMS320VC5509为硬件核心的LFM信号实时脉冲压缩技术。在CCS 3.3软件开发平台上实现,采用C语言编程,结合Matlab仿真得到LFM信号和匹配滤波器的系数,在时域实现脉冲压缩算法。为有效抑制副瓣的影响,采用海明窗加权函数对滤波器进行调制。采用单位阶数耗时衡量滤波算法,通过增加滤波模块接口的方法对数据存储更新方式进行优化,并结合FIR滤波器的特性简化了卷积算法。测试表明,系统工作稳定,处理精度和实时性均达到了较高标准,可以满足工程应用的要求。     

基于FPGA的时域数字脉冲压缩处理器的设计

一种基于FPGA的适用于中小压缩比情况的时域数字脉冲压缩处理器的实现方案。该处理器具有使用灵活、便于功能扩展、成本低的特点,已用于某雷达信号处理机中,性能稳定。     

基于小波包变换的指纹图像分级压缩算法

针对指纹图像中频分量丰富,高频和低频分量相对较少的特点,利用小波包分析提出了一种指纹图像分级压缩算法。将小波包变换后的指纹图像按能量多少进行分级,对包含能量较多的中频子图像,采用无损差分脉冲编码调制（DPCM）,对包含能量较少的低频和高频子图像,采用嵌入式零数编码（EZW）算法;并将压缩图像码流与特征点信息相结合进行图像重建。仿真实验表明,该算法在保证重建质量的前提下,比传统的小波零树编码算法压缩比平均提高了约1.832,信噪比平均提高了约4.07,平均运算时间减少了约26%。     

Joint source-channel coded multidimensional modulation for variable-length codes

Resource-constrained networks such as deep space communications and mobile communications have the phenomena such us large-scale path loss,small-scale fading,and multipath effect,which are very hostile for information transmission.Combining Shannon’s source-channel coding theory with multidimensional modulation,an en/decoding method is proposed in this article called variable-length symbol-level joint sourcechannel and multidimensional modulation.Utilizing symbol-level source a priori information,an optimized symbol-level L-dimensional M-ary phase shift keying(LD-MPSK)constellation mapping function has been derived,which can increase free Euclidean distance between modulated symbols and enhance the decoding performance.It has been shown in the simulation results that the proposed scheme can achieve more than 2 dB signal-to-noise ratio gains compared with the conventional bit-level schemes under the condition of the same error rate.     

一种新的无损图像压缩算法的研究

提出了新的二进制(位级)无损图像压缩方法——将错误纠正BCH码引入到图像压缩算法中;将图像的二进制分为大小为7的码字,这些块进入到BCH解码器,消除了校验位后,使得原来的块的大小减少到4位。实验结果表明,此压缩算法是有效的,并给出了一个很好的压缩比,而且不丢失数据。BCH码的使用在提高压缩比方面比单纯霍夫曼压缩的结果要好。     

基于DFRFT的脉压方法及与匹配滤波性能对比

针对线性调频体制雷达的目标检测与测距,提出采用离散分数阶Fourier变换实现脉压,推导基于采样型离散分数阶Fourier变换脉压方法的理论模型,对采用离散分数阶Fourier变换实现脉压时出现的时延模糊进行分析,提出用与谱峰相邻数据的相位差估计真实雷达目标的时延解决模糊问题。在雷达目标检测与测距中,基于离散分数阶Fourier变换与匹配滤波的脉压方法相比,距离分辨力相同,运算量降低近一半。     

高阶调制下极化码的构造研究

为了避免利用传统方法在高阶调制时无法确定极化码的码元噪声功率的问题,提出一种将高阶调制信道分解成多个平行的并具有固定噪声功率的二进制输入子信道的方法,将高阶调制下极化码构造问题转化为一般的二进制输入信道的极化码构造问题,从而实现了高阶调制时的极化码构造,并针对格雷映射8-PSK调制和PAM/QAM调制等常用的高阶调制进行特定设计。仿真结果表明,采用推荐方法可以带来明显的性能提升。     

Range,radial velocity,and acceleration MLE using frequency modulation coded LFM pulse train

Linearly frequency modulation (LFM) pulse train and linearly stepped frequency (LSF) pulse train are mostly used in radar systems. However, the estimation performance of target motion parameters may be affected by the high recurrent lobe levels and the range–Doppler coupling phenomenon appearing in ambiguity function (AF). In multi-target scenarios, the estimation performance becomes even worse. The Costas frequency-modulation coded (CFMC) LFM pulse train has an ideal thumbtack-shaped AF, thus it can provide motion parameter estimation with high precision. However, the estimation of target motion parameter for the coherent CFMC LFM pulse train has not been investigated in depth. In this paper, we first analyze the properties of the AF of the CFMC LFM pulse train. Based on its convexity and narrow mainlobe width, a fast method to implement the maximum likelihood estimator (MLE) is proposed to estimate the motion parameters. To reduce the computation complexity, the Chirp-Z Transform (CZT) is introduced. Then, the Cramer–Rao lower bounds (CRLBs) on range, velocity and acceleration for frequency-modulation coded (FMC) pulse train are derived. It is shown that the CRLBs are relevant to the frequency coding patterns. Finally, Monte Carlo simulations are performed to verify the performance of the MLE. The results show that the performance of our proposed method can achieve the CRLBs when the signal-noise ratio (SNR) is higher than the threshold SNR.     

基于分圆陪集非二进制量子码的构造方法

为了有效克服量子信息处理过程中存在的量子比特消相干,提出了一种基于分圆陪集非二进制量子纠错码的构造方法。分析了分圆陪集的相关性质,确定BCH码包含其Euclidean对偶码的生成多项式,利用扩展的Calderbank-
Shor-Steane（CSS）构造即Steane’s构造方法,构造出一批新的非二进制量子码。通过与已有的量子纠错码相比,结果表明,采用基于分圆陪集非二进制量子码构造方法构造的参数更优。     

An efficient raster font compression for embedded systems

This paper presents a new lossless raster font compression method that uses vertex chain code to define character’s outline. Obtained chain codes are compressed by Huffman coding algorithm. The results show that the new method requires least memory space to store the raster fonts among the known methods. Moreover, the font size has almost no impact on the coder efficiency. Due to the low complexity of the decoder that occupies only 2.7 kB of memory space, this method is ideal for use in embedded systems.     

新的基于Huffman编码的追踪方案

面对DDoS攻击,研究人员提出了各种IP追踪技术寻找攻击包的真实源IP地址,但是目前的追踪方案存在着标记过程中的空间问题、追踪源是否准确及追踪所需包的数量等问题.提出一种新的基于Huffman编码的追踪方案,可以节省大量的存储空间,提高空间效率,而且当遭遇DoS(拒绝服务攻击)和DDoS的攻击时能迅速作出反应,仅仅收到一个攻击包即可重构出攻击路径,找到准确的攻击源, 将攻击带来的危害和损失减小到最低程度.