• Title/Summary/Keyword: long code

Search Result 646, Processing Time 0.032 seconds

Ultra-Fast L2-CL Code Acquisition for a Dual Band GPS Receiver

  • Kim, Binhee;Kong, Seung-Hyun
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.4 no.4
    • /
    • pp.151-160
    • /
    • 2015
  • GPS L2C signal is a recently added civil signal to L2 frequency and is constructed by time division multiplexing of civil moderate (L2-CM) and civil long (L2-CL) code signals. While the L2-CM code is 20 ms-periodic and modulates satellite navigation message, the L2-CL code is 1.5s-periodic with 767,250 chips long code sequence and carries no data. Therefore, the L2-CL code signal allows receivers to perform a very long coherent integration. However, due to the length of the L2-CL code, the acquisition of the L2-CL code signal may take too long or require too much hardware resources. In this paper, we propose a three-step ultra-fast L2-CL code acquisition (TSCLA) technique for dual band GPS receivers. In the proposed TSCLA technique, a dual band GPS receiver sequentially acquires the coarse/acquisition (C/A) code signal at L1 frequency, the L2-CM code signal, and the L2-CL code signal to minimize mean acquisition time (MAT). The theoretical performance analysis and numerous Monte Carlo simulations show the significant advantage of the proposed TSCLA technique over conventional techniques introduced in the literature.

Comparative Study of Long-Term Deflection Estimated by KCI Code Multiplier and Age-adjusted Effective Modulus Method (설계기준과 AEMM에 의해 추정된 장기처짐량의 비교)

  • Choi, Jae-Keun;Kim, Su-Man
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2006.11a
    • /
    • pp.361-364
    • /
    • 2006
  • It is specified in KCI code that long-tenn deflection shall be determined by multiplying the immediate deflection by KCI code multiplier, unless it is obtained by a more comprehensive analysis. Therefore, in this study, the estimation method of long-term deflection by KCI code multiplier is known resonable by comparing analysis results using KCI code multiplier and AEMM.

  • PDF

Numerical Simulation of High-Velocity Oblique Impacts of Yawed Long Rod Projectile Against Thin-Plate (Yaw 를 가진 긴 관통자와 경사판재의 고속충돌 수치해석)

  • Yoo, Yo-Han
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.7
    • /
    • pp.1426-1437
    • /
    • 2002
  • Using the Lagrangian explicit time-integration finite element code NET3D which can treat three-dimensional high-velocity impact problems, oblique penetration processes of long rod projectile with yaw against thin plate are simulated. Through the comparison of simulation result with experimental result and other code's computational result, the adaptability and accuracy of NET3D is evaluated under the complex situation in which yaw angle and oblique angle exist simultaneously. Main research contents to be handled in this paper include the followings. First, the accuracy and efficiency estimation of NET3D code result obtained from the oblique penetration simulations of long rod projectile with yaw against thin plate. Second, the effect of increasing impact velocity. Third, the effect of initial yaw for the spaced-plate target. Residual velocities, residual lengths, angular velocities, and final deformed configurations obtained from the NET3D computations are compared with the experimental results and other code's computational results such as Eulerian code MESA and Lagrangian code EPIC. As a result of comparisons, it has been found that NET3D code is superior to EPIC code and MESA code in the prediction capability of residual velocity and residual length of penetrator. The key features obtained from the experiment can be successfully reproduced through NET3D simulations. Throughout the study, the applicability and accuracy of NET3D as a metallic armor system design tool is verified.

Performance Evaluation of LDPC-LDPC Product Code for next Magnetic Recording Channel (차세대 자기기록 채널을 위한 LDPC-LDPC 곱 부호의 성능 평가)

  • Park, Donghyuk;Lee, Jaejin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.11
    • /
    • pp.3-8
    • /
    • 2012
  • Two-dimensional product code has been studied for correcting burst errors on the storage systems. An RS-LDPC product code consists of an RS code in horizontal direction and an LDPC code in vertical direction. First, we detect the position of burst errors by using RS code, then LDPC code corrects the errors by using the burst error positions. In storage system, long burst errors are occurred by various reason. So, we need a strong code for correcting the long burst errors. RS-LDPC product code is good for long burst errors. However, as the storage density grows the length of the burst errors will be longer. Thus, we propose an LDPC-LDPC product code, it is strong for correcting the very long burst errors. Also, the proposed LDPC-LDPC product code performs better than RS-LDPC product code when the random errors are occurred, because a row direction LDPC code performs better than row direction RS code.

Metrics for Code Quality Check in SEED_mode.c

  • Jin-Kuen Hong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.16 no.3
    • /
    • pp.184-191
    • /
    • 2024
  • The focus of this paper is secure code development and maintenance. When it comes to safe code, it is most important to consider code readability and maintainability. This is because complex code has a code smell, that is, a structural problem that complicates code understanding and modification. In this paper, the goal is to improve code quality by detecting and removing smells existing in code. We target the encryption and decryption code SEED.c and evaluate the quality level of the code using several metrics such as lines of code (LOC), number of methods (NOM), number of attributes (NOA), cyclo, and maximum nesting level. We improved the quality of SEED.c through systematic detection and refactoring of code smells. Studies have shown that refactoring processes such as splitting long methods, modularizing large classes, reducing redundant code, and simplifying long parameter lists improve code quality. Through this study, we found that encryption code requires refactoring measures to maintain code security.

