• Journal of Positioning, Navigation, and Timing
• /
• v.11 no.4
• /
• pp.251-261
• /
• 2022

The Centimeter Level Augmentation Service (CLAS) is the Precise Point Positioning (PPP) - Real Time Kinematic (RTK) correction service utilizing the Quasi-Zenith Satellite System (QZSS) L6 (1278.65 MHz) signal to broadcast the Global Navigation Satellite System (GNSS) error corrections. Compact State-Space Representation (CSSR) corrections for mitigating GNSS measurement error sources such as satellite orbit, clock, code and phase biases, tropospheric error, ionospheric error are estimated from the ground segment of QZSS CLAS using the code and carrier-phase measurements collected in the Japan's GNSS Earth Observation Network (GEONET). Since the CLAS service begun on November 1, 2018, users with dedicated receivers can perform cm-level precise positioning using CSSR corrections. In this paper, CLAS-based VRS-RTK performance evaluation was performed using Global Positioning System (GPS) observables collected from the refence station, TSK2, located in Japan. As a result of performing GPS-only RTK positioning using the open-source software CLASLIB and RTKLIB, it took about 15 minutes to resolve the carrier-phase ambiguities, and the RTK fix rate was only about 41%. Also, the Root Mean Squares (RMS) values of position errors (fixed only) are about 4cm horizontally and 7 cm vertically.

• The Journal of Korea Robotics Society
• /
• v.16 no.3
• /
• pp.250-259
• /
• 2021

Path planning is one of the important technologies for automated parking. It requires to plan a collision-free path considering the vehicle's kinematic constraints such as minimum turning radius or steering velocity. In a complex parking lot, Rapidly-exploring Random Tree^* (RRT^*) can be used for planning a parking path, and Reeds-Shepp or Hybrid Curvature can be applied as a tree-extension method to consider the vehicle's constraints. In this case, each of these methods may affect the computation time of planning the parking path, path-tracking error, and parking success rate. Therefore, in this study, we conduct comparative analysis of two tree-extension functions: Reeds-Shepp (RS) and Hybrid Curvature (HC), and show that HC is a more appropriate tree-extension function for parking path planning. The differences between the two functions are introduced, and their performances are compared by applying them with RRT^*. They are tested at various parking scenarios in simulation, and their advantages and disadvantages are discussed by computation time, cross-track error while tracking the path, parking success rate, and alignment error at the target parking spot. These results show that HC generates the parking path that an autonomous vehicle can track without collisions and HC allows the vehicle to park with lower alignment error than those of RS.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.18 no.2
• /
• pp.170-177
• /
• 2009

The objective of this study is to evaluate an acoustic emission (AE) source characterization and fracture behavior of the SM45C steel by using back-propagation neural network (BPN). In previous research Ref. [8] about k-nearest neighbor classifier (k-NNC) continuity, we used K-means clustering method as an unsupervised learning method for obtaining multi-variate AE main data sets, such as AE counts, energy, amplitude, risetime, duration and counts to peak. Similarly, we applied k-NNC and BPN as a supervised learning method for obtaining multi-variate AE working data sets. According to the error of convergence for determinant criterion Wilk's ${\lambda}$, heuristic criteria D&B(Rij) and Tou values are discussed. As a result, in k-NNC before fracture signal is detected or when fracture signal is detected, showed that produce some empty classes in BPN. And we confirmed that could save trouble in AE signal processing if suitable error of convergence or acceptable encoding error give to BPN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2451-2458
• /
• 1997

Adaptive channel equalization complished without resorting to a training sequence is known as blind equalization. In this paper, in order to increase the speed of the convergence and to reduce the steady-state mean squared error simulatneously, we propose the multi-stage DD(decision-direct) algorithm derived from the combination of the Sato algorithm and the decision-directed algorithm. In the starting stage, the multi-stage DD algorithm is identical to the Sato algorithm which guarantees the convergence of the equalizer. As the blind equalizer converges, the number of the level of the quantizers is increased gradally, so that the proposed algorithm operates identical to the decision-directed algorithm which leads to the low error power after the convergence. Therefore, the multi-stage DD algorithm obtains fast convergence rate and low steady state mean squared error.

• ETRI Journal
• /
• v.34 no.5
• /
• pp.649-654
• /
• 2012

