• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.49 no.8
• /
• pp.27-34
• /
• 2012

In this paper, the implementation of high throughput two-dimensional (2-D) $8{\times}8$ forward and inverse integer DCT transform for H.264 is presented. The forward and inverse transforms are represented using simple shift and addition operations. Matrix decomposition and matrix operation such as the Kronecker product and direct sum are used to reduce the computation complexity. The proposed design uses integer computations and does not use transpose memory and hence, the resource consumption is also reduced. The maximum operating frequency of the proposed pipelined architecture is 1.184 GHz, which achieves 25.27 Gpixels/sec throughput rate with the hardware cost of 44864 gates. High throughput and low hardware makes the proposed design useful for real time H.264/AVC high definition processing.

• Journal of Broadcast Engineering
• /
• v.13 no.5
• /
• pp.732-743
• /
• 2008

In H.264/AVC, 4$\times$4 block transform is used for intra and inter prediction instead of 8$\times$8 block transform. Using small block size coding, H.264/AVC obtains high temporal prediction efficiency, however, it has limitation in utilizing spatial redundancy. Motivated on these points, we propose a multi-dimensional transform which achieves both the accuracy of temporal prediction as well as effective use of spatial redundancy. From preliminary experiments, the proposed multi-dimensional transform achieves higher energy compaction than 2-D DCT used in H.264. We designed an integer-based transform and quantization coder for multi-dimensional coder. Moreover, several additional methods for multi-dimensional coder are proposed, which are cube forming, scan order, mode decision and updating parameters. The Context-based Adaptive Variable-Length Coding (CAVLC) used in H.264 was employed for the entropy coder. Simulation results show that the performance of the multi-dimensional codec appears similar to that of H.264 in lower bit rates although the rate-distortion curves of the multi-dimensional DCT measured by entropy and the number of non-zero coefficients show remarkably higher performance than those of H.264/AVC. This implies that more efficient entropy coder optimized to the statistics of multi-dimensional DCT coefficients and rate-distortion operation are needed to take full advantage of the multi-dimensional DCT. There remains many issues and future works about multi-dimensional coder to improve coding efficiency over H.264/AVC.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.1
• /
• pp.1-7
• /
• 1999

We present VLSI architecture for a high performance 2-D DCT processor which is used compressing system of real time image processing or HDTV using fast computational algorithm of the Optimized Integer Cosine Transform(OICT). The coefficients of the OICT are integer, so the OICT performs only the integer operations for both forward and inverse transform. Therefore the proposed architecture could be greatly enhanced in improving the speed, reduced the hardware cost considerably by replacing the multiplication operations with shift and addition operations compared with DCT which performs floating-point operations.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.5 no.1
• /
• pp.37-42
• /
• 2006

A reversible audio watermarking algorithm is presented in this paper. This algorithm transforms the audio signal with the integer wavelet transform first in order to enhance the correlation between neighbor audio samples. Audio signal has low correlation between neighbor samples, which makes it difficult to apply difference expansion scheme. Second, a novel difference expansion scheme is used to embed more data by reducing the size of location map. Therefore, the difference expansion scheme used in this paper theoretically secures high embedding capacity under low perceptual distortion. Experiments show that this scheme can hide large number of information bits and keeps high perceptual quality.

• Journal of Broadcast Engineering
• /
• v.15 no.3
• /
• pp.434-453
• /
• 2010

In this paper, we propose 3DTE(3-Dimensional Transform Environment) that is based on 3DT(Dimensional Transform) that performs 2-dimensional integer DCT(Discrete Cosine Transform) based on $4{\times}4$ block and 1-dimensional integer DCT based on $4{\times}1$ block after collecting same frequency coefficients in neighboring $4{\times}4$ block and supports it's additional coding tools for high performance. The transform of 3DT can keep prediction error by using $4{\times}4$ block and reduce spatial redundancy additionally. The proposed 3DTE can provide coding tools to improve the coding efficiency with using 3DT. The performance of 3DTE compared to JM11.0 is average 3.58% and 5.40% bit savings for all test sequences and HD sequences, respectively, with keeping subjective video quality in High profile.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.411-414
• /
• 2008

