• Title/Summary/Keyword: bandwidth selection

Search Result 181, Processing Time 0.022 seconds

A Design of Pan-tilt Leaf Spring Structure for Artificial Eyeball (인공안구를 위한 팬틸트 구동용 판스프링 설계)

  • Kim Jung-Han;Kim Young-Suk
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.14 no.4
    • /
    • pp.22-31
    • /
    • 2005
  • The purpose of this study is to design a flexural structure that has a function of pan and tilt for an artificial eyeball. The artificial eyeball system has a function of image stabilization, which compensate panning and tilting vibration of the body on which the artificial eyeball is attached. The target closed loop control bandwidth is 50Hz, so the mechanical resonance frequency is required to be more than the control bandwidth, which is a tough design problem because of a big mass of camera and actuator. In this study, the design process including the selection of the principal parameters by numerical analysis with ANSYS will be described, as well as the design results and frequency response.

Joint Bandwidth Allocation and Path Selection Scheme for Uplink Transmission in IEEE 802.16j Networks with Cooperative Relays (협력 중계를 이용한 IEEE 802.16j 네트워크를 위한 상향 링크에서의 통합 대역 할당 및 경로 선택 기법)

  • Hwang, Ho-Young;Lee, Hyuk-Joon;Jeong, In-Gun;Jung, In-Sung;Roh, Bong-Soo;Park, Gui-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.1
    • /
    • pp.64-77
    • /
    • 2013
  • In this paper, we propose a joint bandwidth allocation and path selection scheme for IEEE 802.16j networks in uplink with cooperative relaying, and we evaluate the performance of the proposed scheme by using OPNET based simulation in hilly terrain with heavy tree density. The proposed scheme maximizes the system throughput in uplink with cooperative relaying in IEEE 802.16j networks. Then, we transform the proposed scheme into multi-dimensional multiple choice knapsack problem (MMKP) based scheme. We also propose uplink throughput maximization scheme and MMKP based scheme without cooperative relaying. We show that the system throughput of the proposed MMKP based scheme is higher than that of link quality based scheme, and cooperative relaying provides higher system throughput than the conventional case without cooperative relaying in uplink.

Development of the Multi Band Transceiver for Multi-Channel SAR (다채널 영상레이다를 위한 다중대역 송수신기 개발)

  • Kim, Jae-Min;Lim, Jae-Hwan;Park, Ji-Woong;Jin, Hyeong-Seok;Lee, Hyeon-Cheol
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.28 no.2
    • /
    • pp.97-104
    • /
    • 2017
  • In this paper, we designed and fabricated the multi band Transceiver Assembly(TCA) for the Multi Channel Synthetic Aperture Radar(MCSAR) containing C-band, X-band, Ku-band and we researched to verify electrical performance of TCA. The transceiver consists of transmitters, receivers, signal selection modules for each band, and stability oscillator, frequency synthesizer, controller, power distributor. The transceiver has a receive path selection and bandwidth selection functions in accordance with the operating mode. And the transceiver can transmit and receive all three bands simultaneously, each band has a bandwidth of up to 300 MHz. Final transmission output of transceiver for each band is over 20 dBm to be suitable for driving the T/R module. Receiver bandwidth is selected according to the required function and receiver gain has approximately C-band 52 dB, X-band 50 dB, Ku-band 60 dB, the maximum noise figure of Ku-band V polarization is 4.28 dB in the whole band H, V polarization. As a result of the electrical performance test, a multi-band TCA is satisfied the property requirements of the MCSAR.

Robust Cross Validation Score

  • Park, Dong-Ryeon
    • Communications for Statistical Applications and Methods
    • /
    • v.12 no.2
    • /
    • pp.413-423
    • /
    • 2005
  • Consider the problem of estimating the underlying regression function from a set of noisy data which is contaminated by a long tailed error distribution. There exist several robust smoothing techniques and these are turned out to be very useful to reduce the influence of outlying observations. However, no matter what kind of robust smoother we use, we should choose the smoothing parameter and relatively less attention has been made for the robust bandwidth selection method. In this paper, we adopt the idea of robust location parameter estimation technique and propose the robust cross validation score functions.

A Dynamic Frequency Allocation for Provisioning QoS in Cognitive Radio System (무선 인지 기반 시스템에서 QoS 보장 동적 주파수 할당)

  • Lee, Mun-Ho;Lee, Jong-Chan
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2008.10b
    • /
    • pp.634-642
    • /
    • 2008
  • Radio wave is the valuable resources in $21^{st}$ century. It will be widely used in various applications such as DMB, USN, telematics, and home network as well as mobile and wireless communications. Cognitive Radio technology is devised to maximize the utilization of radio resources by sensing near-by spectrum and dynamic and allocating free resources dynamically and adaptively. Wireless links for the secondary user need to be frequently switched to idle frequencies during the transmission of multimedia data in the cognitive radio based system. This may cause delay and information loss, and QoS degradations occur inevitably. The efficient frequency allocation scheme is necessary to support the seamless multimedia service to the secondary user while maintaining QoS of the primary user. This paper suggests a frequency selection scheme which considers other parameters such as cell load, data rate, and available bandwidth than just received signal strength during the frequency selection process. The performance of our proposed scheme is analyzed by simulation.

  • PDF

