• Title/Summary/Keyword: Communication bandwidth

Search Result 2,080, Processing Time 0.025 seconds

Design and implementation of a small broadband dipole antenna using the symmetric double-ring structure (대칭형 이중 링 구조를 이용한 소형 광대역 다이폴형 안테나의 설계 및 구현)

  • Ju, Young-Rim;Kim, Woo-Su;Oh, Soon-Su;Park, Hyo-Dal
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.8
    • /
    • pp.1745-1751
    • /
    • 2010
  • In this paper, a small broadband dipole antenna that simultaneously satisfies DCS1800/PCS/WCDMA/WLAN is designed and fabricated. To reduce the size and to improve the bandwidth of planar microstrip dipole antenna, a new symmetric double-ring radiator structure is used. An antenna can be reduced with increasing effective current length of dipole, and can be obtained a wide band impedance characteristic with decreasing reactance component by using a novel symmetrical double-ring structure. The proposed antenna shows broadband characteristic of 1.07GHz(52%) from 1.5GHz to 2.57GHz with VSWR < 2 (${\leq}-10dB$).

The design and Fabrication of Bandpass Filter Using Step Impedance Resonators of Coaxial Type (동축 형태의 스텝 임피던스 공진기를 이용한 필터 설계 및 제작)

  • Lee, Jung-Nam
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.7
    • /
    • pp.1272-1278
    • /
    • 2009
  • The present paper is purposeful that I compare the materialization method of the filter of UIR and SIR, then make two filters of different methods, so both are useful. The structure of the method of UIR is simple, so it is used a commercial point of view that the client gets the characteristics what he wants. However, the needs of companies when compared to the same standards, a little more cheaply in price, a little smaller in size, better performance characteristics are expected. In this regard, the method of SIR is smaller than UIR in size, but it shows the similar characteristics of UIR, so it is expected that holds a dominant position in competitive power. In this paper, based on these conditions, I compared the methods of SIR and UIR after the design and production. The standards are Insertion Loss is less than 0.8dB, Return Loss is above 20.0dB, and the Ripple is within 0.3dB. The center frequency is settled 881.5MHzband that TX Band is used by CDMA(SKT). I compared in the same conditions in Bandwidth 25.0MHz.

Log processing using messaging system in SSD Storage Tester (SSD Storage Tester에서 메시징 시스템을 이용한 로그 처리)

  • Nam, Ki-ahn;Kwon, Oh-young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.8
    • /
    • pp.1531-1539
    • /
    • 2017
  • The existing SSD storage tester processed logs in a 1-N structure between server and client using TCP and network file system. This method causes some problems for example, an increase in CPU usage and difficulty in exception handling, etc. In this paper, we implement a log processing message layer that can deal with asynchronous distributed processing using open source messaging system such as kafka, RabbitMQ and compare this layer with existing log transmission method. A log simulator was implemented to compare the transmission bandwidth and CPU usage. Test results show that the transmission using the message layer has higher performance than the transmission using the message layer, and the CPU usage does not show any significant difference The message layer can be implemented more easily than the conventional method and the efficiency is higher than that of the conventional method.

The Study on Hybrid Interference Cancellation Methods for Multirate MC DS/CDMA System (다중전송률 MC DS/CDMA 시스템의 복합간섭제거기법에 대한 연구)

  • Kim, Nam-Sun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.7
    • /
    • pp.2623-2631
    • /
    • 2010
  • In this paper, we propose a new interference cancellation(IC) receiver for multirate Multicarrier DS/CDMA(MC DS/CDMA) system based on orthogonal variable spreading factor(OVSF) code. The users are assigned different lengths of OVSF codes as a spreading code according to their data rates and the active users having same representative code split into a group for effective cancellation. The code grouping interference cancellation(IC) receiver performs cancellation between the groups first and cancellation within group. This proposed IC receiver can cancel the interferences using desired user's code information and then desired signals are detected. The results show that the large improvement in performance can be attained by group-wise IC scheme and we can make the effective systems compare to conventional ones. The bit error rate of the system is analytically derived in frequency selective Rayleigh fading channel and we also compare the system performance with that of multirate DS/CDMA system. We also analyze the performance of the proposed system with same bandwidth and processing gain. The results show the large improvement in performance that can be attained by cancellation scheme.

A Mode Selection Algorithm using Scene Segmentation for Multi-view Video Coding (객체 분할 기법을 이용한 다시점 영상 부호화에서의 예측 모드 선택 기법)

  • Lee, Seo-Young;Shin, Kwang-Mu;Chung, Ki-Dong
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.3
    • /
    • pp.198-203
    • /
    • 2009
  • With the growing demand for multimedia services and advances in display technology, new applications for 3$\sim$D scene communication have emerged. While multi-view video of these emerging applications may provide users with more realistic scene experience, drastic increase in the bandwidth is a major problem to solve. In this paper, we propose a fast prediction mode decision algorithm which can significantly reduce complexity and time consumption of the encoding process. This is based on the object segmentation, which can effectively identify the fast moving foreground object. As the foreground object with fast motion is more likely to be encoded in the view directional prediction mode, we can properly limit the motion compensated coding for a case in point. As a result, time savings of the proposed algorithm was up to average 45% without much loss in the quality of the image sequence.

