• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.2
• /
• pp.1-8
• /
• 2012

We propose a new frame length control scheme for cognitive radio systems. In the proposed algorithm, the property that the probability of a primary packet arrival continually increases as time elapses during the primary user's idle period is utilized. When reducing the secondary frame length in accordance with the increasing primary packet arrival probability, spectrum sensing is conducted more frequently as time elapses and the primary packet arrival is detected more quickly. We obtain the optimal frame lengths by maximizing the secondary throughput while satisfying the interference constraint. Numerical results show a significant throughput enhancement via the frame length control.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.745-752
• /
• 2002

The purpose of the paper is to enable a format transcoding between a heterogeneous compression format in a real time, and to enhance the compression ratio using characteristics of the compressed frame. In this paper, for the heterogeneous format transcoding, we tried to transcode from MPEG2 having a lower compression ratio to H.263 having a higher compression ratio. After analyzing MPEG 2 bit stream and H.263 bit stream of the same original video, we found that the number of intra coded macro blocks in MPEG 2 data is much higher than the number of the intra coded macro blocks in H.263 data. In the process of P frame generation, a intra coded macro block is generated when a motion estimation value representing the similarity between the previous frame and current frame does not meet a threshold. Especially the intra coded macro block has a great impact on the compression ratio. Hence the paper, we tried to minimize the number of intra coded macro blocks in H.263 data stream which is transcoded from MPEG 2 in a compressed domain. For the purpose, we propose a guided search method for transcoding the INTRA coded block into INTER coded block using the information about motion vectors surrounding the intra macro block in order to minimize the complexity of the motion estimation process. The experimental results show that the transcoding of MPEG 2 into H.263 can be done in a real time successfully.

• 전자공학회논문지 IE
• /
• v.48 no.2
• /
• pp.61-70
• /
• 2011

IEEE 802.11 wireless network supports control frames like RTS/CTS(Request To Send / Clear To Send). Because they is defend to frame collection problems. It helps to solve the frame collection problem but decreases the throughput rate. Also, control frame makes False Node Problem. This problem is makes to other wireless nodes don't work and don't find channels in the same cell and near cells. We proposed a reformed new control frame for efficiency throughput rate and solution of False Node Problem. New control frame is to have added to 4 bytes of channel detection ability at the RTS frames. Channel detection ability supported to check channel at the wireless node start to transmit data frame, We expect that channel detection ability make prevent False Node Problem for increase to access number to channel. We perform comparative analysis in terms of delay(sec) and load(bits/sec) with reform RTS/CTS method which proves the efficiency of the proposed method.

• Journal of Internet of Things and Convergence
• /
• v.8 no.1
• /
• pp.53-58
• /
• 2022

Smoothing is a transmission plan that converts video data stored at a variable bit rate into a constant bit rate. In the study of [6-7], when a data rate increase is required, the frame with the smallest increase is set as the start frame of the next transmission rate section, when a data tate decrease is required. the frame with the largest decrease is set as the start frame of the next transmission rate section, And the smoothing algorithm was proposed and performance was evaluated in an environment where network traffic is not considered. In this paper, the smoothing algorithm of [6-7] evaluates the adaptive CBA algorithm and performance with minimum frame rate, average frame rate, and frame rate variation from 512KB to 32MB with E.T 90 video data in an environment that considers network traffic. As a result of comparison, the smoothing algorithm of [6-7] showed superiority in the comparison of the minimum refresh rate.

• Journal of Digital Contents Society
• /
• v.12 no.4
• /
• pp.485-490
• /
• 2011

Smoothing is a transmission plan where variable rate video data is converted to a constant bit rate stream. These smoothing algorithms include CBA, MCBA, MVBA, PCRTT and others. But, these algorithms build a transmission plan per frame unit. So, these algorithms cause frame burst or GOP burst. In order to improve it, MVBAG algorithm build a transmission plan per GOP. But this algorithm may not guarantee QoS when frame's size is abruptly larger or smaller than the computed transmission rate. In this paper, a smoothing algorithm is proposed to enhance MVBAG algorithm's problem. In order to show the proposed algorithm's performance, the proposed algorithm is compared with MVBAG algorithm using various evaluation factors such as number of frames that do not meet the QoS, average transmission rate variability per frame, average transmission rate variability per GOP. Experimental results show that the proposed algorithm outperforms MVBAG algorithm in number of frames that do not meet the QoS.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2071-2078
• /
• 2009