In this paper, we present a determination method of quantization skipping condition for H.264/AVC video encoding standard. In order to reduce the complexity of quantization process that is coming from Integer discrete cosine transform, a quantization skipping condition is derived by the analysis of integer transform and quantization processes. The experimental results show that the proposed algorithm has the capability to reduce the computational complexity of CPU operation time about 10-25(%)

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7C
• /
• pp.601-607
• /
• 2007

In order to convert MPEG-2 into H.264 format in ubiquitous communication environments, the efficient conversion of the discrete cosine transform (DCT) coefficients to H.264 transform coefficients is essential. In this paper, two efficient conversion systems are proposed. The proposed systems are composed of two parts. In the first part, the DCT coefficients are denoised using the lapped transform (LT) to reduce the quantization noises and blocking effects. In the second part, the denoised DCT coefficients are converted into the integer transform (IT) coefficients of H.264. Simulation results show that the proposed methods provide visually fine images. Moreover, the computational complexity of the proposed method is reduced compared with the conventional method, since the number of the DCT coefficients, which should be converted, is reduced in the first part.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.66-79
• /
• 2009

In this paper, we propose a new adaptive intra coding technique using 1-D and 2-D integer transforms for improving coding efficiency of H.264/AVC. Proposed technique selects the most effective transform and prediction mode for each block after processing 1-D and 2-D transforms of all prediction modes. In case of using 1-D transform, $4{\times}4$ block is divided into four $1{\times}4$ or $4{\times}1$ subblocks and then each subblock is predicted and subtracted by using the decoded subblock located at the nearest position in the direction of prediction. After prediction error subblock is processed by 1-D transform and quantization, four subblocks are merged back into original $4{\times}4$ block and then, reordered as 1-D signal by a DC biased zigzag scanning pattern according to the prediction mode. Finally, comparing the coding efficiency between bitstreams based on 1-D transform and conventional 2-D transform, prediction mode and quantized coefficients for each block are decided and corresponding quantized coefficients are transmitted. Experimental results show that the proposed adaptive technique increases 0.34dB in BD-PSNR and decreases 4.03% in BD-Bitrate on the average compared with H.264/AVC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1928-1934
• /
• 1993

This paper presents a fast algorithm of integer discrete cosine transform(IDCT) allowing VLSI implementation by integer arithmetic. The proposed fast algorithm has been developed using Chen`s matrix decomposition in DCT, and requires less number of arithmetic operations compared to the IDCT. In the presented algorithm, the number of addition number is the same as the one of Chen`s algorithm if DCT, and the number of multiplication if the same as that in DCT at N=8 but drastically decreasing when N is above 8. In addition, the drawbacks of DCT such as performance degradation at the finite length arithmetic could be overcome by the IDCT.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.3
• /
• pp.39-52
• /
• 2009

Scale Invariant Feature Transform (SIFT) is an effective algorithm in object recognition, panorama stitching, and image matching, however, due to its complexity, real time processing is difficult to achieve with software approaches. This paper proposes using a reconfigurable hardware processor with integer half kernel. The integer half kernel Gaussian reduces the Gaussian pyramid complexity in about half [] and the reconfigurable processor carries out a parallel implementation of a full search Fast SIFT algorithm. We use a low memory, fine grain single instruction stream multiple data stream (SIMD) pixel processor that is currently being developed. This implementation fully exposes the available parallelism of the SIFT algorithm process and exploits the processing and I/O capabilities of the processor which results in a system that can perform real time image and video compression. We apply this novel implementation to images and measure the effectiveness. Experimental simulation results indicate that the proposed implementation is capable of real time applications.