• Title/Summary/Keyword: Bandwidth Requirements

Search Result 329, Processing Time 0.031 seconds

Efficient Implementation of SVM-Based Speech/Music Classification on Embedded Systems (SVM 기반 음성/음악 분류기의 효율적인 임베디드 시스템 구현)

  • Lim, Chung-Soo;Chang, Joon-Hyuk
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.8
    • /
    • pp.461-467
    • /
    • 2011
  • Accurate classification of input signals is the key prerequisite for variable bit-rate coding, which has been introduced in order to effectively utilize limited communication bandwidth. Especially, recent surge of multimedia services elevate the importance of speech/music classification. Among many speech/music classifier, the ones based on support vector machine (SVM) have a strong selling point, high classification accuracy, but their computational complexity and memory requirement hinder their way into actual implementations. Therefore, techniques that reduce the computational complexity and the memory requirement is inevitable, particularly for embedded systems. We first analyze implementation of an SVM-based classifier on embedded systems in terms of execution time and energy consumption, and then propose two techniques that alleviate the implementation requirements: One is a technique that removes support vectors that have insignificant contribution to the final classification, and the other is to skip processing some of input signals by virtue of strong correlations in speech/music frames. These are post-processing techniques that can work with any other optimization techniques applied during the training phase of SVM. With experiments, we validate the proposed algorithms from the perspectives of classification accuracy, execution time, and energy consumption.

Multipaction Sensitivity Analysis of X-band Output Filter for Geostationary Satellite (정지궤도위성 X-대역 출력필터 멀티팩션 민감도 해석)

  • Kim, Joong-Pyo;Lee, Sun-Ik;Lim, Won-Gyu;Kim, Sang-Goo;Lee, Sang-Kon
    • Journal of Satellite, Information and Communications
    • /
    • v.10 no.3
    • /
    • pp.131-136
    • /
    • 2015
  • In this paper, prior to the flight model X-band dual-mode circular cavity filter required for the high power transmission of the observation payload in the geostationary satellite, the development model are designed and analyzed to show the analytical multipactor requirement margin. First of all, the multipaction breakdown power sensitivities were analyzed by changing the iris width and thickness within the filter, and through that the iris width and thickness was selected and then the multipaction threshold powers over the frequencies within the bandwidth were analyzed and the required margin of 8 dB was obtained. Also for the high power transmission filter, another important phenomena known as corona breakdown are analyzed for the iris width and thickness changes. Finally the development model manufactured was tested and the results met the key requirements.

Load Distribution Method based on Transcoding Time Estimation on Distributed Transcoding Environments (분산 트랜스코딩 환경에서 트랜스코딩 시간 예측 기반 부하 분산 기법)

  • Kim, Jong-Woo;Seo, Dong-Mahn;Jung, In-Bum
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.4
    • /
    • pp.195-204
    • /
    • 2010
  • Due to improved wireless communication technologies, it is possible to provide multimedia streaming service for mobile device clients like PDAs and cellphones. Wireless networks are serviced on low bandwidth channels and mobile devices work on limited hardware specifications. In these conditions, transcoding technologies are needed to adapt the media for streaming services to given mobile environments. To transcode from the source media to the target media for corresponding grades, transcoding servers perform transcoding jobs as exhausting their resources. Since various transcoding loads occur according to the target transconding grades, an effective transcoding load balancing policy is required among transcoding servers. In addition to transcoding process, servers should maintain QoS streams for mobile clients for total serviced times. It requires real-time requirements to support QoS for various mobile clients. In this paper, a new transcoding load distribution method is proposed. The proposed method can be driven for fair load balance between distributed transcoding servers. Based on estimated transcoding time, movie information and target transcoding bit-rate, it provides fair transcoding load distribution and also performs admission control to support QoS streams for mobile clients.

