Multiple bit upsets mitigation in memory by using improved hamming codes and parity codes

This paper combines improved Hamming codes and parity codes to assure the reliability of memory in presence of multiple bit upsets with low cost overhead.The redundancy bits of improved Hamming codes will be appended at the end of data bits,which eliminates the overhead of interspersing the redundancy bits at the encoder and decoder.The reliability of memory is further enhanced by the layout architecture of redundancy bits and data bits.The proposed scheme has been implemented in Verilog and synthesized using the Synopsys tools.The results reveal that the proposed method has about 19% less area penalties and 13% less power consumption comparing with the current two-dimensional error codes,and its latency of encoder and decoder is 63% less than that of Hamming codes.

Indexing the bit-code and distance for fast KNN search in high-dimensional spaces

Various index structures have recently been proposed to facilitate high-dimensional KNN queries, among which the techniques of approximate vector presentation and one-dimensional (1D) transformation can break the curse of dimensionality. Based on the two techniques above, a novel high-dimensional index is proposed, called Bit-code and Distance based index (BD). BD is based on a special partitioning strategy which is optimized for high-dimensional data. By the definitions of bit code and transformation function, a high-dimensional vector can be first approximately represented and then transformed into a 1D vector, the key managed by a B+-tree. A new KNN search algorithm is also proposed that exploits the bit code and distance to prune the search space more effectively. Results of extensive experiments using both synthetic and real data demonstrated that BD out- performs the existing index structures for KNN search in high-dimensional spaces.

Achievable secrecy rate of bit-interleaved coded modulation schemes

We study the impact of various modulation mapping strategies and signal constellation shapes on the se- crecy rates achievable with bit-interleaved coded modulation （BICM） schemes. Transmission over an ergodic Rayleigh fading channel is assumed throughout this work. Various constellations and mapping techniques are considered in this work to maximize the capacity difference between the main channel and the eavesdropper channel, rather than to opti- mize the capacity of both channels. We show that in terms of achievable secrecy rate, Gray and Quasi-Gray mappings only perform Well at low SNR but outperformed by other mapping techniques when SNR increases. The proper design of signal mapping can significantly enhance the achievable secrecy rate in BICM schemes. It is indicated that the key parameter to the secrecy rate of a BICM system is the distance spectrum of Euclidean distances for mappings.

A NEW LABELING SEARCH ALGORITHM FOR BIT-INTERLEAVED CODED MODULATION WITH ITERATIVE DECODING

Bit-Interleaved Coded Modulation with Iterative Decoding (BICM-ID) is a bandwidth ef- ficient transmission, where the bit error rate is reduced through the iterative information exchange between the inner demapper and the outer decoder. The choice of the symbol mapping is the crucial design parameter. This paper indicates that the Harmonic Mean of the Minimum Squared Euclidean (HMMSE) distance is the best criterion for the mapping design. Based on the design criterion of the HMMSE distance, a new search algorithm to find the optimized labeling maps for BICM-ID system is proposed. Numerical results and performance comparison show that the new labeling search method has a low complexity and outperforms other labeling schemes using other design criterion in BICM-ID system, therefore it is an optimized labeling method.

基于可逆元胞自动机加密的扩展码索引调制方案

针对直接序列扩频系统伪随机(Pseudo Noise,PN)码资源有限且码索引调制系统误码率性能下降的问题,提出了一种基于可逆的初等元胞自动机加密的扩展码索引调制方案。首先,针对PN码资源有限的问题,提出使用混沌规则的初等元胞自动机对PN码进行迭代的方案,从而实现扩展PN码的目的;其次,针对码索引调制误码率性能下降的问题,提出了一种可逆元胞自动机加密的码索引调制方案,在发射端,把信息比特切割成调制比特和映射比特,并分别映射为调制符号和扩频码索引,使用对应索引的扩频码对同相分量进行扩频,同时使用可逆元胞自动机对映射比特进行加密,加密后的映射比特为调制符号的正交分量选取对应索引的扩频码进行扩频。仿真与分析结果表明,在相同频谱效率条件下,在加性高斯白噪声信道中,当误码率为10-5时,扩展码索引调制方案的误码率性能优于码索引调制和广义码索引调制方案约2~4 dB,优于非正交码移键控码索引调制方案约0.5 dB。

基于小波压缩深度学习重构的多图像光学加密

