• 한국항해항만학회지
• /
• 제31권9호
• /
• pp.763-769
• /
• 2007

A narrow loop noise bandwidth method is desirable to reduce the error of raw measurements due to the thermal noise. However, it degrades the performance of GPS initial synchronization such as mean acquisition time. And it restricts the loop noise bandwidth to a fixed value determined by the lower bound of the allowable range of carrier-to-noise power ratio, so that it is difficult to optimally track GPS signal. In order to make up for the weak points of the fixed-type narrow loop noise bandwidth method and simultaneously minimize the error of code and carrier measurements, this paper proposes a stepwise-type adaptive bandwidth algorithm for DGPS reference receivers. In this paper, it is shown that the proposed adaptive bandwidth algorithm can provide more accurate measurements than those of the fixed-type narrow loop noise bandwidth method, in view of analyzing the simulation results between two signal tracking algorithms. This paper also carries out sensitivity analysis of the proposed adaptive bandwidth algorithm due to the estimation uncertainty of carrier-to-noise power ratio. Finally the analysis results are verified by the experiment using GPS simulator.

• ETRI Journal
• /
• 제34권4호
• /
• pp.503-510
• /
• 2012

We analyze the relationship between channel coherence bandwidth and two complexity-reduced lattice reduction aided detection (LRAD) algorithms for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems in correlated fading channels. In both the adaptive LR algorithm and the fixed interval LR algorithm, we exploit the inherent feature of unimodular transformation matrix P that remains the same for the adjacent highly correlated subcarriers. Complexity simulations demonstrate that the adaptive LR algorithm could eliminate up to approximately 90 percent of the multiplications and 95 percent of the divisions of the brute-force LR algorithm with large coherence bandwidth. The results also show that the adaptive algorithm with both optimum and globally suboptimum initial interval settings could significantly reduce the LR complexity, compared with the brute-force LR and fixed interval LR algorithms, while maintaining the system performance.

• International Journal of Control, Automation, and Systems
• /
• 제6권4호
• /
• pp.596-606
• /
• 2008

In this paper, we present a co-design methodology of dynamic optimal network-bandwidth allocation (ONBA) and adaptive control for networked control systems (NCSs) to optimize overall control performance and reduce total network-bandwidth usage. The proposed dynamic co-design strategy integrates adaptive feedback control with real-time scheduling. As part of this co-design methodology, a "closed-loop" ONBA algorithm for NCSs with communication constraints is presented. Network-bandwidth is dynamically assigned to each control loop according to the quality of performance (QoP) information of each control loop. As another part of the co-design methodology, a network quality of service (QoS)-adaptive control design approach is also presented. The idea is based on calculating new control values with reference to the network QoS parameters such as time delays and packet losses measured online. Simulation results show that this co-design approach significantly improves overall control performance and utilizes less bandwidth compared to static strategies.

• IEIE Transactions on Smart Processing and Computing
• /
• 제5권5호
• /
• pp.303-309
• /
• 2016

This paper presents a channel-adaptive rate control algorithm for low delay video coding. The main goal of the proposed method is to adaptively use the unknown available channel bandwidth while reducing the end-to-end delay between encoder and decoder. The key idea of the proposed algorithm is for the status of the encoder buffer to indirectly reflect the mismatch between the available channel bandwidth and the generated bitrate. Hence, the proposed method fully utilizes the unknown available channel bandwidth by monitoring the encoder buffer status. Simulation results show that although the target bitrate mismatches the available channel bandwidth, the encoder efficiently adapts the given available bandwidth to improve the peak signal-to-noise ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권8호
• /
• pp.3856-3872
• /
• 2018

HTTP-based adaptive streaming (HAS) has recently been widely deployed on the Internet. In the HAS system, a video content is encoded at multiple bitrates and the encoded video content is segmented into small parts of fixed durations. The HAS client requests a video segment and stores it in the playout buffer. The rate adaptation algorithm employed in HAS clients dynamically determines the video bitrate depending on the time-varying bandwidth. Many studies have shown that an efficient rate adaptation algorithm is critical to ensuring quality-of-experience in HAS systems. However, existing algorithms have problems estimating the network bandwidth because bandwidth estimation is performed on the client-side application stack. Without the help of transport layer protocols, it is difficult to achieve accurate bandwidth estimation due to the inherent segment-based transmission of the HAS. In this paper, we propose an alternative approach that utilizes the playout buffer occupancy rather than using bandwidth estimates obtained from the application layer. We start with a queueing analysis of the playout buffer. Then, we present a buffer-aware rate adaptation algorithm that is solely based on the mean buffer occupancy. Our simulation results show that compared to conventional algorithms, the proposed algorithm achieves very smooth video quality while delivering a similar average video bitrate.

• 한국통신학회논문지
• /
• 제27권2A호
• /
• pp.146-156
• /
• 2002

