高速模/数转换器常规参数的动态测试

高速模拟/数字转换器(ADC)被广泛应用于视频和无线通讯等领域。如何对高速ADC的性能进行准确评估是一个受到高度关注的课题。准确评估高速ADC的性能需要采用动态测试方法。文章运用码密度直方图分析法,分析了高速ADC常规参数,包括失调、微分非线性、积分非线性、失码、增益误差等,的动态测试。

On Wyner-Ziv Problem for general sources with average distortion criterion

The Wyner-Ziv Problem for general sources with average distortion under fixed-length coding is investigated in this paper. To solve the problem,an enhanced covering lemma for a Markov chain is first established. Then based on the lemma,a general formula for the rate-distortion function of the problem is derived,where the distortion is only assumed uniformly bounded and may be nonadditive. Finally,it is further pointed out that such methods can be used to establish more general results on multiterminal source coding problems.

Perceptual video coding method based on JND and AR model

In order to achieve better perceptual coding quality while using fewer bits, a novel perceptual video coding method based on the just-noticeable-distortion （JND） model and the auto-regressive （AR） model is explored. First, a new texture segmentation method exploiting the JND profile is devised to detect and classify texture regions in video scenes. In this step, a spatial-temporal JND model is proposed and the JND energy of every micro-block unit is computed and compared with the threshold. Secondly, in order to effectively remove temporal redundancies while preserving high visual quality, an AR model is applied to synthesize the texture regions. All the parameters of the AR model are obtained by the least-squares method and each pixel in the texture region is generated as a linear combination of pixels taken from the closest forward and backward reference frames. Finally, the proposed method is compared with the H.264/AVC video coding system to demonstrate the performance. Various sequences with different types of texture regions are used in the experiment and the results show that the proposed method can reduce the bit-rate by 15% to 58% while maintaining good perceptual quality.

Tree-Structured Parallel Regeneration for Multiple Data Losses in Distributed Storage Systems Based on Erasure Codes

To reduce the time required to complete the regeneration process of erasure codes, we propose a Tree-structured Parallel Regeneration (TPR) scheme for multiple data losses in distributed storage systems. Under the scheme, two algorithms are proposed for the construction of multiple regeneration trees, namely the edge-disjoint algorithm and edge-sharing algorithm. The edge-disjoint algorithm constructs multiple independent trees, and is simple and appropriate for environments where newcomers and their providers are distributed over a large area and have few intersections. The edge-sharing algorithm constructs multiple trees that compete to utilize the bandwidth, and make a better utilization of the bandwidth, although it needs to measure the available band-width and deal with the bandwidth changes; it is therefore difficult to implement in practical systems. The parallel regeneration for multiple data losses of TPR primarily includes two optimizations: firstly, transferring the data through the bandwidth optimized-paths in a pipe-line manner; secondly, executing data regeneration over multiple trees in parallel. To evaluate the proposal, we implement an event-based simulator and make a detailed comparison with some popular regeneration methods. The quantitative comparison results show that the use of TPR employing either the edge-disjoint algorithm or edge-sharing algorithm reduces the regeneration time significantly.

JPEG2000 COMPRESSION CODING USING HUMAN VISUAL SYSTEM MODEL

In order to apply the Human Visual System (HVS) model to JPEG2000 standard,several implementation alternatives are discussed and a new scheme of visual optimization isintroduced with modifying the slope of rate-distortion. The novelty is that the method of visual weighting is not lifting the coefficients in wavelet domain, but is complemented by code stream organization. It remains all the features of Embedded Block Coding with Optimized Truncation (EBCOT) such as resolution progressive, good robust for error bit spread and compatibility of lossless compression. Well performed than other methods, it keeps the shortest standard codestream and decompression time and owns the ability of VIsual Progressive (VIP) coding.

NEW METHOD TO RECOVER INTERNET PACKET LOSSES USING(2,1,m)SYSTEMATIC CONVOLUTIONAL CODES

A new method to recover packet losses using (2,1,m) convolutional codes is proposed. The erasure correcting decoding algorithm and the decoding determinant theorem is presented. It is also proved that the codes with optimal distance profile have also optimal delay characteristic. Simulation results show that the proposed method can recover the packet losses more elliciently than RS codes over different decoding delay conditions and thus suits for different packet network delav conditions.

