• Journal of Internet of Things and Convergence
• /
• v.9 no.2
• /
• pp.11-17
• /
• 2023

Smoothing is to creating a transmission plan consisting of sections of frames that can be sent at the same transmission rate for compressed and stored video data. Various algorithms have been studied for the smoothing to minimize the number of transmission rate changes, the number of transmission rate changes, and the amount of transmission rate increase. This study evaluates the performance of a smoothing algorithm that minimizes the increase in transmission rates and maximizes the increase in transmission rates when the transmission rate is required to maximize the excess bandwidth to be secured by the server in an environment with limited server bandwidth. The available transmission rates and buffer sizes available in the server are set in various ways and evaluated by the number of fps changes, the minimum fps, the average fps, and fps variability. As a result of the comparison, the proposed algorithm showed excellent average fps and fps variability.

• Journal of Digital Contents Society
• /
• v.8 no.1
• /
• pp.9-15
• /
• 2007

Smoothing is a transmission plan where variable rate video data is converted to a constant bit rate stream. Among them are CBA, MCBA, MVBA, e-PCRTT and others. e-PCRTT algorithm, which was improved from PCRTT, restricts the number of rate changes with fixed-size run. This causes unnecessary rate changes when run size is small and buffer size is large. In this paper, to overcome a shortcoming of e-PCRTT algorithm, a smoothing algorithm is proposed, which is improved from e-PCRTT, where a transmission rate transmits more intervalsl as possible. Experiments demonstrated that the proposed algorithm outperformed e-PCRTT algorithm. In order to show the performance, various evaluation factors were used such as the number of transmission rate changes, peak rate, transmission rate variability and so on.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.559-568
• /
• 2002

In this paper, we studied on combining the control of transmission fates and power for the real system where a finite set of transmission rates are used. In [1], the combined control of transmission rates and power was first researched, and suggested the Selective Power Control (SPC) algorithm. However, it can't guarantee the minimum rate to each user and results in frequent changes of rate due to oscillation of the SIR (Signal to Interference Ratio) values. As a main purpose of this paper, we derive a formulation model and propose a distributed iteration algorithm to solve these problems. To evaluate the performance of the proposed algorithm, we carried out numerical analysis and computational experiments. The results indicate that the proposed algorithm achieves better throughput than conventional one by keeping the low average transmission power.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.9
• /
• pp.2326-2333
• /
• 2009

In the adaptable bandwidth allocation technique, a transmission plan for variable rate video data is made by smoothing algorithms such as CBA algorithm and the data is sent by the transmission plan considering network traffic. But the CBA algorithm, the MCBA algorithm, MVBA algorithm and the other smoothing algorithms produce a transmission plan where the size of the increasing interval of transmission rate is generally larger than the size of the decreasing interval. And the transmission rate in CBA algorithm, the MCBA algorithm, the MVBA algorithm is changed in overflow curve during the increasing interval of transmission rate. This may cause many frames to be discarded when available transmission rate is larger than transmission rate by the transmission plan. In this paper, the smoothing algorithm, where transmission rate is changed in the middle of underflow curve and overflow curve to decrease the number of discarded frames, but the transmission rate increases at the minimum, and the CBA algorithm, the MCBA algorithm, the MVBA algorithm are applied to a transmission plan in the adaptable bandwidth allocation technique, and the minimum frame rates, the average frame rates, the variation of frame rates, and the numbers of discarded frames are compared in among algorithms.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.477-486
• /
• 2009

This paper proposes a dynamic bandwidth allocation (DBA) algorithm with adaptive maximum transmission window (DBA-AMTW) to increase channel utilization in Ethernet passive optical networks (EPONs). A polling mechanism in EPON determines channel utilization and puts constraints on DBA algorithm and scheduling. DBA algorithms based on interleaved polling with stop (IPS) allocate transmission windows to optical network units (ONU) considering requests of all ONUs. However channel idle time when any ONU does not transmit packets decreases channel utilization. Proposed DBA-AMTW improves efficiency of a network and allocates transmission windows effectively by appropriate DBA computation from REPORT messages of all ONUs. An adaptive maximum transmission window for each ONU determined by a DBA computation in the previous scheduling cycle. Simulation results show that the proposed DBA algorithm improves performance of throughput and average delay time.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.679-686
• /
• 2002

