• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.4
• /
• pp.1-10
• /
• 2001

The 3-step cell search has been considered for fast acquisition of the scrambling code unique to a cell in the W -CDMA system. In this paper, the performance of the cell search scheme is analyzed in Rayleigh fading channels. And the system parameters for cell search scheme and the design parameters for the receivers are examined. The probabilities of detection, miss and false alarm for each step are derived in closed forms based on the statistics of CDMA noncoherent demodulator output. Through the analysis, the effect of threshold setting and post detection integration for each step is investigated, and the optimal values of the power allocation for the synchronization channels are also considered. The number of post-detection integrations for each step is a design parameter for the receiver, and the optimum values may depend on not only the power allocation for each channel related to the cell search, but the false alarm penalty time. It is shown that optimal values could be determined through the analysis. Also, the cumulative probability distribution of the average cell search time is obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.781-787
• /
• 2005

In this paper, an estimation method of intercell carrier frequency-offset(CFO) in orthogonal frequency division multiplexing(OFDM)-based cellular systems is proposed for a user's equipment(UE), especially at the cell boundary, in downlink channels. Also, after deriving an estimation method of intercell CFO from the signals received by adjacent base stations(BSs), we propose a cell-searching method using the estimated CFOs. It is shown by computer simulation that the proposed methods can uniquely estimate the intercell CFOs and identify the target BS with a high detection probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7A
• /
• pp.733-742
• /
• 2008

In 3GPP LTE downlink system, initial cell search is essential for mobile station to connect to base station. In order to obtain information of the base station, the mobile station detects frame timing, frequency offset, and cell identification using primary synchronization channel(PSC) and secondary synchronization channel(SSC), which are defined in downlink OFDMA specification. In this paper, we analyze various detection algorithms in practical environment of inter-cell-interference, frequency offset, and multi-path fading channel and propose the optimal algorithm. Simulation results show that partial correlation method (for PSC acquisition) and interference cancellation method (for SSC detection) are the most superior algorithms among the applicable algorithms. Employ these two algorithms for receiver design, initial cell search is performed with 99% probability within 70ms in the channel environment considered.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.1-8
• /
• 2006

In the asynchrous OFCDM(Orthogonal Frequency and Code Division Multiplexing) system, a three-step cell search algorithm is performed for the initial synchronization in the following three steps: OFCDM symbol timing, i.e., Fast Fourier Transform(FFT) window timing is estimated employing guard interval (GI) correlation in the first step, then the frame timing and CSSC (Cell Specific Scrambling Code) group is detected by taking the correlation of the CPICH(Common Pilot Channel) based on the property yeilded by shifting the CSSC phase in the frequency domain. Finally, the CSSC phase within the group is identified in the third step. This paper proposes a modification code(PCSSCG:Patial Cell Specific Scrambling Code Group) of the conventional CPICH based cell search algorithm in the second step which offers MS(Mobile Station) complexity reductions with the nearly same performance. The proposed method is to be compared and verified through the computer simulation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.754-757
• /
• 2009

본 논문에서는 휴대 단말을 소지한 사용자가 재난 발생시 구조자로부터 접근이 용이하지 않을 때, 구조자 대신 인명을 찾는 다수의 로봇이 효율적인 탐색을 할 수 있도록 target space(재난 발생 영역)를 각 노드의 통신 범위를 기반하여 셀 단위로 분할한다. 각 노드가 동일한 방향으로 탐색하는 비효율성을 개선하기 위해 셀에서 방향을 설정해 각 노드가 탐색하며, 여러 셀을 묶어 노드들의 탐색범위를 분할하는 방법을 제안한다. 탐색에 참여하는 노드들의 협동 방법으로는 모바일 환경에서의 효율적인 Peer-to-Peer 시스템으로 제안된 double-layered topology 를 기반으로 노드들을 구성하여 super peer 를 통해 맵 정보, 장애물정보, 위험지역 정보를 구조자의 요청에 따라 응답하여 인명을 구조하는 방법을 제안한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.5
• /
• pp.63-69
• /
• 2007

propose a mobile relay structure for vehicles with multiple antennas, which can increase performances of mobile communication systems and broadcasting systems significantly. Since cell searching and DoA estimation are required for the terminal in hard handover cellular system, joint techniques for cell searching and DoA estimation are proposed to apply beamforming technique for the mobile relay with multiple antennas located at the cell boundary. The proposed cell searching and DoA estimation techniques are evaluated by computer simulation under the environment similar to WiBro system.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.4
• /
• pp.39-46
• /
• 2009

Generally, Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, we propose an abstract graph for path-finding with dynamic information. The abstract graph is a simple graph as real road network is abstracted. The abstract graph is created by fixed-size cells and real road network. Path-finding with the abstract graph is composed of two step searching, path-finding on the abstract graph and on the real road network. We performed path-finding algorithm with the abstract graph against A* algorithm based on fixed-size cells on road network that consists of 106,254 edges. In result of evaluation of performance, cost of exploring in path-finding with the abstract graph is about 3~30% less than A* algorithm based on fixed-size cells. Quality of path in path-finding with the abstract graph is, However, about 1.5~6.6% more than A* algorithm based on fixed-size cells because edges eliminated are not candidates for path-finding.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1330-1331
• /
• 2009

본 연구에서는 GERAN (GSM EDGE Radio Access Network) 망에서 다양한 무선환경에 따른 셀 재탐색을 연구하였으며, 시계열분석을 통하여 재탐색 이후의 RSS (Received Signal Strength)를 예측하여 개선된 재탐색 알고리즘을 연구하였다. Field 데이터를 통해 제안된 알고리즘을 분석하였으며, 이를 통하여 다양한 조건에 적합한 기법을 제안코저 한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.599-602
• /
• 2014

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. With regard to procedures of proposal algorithm, duplicated agents were transferred to the point, where the second, third, and fourth cells were created in order, after the first cell was made, and the agents were engineered to search the shortest path to each cell, and then find the most efficient element through competition.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.475-478
• /
• 2000

제 3세대 이동통신 IMT-2000의 상용화를 앞두고 세계의 관심이 고조되고 있는 가운데 미국의 cdma2000진영과 유럽, 일본의 WCDMA 진영에서 각각 다른 표준안을 가지고 세계시장 선점을 위한 치열한 경쟁을 벌이고 있다 특히 WCDMA 방식은 미국의 군사위성에 의해 셀(cell)간의 동기를 맞추는 cdma2000 방식에 비해 군사위성을 필요치 않고, 혼합화 코드(scrambling code)에 의해 셀을 식별하게 되므로 셀 식별에 있어 많은 시간을 소비하게 된다. 따라서 본 논문에서는WCDMA방식의 표준화 기구인 3GPP(3rd generation partnership project)에서 규정한 3단계 셀 탐색방법의 이차동기 패널구조의 개선을 통한 빠른 셀 탐색 방법을 제시한다.