• Title/Summary/Keyword: simulation and mobile communications

Search Result 620, Processing Time 0.019 seconds

Application of Correlation-Aided DSA(CDSA) Technique to Fast Cell Search in IMT-2000 W-CDMA Systems.

  • Kim, Byoung-Hoon;Jeong, Byeong-Kook;Lee, Byeong-Gi
    • Journal of Communications and Networks
    • /
    • v.2 no.1
    • /
    • pp.58-68
    • /
    • 2000
  • In this paper we introduce the correlation-aided distributed sample acquisition (CDSA) scheme for fast cell search in IMT-2000 W-CDMA cellular system. The proposed scheme incorporates the state symbol correlation process into the comparison-correction based synchronization process of the original DSA scheme to enable fast acquisition even under very poor channel environment. for its realization, each mobile station (MS) has to store in its memory a set of state sample sequences. which are determined by the long-period scrambling sequences used in the system and the sampling interval of the state samples. CDSA based cell search is carried out in two stages : First, the MS first acquires the slot timing by using the primary synch code (PSC) and then identifies the igniter code which conveys the state samples of the current cell . Secondly. the MS identifies the scrambling code and frame timing by taking the comparison-correction based synchronization approach and, if the identification is not done satisfactorily within preset time. it initiates the state symbol correlation process which correlates the received symbol sequence with the pre-stored state sample sequences for a successful identification. As the state symbol SNR is relatively high. the state symbol correlation process enables reliable synchronization even in very low chip-SNR environment. Simulation results show that the proposed CDSA scheme outperforms the 3GPP 3-step approach, requiring the signal power of about 7 dB less for achieving the same acquisition time performance in low-SNR environments. Furthermore, it turns out very robust in the typical synchronization environment where large frequency offset exists.

  • PDF

Performance Evaluation of Initial Cell Search Scheme Using Time Tracker for W-CDMA (시간 동기 블록을 적용한 비동기 W-CDMA용 초기 셀 탐색 방법의 성능 분석)

  • Hwang, Sang-Yun;Kang, Bub-Ju;Choi, Woo-Young;Kim, Jae-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1B
    • /
    • pp.24-33
    • /
    • 2002
  • The cell search scheme for W-CDMA consists of the following three stages: slot synchronization(1st stage), group identification and frame boundary detection(2nd stage), and long code identification(3rd stage). The performance of the cell search when a mobile station is switched on, which is referred to as initial cell search, is decreased by the initial frequency and timing error. In this paper, we propose the pipeline structured initial cell search scheme using time trackers to compensate for the impact of the initial timing error in the stage 2 and stage 3. The simulation results show that the performance of the proposed scheme is maximal 1.5dB better than that of the conventional one when the initial timing error is near ${\pm}T_c$/2.

Design of a Low Power Turbo Decoder by Reducing Decoding Iterations (반복 복호수 감소에 의한 저전력 터보 복호기의 설계)

  • Back, Seo-Young;Kim, Sik;Back, Seo-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1C
    • /
    • pp.1-8
    • /
    • 2004
  • This paper proposes a novel algorithm for a low power turbo decoder based on reduction of number of decoding iterations, targeting power-critical mobile communication devices. Previous researches that attempt to reduce number of decoding iterations, such as CRC-aided and LLR methods, either show degraded BER performance in return for reduced complexity or require additional hardware resources for controlling the number of iterations to meet BER performance, respectively. The proposed algorithm can reduce power consumption without degrading the BER performance, and it is achieved with minimal hardware overhead. The proposed algorithm achieves this by comparing consecutive hard decision results using a simple buffer and counter. Simulation results show that the number of decoding iterations can be reduced to about 60% without degrading the BER performance in the proposed decoder, and power consumption can be saved in proportion to the number of decoding iterations.

Distributed Time Division Piconet Coexistence Using Local Time Offset Exchange (로컬 오프셋을 이용한 분산 시간 분리 피코넷 충돌회피 방법론)

  • Park, Yongsuk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.6
    • /
    • pp.1447-1453
    • /
    • 2014
  • Wireless Body Area Networks (WBAN), standardized as IEEE 802.15.6, enable digital devices on/around the human body to communicate with one another. WBAN is essentially a person's piconet consisting of a master (mobile) device and several slave devices, which follows his/her mobility pattern, and hence, occasionally collides with another piconet as people meet or pass by. As such, a mechanism to detect collision and avoid interference is needed for intra-piconet communications. In this paper, we focus on this notorious problem of piconet collision and propose Distributed Time Division Piconet Coexistence (DTDPC) using local time offset exchange as a simple, attractive solution. The proposed DTDPC provides different level of services for various applications. Besides our simulation results have shown that the proposed solution outperforms the conventional CSMA protocols.

An Indexing Scheme for Predicting Future-time Positions of Moving Objects with Frequently Varying Velocities (속도 변화가 빈번한 이동 객체의 미래 시점 위치 추정에 적합한 색인 기법)

  • Lim, Sung-Chae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.5
    • /
    • pp.23-31
    • /
    • 2010
  • With the advances in the information technology and mobile communications, we now face increasing demands for various services based on both of position tracking of moving objects and their efficient index scheme. Accordingly, the $TPR^*$-tree, which were proposed for efficiently tracking moving objects and predicting their positions in the future time, has drawn much intention. As the $TPR^*$-tree came from the R-tree that is suitable for indexing static objects, it does not support cheap update costs. Therefore, it seems to be very costly to index moving objects if there are frequent occurrences of node updates caused by continuously changing velocities and positions. If some moving objects with high velocities have node updates, in particular, then the $TPR^*$-tree may suffer from many unnecessary updates in the wide range of tree regions. To avoid such a problem, we propose a method that can keep fast-moving objects in the child nodes of the root node, thereby saving node update costs in the $TPR^*$-tree. To show our performance advantages and retaining $TPR^*$-tree features, we performed some performance experiments using a simulation technique.

