• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.5
• /
• pp.396-401
• /
• 2017

In this paper, we propose a solution for interference with Bluetooth when connecting Bluetooth and other devices. The random frequency hopping technique is a technique of generating a hopping pattern using the entire Bluetooth channel without considering the interference of the wireless LAN. The proposed adaptive frequency hopping technique is a technique for generating a hopping pattern of Bluetooth channel considering periodic carrier sensing of Bluetooth and considering WLAN interference. Simulation results show that the use of adaptive frequency hopping reduces the packet error rate as the Bluetooth carrier sensing interval decreases even in the congestion of WLAN interference. Especially, the frequency hopping technique improves the average packet error rate by about 13% compared to the adaptive frequency hopping technique.

• Journal of Satellite, Information and Communications
• /
• v.10 no.2
• /
• pp.19-23
• /
• 2015

In this paper, we present the return link ACM method to improve the link availability and system throughput for satellite communication service. Also, we describe the optimization of an algorithm for channel prediction using the LMS (Least Mean Square) adaptive filter and the MODCOD (Modulation & Code rate) decision. The simulation results show that the optimized filter taps and step-size of adaptive filter are 2 and 0.00026, respectively. And also confirms the required SNR margin for minimization of MODCOD decision error is 0.3dB.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.7
• /
• pp.125-131
• /
• 1989

This paper proposes a new ABTC (Adaptive Block Truncation Coding) algorithm which improves the BTC algorithm for image data compression. A new adaptive block truncation coding which adopts a selective coding scheme depending on the local characteristics of an image has been described. The characteristics of the ABTC algorithm can be summarized as high compression ratio and the algorithm simplicity. Using this algorithm, color images can be coded at a variable bit rate from 1.0 (bit/pel) to 2.56 (bit/pel) and high compression rate (1.3-105 bit/pel) can be achieved without conspicuous image degradation compared with original images.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.5
• /
• pp.62-72
• /
• 1993

The phased array antenna has the ability to perform adaptive sampling by directing the radar beam without inertia in any direction. The adaptive sampling capability of the phased array antenna allows each sampling time interval to be varied for each target, depending on the acceleration of each target at any time. In this paper we design a three dimensional adaptive target tracking algorithm for the phased array radar system with a given set of measurement parameters. The tracking algorithm avoids taking unnecessarily frequent samples, while keeping the angular prediction error within a fraction of antenna beamwidth so that the probability of detection will not be degraded during a track updata illuminations. In our algorithm, the target model and the sampling rate are selected depending on the target range and the target maneuver status which is determined by a maneuver level detector. A detailed simulation is conducted to test the validity of our tracking algorithm for target trajectories under various conditions of maneuver.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.931-936
• /
• 2004

We need to have an adaptive TCP protocol that can be tolerable on wireless network environement. TCP Westwood for use in the environe-ment that have a very high loss rate like a sattelite was proposed by modifying the existing bulk retransmission protocol. Bulk retransmission mechanism shows a highly enhanced performance on networks that have a very high loss rate but are prone to bursty loss networks. Also, it can exprience less performance on low late transmission environement. This paper proposes Adaptive Bulk Retransmission Mechanism that adjusts the number of bulk retransmitted packets based on the network conditions. The proposed mechanism was evaluated by using NS-2.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.701-710
• /
• 2000

This paper presents a new method for an efficient coding of very low bit-rate color video based on adaptive wavelet transform. Our approach reveals that the coding process works more efficiently if the quantized wavelet coefficients are preprocessed by a mechanism exploiting the redundancies in the wavelet subband structure. Thus, we focuses optimized activity of coding part, and exhaustive overlapped block motion compensation is utilized to ensure coherency in motion compensated error frames, and raised cosine window is applied. The horizontal and vertical components of motion vectors are encoded separately using adaptive arithmetic coding while significant wavelet coefficients are encoded in bit-plane order using adaptive arithmetic coding. On average the proposed codec exceeds H.263 and ZTE in peak signal-to-noise ratio by as much as 2.07 and 1.38dB at 28 kbits, respectively. Fore entire sequence coding, 3DWCVC method is superior to H.263 and ZTE by 0.35 and 0.71dB on average, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4585-4603
• /
• 2015

