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

In this paper, we implement digital circuit of despreading delay lock loop for GPS receiver. The designed system consists of Epoch signal generator, two 13bit correlators which correlates the received C/A code and the locally generated C/A code in the receiver, the C/A code generator which generates C/A code of selected satellite, and the direct digital clock synthesizer which generates the clock of the C/A code generator to control the phase and clock rate, the clock controller, and the clock divider. The designed circuit has the function of the acquisition and tracking by the autocorrelation characteristics of Gold code. The controller generates each other control signals according to the correlation value. The designed circuit is simulated to verify the logic functional performance. By using the simulator STR-2770 that generates the virtual GPS signal, the deigned FPGA chip is verified the circuit performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.649-655
• /
• 2009

Mean acquisition time (MAT) is the most important performance measure for code acquisition systems, where a shorter MAT implies a better code acquisition performance. Keshavarzian and Salehi proposed the multiple-shift (MS) algorithm for code acquisition in optical code division multiple access (O-CDMA) systems. Performing two steps acquisition, the MS algorithm has a shorter MAT than that of the conventional serial-search (SS) algorithm. In this paper, we propose a rapid code acquisition algorithm for O-CDMA systems. By using an efficient combination of local signals, correlation value, and the sign of correlation value, the proposed algorithm can provide a shorter MAT compared with that of the MS algorithm. The simulation results show that the proposed algorithm presents a shorter MAT than that of the MS algorithm.

• Journal of the Korean Institute of Navigation
• /
• v.25 no.2
• /
• pp.195-205
• /
• 2001

It has been over seven years since Maritime Code of the Peoples Republic of China (hereinafter called the Code) came into force on July 1st 1993. During this period it has played a very important roll in governing Chinas ocean shipping. However, owing to the defects of the Code, many problems have arisen in the performance of the Code, among which is the problem related to delay in delivery. Therefore, it is necessary and inevitable to revise the Code. This study is limited to a rough study on the regulations related to delay in delivery in the Code, such as the definition of delay in delivery, the carriers responsibility for delay in delivery, the carriers exemption from responsibility for delay in delivery, the limitation of responsibility, the procedures of claims for delay in delivery and the difference of the Code from the Korea Commercial Law, the Hague Rules, the Hague-Visby Rules and the Hamburg Rules. Furthermore, some defects in the Code are pointed out and suggestions are provided for the revision of the Code.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.1-9
• /
• 1993

In this paper, a new digital mobile channel has been modeled. And concatenated code systems have been proposed to transmit information reliably in the newly modeled mobile fading channels. The BCH code has been used as the outer code and the convolutional code as the inner code. We have modeled the channels which have multipath fading phenomena and additive white Gaussian noise. As a result, the characteristics of the channels are identical to that of the mobile fading channel. To find the best code system, we have tested (7, 4), (63, 45), (63, 57) and (31.26) BCH codes as an outer code. Results show that the concatenated code with (7, 4) outer code gives the best performance. And if we use the soft decision, we can improve about 2 -6 dB in the SNR

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.1046-1051
• /
• 1999

It is well known that Parallel Concatenated Convolutional Codes(turbo codes) has a good performance for long block sizes. This thesis has analyzed the performance of turbo code which is based on voice or control frames with short frame sizes in the future mobile communication system. Also, at the similar decoding complexity, the performance of turbo code and convolutional codes in the speech/control frames, and the applicability of this system are considered. As a result, turbo code in short frame sizes present the performance of a BER of $10^{-3}$ or more over 3 iterations in the future mobile communication system. However, at a BER of $10^{-3}$ , if the same complexity is considered, the performance of rate 1/2 turbo code with K = 5 is better than that of convolutional code with K = 9 at low $E_b/N_0$, and the performance of turbo code with K = 3 is superior to that of convolutional code with K = 7. Rate 1/3 turbo code with K = 3 and 5 have similar to performance of rate 1/2 turbo code.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.16 no.1
• /
• pp.65-69
• /
• 2010

The variations of marine accidents and ship's insurences are measures for assessing the effects of ISM Code implementation, bemuse expenses for the treatment of ship accidents and compensations for the loss have an effect on the ship's insurence. In order to understand the results and accmplishements of ISM Code implementation in Korea, the rise and the fall of marine accidents and ship's insurences were analyzed and examined in domestic shipping companies from one year before implementation to eight years after implementation of ISM Code. As the result of analysis, compared with the period of a year before implementation of ISM Code, the decrease of about 14.4% in marine accidents was shown in the 8th year after ISM Code implementation in Korea, and ship's insurance rates tended to decrease from year to year.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1075-1081
• /
• 2008

In this paper, we propose a code acquisition algorithm using optical orthogonal code (OOC) for optical code division multiple access (CDMA) systems. Generally, a good code acquisition algorithm offers short mean acquisition time (MAT). The conventional multiple-shift (MS) algorithm consists of two stages and has shorter MAT than that of well-known serial-search (SS) algorithm. This paper proposes a novel code acquisition algorithm called enhanced multiple-shift (EMS) algorithm. By using multiple thresholds, the proposed EMS algorithm provides shorter MAT compared with that of the MS algorithm. The simulation results show that the EMS algorithm presents shorter MAT compared with the MS algorithm in both single-user and multi-user environments.

