• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.598-606
• /
• 2003

In this paper, we analyze the performance of the PCM cell search algorithm proposed for fast cell search of WCDMA systems. In order to improve both performance and complexity of the cell search algorithm standardized for WCDMA systems the PCM scheme uses a group of the polarization codes produced by a Gold code generator. The PCM scheme only uses one synchronization channel since the polarization codes modulated on P-SCH can replace the RS codes of S-SCH. Thus, the PCM reduces the BS's transmission power since only one synchronization channel can be used, and it can also reduce the complexity of receiver as compared with the conventional one. In this paper, by defining a numerical model, we analyze the performance of the PCM cell search algorithm in terms of detection probability and mean acquisition time. Consequently, we could demonstrate that the PCM cell search algorithm is superior to the standard WCDMA cell search algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1C
• /
• pp.113-122
• /
• 2010

In this paper, we propose a CP (Cyclic Prefix) detection based SSS (Secondary Synchronization Signal) detection method for initial cell search in 3GPP LTE (3rd Generation Partnership Project Long Term Evolution) FDD/TDD (Frequency Division Duplex/Time Division Duplex) dual mode downlink receiver. In general, a blind coherent SSS detection method which can detect SSS without CP detection is applied. However, coherent detection method caused performance degradation by channel compensation error at high speed environment because it uses estimated CFR (Channel Frequency Response) at PSS (Primary Synchronization Signal), and it can be more serious problem in TDD mode due to increased distance between PSS and SSS. Also blind detectionhas the drawback of high computational complexity. Therefore, we proposed a CP type pre-decision structure with non-coherent SSS detection which has stable operation in high speed channel environments for 3GPP LTE TDD mode as well as FDD mode, and can reduce computational complexity by applying CP detection before SSS detection. Simulation results show that the proposed method has stable operation for 3GPP LTE TDD/FDD dual mode downlink receiver in various channel environments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.3
• /
• pp.412-421
• /
• 2022

All 5G NR devices must first perform the cell search and synchronization process to communicate with the base station. In this process, PSS detection is one of the most important and difficult problems in 5G NR communication because PSS detection must first be successful in order to extract essential information from the following signals. Among the various PSS detection methods, this paper describes a cross-correlation-based detection method, and the implementation methods of the tap delay line hardware with parallelization are introduced and compared in terms of complexity and detection speed. In addition, the interface required for system configuration including the PSS detector and control software for efficient and flexible operation are also explained. In this paper, the resource usages of Xilinx's UltraScale+ FPGA are compared for various PSS detector structures and analyzed according to various parallelization levels.

• 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.

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

In this parer, we analyze the preamble model in the OFDMA/TDD(OFDM-FDMA/Time Division Duplexing). Besides, under AWGN, ITU-R M.1225 Ped-B and Veh-A channel environments, we analyze capabilities of symbol timing & carrier frequency offset and performance of cell searching capabilities applied to OFDM/TDD system through computer simulation. The performance using Detection Probability, False Alarm Probability, Missing Probability, Mean Acquisition Time and MSE(Mean Square Error) is analyzed. Especially, in the case of symbol timing offset estimation, the preamble structure and its algorithm with enhanced performance are proposed and then compared with existing ones.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.1
• /
• pp.139-149
• /
• 2007

Asynchronous OFCDM(Orthogonal Frequency and Code Division Multiplexing) systems must have a cell search process necessarily unlike synch개nous systems. this process is hewn initial synchronization and 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 yielded 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 group code with two or three block of the conventional CPICH based cell search algorithm in the second step which offers MS(Mobile Station) complexity reductions. however, the effect of the reduction complexity leads to degradation of the performance therefore, look for combination to have the most minimum degradation. the proposed block type group code with suitable combinations is the nearly sane performance as conventional group code and has a complexity reduction that is to be compared and verified through the computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.667-679
• /
• 2010

The use of femtocells in buildings and homes has been widely studied as a means to enlarge the cell coverage and increase the network capacity of mobile communication systems. Femtocells for Mobile WiMAX (M-WiMAX) using time division duplexing (TDD) requires frame synchronization with neighboring base stations to avoid interference between uplink and downlink signals. In this paper, we propose a new frame synchronization method for femtocell using IEEE 802.11 based wireless backhaul, which transfers the time information of mobile network to femtocells via the beacon signal provided by IEEE 802.11. Also, in order to reduce timing error of the proposed method, we modify the collision avoidance scheme in the transmitter of IEEE 802.11 and apply a timing estimation technique designed in the sense of least squares to the receiver of IEEE 802.11. Through computer simulations using the proposed scheme, we evaluate the performance of frame synchronization for femtocells and show that the recovered timing information satisfies the timing specification defined by M-WiMAX standard.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5A
• /
• pp.267-275
• /
• 2003

In UMTS terminal modem uses 3 step search procedure for initial cell search, which comprises 1) slot synchronization, 2) code group identification and frame synchronization, and 3) scrambling-code identification. The performance of initial cell search procedure depends on search parameters like observation time and threshold. The purpose of this paper is to get the optimal observation time and threshold of each step for minimum mean acquisition time. In this paper we induce mean detection time of each step and mean acquisition timefrom the model of 3 step search procedure using state diagram. Also we propose initial cell search algorithm which utilize window search method against initial oscillator error, and select an appropriate observation time and threshold of each step by the analysis of simulation and induced result. It is shown that the mean acquisition time in multipath fading channel can be shorter than 500ms by using the determined observation time and threshold of each step.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.842-854
• /
• 1997

In this paper, the improved Dual Leaky-Bucket(DLB) algorithm is proposed to reduce the synchronous cell loss rate. The conventional DLB algorithm does not support synchronous cells, but the proposed algorithm gives higher priority to synchronous cells. To reduce synchronous cell loss rate, the synchronous cell detector is used in the proposed algorithm. Synchronous cell detector detects synchronous cells, and passes them cells to the 2nd Leaky-Bucket. So it is similar to give higher priority to synchronous cells. In this paper, the proposed algorithm used audio/videl traffic modeled by On/Off and Two-state MMPP, and simulated by SLAM II package. As simulation results, the proposed algorithm gets lower synchronous cell loss rate than the conventional DLB algorithms. The improved DLB algorithm for multimedia synchronization can be extended to any other cells which require higher priority.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.524-531
• /
• 1997

A novel optical cell compressor for optical time division multiplexing system is presented. The compressor is capable of generating optically compressed very high bit-rate (possibly several tens of Gb/s) signals with minimum hardware. Contrast to the previously reported optical compressor, the compressor is mainly composed of passive optical devices and requires no synchronization among control signals in the process of compression, which results in simple implementation. We demonstrate a generation of optically compressed 6 Gb/s optical cells to confirm the fundamental operation of the compressor.