• Title/Summary/Keyword: Synchronization Code

Search Result 185, Processing Time 0.028 seconds

Generation of Ionospheric Delay in Time Comparison for a Specific GEO Satellite by Using Bernese Software

  • Jeong, Kwang Seob;Lee, Young Kyu;Yang, Sung Hoon;Hwang, Sang-wook;Kim, Sanhae;Song, Kyu-Ha;Lee, Wonjin;Ko, Jae Heon
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.6 no.3
    • /
    • pp.125-133
    • /
    • 2017
  • Time comparison is necessary for the verification and synchronization of the clock. Two-way satellite time and frequency (TWSTFT) is a method for time comparison over long distances. This method includes errors such as atmospheric effects, satellite motion, and environmental conditions. Ionospheric delay is one of the significant time comparison error in case of the carrier-phase TWSTFT (TWCP). Global Ionosphere Map (GIM) from Center for Orbit Determination in Europe (CODE) is used to compare with Bernese. Thin shell model of the ionosphere is used for the calculation of the Ionosphere Pierce Point (IPP) between stations and a GEO satellite. Korea Research Institute of Standards and Science (KRISS) and Koganei (KGNI) stations are used, and the analysis is conducted at 29 January 2017. Vertical Total Electron Content (VTEC) which is generated by Bernese at the latitude and longitude of the receiver by processing a Receiver Independent Exchange (RINEX) observation file that is generated from the receiver has demonstrated adequacy by showing similar variation trends with the CODE GIM. Bernese also has showed the capability to produce high resolution IONosphere map EXchange (IONEX) data compared to the CODE GIM. At each station IPP, VTEC difference in two stations showed absolute maximum 3.3 and 2.3 Total Electron Content Unit (TECU) in Bernese and GIM, respectively. The ionospheric delay of the TWCP has showed maximum 5.69 and 2.54 ps from Bernese and CODE GIM, respectively. Bernese could correct up to 6.29 ps in ionospheric delay rather than using CODE GIM. The peak-to-peak value of the ionospheric delay for TWCP in Bernese is about 10 ps, and this has to be eliminated to get high precision TWCP results. The $10^{-16}$ level uncertainty of atomic clock corresponds to 10 ps for 1 day averaging time, so time synchronization performance needs less than 10 ps. Current time synchronization of a satellite and ground station is about 2 ns level, but the smaller required performance, like less than 1 ns, the better. In this perspective, since the ionospheric delay could exceed over 100 ps in a long baseline different from this short baseline case, the elimination of the ionospheric delay is thought to be important for more high precision time synchronization of a satellite and ground station. This paper showed detailed method how to eliminate ionospheric delay for TWCP, and a specific case is applied by using this technique. Anyone could apply this method to establish high precision TWCP capability, and it is possible to use other software such as GIPSYOASIS and GPSTk. This TWCP could be applied in the high precision atomic clocks and used in the ground stations of the future domestic satellite navigation system.

Code Acquisition of W-CDMA Signals by Double-Dwell Serial Search (이중적분 직렬검색을 이용한 W-CDMA 신호의 코드획득에 관한연구)

  • 김강온;차화준;전준수;김철성
    • Proceedings of the IEEK Conference
    • /
    • 2000.06a
    • /
    • pp.189-192
    • /
    • 2000
  • In this paper, we consider a code acquisition of W-CDMA signals over multipath Rayleigh fading channel when double-dwell serial search code acquisition is used for initial synchronization. We derive the detection and false alarm probability, and mean acquisition time mathematically by taking into account of multiple H$\_$l/ cells and double-dwell serial search. It is noteworthy that the more the number of the post-detection integration, the shorter the mean acquisition time in low SNR.

  • PDF

Code Acquisition of W-CDMA Signals Over Multipath Rayleigh Fading (다경로 레일리 페이딩 채널에서 W-CDMA 신호의 코드획득에 관한 연구)

  • 차화준;김강온;김철성
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.233-236
    • /
    • 2000
  • In this paper, we consider a code acquisition of W-CDMA signals over multipath Rayleigh fading channel when double-dwell serial search code acquisition is used for initial synchronization. We derive the detection and false alarm probability, and mean acquisition time mathematically by taking into account of multiple H$_1$ cells and double-dwell serial search. It is noteworthy that the more the number of the post-detection integration, the shorter the mean acquisition time in low SNR.

  • PDF