Ontology-based Semantic Matchmaking for Service-oriented Mission Operation (서비스 지향 임무 수행을 위한 온톨로지 기반 시맨틱 매칭 방법)

  • Song, Seheon;Lee, SangIl;Park, JaeHyun
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.3
    • /
    • pp.238-245
    • /
    • 2016
  • There are technological, operational and environmental constraints at tactical edge, which are disconnected operation, intermittent connectivity, and limited bandwidth (DIL), size, weight and power (SWaP) limitations, ad-hoc and mobile network, and so on. To overcome these limitations and constraints, we use service-oriented architecture (SOA) based technologies. Moreover, the operation environment is highly dynamic: requirements change in response to the emerging situation, and the availability of resources needs to be updated constantly due to the factors such as technical failures. In order to use appropriate resources at the right time according to the mission, it needs to find the best resources. In this context, we identify ontology-based mission service model including mission, task, service, and resource, and develop capability-based matching in tactical edge environment. The goal of this paper is to propose a capability-based semantic matching for dynamic resource allocation. The contributions of this paper are i) military domain ontologies ii) semantic matching using ontology relationship; and (iii) the capability-based matching for the mission service model.

A Fast Universal Video Distribution Protocol For Video-On-Demand Systems (주문형 비디오 시스템을 위한 빠른 광범위한 비디오 배포 기법)

  • Kwon Hyeok Min
    • The KIPS Transactions:PartB
    • /
    • v.11B no.7 s.96
    • /
    • pp.803-812
    • /
    • 2004
  • The performance of video-on-demand(VOD) systems is known to be mainly dependent on a scheduling mechanism which they employ. Broadcast-based scheduling schemes have attracted a lot of attention as an efficient way of distributing popular videos to very large client populations. The main motivations of broadcasting scheduling mechanisms are that they scale up extremely well and they have very modest bandwidth requirements. This paper studies this issue and proposes a new broadcasting scheduling mechanism, named fast universal video dis-tribution(FUVD). FUVD scheme dynamically constructs a video broadcasting schedule in response to client requests, and broadcasts video seg-ments according to this schedule. This paper also evaluates the performance of FUVD on the basis of a simulation approach. The simulation results indicate that FUVD protocol shows a superior performance over UD, CBHD, and NPB in terms of the average response time.

Design and Fabrication of Filter Banks for Implementation of Cavity Tunable Filter (캐비티 가변필터의 구현을 위한 필터뱅크 설계 및 제작)

  • Shin, Yeonho;Kang, Sanggee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.6
    • /
    • pp.169-173
    • /
    • 2014
  • In order to satisfy user's requirements of needs for various services and to efficiently use of frequency, a communication system using one platform can support many communication services. Tunable filters must be used in the front end of broadband communication systems which provide and support various communication methods. In this paper we design and implement a filter bank to verify the feasibility of cavity tunable filter with the operation frequency of 800 MHz ~ 1600 MHz. The filter bank is composed of five bandpass filters and each bandpass filter has the same operation frequency band of the tunable filter. The implemented filter bank has the maximum insertion loss of 0.326 dB, the bandwidth of 37 MHz ~ 84 MHz, and the attenuation of minimum 19.974dB and mximum 37.812dB at the band edge ${\pm}60MHz$ over the operating frequency band.

A Feasible Condition for EDF-based Scheduling of Periodic Messages on a Synchronized Switched Ethernet (동기식 스위칭 이더넷에서 주기적 메시지에 대한 마감시간우선 기반 메시지 스케쥴링을 위한 조건)

  • Kim, Myung-Kyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.4
    • /
    • pp.403-410
    • /
    • 2010
  • The switched Ethernet has many features for real-time communications such as providing traffic isolation, large bandwidth, and full-duplex links, and so on. The switched Ethernet, however, cannot guarantee the timely delivery of a real-time message because message delay increases when collisions occurs at the output ports and message loss can even occur due to the overflow at the output buffer. Recently, many research efforts have been done to use the switched Ethernet as an industrial control network. In the industrial control network, sensors periodically sense the physical environment and transmit the sensed data to an actuator, and the periodic messages from sensors to actuators have typically real-time requirements such that those messages must be transmitted within their deadlines. This paper first suggests a feasible condition for EDF (Earliest Deadline First)-based scheduling of periodic messages on a synchronized switched Ethernet and a message scheduling algorithm which satisfies the proposed feasible condition. Pedreiras, et al. [10] suggested a feasible condition for message scheduling on the Ethernet (shared media Ethernet), but there has been no research result on the scheduling condition on the switched Ethernet until now. We compared the real-time message scheduling capacity between the Ethernet and the switched Ethernet by simulation. The simulation result shows that the message scheduling capacity of the Ethernet has almost remained constant as the number of nodes on the network increases, but, in the case of the switched Ethernet, the message scheduling capacity has increased linearly according to the number of nodes on the network.