A Fault Tolerance Scheme for Reliable Transfer in Delay Tolerant Networks

Delay Tolerant Network （DTN） is a class of networks that experience frequent and long-duration partitions due to sparse distribution of nodes. It has a broad prospect to new network applications for a better sealability, fault-tolerant, and high performance. In DTNs, path failure occurs frequently, so message transfer is not reliable. Sometimes it is required to change routing even in a very short period, resulting in transmission delay and reception delay. However, some well-known assumptions of traditional networks are no longer true in DTNs. In this paper, we study the problem of path failures in DTNs. The path failure process in DTNs is described when the path appears completely normal, completely failed and partially failed. Traditional approaches based on using precisely known network dynamics have not accounted for message losses. A new fault tolerant scheme to generate redundancy is to use erasure coding and full replication. This can greatly decrease the path failure rate. At last, a traffic DTN model is analyzed. Results reveal the superiority of our scheme in comparison to other present schemes.

Efficient Priority Packet Recovery Based on Network Coding in DVB-IPDC System

In DVB-IPDC system, due to the constraints of handheld devices and the broadcast nature of wireless network, packet loss is inevitable. ECDR-NC proposed is a retransmission encoding packet selection algorithm based on the dynamic information updating, which can find the current most effective complete decoding packet. ECDR-NC can not only avoid the redundant encoding packets due to the overlapping among encoding packets, but also reduce the computational complexity compared with the traditional encoding schemes. Furthermore, the retransmission upper bound of ECDR-NC is fully controlled. In time-sensitive applications, to maximize the aggregate number of recovery packets while minimizing the total number of discarded packets due to the time limit according to the priority preference, the adaptive priority scheme EPNC is formulized, and the weighted relation graph is constructed to find the maximum-weighted encoding packets sequence according to the decoding gains. In the same network environment, the performances comparisons between PNC and EPNC show that EPNC is more efficient and more rational, and the average discarded packets ratios ofEPNC can be reduced about 18%~27%. The main contributions of this paper are an effective retransmission encoding packet selection algorithm ECDR-NC proposed, and a new adaptive priority recovery scheme EPNC introduced into DVB-IPDC system.

Optical Packet Switching Scheme Using Multi-optical-code Labels

Proposed is a novel optical code(OC) label switching scheme in which an optical label is constructed by multiple parallel optical codes.The performances of splitting loss and BER are simulated and analyzed.Simulation results show that the proposed label can be correctly recognized to perform packet switching.Compared with reported schemes using one OC as a label,the splitting loss in our proposal is lowered.

A Rate-distortion Based Quantization Level Adjustment Algorithm in Block-based Video Compression

In this paper, a rate-distortion based quantization level adjustment （RDQLA） algorithm is presented. Based on the rate-distortion criterion, the quantization level adjustment algorithm effectively improves coding efficiency by adaptively optimizing quantization levels of the signals near the boundaries of quantization cells and adjusting quantization levels per block. In addition, it has no overhead and is fully compatible with the existing compression standards. The proposed algorithm can be applied in any block based image and video coding method. In particular, the algorithm has been verified on the platform of H.264. Experimental results show that the proposed algorithm improves objective and subjective performances substantially. It is shown that the proposed algorithm has a gain of several dB comparing with the newest H.264 standard for high bit rates.

Dominant edge direction based fast intra mode decision in the H.264/AVC encoder

The H.264/AVC video coding standard uses an intra prediction mode with 4×4 and 16×16 blocks for luma and 8×8 blocks for chroma. This standard uses the rate distortion optimization (RDO) method to determine the best coding mode based on the compression performance and video quality. This method offers a large improvement in coding efficiency compared to other compression standards, but the computational complexity is greater due to the various intra prediction modes. This paper proposes a fast intra mode decision algorithm for real-time encoding of H.264/AVC based on the dominant edge direction (DED). The DED is extracted using pixel value summation and subtraction in the horizontal and vertical directions. By using the DED, three modes instead of nine are chosen for RDO calculation to decide on the best mode in the 4×4 luma block. For the 16×16 luma and the 8×8 chroma, only two modes are chosen instead of four. Experimental results show that the entire encoding time saving of the proposed algorithm is about 67% compared to the full intra search method with negligible loss of quality.