• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.386-392
• /
• 2015

Data in a image compression codec are processed with a specific regular block size. The processing order of block sized data is changed in specific function blocks and the data is packed in memory and read by a new sequence. To maintain a regular throughput rate, double buffering is normally used that interleaving two block sized memory to do concurrent read and write operations. Single buffering using only one block sized memory can be adopted to the simple data reordering, but when a complicate reordering occurs, irregular address changes prohibit from implementing adequate address generating for single buffering. This paper shows that there is a predictable and recurring regularity of changing address access orders within a finite updating counts and suggests an effective method to implement. The data reordering function using suggested idea is designed with HDL and implemented with TSMC 0.18 CMOS process library. In various scan blocks, it shows more than 40% size reduction compared with a conventional method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.9
• /
• pp.1-7
• /
• 1992

This paper proposes a built-in self-test tchnique for CMOS circuits. To detect a stuck-open fault in CMOS circuits, two consequent test patterns is required. The ordered pairs of test patterns for stuck-open faults are generated by feedback shift registers of extended length. A nonlinear feedback shift register is designed by the merging method and reordering algorithms of test patterns proposed in this paper. And a new multifunctional BILBO (Built-In Logic Block Observer) is designed to perform both test pattern generation and signature analysis efficiently.

• Journal of KIISE:Software and Applications
• /
• v.32 no.8
• /
• pp.795-807
• /
• 2005

The classical approaches for computing Live Variable Analysis(LVA) use iterative algorithms across the entire programs based on the Data Flow Analysis framework. In case of Zephyr compiler, average execution time of LVA takes $7\%$ of the compilation time for the benchmark programs. The classical LVA algorithm has many aspects for improvement. The iterative algorithm for LVA scans useless basic blocks and calculates large sets of variables repeatedly. We propose the improvement of Iterative algorithm for LVA based on used variables' upward movement. Our algorithm produces the same result as the previous iterative algorithm. It is based on use-def chain. Reordering of applying the flow equation in DFA reduces the number of visiting basic blocks and redundant flow equation executions, which improves overall processing time. Experimental results say that our algorithm ran reduce $36.4\%\;of\;LVA\;execution\;time\;and\;2.6\%$ of overall computation time in Zephyr compiler with benchmark programs.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.125-132
• /
• 2004

In this paper, a watermark inserting method according to the sensitivity of human visual system and minimizing distortion of original DCT coefficients in DCT transform domain is proposed. The proposed method inserts a more robust watermark in the insensitive block of human vision by reordering the blocks according to the human visual system which is appropriate to the JPEG image compression. It also enhances the invisibility and robustness in high compression rate in terms of the watermark inserting method within the block which minimizes distortions of original DCT coefficients. The computer simulation results show that the proposed method maintains high image quality and good robustness in high compression rate compared with conventional watermarking method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7C
• /
• pp.696-705
• /
• 2005

The rapid progress of the software has enabled individuals to copy and remake digital contents, which was only done by professionals. However, this rapid growth of software has brought many other defects. As a solution to the problems, contents producer needs to have certification and inspection of its contents text and hold the proprietary rights. In this paper, the new video watermarking scheme is proposed which is appropriate for the requirements mentioned for digital video contents and it is applied to MPEG-2 video encoder and decoder. In order to insert watermark sequence for digital video data, watermarking used blocks reordering algorithm and SCL(secret code list). It is satisfied two properties of cryptography that confidentiality and integrity. We test the proposed algorithm to see its performance in terms of watermark capacity, compression robustness and visual quality impact. According to the experiment of proposed watermarking algorithm, we obtained satisfactory results that watermark can still be extracted after MPEG-2 re-encoding at lower bit rates. It is important property for data hiding and user authentication in video data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1165-1172
• /
• 2006

The rapid progress of the software has enabled individuals to copy and remark digital contents, which was only done by professionals. As a solution for the problems, contents producer needs to have certification and inspection of its contents and hold the proprietary right. A fragile watermarking method is able to detect the distortion and damage of watermarked image, but the watermark is also fragile on standardized image compression. That is the problem of fragile watermarking technique. We propose semi-fragile watermarking technique that is robust in the image processing such as JPEG compression used on computer, but it is fragile on the addition of noise and other attacks. In the proposed method, we can generate the watermarks of an image from the relationship between two block coefficients, also the generated watermark is inserted into insensible part of HVS(Human Visual System) after processing DCT(Discrete Cosine Transform) and using quantization. As a result, on the spatial domain, high detection of distortion has been possible even in slight changes, and could detect the corrupted blocks on image. Therefore, it is simple to judge the pixels at which some location has been changed in the space.