• Title/Summary/Keyword: code synchronization

Search Result 184, Processing Time 0.026 seconds

A Study on the Implementation of Inheritance Anomaly in Concurrent Programming (병행 프로그래밍에서 상속 이상의 구현에 관한 연구)

  • Cho, Myung-Hyun;Lee, Myung-Un
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.54 no.1
    • /
    • pp.53-57
    • /
    • 2005
  • When concurrency is integrated to programming language, problem more than inheritance remains yet. Because more than inheritance happens by collision or cross fire between synchronization and inheritance of same time object, when synchronization code is not detached properly from method code about same time object, it makes expanded of code to make derivation class change synchronization code of super class and method code. In this paper, minimize right of inheritance method, When subclass is introduced to new synchronization limitation condition, wish to solve problem more than inheritance of three types that happen in same time programming embodying C++ class that do so that can avoid alteration of method reed.

A Study on the Implementation of a High Speed Synchronization Circuit Applied in Frequency Hopping FSK Tranceiver (주파수 도약 통신방식 FSK 송수신기의 고속동기회로 구현에 관한 연구)

  • 이준호;전동근;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.1
    • /
    • pp.38-46
    • /
    • 1992
  • In this thesis, a high speed code synchronization circuit is implemented, which is applicable to frequency hopping FSK tranceiver within 68-88 MIBz band- width. synchronization Process consists of two steps, initial synchronization and tracking. A modified matched filter method using two channel passive correlators matched with short hopping frequencies, synchronization prcfix. is proposed for initial synchronization. To increase probability of initial synchronization, prefix are transmitted repeatedly. The outputs of correlators are sent to synchronization decision circuit, and code start time Is extracted by synchronizatlon decision circuit-Modified matched fitter method makes it possible to reduce complexity in hardware and obtain code acquisition rapidly.Clock recovery circuit regenerates PN code clock for tracking.

  • PDF

Frame Synchronization Algorithm for LDPC Coded Burst Systems

  • Man, Xin;Zhai, Haitao;Zhang, Eryang
    • ETRI Journal
    • /
    • v.37 no.5
    • /
    • pp.940-944
    • /
    • 2015
  • We present a frame synchronization algorithm for lowdensity parity-check (LDPC) coded burst transmissions, which combines a conventional pilots-assisted frame synchronization algorithm and a code-aided algorithm based on the mean magnitude of the soft outputs from the LDPC decoder. With moderate computational complexity, the proposed algorithm is more efficient in bandwidth than conventional pilots-assisted algorithms. When compared with other code-aided algorithms, the proposed algorithm offers a better trade-off between complexity and performance. Simulation results in the case of an 8-PSK system with (1944, 972) LDPC code show that the proposed algorithm can achieve a performance equivalent to that of the perfect frame synchronization, with a bandwidth efficiency loss of 0.06 dB due to the use of pilot symbols.

CELL SEARCH AND PERFORMANCE ANALYSIS OF W-CDMA SYSTEM IN REALISTIC MULTIPATH CHANNEL ENVIRONMENTS (광대역 다중경로 채널환경에서 W-CDMA 시스템의 셀 탐색과 성능분석)

  • 박대식;김병학;우연식;김철성
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.591-594
    • /
    • 2001
  • In the W-CDMA system, cell search is one of the imporant functions of the mobile station searching for a cell and achieving spreading code and time synchronization to its downlink scrembling code. For the methods of cell search to optimize codes, three stages are considered: 1) slot synchronization, 2) frame synchronization, and 3) scrambling code identification. Channels for cell search are Primary Synchronization Channel (P-SCH), Secondary Synchronization Channel(S-SCH), and Common Pilot Channel (CPICH). In this paper, cell search is analyzed based on simulation. Rake receiver provides improvement of Performance as an increase of bandwidth because there are more available multipaths. In this paper, the performance of W-CDMA system employing RAKE receiver is evaluated by computer simulation over the types of ITU_R wideband channel model and spreading rate. The result shows that the performance of CDMA adapting RAKE receiver is improved by the increase of multipath components in equal level of the received power.

  • PDF

Improvement of Time Synchronization over Space Wire Link (스페이스와이어 링크의 시각 동기 성능 개선)

  • Ryu, Sang-Moon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.11
    • /
    • pp.1144-1149
    • /
    • 2009
  • This paper deals with the time synchronization problem over SpaceWire links. SpaceWire is a standard for high-speed links and networks between spacecraft components, which was invented for better, cheaper, faster on-board data handling in spacecraft. The standard defines Time-Code for time distribution over SpaceWire network. When a Time-Code is transmitted, transmission delay and jitter is unavoidable. In this paper, a mechanism to remove Time-Code transmission delay and jitter over SpaceWire links is proposed and implemented with FPGA for validation. The proposed mechanism achieves high resolution clock synchronization over SpaceWire links, complies with the standard and can be easily adopted over SpaceWire network.