This paper presents an adaptive H.263+ rate control algorithm for streaming video applications under the networks supporting bandwidth renegotiation, which can communicate with end-users to accommodate their time-varying bandwidth requests during the data transmission. That is, the requests of end-users can be supported adaptively according to the availability of the network resources, and thus the overall network utilization can be improved simultaneously. They are especially suitable for the transmission of non-stationary video traffics. The proposed rate control algorithm communicates with the network to renegotiate the required bandwidth fort the underlying video which are measured based on the motion change information, and choose their control strategies according to the renegotiation results. Unlike most conventional algorithms that control only the spatial quality by adjusting quantization parameters, the proposed algorithm treats both the spatial and temporal qualities at the same time to enhance human visual perceptual quality. Experimental results are provided to demonstrate that the proposed rate control algorithm can achieve superior performance to the conventional ones with low computational complexity under the networks supporting bandwidth renegotiation.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.408-418
• /
• 2007

In this paper, we address the question of dynamic network provisioning for time-varying traffic rates, with the objective of maximizing the system throughput. We assume that the network is capable of providing bandwidth guaranteed traffic tunnels for an ingress-egress pair and present an approach that (1) updates the tunnel routes and (2) adjusts the tunnel bandwidths, in an incremental, adaptive manner, based on the variations in the incoming traffic. First, we consider a simpler scenario where tunnel routes are fixed, and present an approach for adjusting the tunnel bandwidths dynamically. We show, through simulations, that our dynamic bandwidth assignment algorithm significantly outperforms the optimal static bandwidth provisioning policy, and yields a performance close to that of the optimal dynamic bandwidth provisioning policy. We also propose an adaptive route update algorithm, which can be used in conjunction with our dynamic bandwidth assignment policy, and leads to further improvement in the overall system performance.

• 응용통계연구
• /
• 제7권1호
• /
• pp.149-158
• /
• 1994

커널 추정은 커널함수와 bandwidth에 의해서 결정이 된다. 그러나 평활의 정도를 조절하는 적절한 bandwidth를 찾는 것이 더욱 중요한 문제이다. 그러므로 이론적으로 최적의 bandwidth와 비교하여 실제자료에 잘 적용될 수 있는 적절한 bandwidth를 어떻게 찾느냐는 것이 문제가 된다. 본 논문에서는 평균제곱오차(mean square error)의 편의(bias)와 분산(variance)의 관계를 통하여 커널을 이용한 회귀선의 추정에 있어서 간단하고 효과적인 local bandwidth를 찾을 수 있는 알고리즘을 제안하였다.

• 한국통신학회논문지
• /
• 제31권5B호
• /
• pp.449-455
• /
• 2006

멀티미디어 응용의 발달과 통합형 인터넷 서비스가 등장함에 따라, 광 가입자 망에 대한 연구가 활발히 진행되고 있다. 특히, Ethernet Passive Optical Network(EPON)은 경제성과 더불어 높은 대역폭 제공으로 인해 많은 관심을 받고 있다. EPON 시스템에서의 데이터 전송은 OLT(Optical Line Terminal) 가 ONU(Optical Networks Units)에게 데이터를 전송하는 하향 전송과 ONU가 OLT에게 데이터를 전송하는 상향 전송, 두 가지 방식으로 이루어져 있다. 하향 전송의 경우 모든 ONU들에게 데이터를 브로드캐스트 방식으로 전송한다. 반면 상향 전송의 경우 OLT와 ONU가 점대점 형식으로 연결되어 데이터를 전송하는데, 이때 하나의 상향 링크를 다수의 ONU가 TDMA 기반으로 공유하여 사용한다. 이러한 상향 전송에서의 대역 할당 알고리즘은 효율적인 대역폭 관리를 위해 반드시 필요하다. Limited 방식은 상향 전송에 있어서 효율적인 대역폭 할당을 위해 제안되었다. 본 논문에서는 기존 Limited 방식의 단점을 보완한 적응적 Limited 방식을 제안한다. 적응적 Limited 방식은 보다 탄력적인 대역할당이 가능하고, 패킷 지연 기반의 공평성을 제공한다. 컴퓨터 시뮬레이션을 통해 적응적 Limited 방식이 기존 Limited 방식보다 더욱 탄력적인 대역폭 할당이 가능함을 확인할 수 있었으며, 패킷 지연 기반의 공평성 유지 및 요구 기반의 대역폭 할당 공평성이 우수하게 유지됨을 확인할 수 있었다.

• 정보처리학회논문지C
• /
• 제13C권2호
• /
• pp.171-176
• /
• 2006

최근 무선통신 기술의 비약적인 발전과 함께, 이동 셀룰러 네트워크 상에서 다양한 형태의 멀티미디어 서비스에 대한 수요가 폭발적으로 증가하고 있다. 그러나, 무선 네트워크의 특성상 유선 네트워크에 비해 상대적으로 제한된 대역폭을 가지기 때문에 효율적인 대역폭 관리가 중요한 이슈이다. 본 논문에서는 이동 셀룰러 네트워크상에서의 멀티미디어 서비스를 효율적으로 지원할 수 있는 적응적 온라인 대역폭 관리 알고리즘을 제안하였다. 이 기법은 현재 네트워크의 트래픽 상황을 기반으로 하여 실시간으로 시스템을 관리하여 우선순위가 높은 서비스의 QoS 보장과 동시에 효율적인 대역폭 사용률을 제공한다. 컴퓨터 시뮬레이션을 통하여 대역폭 관리를 위해 제안된 기존의 타 기법들과의 비교, 분석을 수행하여 제안된 방법이 다앙한 네트워크 트래픽 상황에서 우수한 성능을 가지는 것을 확인할 수 있었다.