An Efficient Channel Tracking Method in MIMO-OFDM Systems (MIMO-OFDM에서 효율적인 채널 추적 방식)

  • Jeon, Hyoung-Goo;Kim, Kyoung-Soo;Ahn, Ji-Whan;Serpedin, Erchin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3A
    • /
    • pp.256-268
    • /
    • 2008
  • This paper proposes an efficient scheme to track the time variant channel induced by multi-path Rayleigh fading in mobile wireless Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing (MIMO-OFDM) systems with null sub-carriers. In the proposed method, a blind channel response predictor is designed to cope with the time variant channel. The proposed channel tracking scheme consists of a frequency domain estimation approach that is coupled with a Minimum Mean Square Error (MMSE) time domain estimation method, and does not require any matrix inverse calculation during each OFDM symbol. The main attributes of the proposed scheme are its reduced computational complexity and good tracking performance of channel variations. The simulation results show that the proposed method exhibits superior performance than the conventional channel tracking method [4] in time varying channel environments. At a Doppler frequency of 100Hz and bit error rates (BER) of 10-4, signal-to-noise power ratio (Eb/N0) gains of about 2.5dB are achieved relative to the conventional channel tracking method [4]. At a Doppler frequency of 200Hz, the performance difference between the proposed method and conventional one becomes much larger.

Femto-Caching File Placement Technique for Overlapped Helper Coverage Without User Location Information (사용자 위치정보를 사용하지 않는 헬퍼 간 중첩 커버리지 영역을 위한 펨토-캐싱 파일 분배 기술)

  • Shim, Jae-Nam;Min, Byoung-Yoon;Kim, Dong Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.11
    • /
    • pp.682-689
    • /
    • 2014
  • Due to explosive growth of mobile data traffic, many kind of techniques based on small cell is proposed as solution for phenomenon. However, those techniques essentially demands increase of backhaul capacity and causes performance degradation if not satisfied. Based on that, the approach applying the storage capacity in place of backhaul capacity, which is known as femto-caching, is proposed to reduce data downloading delay of users in system. In this paper, we expanded previous research by proposing file placement strategy with distribution of user position, which is more practical scenario. Simulation results verify that our proposed scheme has better performance gains mainly because when coverage of helpers are overlapped, users get more opportunity to connect various helpers which enables users to download a variety kind of files from helpers, not base station.

A Novel Cell Selection Technique Based on Game Theory for Femtocell System Resource Optimization (펨토셀시스템 자원 최적화를 위한 게임이론 기반 기지국 선택 기법)

  • Jang, Jeong-Gyu;Sohn, Insoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.11
    • /
    • pp.652-659
    • /
    • 2014
  • In this paper, we propose an access point selection method for mobile users in LTE-femtocell system. In wireless communication system, users want to receive good data service. In LTE-femtocell system, if users move a little, users can experience different data service. The proposed access point selection method help that if users move a little, users obtain the high capacity and that user selects access point that other user have not selected much and so obtains higher data service. We simulated in order to prove performance of the proposed access point selection metod. Simulation results show that in a situation that users are concentrated in order to obtain better data service users are seen scattered look. As a result, we confirm that the proposed access point selection method provides good data service to users.

A study on ATM Switch supporting AAL Type 2 Cell processing (AAL Type 2 셀 처리를 지원하는 ATM 스위치에 관한 연구)

  • Park, Noh-Sik;Sonh, Seung-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3B
    • /
    • pp.209-216
    • /
    • 2003
  • In this paper, we propose ATM switch structure including AAL type 2 switch which can efficiently transmit low-bit rate data, even if the network has many endpoints. We simulate the architecture of ATM switch fabric that is modeled in computer program and analyze the performance according to offered loads. ATM switch proposed in this paper can support cell switching for all types of AAL cells which consist of AAL type 1, AAL type 2, AAL type 3/4, and AAL type 5 cells. We propose two switch fabric methods; One supports the AAL type 2 cell processing per input port, the other global AAL type 2 cell processing for every input port. The simulation results show that the latter is superior to the former. But the former has a merit for easy implementation and extensibility. The proposed ATM switch fabric is widely applicable to mobile communication, narrow band services over ATM network and wireless ATM as well as general ATM switching fabric.

Analysis of the Blocking Probability for Wireless PKI (무선 PKI에서의 블러킹 확률 분석)

  • Shin Seung-Soo;Choi Seung Kwon;Ji Hong-Il;Shin Dong-Hwa;Cho Yong-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5A
    • /
    • pp.426-435
    • /
    • 2005
  • this paper, we made out blocking probability analysis for a new authentication structure for reducing the certificate acquisition time which is one of the factors that should be improved in a conventional wireless PKI. A conventional key exchange method simply performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. Besides, we proposed advanced handover method and blocking probability analysis for wireless PKI. Proposed handover method shows reduced handover processing time than conventional method since it can reduce CRL retrieval time. Also, we compared proposed authentication structure and conventional algorithm, and simulation results show that proposed authentication method outperforms conventional algorithm in all environment regardless of call arrival rate, queue service rate, queue size