Improved decoder for transform coding with application to the JPEGbaseline system

Transform coding, a simple yet efficient image coding technique, has been adopted by the Joint Photographic Experts Group (JPEG) as the basis for an emerging coding standard for compression of still images. However, for any given transform encoder, the conventional inverse transform decoder is suboptimal. Better performance can be obtained by a nonlinear interpolative decoder that performs table lookups to reconstruct the image blocks from the code indexes. Each received code index of an image block addresses a particular codebook to fetch a component vector. The image block can be reconstructed as the sum of the component vectors for that block. An iterative algorithm for designing a set of locally optimal codebooks is developed. Computer simulation results demonstrate that this improved decoding technique can be applied in the JPEG baseline system to decode enhanced quality pictures from the bit stream generated by the standard encoding scheme     

AVS视频解码器的PC实现

本文主要介绍了AVS视频解码的关键技术及解码原理。针对AVS视频解码器开源代码RM52J_r1解码效率相对低下的问题,根据该开源代码设计了新的AVS解码器。实验结果表明,在保证解码质量的前提下,解码速度有了很大的提高,基本上能达到实时解码的要求。     

Distributed video coding based on lossy syndromes generated in hybrid pixel/transform domain

A recently proposed class of distributed source coding based video coders enables low-complexity compression and robust transmission over unreliable channels. These architectures process the video signal either in the pixel or in the transform domain generating some side information that permits a correct decoding of the coded image from a set of possible correlated sources. The approach proposed in this paper processes the video sequence both in the pixel and in the transform domain exploiting the advantages of both schemes and generating a set of lossy syndromes. The resulting video coding scheme requires a lower computational complexity at the decoder with respect to their transform-domain counterparts (like DISCOVER or PRISM) and provides a high compression gain and an increased robustness against channel losses.     

基于PC的AVS视频解码器软件优化

简要介绍了AVS视频编码标准的主要特点以及单指令多数据(SIMD)汇编指令集运算优势,通过分析AVS参考解码器软件的性能以及造成解码器速度瓶颈的原因,提出了基于SIMD汇编指令的优化方案,最终实现了基于PC的高清AVS视频实时解码.     

Hadamard-based soft decoding for vector quantization over noisychannels

We present an estimator-based, or soft, vector quantizer decoder for communication over a noisy channel. The decoder is optimal according to the mean-square error criterion, and Hadamard-based in the sense that a Hadamard transform representation of the vector quantizer is utilized in the implementation of the decoder. An efficient algorithm for optimal decoding is derived. We furthermore investigate suboptimal versions of the decoder, providing good performance at lower complexity. The issue of joint encoder-decoder design is considered both for optimal and suboptimal decoding. Results regarding the channel distortion and the structure of a channel robust code are also provided. Through numerical simulations, soft decoding is demonstrated to outperform hard decoding in several aspects     

流水线式LDPC译码器的FPGA设计与仿真

LDPC码在深空通信中有很好的实用价值,同时LDPC码也被广泛应用于光纤通信、卫星数字视频和音频广播等领域。针对LDPC译码器提出一种新的设计思路,将流水线思想从译码算法本身扩展到译码器的整体设计中,设计出可以多帧并行且结构简单的译码器,最后从吞吐量和资源消耗两方面进行仿真验证。     

Multiple-bases belief-propagation decoding of high-density cyclic codes

We introduce a new method for decoding short and moderate-length linear block codes with dense paritycheck matrix representations of cyclic form. This approach is termed multiple-bases belief-propagation. The proposed iterative scheme makes use of the fact that a code has many structurally diverse parity-check matrices, capable of detecting different error patterns. We show that this inherent code property leads to decoding algorithms with significantly better performance when compared to standard belief-propagation decoding. Furthermore, we describe how to choose sets of parity-check matrices of cyclic form amenable for multiple-bases decoding, based on analytical studies performed for the binary erasure channel. For several cyclic and extended cyclic codes, the multiple-bases belief propagation decoding performance can be shown to closely follow that of the maximum-likelihood decoder.     

A Concatenated Coding Scheme for Error Control

In this paper, a concatenated coding scheme for error control in data communications is presented and analyzed. In this scheme, the inner code is used for both error correction and detection; however, the outer code is used only for error detection. A retransmission is requested if either the inner code decoder fails to make a successful decoding or the outer code decoder detects the presence of errors after the inner code decoding. Probability of undetected error (or decoding error) of the proposed scheme is derived. An efficient method for computing this probability is presented. Throughput efficiency of the proposed error control scheme incorporated with a selective-repeat ARQ retransmission strategy is also analyzed. Three specific examples are presented. One of the examples is proposed for error control in the NASA Telecommand System.     