Video streaming services make up a large proportion of Internet traffic on both fixed and mobile access throughout the world. Adaptive streaming allows for dynamical adaptation of the bitrate with varying network conditions, to guarantee the best user experience. Adaptive bitrate algorithms face a significant challenge in correctly estimating the throughput as it varies widely over time. In this paper, we first evaluate the throughput estimation techniques and show that the method that we have used offers stable response to throughput fluctuations while maintaining a stable playback buffer. Then, we propose an adaptive bitrate scheme that intelligently selects the video bitrates based on the estimated throughput and buffer occupancy. We show that the proposed scheme improves viewing experience by achieving a high video rate without taking unnecessary risks and by minimizing the frequency of changes in the video quality. Furthermore, we show that it offers a stable response to short-term fluctuations and responds swiftly to large fluctuations. We evaluate our algorithm for both constant bitrate (CBR) and variable bitrate (VBR) video content by taking into account the segment sizes and show that it significantly improves the quality of video streaming.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.1
• /
• pp.11-18
• /
• 2012

In this paper, an entropy constrained vector quantizer for high bit-rates is proposed. The sample-adaptive product quantizer (SAPQ), which is based on the product codebooks, is employed, and a design algorithm for the entropy constrained sample adaptive product quantizer (ECSAPQ) is proposed. The performance of the proposed ECSAPQ is better than the case of the entropy constrained vector quantizer by 0.5dB. It is also shown that the ECSAPQ distortion curve, which is based on the scalar quantizer, is lower than the high-rate theoretical curve of the entropy constrained scalar quantizer, where the theoretical curve have 1.53dB difference from Shannon's lower bound.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.112-117
• /
• 2007

In this paper, we focus on the total transmission power minimization problem for downlink beamforming multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems while ensuring each user's QoS requirement. Although the linear integer programming (LIP) solution we formulate provides the performance upper bound of the margin adaptive (MA) optimization problem, it is hard to be implemented in practice due to its high computational complexity. By regarding each user's equivalent channel gain as approximate independent values and using iterative descent method, we present a heuristic MA resource allocation algorithm. Simulation results show that the proposed algorithm efficiently converges to the local optimum, which is very close to the performance of the optimal LIP solution. Compared with existing space division multiple access (SDMA) OFDM systems with or without adaptive resource allocation, the proposed algorithm achieves significant performance improvement by exploiting the frequency diversity and multi-user diversity in downlink multiple-input single-output (MISO) OFDM systems.

• Communications for Statistical Applications and Methods
• /
• v.28 no.5
• /
• pp.411-424
• /
• 2021

Inference following two-stage adaptive designs (also known as two-stage randomization designs) with survival endpoints usually focuses on estimating and comparing survival distributions for the different treatment strategies. The aim is to identify the treatment strategy(ies) that leads to better survival of the patients. The objectives of this study were to assess the performance three commonly cited methods for estimating survival distributions in two-stage randomization designs. We review three non-parametric methods for estimating survival distributions in two-stage adaptive designs and compare their performance using simulation studies. The simulation studies show that the method based on the marginal mean model is badly affected by high censoring rates and response rate. The other two methods which are natural extensions of the Nelson-Aalen estimator and the Kaplan-Meier estimator have similar performance. These two methods yield survival estimates which have less bias and more precise than the marginal mean model even in cases of small sample sizes. The weighted versions of the Nelson-Aalen and the Kaplan-Meier estimators are less affected by high censoring rates and low response rates. The bias of the method based on the marginal mean model increases rapidly with increase in censoring rate compared to the other two methods. We apply the three methods to a leukemia clinical trial dataset and also compare the results.