• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.315-323
• /
• 2004

In this paper we present a method to generate the bit stream of static video test patterns for testing the picture quality in DTV system. The proposed user-defined quantization table is suitable for the static video test pattern and for minimizing the deterioration of picture quality by quantization, the underflow or overflow of video buffer generated on the process of coding the static video test pattern is compensated by a adaptive zero stuffing algorithm so that optimal picture quality is implemented. Experimental result showed that the test pattern stream encoded by MPEG-2 software with the proposed algorithm had a stable bit rate and good video quality during the decoding process, which is about 3 dB higher than that of the conventional case.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.691-696
• /
• 2005

In asynchronous transfer mode (ATM) networks, fixed length cells of 53 bytes are transmitted. A cell may be discarded during transmission due to buffer overflow or a detection of errors. Cell discarding seriously degrades transmission quality. The quality degradation can be reduced by employing efficient forward error control (FEC) to recover discarded cells. In this paper, we present the design and implementation of decoding equipment for FEC in ATM networks based on a single parity check (SPC) product code using very-large-scale integration (VLSI) technology. FEC allows the destination to reconstruct missing data cells by using redundant parity cells that the source adds to each block of data cells. The functionality of the design has been tested using the Model Sim 5.7cXE Simulation Package. The design has been implemented for a $5{\times}5$ matrix of data cells in a Virtex-E XCV 3200E FG1156 device. The simulation and synthesis results show that the decoding function can be completed in 81 clock cycles with an optimum clock of 56.8 MHz. A test bench was written to study the performance of the decoder, and the results are presented.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.239-244
• /
• 2008

It is not enough to reduce damages of computer systems by just patching vulnerability codes after incidents occur. It is necessary to detect and block intrusions by boosting the durability of systems even if there are vulnerable codes in systems. This paper proposes a robust real-time intrusion detection method by monitoring root privileged processes instead of system administrators in Linux systems. This method saves IP addresses of users in the process table and monitors IP addresses of every root privileged process. The proposed method is verified to protect vulnerable programs against the buffer overflow by using KON program. A configuration protocol is proposed to manage systems remotely and host IP addresses are protected from intrusions safely through this protocol.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.693-702
• /
• 2001

One of the major characteristics of C language is that it allows us to use pointer type variables to access any area of virtual address space. So, we can read/write/execute from/to virtual memory area not controlled delicately by operating system. We can access such memory area by using format string and it can be a vulnerability of C language from the point of secure programming. In this paper, we analyze in detail the process of security attack based on format string and then exploit a new virus style attack which is stepwise and durable with some actual scenarios to warn the severity of it, and grope for some preliminary responding actions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.426-445
• /
• 2012

Conventional rate control (RC) schemes for H.264 video coding usually regulate output bit rate to match channel bandwidth by adjusting quantization parameter (QP) at fixed full frame rate, and the passive frame skipping to avoid buffer overflow usually occurs when scene changes or high motions exist in video sequences especially at low bit rate, which degrades spatial-temporal quality and causes jerky effect. In this paper, an active content adaptive frame skipping scheme is proposed instead of passive methods, which skips subjectively trivial frames by structural similarity (SSIM) measurement between the original frame and the interpolated frame via motion vector (MV) copy scheme. The saved bits from skipped frames are allocated to coded key ones to enhance their spatial quality, and the skipped frames are well recovered based on MV copy scheme from adjacent key ones at the decoder side to maintain constant frame rate. Experimental results show that the proposed active SSIM-based frameskip scheme acquires better and more consistent spatial-temporal quality both in objective (PSNR) and subjective (SSIM) sense with low complexity compared to classic fixed frame rate control method JVT-G012 and prior objective metric based frameskip method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.218-226
• /
• 2001