为解决多图像加密算法密文体积大、加密效果差、重构效果不理想等问题,提出一种基于小波压缩和深度学习重构的多图像光学加密方法。利用小波压缩提取多图像的低频部分,将重排后的新图放入改进的FDT-DRPE光学加密系统中得到密文;利用矢量分解和螺旋相位变换克服FDT-DRPE不敏感问题;构造的L_S混沌系统提高密钥敏感性。提出新型深度学习网络模型BHCN,解决传统图像重构精度不高问题。实验结果表明,密文体积可压缩至原图的1/4,重构图像的峰值信噪比为34.57 dB,结构相似性为0.9521,与同类文献相比,速度更快,重构效果更好,安全性更高。

一种基于混合MELP/CELP的4 kbit/s声码器

利用混合激励线性预测(mixed excitation linear prediction,MELP)算法和码激励线性预测(code excitation linear prediction,CELP)算法的优点,提出了一种混合MELP/CELP语音编码模型。编码端对强浊音帧采用MELP编码,对弱浊音帧和清音帧进行CELP编码。MELP编码器采用相位对齐技术提取强浊音帧的相位参数,解决了合成语音与原始语音在时间上不同步的问题。对实现的4 kbit/s混合MELP/CELP声码器进行客观MOS(mean opinion score)值和主观DRT(diagnostic rhythm test)清晰度测试,结果表明,该声码器的合成语音具有较高的可懂度和清晰度。

Hamming Code信息校验方法研究

对 Hamming Code信息校验的组成规则、校验方法及校验条件做了探讨与研究 。

一种基于视觉显著性的码率控制算法

针对当前高效视频编码的码率控制算法未能充分确保视频显著区域的图像质量问题,提出了一种基于视觉显著性的码率控制算法。首先,采用基于图的流形排序显著检测算法获取视频的显著区域;其次,在图像编码过程中,为每个编码单元(Coding Unit,CU)建立基于视觉显著性的加权失真公式,将显著性值作为权重;最后,通过求解得到拉格朗日乘子λ,并根据原始码率控制算法中的λ与量化参数(Quantization Parameter,QP)的关系为每个CU确定QP。试验结果表明,该算法有效地根据视频内容的显著性权重实现了码率的合理分配,并在保持码率控制准确性的同时,提升了视频显著区域的图像质量。

基于FPGA的64 kbit/s通信误码生成仪

介绍了利用FPGA实现64 kbit/s通信误码生成仪的具体实现方法,即为减轻CPU的工作负担,利用FPGA和SDRAM芯片IS61LV5128实现64 kbit/s信号的时延、在64 kbit/s信号中添加随机误码、连续误码的实现方法,利用FPGA实现从信号中提取时钟的锁相环电路的设计方法。利用ARM7的数据处理能力和FPGA并行处理能力相结合,适用于实时性要求高的场合,是一种实时信号处理新的实现方法的探索。

基于模糊量化和2 bit深度像素的运动估计算法

提出了一种2 bit深度像素的运动估计算法。首先,将像素深度的降采样过程形式化为区间分划和区间映射2个步骤,其中前者为多对一映射,决定着运动估计性能,后者为一一映射;其次,提出一种非均匀量化方法求解区间分划的3个初始阈值,并利用隶属度函数对初始阈值细化,从而克服信号噪声等因素导致的初始阈值周围像素值的误匹配;再次,讨论了适用于2 bit深度像素运动估计的误差度量准则,进而提出了基于模糊量化和2 bit深度像素的运动估计算法;最后,借助信号自相关函数,建立比特深度转换误差—运动向量精度模型来估计该算法所能达到的预测精度。实验结果证明,对于多种类型的视频序列,尤其是场景细节和物体运动比较复杂者,该算法始终能保持较高的估计精度,运动补偿的平均峰值信噪比较之传统2 bit深度像素的运动估计提高0.27 dB。

基于Gamma-Gamma湍流信道下的卷积码性能研究

为了研究不同码型的卷积码在水下湍流信道中的误码率(BER)性能,采用接受-拒绝采样模拟湍流信道乘性干扰,并选择二进制相移键控(BPSK)调制方式,建立Gamma-Gamma湍流信道通信系统仿真模型。仿真结果表明:在不同强度的湍流信道中,采用卷积码编码均能提升系统的BER性能;卷积码的码率越小,系统BER性能提升越显著;随着信噪比(SNR)增大,记忆深度越长,系统BER下降速度越快;采用软译码比采用硬译码时增益至少提升2.82 d B;卷积码的解码不仅受当前信息的影响,还与之前的码元信息有关。