Real-time video decoding scheme for HDTV set-top boxes

We present a scheme for real-time digital HDTV video decoding suitable for DVB or ATSC set-top boxes. Our technique is based on a dual decoding datapath controlled in two fixed-scheduling combinations with an efficient memory interface scheme for anchor pictures. Unlike other decoding approaches such as the slice bar decoding method and the crossing-divided method, our scheme reduces memory access contention problem to achieve real-time HDTV decoding without a high cost in overall decoder buffers, architecture, and bus. Our simulation shows that with a relatively low rate 81 MHz clock, our decoder can decode MPEG-2 MP@HL HDTV in real-time, based on a video format of 1920 /spl times/ 1080 pixels/frame at 30 frames/s, at a bit rate of 18-22 Mbps.     

基于CEVA平台的WMV视频解码器优化

针对VC-1标准下的WMV视频解码,提出了一种基于CEVA平台下的优化方案。该方案对运动补偿、去方块滤波、反量化、反变换的算法结构进行优化后,再利用CEVA的SIMD（单指令多数据处理）和VLIW（超长指令字）技术实现DSP平台上的优化。实验仿真表明：经过优化处理后,各个模块解码时间对比之前有了大幅度降低．解码速度最高...     

Efficient Generalized Minimum-distance Decoders of Reed-Solomon Codes

Generalized minimum distance (GMD) decoding of Reed–Solomon (RS) codes can correct more errors than conventional hard-decision decoding by running error-and-erasure decoding multiple times for different erasure patterns. The latency of the GMD decoding can be reduced by the Kötter’s one-pass decoding scheme. This scheme first carries out an error-only hard-decision decoding. Then all pairs of error-erasure locators and evaluators are derived iteratively in one run based on the result of the error-only decoding. In this paper, a more efficient interpolation-based one-pass GMD decoding scheme is studied. Applying the re-encoding and coordinate transformation, the result of erasure-only decoding can be directly derived. Then the locator and evaluator pairs for other erasure patterns are generated iteratively by applying interpolation. A simplified polynomial selection scheme is proposed to pass only one pair of locator and evaluator to successive decoding steps and a low-complexity parallel Chien search architecture is developed to implement this selection scheme. With the proposed polynomial selection architecture, the interpolation can run at the full speed to greatly increase the throughput. After efficient architectures and effective optimizations are employed, a generalized hardware complexity analysis is provided for the proposed interpolation-based decoder. For a (255, 239) RS code, the high-speed interpolation-based one-pass GMD decoder can achieve 53% higher throughput than the Kötter’s decoder with slightly more hardware requirement. In terms of speed-over-area ratio, our design is 51% more efficient. In addition, compared to other soft-decision decoders, the high-speed interpolation-based GMD decoder can achieve better performance-complexity tradeoff.     

A versatile time-domain Reed-Solomon decoder

A versatile Reed-Solomon (RS) decoder structure based on the time-domain decoding algorithm (transform decoding without transforms) is developed. The algorithm is restructured, and a method is given to decode any RS code generated by any generator polynomial. The main advantage of the decoder structure is its versatility, that is, it can be programmed to decode any Reed-Solomon code defined in Galois field (GF) 2^m with a fixed symbol size m. This decoder can correct errors and erasures for any RS code, including shortened and singly extended codes. It is shown that the decoder has a very simple structure and can be used to design high-speed single-chip VLSI decoders. As an example, a gate-array-based programmable RS decoder is implemented on a single chip. This decoder chip can decode any RS code defined in GF (2⁵) with any code word length and any number of information symbols. The decoder chip is fabricated using low-power 1.5-μ, two-layer-metal, HCMOS technology     

一种新型的AVS熵解码码表结构

传统AVS熵解码过程中需要存储大量的码表数据,并且在码表查询和切换的过程中存在很多的判断和跳转指令,严重地降低了解码速度,不利于DSP的实现。为了实现嵌入式AVS视频解码器,通过分析熵解码码表的特点,提出了一种新型的码表结构和一种分组查询的查询方法,代码实现采用DSP汇编语言。结果表明,与传统的码表结构和查询方式相比较,大大节省了数据空间,缩短了代码的执行时间,提高了解码的效率。     