The MPEG-2 Test Model 5 (TM5) algorithm is widely used for bit rate control. In TM5, however, the target number of bits and the number of actual coding bits for each picture do not match well. Therefore, buffer overflow and picture quality degradation may occur at the end of the GOP. In this paper, we propose a new bit rate control algorithm for matching the target and the actual coding bits based on accurate bit allocation. The key idea of the proposed algorithm is to determine quantization Parameters which enable us to generate the number of actual coding bits close to the target number of bits for each picture, while maintaining uniform picture quality and supporting real-time processing. The proposed algorithm exploits the relationship between the number of actual coding bits and the number of estimated bits of the previous macroblock.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.3
• /
• pp.196-201
• /
• 2013

In this paper, we propose an asynchronous and adaptive message passing scheme based on S-MAC for handling with the problem on energy efficiency in wireless sensor networks. The proposed scheme consists of a policy that differentiate transmission errors caused by packet collision or radio interference from congestion errors caused by buffer overflow and a method that adaptively controls the size of a fragment according to the variance of traffic loads. Especially, it presents a method that highly reduce the energy consumption by keeping the size of fragment not being excessively smaller than the one that may result in rapid increment of the total transfer time. Finally, with the simulation results we show that network throughput and delay are improved by using the proposed message passing scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1384-1396
• /
• 1998

This paper ivestigates the performance of a relative rate (RR) switch algorithm for the rate-based available bit rate (ABR) flow control in asynchronous transfer mode (ATM) networks. A RR switch may notify the network congestion status to the source by suing the congestion indication (CI) bit or no increase (NI)bit in the backward RM (BRM) cells. A RR switch can be differently implemented according to the congestion detectio and notification methods. In this paper, we propose three implementation schemes for the RR switch with different congestion detection and notification methods, and analyze the allowed cell rate (ACR) of a source and the queue length of a switch in steady state. In addition, we derive the upper and lower bounds for the maximum and minimum queue lengths for each scheme respectively, and evaluate the effects of the ABR parameter values on the queue length. Furthermore, we suggest the range of the rage increase factor (RIF) and rate decrease factor (RDF) parameter values which can prevent buffer overflow and underflow at a switch.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1322-1330
• /
• 1999

The major source of errors in high-speed networks such as Broadband ISDN(B-ISDN) is buffer overflow during congested conditions. These congestion errors are the dominant sources of errors in high-speed networks and result in cell losses. Conventional communication protocols use error detection and retransmission to deal with lost packets and transmission errors. As an alternative, we have presented a method to recover consecutive cell losses using forward error correction(FEC) in ATM(Asynchronous Transfer Mode) networks to reduce the problem. The method finds the lost cells by observing new cell sequence number($SN^{\ast}$). We have used the LI field together with SN and ST fields to consider the $SN^{\ast}$ which provides more correcting coverage than SN in ATM standards. The $SN^{\ast}$ based on the additive way such as the addition of LI capacity to original SN capacity is numbered a repeatedly 0-to-80 cycle. Another extension can be based on the multiplicative way such that LI capacity is multiplied by SN capacity. The multiplicative $SN^{\ast}$ is numbered in a repeatedly 0-to-1025 cycle.

• The KIPS Transactions:PartC
• /
• v.18C no.2
• /
• pp.89-96
• /
• 2011

ASR is an excellent program security technique that protects various data memory areas without run-time overhead. ASR hides the addresses of variables from attackers by reordering variables within a data memory area; however, it can be broken by brute force attacks because of a limited data memory space. In this paper, we propose Multiple ASR to overcome the limitation of previous ASR approaches. Multiple ASR separates a data memory area into original and duplicated areas, and compares variables in each memory area to detect an attack. In original and duplicated data memory areas variables are arranged in the opposite order. This makes it impossible to overwrite the same variables in the different data areas in a single attack. Although programs with Multiple ASR show a relatively high run-time overhead due to duplicated execution, programs with many I/O operations such as web servers, a favorite attack target, show 40~50% overhead. In this paper we develop and test a tool that transforms a program into one with Multiple ASR applied.