Performance of PN Code Synchronization with Extended Kalman Filter for a Direct-Sequence Spread-Spectrum System (직접시퀀스 확산대역 시스템을 위한 Extended Kalman Filter 기반의 PN 부호 동기화 성능)

  • Kim, Jin-Young;Yang, Jae-Soo
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.8 no.3
    • /
    • pp.107-110
    • /
    • 2009
  • In this paper, a PN code tracking loop with extended Kalman filter (EKF) is proposed for a direct-sequence spread-spectrum. EKF is used to estimate amplitude and delay in a multipath. fading channel. It is shown that tracking error performance is significantly improved by EKF compared with a conventional tracking loop.

  • PDF

A ASIC design of the Improved PN Code Acquisition System for DS/CDMA (DS-CDMA용 개선된 PN 코드 포착 시스템의 ASIC 설계)

  • Jo, Byeong-Rok;Park, Jong-U
    • The KIPS Transactions:PartD
    • /
    • v.9D no.1
    • /
    • pp.161-166
    • /
    • 2002
  • The existing method in PN code acquisition process have a problem in PN code acquisition time because PN code searching is accomplished in one epoch. In this paper, we propose algorithm that can reduce PN code acquisition time because PN code searching is accomplished in each other two epoches. The designed ASIC chip using proposed algorithm confirmed that the area (the number of gates) increase more than existing method in PN code acquisition, but the performance of PN code acquisition is better than existing method.

Audio Watermarking Using Empirical Mode Decomposition (경험적 모드 분해법을 이용한 오디오 워터마킹)

  • Nguyen, Phuong;Kim, Jong-Myon
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2014.01a
    • /
    • pp.89-92
    • /
    • 2014
  • This paper presents a secure and blind adaptive audio watermarking algorithm based on Empirical Mode Decomposition (EMD). The audio signal is divided into frames and each one is decomposed adaptively, by EMD, into several Intrinsic Mode Functions (IMFs). The watermark and the synchronization codes are then embedded into the extrema of the last IMF. The experimental results show that the proposed method has good imperceptibility and robustness against signal processing attacks.

  • PDF

The Performance Analysis of the Initial Synchronization for the Direct Sequence Spread Spectrum Communication under the Rician Fading Channel (Rician Fading Channel에서의 직접대역확산통신용 초기동기 성능분석)

  • Lim, Myoung-Seob
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.9 no.1
    • /
    • pp.43-51
    • /
    • 1998
  • In this paper, the performance about the CDMA inital synchronization under the Rician fading channel, which is actively studied as a CAI for IMT2000(FPLMTS) is analyzed. Through the performance analysis with the double dwell serial search code acquisition, the minimum mean initial synchronization acquisition time vs signal detection threshold value and first dwell duration time respectively with parameters of false alarm probability, detection probability and test PN chips is presented and the results show the mean initial synchronization acquisition time is increased with lower slope than Rayleigh fading as the threshold value of the initial synchronization acquisition decision is increased.

  • PDF

A Study on a Cell search Using PCSSCG in Broadband OFCDM Systems (OFCDM시스템에서 PCSSCG를 이용한 셀 탐색에 관한 연구)

  • Kim Dae-Yong;Choi Kwon-Hue;Park Yong-Wan
    • 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.

A Cell Search with Reduced Complexity in a Mobile Station of OFCDM Systems (OFCDM 시스템의 이동국에서의 복잡도 감소 셀 탐색)

  • Kim, Dae-Yong;Park, Yong-Wan
    • 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 design of the matched filter for CDMA rapid initial PN code synchronization acquisition using HW reuse scheme (CDMA 고속초기동기획득을 위한 HW 재사용에 의한 정합필터의 설계)

  • Lim, Myoung-Seob
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.11
    • /
    • pp.28-36
    • /
    • 1998
  • In the CDMA mobile communication system with asynchronous mode among base stations, the initial PN code acquisition method using a matched filter can be considered for the rapid PN code synchronization acquisition in the handoff region. In the model of the noncoherent QPSK/DS-SS under the Rayleigh fading channel, the mean acquisttion time of the matched filter is analyzed to have a shortened time in proportion to the length of matched filter to be compared with the serial correlation method. In this paper to improve the HW complexity of the conventional matched device which enables the repeated correlation process, is designed and its function is verified through the FPGAsimulation using Altera MaxPlus Ⅱ.

  • PDF