The first frame is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the intial QP (Quantization Parameter) for the first frame affects the first frame as well as the following frames. Traditionally, the initial QP is determined among four constant values only depending on the bpp. In the case of low bit rate video coding, the initial QP value is fixed to 35 regardless of the output bandwidth. Although this initialization scheme is simple, yet it is not accurate enough. An accurate intial QP prediction scheme should not only depends on bpp but also on the complexity of the video sequence and the output bandwidth. In the proposed scheme, we use a linear model because there is a linear inverse proportional relationship between the output bandwidth and the optimal intial QP. Model parameters of the model are determined depending on the spatial complexity of the first frame. It is shown by experimental results that the new algorithm can predict the optimal initial QP more accurately and generate the PSNR performance better than that of the existing JM algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1236-1239
• /
• 2008

적응형 대역폭 할당 방법에서는 가변 비트율의 비디오 데이터에 대해 스무딩 알고리즘을 사용하여 전송 계획을 세우고, 이 계획에 따라 데이터를 네트워크 트래픽을 고려하여 전송한다. 그러나, 새로운 구간에서 높은 전송률이 요구될 수 있는 개선된 e-PCRTT 알고리즘[4]를 이 방법에서의 전송 계획으로 그대로 사용하려는 경우 가용 전송률이 낮은 경우에는 폐기되는 프레임의 양이 많아질 수 있다. 이를 개선한 알고리즘[5]에서는 언더플로우 경계선과 오버플로우 경계선의 중간에서 전송률이 변화되지만, 전송률의 증가가 필요한 경우에는 전송률 증가 양을 최소로 한다. 본 논문에서는, 개선된 e-PCRTT 알고리즘[4]와 이를 다시 개선한 알고리즘[5]의 성능을 평가하기 위하여 E.T.90 비디오 데이터를 사용하여, 첨두 전송률, 평균 전송률 증가양, 폐기되는 프레임 양을 비교하였다.

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

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.121-124
• /
• 1994

음소를 인식의 기본으로 하는 한국어 음성인식 시스템을 구현하기 위한 기초 연구의 일환으로서 각 음소의 특징 가장 잘 표현하는 기준프레임 추출을 위한 연구를 수행하였다. 이를 위하여 먼저 선행 실험과 분산비 분석을 통해서 인식에 필요로한 시간 패턴의 길이를 추출한 후 이를 바탕으로 통계적 인식방법인 베이즈 결정법칙을 이용하여 시단 프레임으로부터 3프레임씩 시점을 1프레임씩 옮기면서 인식 실험을 해？여, 각 음소별 특징이 가장 풍부한 기준 프레임을 추출하였다. 그리고 이 기준 프레임을 중심으로 각 음소군별 인식 실험을 수행하여 그 결과를 시단을 기준으로 한 경우와 비교 검토하고 한국어 전 음소별로 확장하여 인식 실험을 실시하였다. 이 실험 결과 모음의 경우 시단으로부터 5프레임, 파열음은 시단에서부터 5프레임사이, 마찰음은 3프레임에서부터 10프레임까지, 파찰음은 5프레임까지, 비음과 유음의 경우 초성은 시단 프레임에서 6프레임, 종성은 종단으로부터 전 4프레임 구간이 인식률이 높게 나타나 이 부분의 특징이 인식에 가장 유효함을 알 수 있었다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1947-1954
• /
• 2012

The first frame is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the initial QP for the first frame affects the first frame as well as the following frames. Traditionally, the initial QP is determined among four constant values only depending on the bpp. In the case of low bit rate video coding, the initial QP value is fixed to 40 regardless of the output bandwidth. Although this initialization scheme is simple, yet it is not accurate enough. An accurate initial QP prediction scheme should not only depends on bpp but also on the complexity of the video sequence and the output bandwidth. In the proposed scheme, we determine the initial QP according to the ratio of the first frame to the total bits allocated to a GOP. To estimate the QP of the allocated bits, Rate-QP model is used. It is shown by experimental results that the new algorithm can predict the optimal initial QP more accurately and generate the PSNR performance better than that of the existing JVT algorithm.