Block Markov superposition transmission over turbulence channels in outdoor optical wireless communication

Based on the equivalent genie-aided system,the bit-error rate of the block Markov superposition transmission system was analyzed and the union bound of the bit-error rate of the genie-aided system was derived.When the bit-error rate was extremely low at which the Monte Carlo simulation was time-consuming,the union bound could be adopted to evaluate the performance of the block Markov superposition transmission system.Simulations under turbulence conditions from weak to strong are performed which show that,in the low bit-error rate region,performance of the block Markov superposition transmission system matches well with the lower bound.It is also illustrated that the derived union bound matches well with Monte Carlo simulation result.At the BER of 10^-5,block Markov superposition transmission system with transmission memory 2 performs within 1 dB away from the Shannon limit.     

An achievable rate region of cooperative multiple-access channels with hybrid CF and DF cooperation

In this letter, we derive an achievable rate region of a two-user cooperative multiple-access (CMA) channel where one user performs decode-and-forward (DF) cooperation and the other user performs Wyner-Ziv-type compress-and-forward (CF) cooperation. The proposed rate region is achieved using a communication scheme that applies block Markov coding at each user and backward decoding at destination. Numerical results show that for some channel scenarios, the proposed hybrid CF and DF cooperation scheme enlarges the rate region achieved by the pure DF-based cooperation scheme.     

An Achievable Rate Region for the Asynchronous Multiple Access Channel with Feedback

1　ＩｎｔｒｏｄｕｃｔｉｏｎＧＡＡＲＤＥＲａｎｄＷＯＬＦ[1 ] ａｓｗｅｌｌａｓＣｏｖｅｒａｎｄＬｅｕｎｇｈａｖｅｄｅｍｏｎｓｔｒａｔｅｄｔｈａｔｔｈｅｃａｐａｃｉｔｙｒｅｇｉｏｎｏｆａｄ .ｍ .ＭｕｌｔｉｐｌｅＡｃｃｅｓｓＣｈａｎｎｅｌ(ＭＡＣ)ｃａｎｂｅｉｎ     

The two-user cutoff rate for an asynchronous and a synchronous multiple-access channel are the same

The cutoff rate region for block coding of a two-sender one-receiver multiple-access channel is shown to be the same with and without frame synchronization between the two senders.     

顽健合成图像篡改检测及定位

针对自然图像与高度仿真的计算机生成图像的合成图像篡改检测问题,提出在YCbCr颜色空间基于差分直方图和中心对称局部二进制模式提取图像块颜色和纹理特征的方法,通过训练后验概率支持向量机模型对待测图像块进行识别.在不重叠分块情况下先大致判断篡改区域,然后在该区域内逐像素分块判别,最终实现篡改区域精确定位.实验结果表明,对128 dpi×128 dpi图像块的识别率达到94.75％,高于现有方法;对合成图像篡改区域能够实现精确定位,且对旋转、缩放操作表现出较好的顽健性.     

Performance of block Markov superposition transmission over non-Gaussian impulsive channels

Block Markov superposition transmission scheme was used over channels with symmetric alpha-stable (SαS) impulsive noise.Based on the equivalent genie-aided system,the lower bound of the block Markov superposition transmission system was analyzed.Numerical simulations over non-Gaussian impulsive channels with different characteristic exponents show that,in the low bit-error rate region,performance of the block Markov superposition transmission system matches well with the lower bound.Block Markov superposition transmission scheme performs well (with 0.85 dB away from Shannon limits at the BER of 10^-5) over non-Gaussian impulsive channels.     

Some families of zero- error block codes for the two-user binary adder channel with feedback

Families of zero-error codes for the real binary adder channel with feedback that achieve high rate pairs are introduced. Two families of zero-error block codes are given for the case in which only one of the two senders receives feedback about the channel output. In the first of these families, the uninformed sender transmits at a rate of nearly one bit per symbol and the informed sender transmits slightly less that1/2bit per symbol. The second family is designed for the case in which the informed sender sends at or near one bit per symbol and the uninformed one sends nearly1/2bit per symbol. A family of zero-error codes is introduced, based on the Fibonacci recursion; these codes are readily implemented by means of a simple square-dividing strategy. The Fibonacci codes achieveR_{1}=R_{2}=log_{2} [(1 + sqrt{5})/2]in the limit of large block length. Time-sharing between members of these three code families is used to obtain an achievable rate region, or inner bound, to the zero-error capacity region for block coding. For the case in which the feedback is available to both senders, a variant of the Fibonacci difference equation is used to generate zero-error block codes with slightly higher asymptotic rateR_{1}=R_{2}=0.717.     

