• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 제13회 신호처리 합동 학술대회 논문집
• /
• pp.979-982
• /
• 2000

In this paper we suggest the adaptive QoS-based VOD system design, which can diagnose and reflect the variable network situation. This system is based on the changeable Forward Error Correction(FEC) coding and re-transmission to enhance system quality by using the measured real-time network value such as loss, delay and jitter.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1992년도 춘계학술대회
• /
• pp.79-81
• /
• 1992

This paper describes the design of an adaptive closed circuit anesthesia controller based on a multiplexed mass spectrometer system. The controller deals with measurement deterioration caused by measurement delay and rise time through a tong catheter as well as long sampling times due to the multiplexed measurements. Measurement data is extrapolated between sampling periods to increase the estimation convergence rate. A multiple-step-ahead predictive control algorithm is used to calculate intermediatc control inputs between sampling intervals. Simulations are used to validate the designed controller.

• 한국정보통신학회논문지
• /
• 제7권3호
• /
• pp.411-416
• /
• 2003

본 논문에서는 STTD(Space Time Transmit Diversity)를 적용한 적응변조 시스템의 성능을 분석하였다. 무선채널 환경에서는 지연파에 의한 ISI(Intersymbol interference)간섭으로 인해 전송 오율을 증가시키게 된다. 따라서 ISI간섭의 영향을 줄이기 위해 STTD를 적용함으로써 적응변조시스템의 성능개선 정도를 분석하였다. 결과에 의하면, STTD를 적용함에 따라 더 낮은 SNR에서도 변조 다치수가 높은 변조 모드를 선택할 수 있기 때문에 고속.고품질의 데이터 전송이 가능함을 알 수 있었다.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2000년도 추계학술대회논문집
• /
• pp.443-448
• /
• 2000

In this paper, we propose a novel adaptive feedforward controller for periodic disturbance and noise cancellation, with a frequency tracking capability. It can be added to an existing feedback control system without altering the original closed-loop characteristics, which is based on adaptive algorithm. We introduce novel algorithm "Constrained AFC(adaptive feedforward controller) algorithm" that increase the convergence region regardless of the delay in the closed loop system. In the algorithms, coefficients of the controller are adapted using the residuals of constrained structure which are defined in such a way that the coefficients become time invariant. The proposed algorithm not only estimate the magnitude and phase of the tonal disturbance and noise but also track the frequency of the tone, which changes in quasi-static manner. The frequency tracking algorithm uses the instantaneous frequency approach based on Hilbert transform. A number of computer simulations have been carried out in order to demonstrate the effectiveness of proposed method under various conditions.

• 한국통신학회논문지
• /
• 제36권6C호
• /
• pp.343-348
• /
• 2011

이 논문은 NFxLMS (normalized filtered-x least mean square) 적응 필터기반의 실시간 ANC (active noise control) 무선 헤드셋에 관해서 연구한다. RMS (root mean square) 지연 분포를 측정한 후 채널을 보정해서 학습시간을 줄이고, 학습 시간동안 NFxLMS 필터 계수를 갱신해서 잡음 제거 필터의 수렴속도를 개선하는 방법을 제안한다. 제안한 방법을 실제 잡음 환경에서 이용할 경우에 짧은 학습 시간과 빠른 수렴속도를 가지면서 기존 잡음 제거기와 비슷한 성능을 가지는 잡음 제거기를 구성할 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1733-1751
• /
• 2015

The IEEE 802.15.4 standard not only provides a maximum of seven guaranteed time slots (GTSs) for allocation within a superframe to support time-critical traffic, but also achieves ultralow complexity, cost, and power in low-rate and short-distance wireless personal area networks (WPANs). Real-time wireless body area sensor networks (WBASNs), as a special purpose WPAN, can perfectly use the IEEE 802. 15. 4 standard for its wireless connection. In this paper, we propose an adaptive GTS allocation scheme for real-time WBASN data transmissions with different priorities in consideration of low latency, fairness, and bandwidth utilization. The proposed GTS allocation scheme combines a weight-based priority assignment algorithm with an innovative starvation avoidance scheme. Simulation results show that the proposed method significantly outperforms the existing GTS implementation for the traditional IEEE 802.15.4 in terms of average delay, contention free period bandwidth utilization, and fairness.