I2DM : An Improved Identity Management Protocol for Internet Applications in Mobile Networks (모바일 네트워크에서 인터넷 응용을 위한 향상된 ID관리 프로토콜)

  • Park, In-Shin;Jeong, Jong-Pil
    • The KIPS Transactions:PartC
    • /
    • v.19C no.1
    • /
    • pp.29-38
    • /
    • 2012
  • Due to rapid spread of smart phones and SNS(Social Network Service), using of Internet applications has increased and taking up bandwidth more than 3G network's capacity recently. This caused reduction of speed and service quality, and occurred strong needs that backbone network company to increasing investment costs. Also a great rise of mobile network users causing identity management problems on mobile service provider through mobile network. This paper proposes advanced IDM3G[1] - to solve user ID management and security problems on mobile internet application services over 3G network and more - authentication management protocol. $I^2DM$ protocol breakup loads which made by existing IDM3G protocol's mutual authentication via mobile operator, via sending some parts to internet application service provider, enhancing mobile and ID management of service provider and network load and process load from information handling and numbers of transmitting packets, to suggest more optimized protocol against further demanding of 3G mobile network.

Channel Scheduling Policies for Batching in VOD System (VOD 시스템에서 일괄전송을 위한 채널 스케줄링 기법)

  • Park, Ho-Gyun;Yu, Hwang-Bin
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.2
    • /
    • pp.385-395
    • /
    • 1999
  • Video-On-demand system provides electronic video rental services from remote video servers on a broadband communication networks. When we assume some situation that serve the same video stream by batching, each time single video stream became available at server-end side, we face the problem that what video stream to be scheduled at what time instant. Hence, in order to manage the resource bandwidth which is different at each stream, the policy of channel allocation became important factor. In this work, we proposed three type of scheduling policies with queueing, as are cumulative Waiting Time(CWT), Mean Waiting Time(MWT) and Predictable Popular Factor(PPF). While CWT policy is good for popular video, MWT policy was good for non-popular video. Also, we know that PPT policy has some fairness for average wait time and reneging rate of user requests.

  • PDF

Structural Modification of Crossed Planar Monopole Antenna for ISM 2.45GHz/5.8GHz Dual Band Characteristics (ISM 2.45GHz/5.8GHz 이중대역 특성을 위한 십자형 평판 모노폴 안테나의 구조 변경)

  • Shim, Jaeruen;Chun, Joong-Chang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.1
    • /
    • pp.13-18
    • /
    • 2015
  • This study presents the structure design of antenna to have the dual band characteristics in a desired frequency band through the structural modification of an antenna structure. For the experiment, a wideband crossed planar monopole antenna was used. The target frequency band was set to ISM 2.45GHz/5.8GHz. To give the properties, an additional antenna element was added to the crossed planar monopole antenna, which is a main body of the antenna. And then structural adjustment parameter was set to change the length(shape) of the antenna. Various simulations were conducted to find the dual band characteristics in the desired frequency band. The simulations brought forth the antenna bandwidth above the normal values for ISM 2.45GHz/5.8GHz. The structural adjustment parameter introduced in this study for structural modification of an antenna can be useful in developing an antenna featured with dual band(multiband) characteristics.

A Study on Research Scheme for Peer-to-Peer Network Using Smart Network (스마트 네트워크 구조를 활용한 Peer-to-Peer 기반 콘텐츠 검색 기법 연구)

  • Kang, Mi-Young;Nam, Ji-Seung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.2
    • /
    • pp.57-62
    • /
    • 2014
  • In order to provide real-time multimedia streaming service, a lot of system resources and network bandwidth required. Thus each computer is any computer other equivalent has the ability to act as a client and a server Peer-to-Peer(P2P) architecture with much interest. In this paper, techniques of P2P content that requires a user to efficiently retrieve the desired time in the streaming service have placed the focus of the research techniques. In a number present in the P2P contents, the user requests to find out the desired amount of time the content streaming services in order to provide seamless lookup latency contents search algorithm to minimize the study. P2P based smart network system and the structure of the super-node and the peer node is composed of super-gateway. Smart network system architecture proposed by performing a content search algorithm. The user requests a desired content, the service can be retrieved within the provided the flexibility.

Efficient Broadcast Data Clustering for Multipoint Queries in Mobile Environments (이동 환경에서 다중점 질의를 위한 효율적인 방송 데이타 클러스터링)

  • Bang, Su-Ho;Chung, Yon-Dohn;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.28 no.4
    • /
    • pp.715-722
    • /
    • 2001
  • Mobile computing has become a reality thank to the convergence of two technologies :powerful portable computers and the wireless networks. The restrictions of wireless network such as bandwidth and energy limitations make data broadcasting an attractive data communication method. This paper addresses the clustering of wireless broadcast data for multipoint queries. By effective clustering of broadcast data the mobile client can access the data on the air in short latency In the paper we define the data affinity and segment affinity measures. The data affinity is the degree that two data objects are accessed by queries, and the segment affinity is the degree that two sets of data (i.e segments) are accessed by queries Our method clusters data objects based on data and segment affinity measures we show that the performance of our method is scarcely infuenced by the growth of the number of queries.

  • PDF