• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.277-285
• /
• 2008

We previously proposed an Orthogonal Code Hopping Multiplexing (OCHM) scheme for statistical multiplexing on a synchronous downlink. OCHM enables a large number of users to share a limited number of code channels through statistical multiplexing. We here improve the performance of OCHM by prioritizing encoded symbols according to their importance using both the conventional code division and the previously proposed code hopping multiplexing schemes. Prioritization is useful for channel coding schemes with different levels of importance for encoded symbols such as turbo-codes. Scheme performance is evaluated by simulation in terms of the required Eb/N0 for a 1% block error rate.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.5
• /
• pp.724-733
• /
• 2003

Fatigue design rules for welds in the ASME Boiler and Pressure Vessels Code are based on the use of Fatigue Strength Reduction Factors(FSRF) against a code specified fatigue design curve generated from smooth base metal specimens without the presence of welds. Similarly, stress intensification factors that are used in the ASME B3l.1 Piping Code are based on component S-N curves with a reference fatigue strength based on straight pipe girth welds. But the determination of either the FSRF or stress intensification factor requires extensive fatigue testing to take into account the stress concentration effects associated with various types of component geometry, weld configuration and loading conditions. As the fatigue behavior of welded joints is being better understood, it has been generally accepted that the difference in fatigue lives from one type of weld to another is dominated by the difference in stress concentration. However, general finite element procedures are currently not available for effective determination of such stress concentration effects. In this paper, a mesh-insensitive structural stress method is used to re-evaluate the S-N test data, and then more effective method is proposed for pressure vessel and piping fatigue design.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.8
• /
• pp.3053-3059
• /
• 2010

In DS-CDMA method, Mobile Stations own jointly one radio channel and are made to use a PN code (Pseudo-Noise Code) for the purpose of minimize interference. However, corelation value of PN code is one when time delay is zero but the corelation value is 1 / N when time delay is not 0. Therefore corelation characteristic does not fully attained. As a result, when the user increase, the performance degradation and system capacity problem will be able to occur by interference among users. In this paper, the PN code has ideally self corelation. It was proved that PN code could depress interference from other users in multiple access system.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1952-1955
• /
• 2002

Multiple access interference (MAI) and multi path interference(MPI) degrades the system performance in the DS-CDMA(direct-sequence code-division multiple- access)systems .0 this paper, a generalized construction method fer 2$\^$n/(n=1,2,3) phase preferred pairs(PP) with zero-correlation duration (ZCD) of (0.5N+1) chips is proposed. 2$\^$n/(n=1,2,3) phase ZCD code sets with ZCD and enlarged family sizes are generated by carrying out a chip-shift operation of the preferred pairs . The properties of the proposed codes are effective for the cancellation of MAI and MPI in DS-CDMA Systems.

• Korean Journal of Mathematics
• /
• v.24 no.3
• /
• pp.567-572
• /
• 2016

Quadratic residue codes are cyclic codes of prime length n defined over a finite field ${\mathbb{F}}_{p^e}$, where $p^e$ is a quadratic residue mod n. They comprise a very important family of codes. In this article we introduce the generalization of quadratic residue codes defined over Galois rings using the Galois theory.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.391-397
• /
• 2019

In this paper, we give a simple proof of the improved Johnson bound for A(n, d), the maximum number of codewords in a binary code of length n and minimum distance d, given by Mounits, Etzion and Litsyn.

• Journal of Radiation Protection and Research
• /
• v.19 no.1
• /
• pp.13-22
• /
• 1994

The MCNP 4.2 code was used to calculate the thermal neutron flux distributions for $(n,\;{\gamma})$reaction in mainshell, annular plate, and subshell of the calandria of a CANDU 6 plant during operation. The thermal neutron flux distributions in calandria mainshell, annular plate, and subshell were in the range of $10^{11}{\sim}10^{13}\;neutrons/cm^2-sec$ which is somewhat higher than the previous estimates calculated by DOT 4.2 code. As an application to shielding analysis, photon dose rates outside the side and bottom shields were calculated. The resulting dose rates at the reactor accessible areas were below design target, $6 {\mu}Sv/h$. The methodology used in this study to evaluate the thermal neutron flux distribution for $(n,\;{\gamma})reaction$ can be applied to radiation shielding analysis of CANDU 6 type plants.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.902-907
• /
• 2001

In this paper, we analyzed BER performance of the MC DS-CDMA system and evaluated the degree of performance improvement of the system caused by adopting turbo code recently receiving much attention due to its powerful coding capability. As a result of analysis, it was found that the MC DS-CDMA system without any powerful coding scheme can not serve voice quality $(BER : 10^{-3}$ regardless of the number of users and the value of $(BER : 10^{-3)$ in Rayleigh fading channel. On the other hand, it was found that the MC DS-CDMA system adopting turbo code for performance improvement, shows improved BER performance and can serve voice quality without regard to the number of users and the value of $(BER : 10^{-3)$ in the same channel. For example, when $(BER : 10^{-3)$ is l0dB and the number of users was 10, the MC DS-CDMA system adopting turbo code showed improved BER performance about $5\times10^{-3}$.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.404-417
• /
• 2023

This paper proposed a novel method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes of medium to high code rates that can be applied in cloud data storage systems, requiring better error correction capabilities. The novelty of this method lies in the construction of sparse base matrices, using a girth greater than 4 that can then be expanded with a lift factor to produce high code rate QC-LDPC codes. Investigations revealed that the proposed large-sized QC-LDPC codes with high code rates displayed low encoding complexities and provided a low bit error rate (BER) of 10^-10 at 3.5 dB E_b/N₀ than conventional LDPC codes, which showed a BER of 10^-7 at 3 dB E_b/N₀. Subsequently, implementation of the proposed QC-LDPC code in a softwaredefined radio, using the NI USRP 2920 hardware platform, was conducted. As a result, a BER of 10^-6 at 4.2 dB E_b/N₀ was achieved. Then, the performance of the proposed codes based on their encoding-decoding speeds and storage overhead was investigated when applied to a cloud data storage (GCP). Our results revealed that the proposed codes required much less time for encoding and decoding (of data files having a 10 MB size) and produced less storage overhead than the conventional LDPC and Reed-Solomon codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.723-729
• /
• 2014

In this paper, we derive the average repair bandwidth and/or read cost for arbitrary repairable linear code ensembles. The repair bandwidth and read cost are the required amount of data and access number of nodes to restore a failed node, respectively. Here, the repairable linear code ensemble is given by such parameters as the number k of data symbols, the number m of parity symbols, and their degree distributions. We further assume that the code is systematic, and no other constraint is assumed, except possibly that the exact repair could be done by the parity check-sum relation with fully connected n=k+m storages. This enables one to apply the result of this paper directly to any randomly constructed codes with the above parameters, such as linear fountain codes. The final expression of the average repair read cost shows that it is highly dependent on the degree distribution of parity symbols, and also the values n and k.