桶形移位器在AVS熵解码器中的应用及仿真

AVS视频解码器作为一种媒体解码器,对实时性有较高的要求,这就要求解码器有较快的解码速度.针对这一技术需要,在AVS熵解码器的设计中,提出了一种用于码流截取的桶形移位器的设计方案.采用Verilog HDL语言进行设计和仿真,实现了码流的正确截取.本设计方案通过采用累加器和移位器的组合来实现数据传输,考虑了解码时延不同...     

Time diversity scheme and adaptive signal clipping with blanking applied to G3 systems for narrowband power‐line communications

In this paper, an investigation into the behavior of modern narrowband power‐line communication systems when concatenated with both a fountain code named Luby transform code and a combination of nonlinear preprocessing techniques called signal clipping with blanking is presented. The new systems can be used in applications such as the automatic meter reading component of smart grid technology. Testing is performed on a range of systems provided by the G3 standard and the results show that a bit error rate improvement can be achieved with the correct encoder/decoder settings. The recommended settings include an adaptive technique that uses Gaussian elimination for Luby transform code decoding and code rates that depend on the system specifications used. From there, it is shown that a further improvement is achieved when both the Luby transform code and adaptive signal clipping/blanking based on signal power are combined. It is found that these modifications present a complexity trade‐off, which is higher on the receiver side. This added complexity can be well‐tolerated in automatic meter‐reading systems because of the star topology and asymmetric nature of the network, which has a centralized agent acting as a receiver that collects data from various transmitter nodes.     

基于DM642的CAVLC解码器快速算法与实现

结合TMS320DM642的特点,采用码字扩展,码表分组和线性汇编方法对CAVLC解码进行快速算法设计与实现.在SEED-VPM642的开发板上实验,结果表明,新算法使得解码速度提高了约66.5%,能够应用于视频实时解码系统中.     

Bandwidth-efficient turbo trellis-coded modulation using puncturedcomponent codes

We present a bandwidth-efficient channel coding scheme that has an overall structure similar to binary turbo codes, but employs trellis-coded modulation (TCM) codes (including multidimensional codes) as component codes. The combination of turbo codes with powerful bandwidth-efficient component codes leads to a straightforward encoder structure, and allows iterative decoding in analogy to the binary turbo decoder. However, certain special conditions may need to be met at the encoder, and the iterative decoder needs to be adapted to the decoding of the component TCM codes. The scheme has been investigated for 8-PSK, 16-QAM, and 64-QAM modulation schemes with varying overall bandwidth efficiencies. A simple code choice based on the minimal distance of the punctured component code has also been performed. The interset distances of the partitioning tree can be used to fix the number of coded and uncoded bits. We derive the symbol-by-symbol MAP component decoder operating in the log domain, and apply methods of reducing decoder complexity. Simulation results are presented and compare the scheme with traditional TCM as well as turbo codes with Gray mapping. The results show that the novel scheme is very powerful, yet of modest complexity since simple component codes are used     

A Real-Time Video Decoder for Digital HDTV

In this paper, an architecture for real-time digital HDTV video decoding is presented. Our architecture is based on a dual decoding datapath controlled in a fixed schedule with an efficient write-back scheme for anchor pictures. The decoding datapath is synchronized at the block (8 × 8 pixels) level. Unlike other decoding approaches such as the slice bar decoding method and the cross-divide method, our scheme reduces memory access contention problem to achieve real-time HDTV decoding without a high cost in overall decoder buffers, architecture, and bus. In comparison to data-flow approaches, our method eliminates the complexity associated with tagged data operations. Our anchor picture storage is organized to minimize page-breaks during memory accesses. Simulation shows that with a relatively low rate 81 MHz clock, our decoder can decode MPEG-2 MP@HL HDTV in real-time, based on an ATSC video format of 1,920 × 1,080 pixels/frame at 30 frames/s, at a bit rate of 18 to 20 Mbps.     

在OMAP3530平台实现AVS解码器

详细讨论了OMAP架构的双核通信机制,分析了Codec Engine,DSPlink,CMEM等核心模块。然后实现了一种基于OMAP3530开发平台的AVS视频解码系统,实现了ARM处理器接收网络数据和显示图像,DSP处理器解码AVS码流。在Linux环境下将AVS视频解码器移植到3530开发板中,在分辨率D1下达到25 f/s(帧/秒)。