On the capacity of the state‐dependent interference relay channel

This paper considers the state‐dependent interference relay channel (SIRC) in which one of the two users may operate as a secondary user and the relay has a noncausal access to the signals from both users. For discrete memoryless SIRC, we first establish the achievable rate region by carefully merging Han‐Kobayashi rate splitting encoding technique, superposition encoding, and Gelfand‐Pinsker encoding technique. Then, based on the achievable rate region that we derive, the capacity of the SIRC is established in many different scenarios including (a) the weak interference regime, (b) the strong interference regime, and (c) the very strong interference regime. This means that our capacity results contain all available known results in the literature. Next, the achievable rate region and the associated capacity results are also evaluated in the case of additive Gaussian noise. Additionally, many numerical examples are investigated to show the value of our theoretical derivations.     

Optimal weighed Holoentropy for video compression: an advanced HEVC

ABSTRACT

In recent times, the applications of multimedia are rising in a greedy mode and hence the amount of video transactions is also increasing exponentially. This has shouted great demands on effective models on video encoding and also for reducing the transmission channel congestion. This research work introduces a managing technique termed weighted encoding for High-Efficiency Video Coding (HEVC). HEVC, also termed as MPEG-H Part 2 and H.265 is a video compression standard that is widely utilized AVC (H.264 or MPEG-4 Part 10). When compared to AVC, HEVC grants double the ratio of data compression at a similar level of quality of the video or considerably enhanced video quality at a similar bit rate. This work intends to optimize the weight that adopted in HEVC for encoding. For this, this paper proposes a new Iterative based propagation update in the water wave Optimization Algorithm (IPU-WWO), which is the improved form of Water wave Optimization (WWO). The performance of proposed IPU-WWO is compared over other conventional methods like Artificial Bee Colony (ABC), Firefly (FF), Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) with respect to Peak Signal to Noise Ratio (PSNR). By doing the encoding process, it minimizes the video size with perceptually better quality video or PSNR.     

基于深度卷积长短时神经网络的视频帧预测

针对视频帧预测中难以准确预测空间结构信息细节的问题，通过对卷积长短时记忆（LSTM）神经网络的改进，提出了一种深度卷积长短时神经网络的方法。首先，将输入序列图像输入到两个不同通道的深度卷积LSTM网络组成的编码网络中，由编码网络学习输入序列图像的位置信息变化特征和空间结构信息变化特征；然后，将学习到的变化特征输入到与编码网络通道数对应的解码网络中，由解码网络输出预测的下一张图；最后，将这张图输入回解码网络中，预测接下来的一张图，循环预先设定的次后输出全部的预测图。与卷积LSTM神经网络相比，在Moving-MNIST数据集上的实验中，相同训练步数下所提方法不仅保留了位置信息预测准确的特点，而且空间结构信息细节表征能力更强。同时，将卷积门控循环单元（GRU）神经网络的卷积层加深后，该方法在空间结构信息细节表征上也取得了提升，检验了该方法思想的通用性。     

Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers

The knowledge of turbo code's minimum Hamming distance (d_min) and its corresponding codeword multiplicity (A_min) is of a great importance because the error correction capability of a code is strongly tied to the values of d_min and A_min. Unfortunately, the computational complexity associated with the search for d_min and A_min can be very high, especially for a turbo code that has high d_min value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of d_min and A_min values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd.     

二维码位流长度最小化算法

目的 快速响应矩阵码(quick response code,QR code)简称二维码,是一种由深色和浅色模块组成的正方形符号。给定输入数据,不同编码算法可能输出不同的位流。位流长度决定了二维码的版本,进而决定了二维码每条边上的模块数量。减小二维码的版本能够在不减小模块大小的前提下节省面积,或者在不改变面积的前提下增大模块大小。为了减小二维码面积、提高二维码识读率,本文提出了位流长度最小化算法。方法 首先,根据二维码位流可以分段切换编码模式的特点,归纳了6种编码状态;然后,根据二维码位流编码标准推导了状态转移关系,从而将位流长度最小化问题转换成动态规划问题;最后,通过求解动态规划问题,计算出最短位流。针对统一资源定位符(uniform resource locator,URL)类型数据,利用其部分字段对大小写不敏感、部分字段可以转义的性质,提出了统一资源定位符的最短位流计算算法,进一步缩短位流。结果 本文构建了一个测试集,包含603个编码了非URL数据的二维码,以及1 679个编码了URL数据的二维码。实验结果表明,本文算法与二维码标准相比,对于非URL测试集,位流长度减小的二维码占比9.1%,版本减小的二维码占比1.2%;对于URL测试集,位流长度减小的二维码占比98.4%,版本减小的二维码占比31.7%。结论 二维码位流长度最小化算法输出的位流长度最短,输出的二维码版本最小,能在兼容标准二维码解码器且不影响纠错能力的前提下提升二维码的数据容量。同时,本文算法运行速度快,易于使用,没有需要调节的参数。     

EPS 2012下DLG数据编码升级的编程实现

新的国家地形图图式的运用导致了EPS的模板变化,原有的DLG数据势必要进行编码升级转换才能加以运用. 在分析了EPS数据结构机制的基础上,利用VBScript脚本编程实现了数据的编码对照,并进行无损匹配干预,最终实现了DLG数据的升级利用.     

一种基于双随机相位编码的光学加密系统设计

针对于有加密需求的监控领域,图像数据剧增对加密算法提出严峻考验。复杂的加解密算法将会增大运算开支,最终影响视频传输的实时性能。本文根据视频加解密要求,提出在视频监控领域进行光学加解密并设计了基于双随机相位编码的单通道加解密光学系统。该光学系统加解密速度和光速相等,加解密时耗几乎为零,在高清视频迅速普及的未来将会产生重要的应用价值,在军事加解密领域将有着广阔的应用前景。     

基于Radix-4 Booth编码的模2n+1乘法器设计

模2n+1乘法(n=8、16)在分组密码算法中比较常见,如IDEA算法,但由于其实现逻辑复杂,往往被视为密码算法性能的瓶颈。提出了一种适用于分组密码算法运算特点的基于Radix-4 Booth编码的模2n+1乘法器实现方法,其输入/输出均无需额外的转换电路,并通过简化部分积生成、采用重新定义的3-2和4-2压缩器等措施以减少路径时延和硬件复杂度。比较其他同类设计,该方法具有较小的面积、时延,可有效提高分组密码算法的加解密性能。     

基于FPGA的Camera Link输出编码设计

为了Camera Link摄像机的小型化和集成化,设计并实现了基于FPGA的Camera Link接口的编码输出功能。输出编码分为3个步骤:首先,完成图像像素数据到Camera Link PORT的映射;其次,根据DS90CR287的数据编码要求对PORT数据和同步时钟信号进行编码;最后,通过FIFO和并串转换功能模块完成图像数据和时钟编码信号的LVDS信号输出。使用ModelSim软件,对像素时钟为40 MHz的BASE模式进行了仿真,同时在实物实验中,完成了像素时钟为40 MHz的FULL模式的实验,通过以上两方面实验验证了设计的Camera Link输出编码方案的正确性和可行性。提出的编码方案稳定可靠,可以应用于不同模式下的Camera Link编码输出,具有很高的灵活性和应用价值。