• Journal of the Korean Society of Safety
• /
• v.27 no.6
• /
• pp.192-204
• /
• 2012

For a severe accident of nuclear power plant, an approach to estimation of the radiological source term using a severe accident code(MELCOR) has been proposed. Although the MELCOR code has a capability to estimate the radiological source term, it has been hardly utilized for the radiological consequence analysis mainly due to a lack of understanding on the relevant function employed in MELCOR and severe accident phenomena. In order to estimate the severe accident source term to be linked with the radiological consequence analysis, this study proposes 4-step procedure: (1) selection of plant condition leading to a severe accident(i.e., accident sequence), (2) analysis of the relevant severe accident code, (3) investigation of the code analysis results and post-processing, and (4) generation of radiological source term information for the consequence analysis. The feasibility study of the present approach to an early containment failure sequence caused by a fast station blackout(SBO) of a reference plant (OPR-1000), showed that while the MELCOR code has an integrated capability for severe accident and source term analysis, it has a large degree of uncertainty in quantifying the radiological source term. Key insights obtained from the present study were: (1) key parameters employed in a typical code for the consequence analysis(i.e., MACCS) could be generated by MELCOR code; (2) the MELOCR code simulation for an assessment of the selected accident sequence has a large degree of uncertainty in determining the accident scenario and severe accident phenomena; and (3) the generation of source term information for the consequence analysis relies on an expert opinion in both areas of severe accident analysis and consequence analysis. Nevertheless, the MELCOR code had a great advantage in estimating the radiological source term such as reflection of the current state of art in the area of severe accident and radiological source term.

• Journal of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.29-44
• /
• 2021

The set D of column vectors of a generator matrix of a linear code is called a defining set of the linear code. In this paper we consider the problem of constructing few-weight (mainly two- or three-weight) linear codes from defining sets. It can be easily seen that we obtain an one-weight code when we take a defining set to be the nonzero codewords of a linear code. Therefore we have to choose a defining set from a non-linear code to obtain two- or three-weight codes, and we face the problem that the constructed code contains many weights. To overcome this difficulty, we employ the linear codes of the following form: Let D be a subset of ��2n, and W (resp. V ) be a subspace of ��2 (resp. ��2n). We define the linear code ��D(W; V ) with defining set D and restricted to W, V by $${\mathcal{C}}_D(W;V )=\{(s+u{\cdot}x)_{x{\in}D^{\ast}}|s{\in}W,u{\in}V\}$$. We obtain two- or three-weight codes by taking D to be a Vasil'ev code of length n = 2m - 1(m ≥ 3) and a suitable choices of W. We do the same job for D being the complement of a Vasil'ev code. The constructed few-weight codes share some nice properties. Some of them are optimal in the sense that they attain either the Griesmer bound or the Grey-Rankin bound. Most of them are minimal codes which, in turn, have an application in secret sharing schemes. Finally we obtain an infinite family of minimal codes for which the sufficient condition of Ashikhmin and Barg does not hold.

• Journal of Ginseng Research
• /
• v.41 no.3
• /
• pp.339-346
• /
• 2017

Background: In this study, we investigated how to convert the Panax ginseng DNA sequence code and chemical fingerprints into a two-dimensional code. In order to improve the compression efficiency, GATC2Bytes and digital merger compression algorithms are proposed. Methods: HPLC chemical fingerprint data of 10 groups of P. ginseng from Northeast China and the internal transcribed spacer 2 (ITS2) sequence code as the DNA sequence code were ready for conversion. In order to convert such data into a two-dimensional code, the following six steps were performed: First, the chemical fingerprint characteristic data sets were obtained through the inflection filtering algorithm. Second, precompression processing of such data sets is undertaken. Third, precompression processing was undertaken with the P. ginseng DNA (ITS2) sequence codes. Fourth, the precompressed chemical fingerprint data and the DNA (ITS2) sequence code were combined in accordance with the set data format. Such combined data can be compressed by Zlib, an open source data compression algorithm. Finally, the compressed data generated a two-dimensional code called a quick response code (QR code). Results: Through the abovementioned converting process, it can be found that the number of bytes needed for storing P. ginseng chemical fingerprints and its DNA (ITS2) sequence code can be greatly reduced. After GTCA2Bytes algorithm processing, the ITS2 compression rate reaches 75% and the chemical fingerprint compression rate exceeds 99.65% via filtration and digital merger compression algorithm processing. Therefore, the overall compression ratio even exceeds 99.36%. The capacity of the formed QR code is around 0.5k, which can easily and successfully be read and identified by any smartphone. Conclusion: P. ginseng chemical fingerprints and its DNA (ITS2) sequence code can form a QR code after data processing, and therefore the QR code can be a perfect carrier of the authenticity and quality of P. ginseng information. This study provides a theoretical basis for the development of a quality traceability system of traditional Chinese medicine based on a two-dimensional code.