An Integrated GFR Buffer Management Algorithm or improving Internet Traffic Performance over ATM Networks (ATM 망에서 인터넷 트래픽 성능 향상을 위한 GFR 통합 버퍼 관리 기법)

  • Jeong Kwang-Il;Kim Kwan-Woong;kwak Hyun-min;Kim Nam-Hee;Chung Hyung-Taek;Chae Kyun-Shik;Chon Byoung-Sil
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.1
    • /
    • pp.73-82
    • /
    • 2004
  • As a new service category to better support TCP traffic in ATM networks, the Guaranteed Frame Rate (GFR) service category aims to support minimum cell rate guarantee, fairly distribute available bandwidth while keeping the simplicity of Unspecified Bit Rate (UBR). In this paper, we proposed a buffer management scheme which uses the per-VC accounting of single FWO queue and capable of supporting both GFR.1 and GFR.2 conformance definition. The proposed buffer management deal with GFR.1 and GFR.2 conformance definitions differentially by controlling the number of CLP=0 cell and CLP=1 cell which are occupying buffer space. The simulation results show that our proposed scheme satisfies the requirements of GFR services as well as improves total fairness index and each conformance definition fairness index.

A parallel tasks Scheduling heuristic in the Cloud with multiple attributes

  • Wang, Qin;Hou, Rongtao;Hao, Yongsheng;Wang, Yin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.287-307
    • /
    • 2018
  • There are two targets to schedule parallel jobs in the Cloud: (1) scheduling the jobs as many as possible, and (2) reducing the average execution time of the jobs. Most of previous work mainly focuses on the computing speed of resources without considering other attributes, such as bandwidth, memory and so on. Especially, past work does not consider the supply-demand condition from those attributes. Resources have different attributes, considering those attributes together makes the scheduling problem more difficult. This is the problem that we try to solve in this paper. First of all, we propose a new parallel job scheduling method based on a classification method of resources from different attributes, and then a scheduling method-CPLMT (Cloud parallel scheduling based on the lists of multiple attributes) is proposed for the parallel tasks. The classification method categories resources into different kinds according to the number of resources that satisfy the job from different attributes of the resource, such as the speed of the resource, memory and so on. Different kinds have different priorities in the scheduling. For the job that belongs to the same kinds, we propose CPLMT to schedule those jobs. Comparisons between our method, FIFO (First in first out), ASJS (Adaptive Scoring Job Scheduling), Fair and CMMS (Cloud-Minmin) are executed under different environments. The simulation results show that our proposed CPLMT not only reduces the number of unfinished jobs, but also reduces the average execution time.

Analysis of the Digital Phase Tracking Technique for Fiber-Optic Gyroscope (광섬유 자이로스코프의 위상추적 신호처리 분석)

  • Yeh, Y.H.;Cho, S.M.;Kim, J.H.
    • Journal of Sensor Science and Technology
    • /
    • v.6 no.2
    • /
    • pp.95-105
    • /
    • 1997
  • A new open-loop signal processing technique of digital phase tracking is known to have a Potential to solve the problems in the open-loop processor such as limited dynamic range, dependence on the optical intensity fluctuations, and dependence on gain fluctuations of signal path. But new problems with digital phase tracking must be solved before it can be a useful signal processing method. In this paper, barriers to the success of the digital phase tracking such as harmonics content, phase difference, amplitude variations of the phase modulation(PM) signal, bandwidth limit of the signal path, and the implementation of the mixer, are pointed out and their effects on the performance of the signal processor are analyzed to calculate the requirements of the signal processor for $1{\mu}rad$-grade FOG.

  • PDF