A Synchronization Scheme Based on Moving Average for Robust Audio Watermarking

  • Zhang, Jinquan;Han, Bin
    • Journal of Information Processing Systems
    • /
    • v.15 no.2
    • /
    • pp.271-287
    • /
    • 2019
  • The synchronization scheme based on moving average is robust and suitable for the same rule to be adopted in embedding watermark and synchronization code, but the imperceptibility and search efficiency is seldom reported. The study aims to improve the original scheme for robust audio watermarking. Firstly, the survival of the algorithm from desynchronization attacks is improved. Secondly, the scheme is improved in inaudibility. Objective difference grade (ODG) of the marked audio is significantly changed. Thirdly, the imperceptibility of the scheme is analyzed and the derived result is close to experimental result. Fourthly, the selection of parameters is optimized based on experimental data. Fifthly, the search efficiency of the scheme is compared with those of other synchronization code schemes. The experimental results show that the proposed watermarking scheme allows the high audio quality and is robust to common attacks such as additive white Gaussian noise, requantization, resampling, low-pass filtering, random cropping, MP3 compression, jitter attack, and time scale modification. Moreover, the algorithm has the high search efficiency and low false alarm rate.

Improvement of Time Synchronization of SpaceWire Network through Time-Code Extension (타임코드 확장을 통한 스페이스와이어 네트워크의 시각 동기화 성능 개선)

  • Ryu, Sang-Moon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.4
    • /
    • pp.724-730
    • /
    • 2017
  • SpaceWire invented for spacecrafts has Time-Code defined for time synchronization over SpaceWire network. A Time-Code suffers transmission delay of 14[bit-period] and jitter up to 10[bit-period] whenever it passes through a SpaceWire link, which is the primary cause of time synchronization error. This work presents a simple method to improve the time synchronization which uses two extended Time-Codes. Nodes on a SpaceWire network can find how much delay and jitter a received Time-Code has suffered while it passes through the network, and they can correct time synchronization error with this information. The proposed method was validated in a simulation environment developed based on OMNeT++. The simulation result showed that time synchronization error less than a few bit-periods can be achieved. The proposed method is cost effective and suitable for small-scale SpaceWire network systems.

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

High speed matched filter synchronization circuit applied in frequency hopping FSK Transceiver (주파수도약 대역 확산 FSK 수신기의 고속 정합여파기 동기회로)

  • Kim, Seong-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1543-1548
    • /
    • 2009
  • In this paper, a high speed code synchronization circuit is proposed. for fast code synchronization, matched filler method is used for initial code acquisition with two channel correlators. Particular frequency patterns of the limited number having the information about PN code start time are composed and transmitted repeatedly to increase the probability of accurate initial synchronization. And digital frequency synthesizer is proposed. And it's performance is analyzed theoretically. The analysis show that fast frequency hopping is possible in frequency hopping system that use digital frequency synthesizer.

Performance Analysis of Quasi-synchronous MC-CDMA and MC-DS/CDMA in Mobile Satellite Return Link (이동위성 리턴링크에서 준동기 MC-CDMA와 MC-DS/CDMA 성능 분석)

  • 안치훈;최영관;이호진;김동구
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.8
    • /
    • pp.307-317
    • /
    • 2003
  • We analyze the performance of MC-CDMA and MC-DS/CDMA system on quasi-synchronized moble satellite return link. Quasi-synchronization is considered that chip offset between terminals is within a few chips. In 10-3 BER, performance of MC-DS/CDMA system with walsh code is 0.3dB better than that of MC-CDMA system when the number of user is 5 from -0.5 $T_{c}$ to 0.5 $T_{c}$ quasi-synchronization of MC-DS/CDMA system and from -5/64 $T_{c}$ $^{MC}$ to 5/64 $T_{c}$ $^{MC}$ quasi-synchronization of MC-CDMA system. MC-DS/CDMA system with walsh code is over 0.2dB better than that of MC-DS/CDMA system with extended m code and gold code. MC-CDMA system with walsh code is over 1.2dB better than that of MC-CDMA system with gold code when the number of user is 5 and lower than from -5/32 $T_{c}$ $^{MC}$ to 5/32 $T_{c}$ $^{MC}$ quasi-synchronization.