Improved Blind Multipath Estimation for Long Code DS-CDMA

  • Yu Qian;Bi Guoan;Zhang Gaonan
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.278-283
    • /
    • 2005
  • This paper proposes a blind channel estimation scheme for long code direct sequence code division multiple access (DS­CDMA) systems with multipath fading channels. This scheme combines the advantages of Toeplitz displacement and correlation matching methods to achieve improved performance. The basic idea is to remove the effects of noise and interferences with Toeplitz displacement operation and then estimate the multi path channel parameters with the correlation matching method. Simulation results are presented to show that the proposed scheme provides better MSE performance and robustness against the near-far problem.

Analysis of Morton Code Conversion for 32 Bit IEEE 754 Floating Point Variables (IEEE 754 부동 소수점 32비트 float 변수의 Morton Code 변환 분석)

  • Park, Taejung
    • Journal of Digital Contents Society
    • /
    • v.17 no.3
    • /
    • pp.165-172
    • /
    • 2016
  • Morton codes play important roles in many parallel GPU applications for the nearest neighbor (NN) search in huge data and queries with its applications growing. This paper discusses and analyzes the meaning of Tero Karras's 32-bit 'unsigned int' Morton code algorithm for three-dimensional spatial information in $[0,1]^3$ and its geometric implications. Based on this, this paper proposes 64-bit 'unsigned long long' version of Morton code and compares the results in both CPU vs. GPU and 32-bit vs. 64-bit versions. The proposed GPU algorithm runs around 1000 times faster than the CPU version.

Area-Efficient Semi-Parallel Encoding Structure for Long Polar Codes (긴 극 부호를 위한 저 면적 부분 병렬 극 부호 부호기 설계)

  • Shin, Yerin;Choi, Soyeon;Yoo, Hoyoung
    • Journal of IKEEE
    • /
    • v.23 no.4
    • /
    • pp.1288-1294
    • /
    • 2019
  • The channel-achieving property made the polar code show to advantage as an error-correcting code. However, sufficient error-correction performance shows the asymptotic property that is achieved when the length of the code is long. Therefore, efficient architecture is needed to realize the implementation of very-large-scale integration for the case of long input data. Although the most basic fully parallel encoder is intuitive and easy to implement, it is not suitable for long polar codes because of the high hardware complexity. Complementing this, a partially parallel encoder was proposed which has an excellent result in terms of hardware area. Nevertheless, this method has not been completely generalized and has the disadvantage that different architectures appear depending on the hardware designer. In this paper, we propose a hardware design scheme that applies the proposed systematic approach which is optimized for bit-dimension permutations. By applying this solution, it is possible to design a generalized partially parallel encoder for long polar codes with the same intuitive architecture as a fully parallel encoder.

Simulation and transient analyses of a complete passive heat removal system in a downward cooling pool-type material testing reactor against a complete station blackout and long-term natural convection mode using the RELAP5/3.2 code

  • Hedayat, Afshin
    • Nuclear Engineering and Technology
    • /
    • v.49 no.5
    • /
    • pp.953-967
    • /
    • 2017
  • In this paper, a complete station blackout (SBO) or complete loss of electrical power supplies is simulated and analyzed in a downward cooling 5-MW pool-type Material Testing Reactor (MTR). The scenario is traced in the absence of active cooling systems and operators. The code nodalization is successfully benchmarked against experimental data of the reactor's operating parameters. The passive heat removal system includes downward water cooling after pump breakdown by the force of gravity (where the coolant streams down to the unfilled portion of the holdup tank), safety flapper opening, flow reversal from a downward to an upward cooling direction, and then the upward free convection heat removal throughout the flapper safety valve, lower plenum, and fuel assemblies. Both short-term and long-term natural core cooling conditions are simulated and investigated using the RELAP5 code. Short-term analyses focus on the safety flapper valve operation and flow reversal mode. Long-term analyses include simulation of both complete SBO and long-term operation of the free convection mode. Results are promising for pool-type MTRs because this allows operators to investigate RELAP code abilities for MTR thermal-hydraulic simulations without any oscillation; moreover, the Tehran Research Reactor is conservatively safe against the complete SBO and long-term free convection operation.

High Speed Impact and Penetration Analysis using Explicit Finite Element Method (외연 유한요소 기법을 사용한 고속충돌 및 관통해석)

  • Paik, Seung-Hoon;Kim, Seung-Jo
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.8 no.4 s.23
    • /
    • pp.5-13
    • /
    • 2005
  • The impact of a long-rod penetrator into oblique plates with combined obliquity and yaw is investigated. The study was done using a newly developed three dimensional dynamic and impact analysis code, which uses the explicit finite element method. Through the comparison of simulation result with experimental result and other code's result, the adaptability and accuracy of the developed code is evaluated under the complex situation in which yaw angle and oblique angle exist simultaneously. As a result of comparison, it has found that deformed shape, residual length and velocity, rotational velocity of long-rod show good agreement with experimental data. Through this study, the applicability and accuracy of the code as a metallic armour system design tool is verified.