This paper presents a novel 16-quadrature-amplitude-modulation (QAM) E-band communication system. The system can deliver 10 Gbps through eight channels with a bandwidth of 5 GHz (71-76 GHz/81-86 GHz). Each channel occupies 390 MHz and delivers 1.25 Gbps using a 16-QAM. Thus, this system can achieve a bandwidth efficiency of 3.2 bit/s/Hz. To implement the system, a driver amplifier and an RF up-/down-conversion mixer are implemented using a $0.1{\mu}m$ gallium arsenide pseudomorphic high-electron-mobility transistor (GaAs pHEMT) process. A single-IF architecture is chosen for the RF receiver. In the digital modem, 24 square root raised cosine filters and four (255, 239) Reed-Solomon forward error correction codecs are used in parallel. The modem can compensate for a carrier-frequency offset of up to 50 ppm and a symbol rate offset of up to 1 ppm. Experiment results show that the system can achieve a bit error rate of $10^{-5}$ at a signal-to-noise ratio of about 21.5 dB.

• Journal of Korean Ophthalmic Optics Society
• /
• v.14 no.4
• /
• pp.53-57
• /
• 2009

Purpose: To study the relationship of N.P.C, heterophoria and near convergence and divergence by amount of the refractive error. Methods: All subjects have no ocular disease and their mean age is 22.7. All 39 subjects examined about refractive error, near point of convergence (NPC), heterophoria, near convergence and divergence. Results: Classified by low refractive state, middle refractive state, and high refractive state compared with the expected value of Morgan. NPC had been measured within low and middle refractive state eight all the 8cm. However, high refractive state measured 9.64 cm. Low and middle refractive state for the classification by near phoria. Near esophoria groups was smallest by near divergence and exophoria groups was smallest by near convergence. Conclusions: Near convergence were largest with esophoria while near divergence were largest with exophoria.

• Convergence Security Journal
• /
• v.6 no.3
• /
• pp.107-115
• /
• 2006

It discovered a design error from the module to search required installing security patch of Windows Update and Automatic Updates that Microsoft supports it to install security patch easily and quickly. It explains and tests security patch-disguise attack by this error. Security patch-disguise attack is to maintains a vulnerability and to be not searched the security patch simultaneously. Also it composes an attack scenario. Is like that, it proposes the method which solves an design error of the module to search required installing security patch.

• ETRI Journal
• /
• v.37 no.4
• /
• pp.752-765
• /
• 2015

We propose a novel post-processing algorithm and its very-large-scale integration architecture that simultaneously uses the passive and active stereo vision information to improve the reliability of the three-dimensional disparity in a hybrid stereo vision system. The proposed architecture consists of four steps - left-right consistency checking, semi-2D hole filling, a tiny adaptive variance checking, and a 2D weighted median filter. The experimental results show that the error rate of the proposed algorithm (5.77%) is less than that of a raw disparity (10.12%) for a real-world camera image having a $1,280{\times}720$ resolution and maximum disparity of 256. Moreover, for the famous Middlebury stereo image sets, the proposed algorithm's error rate (8.30%) is also less than that of the raw disparity (13.7%). The proposed architecture is implemented on a single commercial field-programmable gate array using only 13.01% of slice resources, which achieves a rate of 60 fps for $1,280{\times}720$ stereo images with a disparity range of 256.

• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.175-180
• /
• 2016

The demand for accurate freeform apsheric surface is increasing to satisfy the optical performance. In this paper, we develop the algorithm for opto-mechatronics convergence, that reconstruct the surface 3D profiles from the curvarure data along two orthogonal directions. A synthetic freeform surface with 8.4 m diameter was simulated for the testing. The simulation results show that the reconstruction error is 0.065 nm PV(Peak-to-valley) and 0.013 nm RMS(Root mean square) residual difference. Finally the sensitivity to noise is diagnosed for probe position error, the simulation results proving that the suggested method is robust to position error.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.6
• /
• pp.28-34
• /
• 1993

An algorithm for MMADF(modified multiplication-free adaptive filter) which need not to multiplication arithmatic operation is proposed to improve the performance of FSE (fractionally spaced equalizer) which reduce the ISI(intersymbol interference) in signal transfer channel. The input signals are quantized using DPCM and the reference signals is processed using a first-order linear prediction filter. The convergence properties of Sign. MADF and M-MADF algorithm for updating of the coefficients of a FIR digital filter of the fractionally spaced equalizer (FSE) are investigated and compared with one another. The convergence properties are characterized by the steady state error and the convergence speed. It is shown that the convergence speed of M-MADF is almost same as Sign algorithm and is faster than MADF in the condition of same steady state error. Especially it is very useful for high correlated signals.