Mobility-adaptive QoE Provisioning Solution in Heterogeneous Wireless Access Networks

  • Kim, Moon;Cho, Sung-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8B
    • /
    • pp.1159-1169
    • /
    • 2010
  • This paper introduces the mobility-adaptive QoE provisioning solution. The key is placed on the intelligent selection of access network depending on the QoE criteria classified by the user mobility and the bandwidth demand for service. We further focus on the network-based smart handover scheme using the mobility-adaptive handover decision and the enhanced MIH-FMIP framework. The concept is the network-based calm service and the balance in order to facilitate vertical and seamless handover. In result, it is figured out that our solution improves QoE performance by selecting appropriate access network, repressing handover occurrence, and reducing handover delay as well.

An Energy Saving Cooperative Communications Protocol without Reducing Spectral Efficiency for Wireless Ad Hoc Networks

  • Xuyen, Tran Thi;Kong, Hyung-Yun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.2A
    • /
    • pp.107-112
    • /
    • 2009
  • Spectral efficiency of current two-phase cooperative communications protocols is low since in the second time the relay forwards the same signal received from the source to the destination, the source keeps silent in this time. In this paper, we propose a novel cooperative communications protocol where the signal needed to transmit to the destination is sent in both phases, the source and the relay also transmit different signal to the destination thus no loss of spectral efficiency. This protocol performs signal selection based on log-likelihood ratio (LLR) at relay and maximum likelihood (ML) detection at destination. While existing protocols pay for a worse performance than direct transmission in the low SNR regime which is of special interest in ad hoc networks, ours is better over the whole range of SNR. In addition, the proposal takes advantages of bandwidth efficiency, long delay and interference among many terminals in ad hoc network. Simulation results show that the proposed protocol can significantly save total energy for wireless ad hoc networks.

A Restoration Method for Improving Fault Recovery in MPLS Networks Routing Protocol (패킷망에서 NGN을 위한 라우팅 프로토콜MPLS망에서 장애 개선을 위한 복구 기법)

  • In Chi-Hyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.956-966
    • /
    • 2004
  • Nowadays, NGN(Next Generation Network) is evolving into network with packet based QoS.\ulcorner This paper presents the recovery method as a selecting way of more efficient path in MPLS network that reduces the service interruption time. In order to increase the efficiency of usage of recovering resource which is one of major functions of disorder recovering, it opens the state information of each Node both to fault detector and bandwidth broker so that it reduces message transmission time for recovery when functional disorder occurs. in addition, by effective management and adjustment of required bandwidth of entire network depending on the changes of traffic load, it improves the efficiency of bandwidth usage. and in MPLS network supporting priority selection function, it allocates domains depending on the traffic relating to priority order to the entire network so that\ulcorner it efficiently allocates proper resources to the restoring process between the entry and the end for the traffic of high priority and for low priority traffic, it restores path oかy inside disordered domain. by doing this, it reduces resetting time and unnecessary massage transmission.

Performance Analysis of Virtual Conference System in the IPv6 Multicast Network (IPv6 멀티캐스트 네트워크에서 가상 학술회의 시스템의 성능 분석)

  • Eom, Tai-Rang;Do, Jin-Sook;Lee, Kyung-Geun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.1B
    • /
    • pp.45-54
    • /
    • 2003
  • In the Protocol-Independent Multicast Sparse Mode(PIM-SM), we need a careful selection scheme for the Rendezvous Point(RP) which influences much on the QoS due to the delay among multicast group members and packet loss The QoS based RP selection schemes choose RPs which satisfy the restriction conditions such as bandwidth, delay, and other QoS parameters In this paper, we propose a new RP selection scheme which is a variation of the group-based RP selection scheme The new algorithm, MCT(Maximum Cross Tree), is implemented by taking advantages of the topology-based selection scheme and the group-based selection scheme as well In order to verify the proposed algorithm, we first measure the multicast traffic data of the Virtual Conference System implemented on the IPv6 network via KOREN, then expand the results to two types of network models and analyze the performance by computer simulation.

A Route Selection Algorithm using a Statistical Approach (통계적 기법을 이용한 경로 선택 알고리즘)

  • Kim, Young-Min;Ahn, Sang-Hyun
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.1
    • /
    • pp.57-64
    • /
    • 2002
  • Since most of the current route selection algorithms use the shortest path algorithm, network resources can not be efficiently used also traffics be concentrated on specific paths resulting in congestgion. In this paper we propose the statistical route selections(SRS) algorithm which adopts a statistical mechanism to utilize the network resource efficiently and to avoid congestion. The SRS algorithm handles requests on demand and chooses a path that meets the requested bandwidth. With the advent of the MPLS it becomes possible to establish an explicit LSP which can be used for traffic load balancing. The SRS algorithm finds a set of link utilizations for route selection, computes link weights using statistical mechanism and finds the shortest path from the weights. Our statistical mechanism computes the mean and the variance of link utilizations and selects a route such that it can reduce the variance and the number of congested links and increase the utilization of network resources. Throughout the simulation, we show that the SRS algorithm performs better than other route selection algorithms on several metrics like the number of connection setup failures and the number of congested links.