• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.279-286
• /
• 2001

This paper proposes a low power resource allocation and scheduling algorithm that minimized power consumption such as DSP circuit in high-level synthesis process. In this paper, we have used list-scheduling method for low power design in scheduling step. Also, it increase possibility to reuse input through resource sharing when assign resource. After scheduling, the resources allocation uses the power function in consideration of the result of calculating average hamming distances and switching activity between two input. First, it obtain switching activity about input value after calculate average hamming distances between two operator and find power value make use of bit pattern of the input value. Resource allocation process assign operator to minimize average hamming distance and power dissipation on all occasions which is allocated at each control step according to increase control step. As comparing the existed method, the execution time becomes fast according to number of operator and be most numberous control step. And in case of power that consume, there is decrease effect from 6% to 8% to be small.

• Journal of Digital Contents Society
• /
• v.9 no.3
• /
• pp.433-439
• /
• 2008

A moving picture in online game is one of major ways to advertise online games, which gives a lot of help in playing game. In this case, a moving picture is compressed to variable bit rate for efficient storage use and network resource efficiency. Adaptable bandwidth allocation technique builds a transmission plan of a game moving picture. And, then some frames are discarded when transmission rate by the transmission plan is larger than available transmission rate, until transmission rate satisfies available transmission rate. Thus, performance evaluation factors in adaptable bandwidth allocation technique may be dependent on discarding order of a frame which transmission rate is much influenced. In this paper, in order to show the performance, a CBA algorithm, an MCBA algorithm, an MVBA algorithm, [6] and [7] algorithm were applied to a transmission plan in the adaptable band width allocation technique using various frame discard methods and performance evaluation factors were compared in among smoothing algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.505-516
• /
• 2012

According to distribute of resource of macro cell and reduce distance between transmitter and receiver, Femto cell system is promising to provide costeffective strategy for high data traffic and high spectral efficient services in future wireless cellular system environment. However, the co-channel operation with existing Macro networks occurs some severe interference between Macro and Femto cells. Hence, the interference cancellation or management schemes are imperative between Macro and Femto cells in order to avoid the decrease of total cell throughput. First, we briefly investigate the conventional resource allocation and interference cancellation scheme between Macro and Femto cells. So we found that cell throughput and frequency reuse ware decreased Then, we propose an adaptive resource allocation scheme based on the distribution of Femtocell traffic in order to increase the cell throughput and also maximize the spectral efficiency over the FFR (Fractional Frequency Reuse) based conventional resource allocation schemes. Simulation Results show that the proposed scheme attains a bit similar SINR (Signal to Interference Noise Ratio) distribution but achieves much higher total cell throughput performance distribution over the conventional resource allocation schemes for FFR and future IEEE 802.16m based Femtocell network environment.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.2E
• /
• pp.24-32
• /
• 1996

A rigorous theory for modeling, analysis, optimum nonseparable filter bank in multidimensional M-band quantized subband codec are developed in this paper. Each pdf-optimized quantizer is modeled by a nonlinear gain-plus-additive uncorrelated noise and embedded into the subband structure. We then decompose the analysis/synthesis filter banks into their polyphase components and shift the down-and up-samplers to the right and left of the analysis/synthesis polyphase matrices respectively. Focusing on the slow clock rate signal between the samplers, we derive the exact expression for the output mean square quantization error by using spatial-invariant analysis. We show that this error can be represented by two uncorrelated components : a distortion component due to the quantizer gain, and a random noise component due to fictitious uncorrelated noise at the uantizer. This mean square error is then minimized subject to perfect reconstruction (PR) constraints and the total bit allocation for the entire filter bank. The algorithm gives filter coefficients and subband bit allocations. Numerical design example for the optimum nonseparable orthonormal filter bank is given with a quincunx subsampling lattice.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.87-90
• /
• 1998

Many recent studies have been conducted involving the transport of constant and variable bit rate MPEG-2 video in asynchronous transfer mode (ATM) networks. In this study, the traffic control of supporting MPEG-2 video communications in ATM networks under unloaded or loaded network conditions, in which the generated traffic sources are bursty in nature, are considered. We analyse about MPEG-2 traffic and design a model, which makes use of the ATM OAM funcation in order to support the traffic control functions. To implement the model, we propose a scheme, which combines the performance management OAM function and the bandwidth allocation function. Especially, we design this scheme to control the VBR (Variable Bit Rate)MPEG-2 video traffic.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.33-42
• /
• 1997