• 한국통신학회논문지
• /
• 제29권4A호
• /
• pp.370-377
• /
• 2004

본 논문에서는 광대역 무선 통신에서 직교 주파수 분할 다중화 방식의 적응 변조 기법(적응 OFDM)을 소개한다. 또한, 향상된 성능의 채별 예측 방식을 이용하여 고속 이동 환경에서 적응 OFDM 시스템 성능을 향상시킨다. 주파수 선택적 페이딩 환경에서 적응 OFDM 방식은 고속 데이터 전송의 신뢰도를 향상시킨다. 하지만, 이 방식은 보다 좋은 성능을 위해 전송단과 수신단간의 정확한 채널 정보를 요구한다. 고속의 이동성을 갖는 실외 환경에서 적응 OFDM 시스템들은 수신단으로부터 전송된 채별 정보를 필요로 한다. 하지만, 이 경우 전송단에서는 지연된 채널 정보를 갖게 된다. 더구나, 고속 이동 환경에서 채별 충격 응답은 매우 빠르게 변한다. 따라서, 전송시 적응 OFDM 시스템에 이미 오래된 채널 정보를 사용할 경우 시스템 성능은 저하된다. 이러한 문제를 해결하기 위해 본 논문에서는 향상된 성능의 채널 예측기를 갖는 적응 OFDM 방식을 제안한다. 제안한 방식의 적응 OFDM은 적은 계산량으로 고속의 비트 할당을 가능케하며 향상된 성능의 채별 예측기를 이용함으로써 채널 지연의 영향을 완화시켜 적응 OFDM 시스템의 성능이 오래된 채널 정보에도 밀 민감하게 한다. 다양한 모의 실험의 성능 결과를 통해 제안한 방식의 우수한 성능을 볼 수 있다.

• Journal of information and communication convergence engineering
• /
• 제15권1호
• /
• pp.28-36
• /
• 2017

The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.

• Journal of Communications and Networks
• /
• 제18권1호
• /
• pp.65-74
• /
• 2016

Ship ad-hoc network (SANET) extends the coverage of the maritime communication among ships with the reduced cost. To fulfill the growing demands of real-time services, the SANET requires an efficient clock time synchronization algorithm which has not been carefully investigated under the ad-hoc maritime environment. This is mainly because the conventional algorithms only suggest to decrease the beacon collision probability that diminishes the clock drift among the units. However, the SANET is a very large-scale network in terms of geographic scope, e.g., with 100 km coverage. The key factor to affect the synchronization performance is the signal propagation delay, which has not being carefully considered in the existing algorithms. Therefore, it requires a robust multi-hop synchronization algorithm to support the communication among hundreds of the ships under the maritime environment. The proposed algorithm has to face and overcome several challenges, i.e., physical clock, e.g., coordinated universal time (UTC)/global positioning system (GPS) unavailable due to the atrocious weather, network link stability, and large propagation delay in the SANET. In this paper, we propose a logical clock synchronization algorithm with multi-hop function for the SANET, namely multi-hop clock synchronization for SANET (MCSS). It works in an ad-hoc manner in case of no UTC/GPS being available, and the multi-hop function makes sure the link stability of the network. For the proposed MCSS, the synchronization time reference nodes (STRNs) are efficiently selected by considering the propagation delay, and the beacon collision can be decreased by the combination of adaptive timing synchronization procedure (ATSP) with the proposed STRN selection procedure. Based on the simulation results, we finalize the multi-hop frame structure of the SANET by considering the clock synchronization, where the physical layer parameters are contrived to meet the requirements of target applications.

• 인터넷정보학회논문지
• /
• 제5권6호
• /
• pp.11-20
• /
• 2004

Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.