高速通信系统中并行CRC计算及电路实现

针对高位宽数据情况下的循环冗余校验码(Cyclic Redundancy Code, CRC)电路计算工作频率较低以及资源占用过多的问题,设计并实现了一种并行CRC计算方法。该方法将CRC计算拆分为数据CRC计算和余数CRC计算两个部分,余数CRC计算由多个余数CRC计算模块级联完成,数据CRC计算模块由固定逻辑表达式实现,对二者计算结果做模二加法即得到CRC计算结果。根据数据长度选择相应的数据CRC计算模块和余数CRC计算模块的组合,以适应高位宽可变数据长度的CRC计算。以100 Gbps远程直接数据存取(Remote Direct Memory Access, RDMA)通信系统中的1 024 bits数据位宽CRC-32的计算为例,在VCU118开发板上实现了该算法的硬件电路。实验结果表明,所提设计仅使用4 760个查找表和2 658个触发器,整个系统带宽最高可达97.85 Gbps,最高工作频率可达326 MHz。与其他相关方法相比,提出的方法具有较高的工作频率且资源占用较少。

基于网络编码的BitTorrent内容分发系统研究

分析了目前流行的BitTorrent系统的工作原理及存在的文件分块调度复杂、文件下载稳定性等问题,提出了在BitTorrent系统中采用网络编码解决这些问题的方法,证明使用网络编码技术可以增强系统的鲁棒性,降低系统调度算法的复杂性,并能有效地解决BitTorrent系统中由于"种子"退出造成的文件下载不完的问题。

PDU中7-bit字符串编解码的程序设计

本文主要介绍了PDU中7-bit字符串编解码的算法,及其程序的设计,并针对不同长度和内容的字符对程序的有效性进行了测试,测试结果表明程序是正确的。

基于JPEG标准的16bit图像有损压缩应用

给出了16 bit图像有损压缩的原理和详细流程。由于16 bit图像数据量大而JPEG并不支持16 bit图像的压缩,这使得其在存储和传输方面有很多不便。在JPEG压缩方案的基础上,对统计模型进行了扩展(分别对DC差分值编码的统计模型表和AC系数编码的统计模型表进行了一定的改变和扩充),使其能够处理位深度为16的数据,从而实现了16 bit图像的有损压缩。图像量化过程中所使用的量化表是基于JPEG默认的8位亮度图像量化表生成的。所采用的编码器为QM算术编码器,解压后的图像质量评价标准采用客观评价标准PSNR。

PERFORMANCE EVALUATION OF LOW DENSITY PARITY CHECK CODES FOR DIGITAL RADIO MONDIALE (DRM) SYSTEM

In Digital Radio Mondiale (DRM) system, achieving good audio quality becomes a challenge due to its limited band-width of 9 or 10kHz and the very bad fading channels. Therefore, DRM needs highly efficient channel coding schemes. This paper, proposes the schemes which use the Low-Density Parity-Check (LDPC) coded Bit-Interleaved Coded Modulation (BICM) schemes for the implementation of DRM systems. Simulation results show that the proposed system is more efficient than the Rate Compatible Punctured Con volutional (RCPC) coded DRM system on various broadcast channels, and may be recommended as a coding technology for Digital Amplitude Modulation Broadcasting (DAMB) systems of China.

Improving the BER performance of turbo codes with short frame size based on union bound

In order to improve the bit error rate(BER) performance of turbo codes with short frame size at a wide range of signal to noise ratio(SNR),a new method by optimizing the bit energy is proposed.At first,a formula derived from the Union Bound is introduced.It describes the relations between the bit error rate distribution and the minimum weight distribution.And then,by mathematically optimizing the formula,the energy for every bit of the codeword is optimized to achieve the minimum BER at high SNR region.At last,an adjustable parameter is employed to compensate the degradations of BER at low and moderate SNR regions.Case studies indicate that the improvements of BER for turbo codes with short frame size are significant at a wide range of SNR.

Quantitative information measurement and application for machine component classification codes

Information embodied in machine component classification codes has internal relation with the probability distribu- tion of the code symbol. This paper presents a model considering codes as information source based on Shannon’s information theory. Using information entropy, it preserves the mathematical form and quantitatively measures the information amount of a symbol and a bit in the machine component classification coding system. It also gets the maximum value of information amount and the corresponding coding scheme when the category of symbols is fixed. Samples are given to show how to evaluate the information amount of component codes and how to optimize a coding system.