In this paper, a video coding method in wavelet transformed multi-resolution image using variable block sized motion estimation and multi-codebook is proposed. In the propoed method, the accuracy of motion estimation is increased by using variable block matching algorithm based on edge type of blocks which estimation is increased by using variable block matching algoritm based on edge type of blocks which is classified accoridng to the magnitude of wavelet coefficients in vertical subband and horizontal subband of the highest layer. Also, we increased the flexibility of bit allocation and decreased vector quantization error for motion compensated error transmission by using importance of each subband. Some experimental results confirm that he proposed mothod has fine reconstructed images without blocking effect at low bit rate, and especially reconstructs edges well to which human eyes are sensitive.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.91-93
• /
• 2003

본 논문에서는 대용랑 스토리지를 공유하는 스토리지 클러스터 시스템을 위한 매핑 테이블 기반의 스냅샷 기법을 제안한다. 스냅샷 상태 비트를 이용한 디스크 기반의 스냅샷 기법을 개선한 스냅샷 상태 테이블을 메모리에 유지하는 스냅샷 기법을 제안한다. 스냅샷 상태 테이블은 최초 할당 비트(FAB:First Allocation Bit)와 스냅샷 상태 비트(SSB:Snapshot Stautus Bit)로 구성되고 기존 스냅샷 기법이 갖는 문제점들을 해결한다. 스냅샷 생성 시 대상 저장 장치에 대한 I/O의 중단없이 데이터의 일관성을 보장한다. 또한 쓰기 연산 수행 시 COW의 수행 여부 판단을 스냅샷 상태 테이블의 FAB와 SSB를 이용하여 매핑 블록에 대한 추가적인 I/O를 없앤다. 스냅샷 삭제 시 매핑 블록에 대한 접근 없이 COW 수행 여부 판단을 처리하여 성능을 향상시킨다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.778-780
• /
• 2001

ATM(Asynchronous Transfer Mode) 망은 사용자의 요구에 의해 대역폭을 할당한 수 있으므로 전송에 필요한 대역폭이 수시로 변화하는 MPEG 비디오를 전송하는데 적합하다. 그러나 MPEG 트래픽(traffic)은 셀(cell) 발생량의 변화가 심한 군집성 (burst)이 큰 트래픽 이기에 전송 품질을 유지하면서 동시에 망의 대역폭을 효율적으로 사용하는 전송을 구현하기가 매우 힘들다. 본 연구에서는 이러한 상반되는 두 가지의 목적을 수행하기 위하여 새로운 대역폭 할당 기법을 제안하였다. 사용자에게 최소한의 품질을 보장하면서 망에 대역폭의 여유가 있는 경우 고품질의 서비스가 가능토록 하는 방안으로 ATM 망의 CBR(Constant Bit Rate) 서비스와 VBR(Variable Bit Rate) 서비스를 복합적으로 사용하는 방법을 제안하였다. 이의 구현을 위하여 2 계층 구조의 MPEG 부호화기를 설계, 구현하였고 모의 실험을 통하여 기존의 단일 계층 CBR 서비스에 비하여 품질과 망의 효율성에 있어 충분히 우수함을 확인하여 그 효용성을 증명하였다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.99-108
• /
• 1997

An efficient wavelet packet algorithm to find wavelet packet quickly is presented in this paper. The top-down method maximizing the transform coding gain that is obtained from the second moment of the band is used to divide the subbands into wavelet tree. The bit allocation for each band in the tree is performed in proportion to its variance. Bands are coded by the lossless coding algorithm called the bit plane run length coding(BPRLC) and uniform quantizer. The proposed algorithm is compared with of the single tree algorithim proposed by Ramchandran and Vetterli. To verify the efficiency of our algorithm, simulations are jperformed using several sets of images. The results show us that our method reduces the execution time by about forty percent of that required by the single tree method while maintaining the comparable reconstructed image qualities.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.207-210
• /
• 2009

An efficient algorithm to compress high dynamic range (HDR) videos is proposed in this work. We separate an HDR video sequence into a tone-mapped low dynamic range (LDR) sequence and a ratio sequence. Then, we encode those two sequences using the standard H.264/AVC codec. During the encoding, we allocate a limited amount of bit budget to the LDR sequence and the ratio sequence adaptively to maximize the qualities of both the LDR and HDR sequences. While a conventional LDR decoder uses only the LDR stream, an HDR decoder can reconstruct the HDR video using the LDR stream and the ratio stream. Simulation results demonstrate that the proposed algorithm provides higher performance than the conventional methods.