On the Voronoi neighbor ratio for binary linear block codes

Soft-decision decoding of block codes is regarded as the geometrical problem of identifying the Voronoi region within which a given input vector lies. A measure, called the neighbor ratio, is proposed to characterize how many facets a Voronoi region has. Theory and algorithms are presented to determine the neighbor ratio for binary linear block codes and results are given for several types of codes. An asymptotic analysis for long codes reveals that the neighbor ratio depends on whether the code rate is less than 1/2 or not. For rates below this threshold, all pairs of codewords tend to share a Voronoi facet; for higher rates, a relatively small fraction of them do     

H.265整数运动估计参考块更新的并行化设计

针对H.265整数运动估计算法参考块更新模块中数据传输量大、运行速度慢等问题,在分析参考块间数据相关性的基础上,提出了能够减少硬件使用资源,提高运行效率的并行方案.该方案采用18×17个处理元阵列,通过相邻参考块之间3个方向数据重合的关系设计了3个缓存区,更新时根据参考块之间的关系定位缓存区,然后从外存加载相应的参考块数据.该方案中的资源占用量相比传统设计降至1/16.实验结果表明,该方案可以将数据复用率提高到98.4％,有效降低了整数运动估计算法的带宽需求.     

Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels

We derive tight exponential upper bounds on the decoding error probability of block codes which are operating over fully interleaved Rician fading channels, coherently detected and maximum-likelihood decoded. It is assumed that the fading samples are statistically independent and that perfect estimates of these samples are provided to the decoder. These upper bounds on the bit and block error probabilities are based on certain variations of the Gallager bounds. These bounds do not require integration in their final version and they are reasonably tight in a certain portion of the rate region exceeding the cutoff rate of the channel. By inserting interconnections between these bounds, we show that they are generalized versions of some reported bounds for the binary-input additive white Gaussian noise channel.     

Fast copy-move forgery detection algorithm based on group SIFT

Aiming at the high computational complexity of the existing copy-move image forgery detection algorithm,a copy-move forgery detection algorithm based on group scale-invariant feature transform (SIFT) was proposed.Firstly,the simple linear iterative clustering (SLIC) was utilized to divide the input image into non-overlapping and irregular blocks.Secondly,the structure tensor was introduced to classify each block as flat blocks,edge blocks and corner blocks,and then the SIFT feature points extracted from the block were taken as the block features.Finally,the forgery was located by the inter-class matching of the block features.By means of inter-class matching and feature point matching,the time complexity of the proposed copy-move forgery detection algorithm in feature matching and locating forgery region was effectively reduced while guaranteeing the detection effect.The experimental results show that the accuracy of the proposed algorithm is 97.79%,the recall rate is 90.34%,and the F score is 93.59%,the detecting time for the image with size of 1024×768 is 12.72 s,and the detecting time for the image with size of 3000×2000 was 639.93 s.Compared with the existing copy-move algorithm,the proposed algorithm can locate the forgery region quickly and accurately,and has high robustness.     

On zero-error coding of correlated sources

The problem of separate zero-error coding of correlated sources is considered. Inner and outer single-letter bounds are established for the achievable rate region, and conditions for their coincidence are investigated. It is shown that successive encoding combined with time sharing is not always an optimal coding strategy. Conditions for its optimality are derived. The inner bound to the achievable rate region follows as a special case of the single-letter characterization of a generalized zero-error multiterminal rate-distortion problem. The applications of this characterization to a problem of remote computing are also explored. Other results include (i) a product-space characterization of the achievable rates, (ii) bounds for finite block length, and (iii) asymptotic fixed-length rates.     

灰度图像的子块压缩方法

从灰度图像的局部几何特性出发，把图像中像素灰度相近或相同的区域当作一个整体处理，从而达到图像压缩的目的。计算机仿真实验表明，该方法可以获得产高的压缩比和峰值信噪比，有效地消除方块效应，很好地保持目标细节，具有较高的实用价值。     

New high-performance reversible data hiding method for VQ indices based on improved locally adaptive coding scheme

In this paper, a new high-performance reversible data hiding method for vector quantization (VQ) indices is proposed. The codebook is firstly sorted using the unidirectional static distance-order technique to improve the correlation among the neighboring indices. The two-dimensional structure of image and the high correlation among the neighboring blocks are used to update the self-organized list L in the improved locally adaptive coding scheme (ILAS). Then a new embedding rule according to the complexity of the region at which the current block locates and the position of current block index in the list L is proposed to obtain a better embedding capacity. The experimental results demonstrate that our proposed method has a better performance in terms of compression rate, embedding capacity and embedding rate compared with the related data hiding methods.     