The transmission of prerecorded and compressed video data without degradation of picture quality requires video servers to cope with large fluctuations in bandwidth requirement. Bandwidth smoothing techniques can reduce the burst of a variable-bit rate stream by prefetching data at a series of fixed rates and simplifying the allocation of resources in the video servers and the network. In this paper, the proposed smoothing algorithm results in the optimal transmission plans for (1) the smallest bandwidth requirements, (2) the minimum number of changes in transmission rate, and (3) the minimum amount of the server process overhead. The advantages of the proposed smoothing algorithm have been verified through the comparison with the existing smoothing algorithms in diverse environments.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.285-292
• /
• 2007

In the adaptable bandwidth allocation technique, a transmission plan for variable rate video data is made by the CBA algorithm and the data is transmitted by considering network traffic. But the CBA algorithm produces a transmission plan where the size of the increasing interval of transmission rate is generally larger than the size of the decreasing interval. And the transmission rate in CBA algorithm is changed in overflow curve during the increasing interval of transmission rate. This ぉy cause many frames to be discarded when available transmission rate is small. In this paper, a smoothing algorithm is proposed, where transmission rate is changed in the middle of underflow curve and overflow curve, but the transmission rate increases at the minimum. In order to show the performance, the proposed algorithm and a CBA algorithm were applied to a transmission plan in the adaptable bandwidth allocation technique, and the minimum frame rates, the average frame rates, the variation of frame rates, and the numbers of discarded frames were compared in both algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.31-37
• /
• 2010

In this paper, a performance of a decorrelating detector for a multirate MC(multi-carrier) DS/CDMA system is analyzed and simulated in a frequency selective Rayleigh fading channel. The performance is compared with that of single rate MC-DS/CDMA system in term of bit error probability. Variable Spreading Length (VSL) is employed for MC-DS/CDMA system as multirate transmission scheme. From simulation result, it is shown that Decorrelator for multirate MC-DS/CDMA achieves high BER performance as well as that of single rate case.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.8
• /
• pp.1027-1038
• /
• 2002

Multimedia data services have been widely developed with the recent progression of the Internet technology. Multimedia services, especially, must guarantee Quality of Service with restricted environment resources. The abrupt increase of transmission quanta, so called burst, and the number of client that access multimedia server, with limited network bandwidth will demage the quality of service and the utilization of network resource. Smoothing techniques can reduce the burst of a variable bit rate stream by transmitting data at a series of fixed rates. In this paper, we present a new smoothing algorithm using MPEG's characteristics in transmitting stored video data with VBR. The smoothing algorithm we present will be verified with assorted existing techniques in diverse environments.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.273-276
• /
• 2001

CELP 부호화기는 선형 예측 합성에 의한 분석 부호화의 원칙에 기본을 두고 있다. 그리고 음성 신호의 스펙트럼을 LPC 분석을 통해 부호화하는데 고정 윈도우를 사용하여 부호화한다. 그러나 음성신호는 화자의 발성속도에 따라 파형의 변화가 시간적으로 빠르게 변화하기도 하고, 반대로 유사한 파형이 일정시간 유지되기도 한다. 따라서 윈도우의 크기를 발성속도에 맞추어 분석한다면 보다 효율적인 부호화를 할 수 있다. 본 논문에서는 발성속도에 따라 전송률을 달리 적용하는 방법을 제안한다. 발성속도의 측정은 스펙트럼 변화도를 이용하여 측정하였고, 발성속도가 빠를 때는 프레임 크기를 줄여 시간적으로 빠르게 변화하는 신호에 적응적으로 분석하고 대신 파라미터 표현에 비트를 줄인다. 반대로 발성속도가 느릴 때는 프레임 크기를 키우고 파라미터 표현에 비트를 더 할당한다. 제안한 방법을 실험하기 위해 G.723.1 5.3kbps ACELP 부호화기를 이용하였다 음질의 열하 없이 평균 16.34% 전송률 감소효과를 얻을 수 있었다.