• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.375-383
• /
• 2009

The WiMedia alliance has specified a distributed medium access control (WiMedia MAC) protocol based on ultra wideband (UWB) for high data rate WPANs (HR-WPANs). The merits of WiMedia MAC such as distributed nature and high data rate make it a favorite candidate in HR-WPAN. Although QoS parameters such as the range of service rates are provided to a traffic stream, the WiMedia MAC is not able to use the QoS parameters and to determine or adjust a service rate using the QoS parameters for the traffic stream. In this paper, we propose a fair and adaptive resource allocation method that allocates time slots to isochronous streams according to QoS parameters and the current traffic load condition in a fully distributed manner. Although the traffic load condition changes, each device independently recognizes the changes and calculates fair and maximum allowable service rates for traffic streams. From the numerical and simulation results, it is proved that the proposed method achieves high capacity of traffic streams and fair QoS provisioning under various traffic load condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.147-152
• /
• 2005

In this paper, we proposed a method for compressing the static video test patterns in high quality to test the picture quality in DTV. In our method, we use the fact that the generated bits and average quantization value have almost identical distribution characteristics per each GOP and we propose a new target bit allocation method suitable for compressing the static test pattern while the target bit allocation method in MPEG-2 TM5 is suitable for the moving picture. The proposed target bit allocation method is to maintain the high quality video continuously by using the normalized complexities which are updated or maintained by means of picture qualities at each GOP. Experiment 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.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.651-654
• /
• 2010

In this paper, we propose two power randomization schemes for the random beamforming (RBF) based MIMO systems in cellular downlink. In the proposed system, a BS randomizes not only the pre-coding matrix but also the power allocation matrix, while the conventional RBF system allocates an equal power to each transmit stream. The proposed water-filling based power randomization scheme (Scheme-I) is proper in the low SNR values and the proposed random-power based randomization scheme (Scheme-II) is proper in the high SNR values. The proposed system with the power randomization outperforms the conventional RBF system which allocates the same power for each data stream.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1215-1218
• /
• 1998

본 논문은 Digital Audio Compression(AC-3) Standard 인 A-52를 기반으로 하였으며 Borland C++3.1 Compiler를 사용하여 AC-3 Decoding Algorithm 구현하였다. Input Stream은 DVD VOB File에서 AC-3 Stream만을 분리하여 사용하며 최종 출력은 16 Bit PCM File이다. AC-3의 Frame구조는 Synchronization Information, Bit Stream Information, Audio Block, Auxiliary Data, Error Check로 구성된다. Aduio Block 은 모두 6개의 Block으로 나뉘어져 있다. BSI와 Side Information을 참조하여 Exponent를 추출하여 Exponent Strategy에 따라 Exponent를 복원한다. 복원된 Exponent 정보를 이용하여 Bit Allocation을 수행하여 각각의 Mantissa에 할당된 Bit수를 계산하고 Stream으로부터 Mantissa를 추출한다. Coupling Parameter를 참조하ㅕ Coupling Channel을 Original Channel로 복원시킨다. Stereo Mode에 대해서는 Rematrixing을 수행한다. Dynamic Range는 Mantissa와 Exponent의 Magnitude를 바꾸는 것으로 선택적으로 사용할 수 있다. Mantissa와 Exponent를 결합하여 Floating Point coefficient로 만든 후 Inverse Transform을 수행하면 PCM Data를 얻을 수 있다. PC에서 듣기 위해서는 Multi Channel을 Stereo나 Mono로 Downmix를 수행한다. 이렇게 만들어진 PCM data는 PCM Data를 재생하는 프로그램으로 재생할 수 있다.

• Journal of Korean Society on Water Environment
• /
• v.20 no.2
• /
• pp.151-156
• /
• 2004

A decision support system, Watershed Analysis Risk Management Framework(WARMF), was applied to the Kyungan Stream watershed, a tributary of Lake Paldang, for calculation of total maximum daily loads(TMDL). The WARMF system was developed by Systech Engineering, USA, and has been successfully used in several watersheds, for TMDL studies. The study area was divided into 14 sub-basins, based on digital elevation model(DEM). The integrated watershed and stream model of WARMF was validated by flow and BOD data measured during the year of 1999. There were reasonable agreements between model results and field data, both in water flow and BOD. The validated Kyungan WARMF was extensively utilized to study the quantitative relationship between waste loads and receiving water quality. Based on TMDL guideline at Paldang Lake and Kyungan Stream, the water quality criterion were set to be 3.0mg/L, 3.5mg/L, and 4.0mg/L at the watershed outlet. The allowable waste loads of BOD, both from point and non-point sources, were determined at each water quality criterion. From this study, it was concluded that the WARMF provided several advantages over the conventional application of watershed and stream models for TMDL study, such as time variable simulations, multiple possible soutions, and reduction loads for goal water quality, etc.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.404-410
• /
• 1999

A scheme of more exact overflow probability analysis is proposed for traffic regulated by dual leaky bucket. To each regulated traffic stream is allocated bandwidth and buffer independent of other traffic stream and overflow occurs when total bandwidth or buffer allocated to each traffic exceed link capacity or physical buffer size. Ratio of buffer and bandwidth allocated to each traffic stream is assumed to be constant, and this ratio is larger than the ratio of physical buffer and bandwidth due to buffer sharing effect. Numerical experiments show that this sharing effect have significant influence on overflow probability and effective bandwidth.

• 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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.120-127
• /
• 2002

The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group. However. there have been few researches about the relation between multiple and concurrent multicast groups. In this paper, the multiple multicast tree allocation algorithm to avoid congestion is proposed. The multicast group with different bandwidth requirement is also considered. A two-phase algorithm is proposed. The first phase is for basic search and the second phase for further improvement. The performance of the proposed algorithm is experimented with computational results. Computational results show that the proposed algorithm outperforms an existing algorithm.

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.109-115
• /
• 2014

This paper presents a concurrent channel time allocation scheme used in the reservation period for concurrent transmissions in 60-GHz wireless personal area networks (WPANs). To this end, the proposed resource allocation scheme includes an efficient method for creating a concurrent transmission group by using a table that indicates whether individual streams experience interference from other streams or not. The coordinator device calculates the number of streams that can be concurrently transmitted with each stream and groups them together on the basis of the calculation result. Then, the coordinator device allocates resources to each group such that the streams belonging to the same group can transmit data concurrently. Therefore, when the piconet coordinator (PNC) allocates the channel time to the individual groups, it should allow for maximizing the overall capacity. The performance evaluation result demonstrates that the proposed scheme outperforms the random grouping scheme in terms of the overall capacity when the beamwidth is $30^{\circ}C$ and the radiation efficiency is 0.9.

• Journal of Korea Game Society
• /
• v.20 no.4
• /
• pp.77-88
• /
• 2020

Recently, interest in game streaming is high in cloud-based gaming. In game streaming, remote game servers perform graphics rendering and stream the resulting scene images to clients' device on the Internet. We model the client-server allocation (CSA) problem for balancing the GPU load between servers in a game streaming environment as an optimization problem, and propose a simulated annealing-based method. The features of our method are that the method takes into account the constraints on network delay and has the ability to automatically adjust the frame rate of game sessions if necessary.