Image compression using address-vector quantization

A novel vector quantization scheme, called the address-vector quantizer (A-VQ), is proposed. It is based on exploiting the interblock correlation by encoding a group of blocks together using an address-codebook. The address-codebook consists of a set of address-codevectors where each codevector represents a combination of addresses (indexes). Each element of this codevector is an address of an entry in the LBG-codebook, representing a vector quantized block. The address-codebook consists of two regions: one is the active (addressable) region, and the other is the inactive (nonaddressable) region. During the encoding process the codevectors in the address-codebook are reordered adaptively in order to bring the most probable address-codevectors into the active region. When encoding an address-codevector, the active region of the address-codebook is checked, and if such an address combination exist its index is transmitted to the receiver. Otherwise, the address of each block is transmitted individually. The quality (SNR value) of the images encoded by the proposed A-VQ method is the same as that of a memoryless vector quantizer, but the bit rate would be reduced by a factor of approximately two when compared to a memoryless vector quantizer     

一种基于隐式ROI的自适应图像编码算法

 针对JPEG2000中隐式ROI(Region of Interest)编码算法在低码率下重建图像感兴趣区质量较差的问题,提出了一种改进方法.利用拉格朗日插值法构造权重自适应函数,根据ROI码块中ROI小波系数个数所占比例及设定的目标码率,合理地为ROI码块分配权重,在保证更多ROI信息被优先编码的同时,降低背景小波系数的影响,从而提高了ROI小波系数在码流中的数据长度.实验结果表明,采用该算法,重建后感兴趣区图像质量较隐式ROI算法有明显提高.     

Adaptive transform tree coding of images

A tree code, asymptotically optimal for stationary Gaussian sources and squared error distortion, is applied suboptimally to encode the discrete cosine transform (DCT) of image subblocks. The variance spectrum of each block DCT is estimated and specified uniquely by a set of one-dimensional autoregressive parameters. The average pel rate for each block is allowed to vary to meet the specification of the same average distortion per block. Since the variance spectrum and rate are different for every block. so is the code tree. Comparative coding simulations with a 256×256 and 512×512 image show that DCT tree coding with postcoding is clearly superior to DCT quantization and that a variable block rate assignment gains about 3 dB over a fixed block rate assignment     

Low-loss Bragg-reflector lateral-transverse-mode confinement inAlGaInP red laser

A low-loss Bragg-reflector-waveguide (BRW) structure is proposed for AlGaInP red lasers. This BRW laser uses (AlGaInP/GaAs)_n Bragg-reflector (BR) block layers in place of conventional GaAs block layers. Propagating-mode calculations reveal that an aluminum content (x) lower than 0.2 for (Al_xGa_1-x)_0.5In _0.5P in the BR block layers is sufficient for reducing mode loss together with confining the lateral transverse mode. Mode loss in the (AlGaInP/GaAs)_n BR region is reduced resonantly to one-third that of a conventional GaAs block region. This reduction originates from a combination of Bragg reflection and the low absorption loss in the AlGaInP crystal. The refractive-index step, formed at the edge of a ridge stripe by the BR block layers, is around 1×10^-2     

LTE中基于发送分集的预编码

MIMO技术是LTE中采用的关键技术之一,本文研究的基于发送分集的预编码技术就是MIMO技术中的一种方案。本文对LTE中使用的2发射天线和4发射天线的基于发送分集的预编码方案进行了推导,并对其性能进行了仿真,将其与空时分组码方案进行了性能比较。推导结果表明LTE中基于发送分集的预编码方案与2根发射天线的空时分组码的编码原理相同。仿真结果表明在两根发射天线情况下,空时分组码的误码率性能和预编码方案相同;在4发射天线的情况下,空时分组码的误码率低于预编码方案,但预编码方案的传码率要高于空时分组码。     

EVDO网络C/I优良比提升策略研究

研究CDMA网络中C/I优良比快速提升方法,通过网络场景关联性分析,提出质差C/I区域定位分析法,提出了Pnscanner开展精准RF优化策略、双载连片区域邻区跨频不互配策略和载波隔频连片扩容策略3种C/I优良比优化方法。通过典型案例验证优化策略能够实现有效快速提升用户感知。