• Journal of the Society of Disaster Information
• /
• v.12 no.2
• /
• pp.144-149
• /
• 2016

Nowaday, most of the low-rise concrete structures which have less than five stories were built before the intensified seismic code was established 2005. According to the fact that our country is not a safety zone ay more, studies are need to reinforce the seismic performance of that structures. The basic frame of low-rise structure are consist of beams and columns with partition walls, therefore that are very weak about secondary wave of earthquake because of the high stiffness. The partition wall are consist of open channel for sunlight or ventilation and intermediate wall. The intermediate walls will enhance the stiffness of columns, but will cause shear failure with short column effects because of the reduced effective depth. But we don't have studies and adequate design code for partition wall effects, therefore some more studies are need for these facts.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.231-238
• /
• 2002

In this paper, we study cyclic codes detecting a subclass of close-closed loop bursts viz. low-density close-closed loop bursts. A subclass of CT close-closed loop berets called CT low-density close-closed loop bursts is also studied.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.80-83
• /
• 2010

This paper describes an analysis of decoding performance of multi-mode LDPC(Low Density Parity Check) decoder which supports three block lengths (648, 1296, 1944) and four code rates (1/2, 2/3,3/4, 5/6) for IEEE 802.11n WLAN system. A fixed-point model of LDPC decoder which adopts min-sum algorithm and layered decoding scheme is implemented using Matlab. From fixed-point simulation results for various bit-width parameters such as internal bit-width, bit-width of integer and fractional parts, an optimal design condition and decoding performance of LDPC decoder are analyzed.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.12
• /
• pp.36-41
• /
• 2016

LDPC code has beend applied in recent communication standards, such as Wi-Fi, WiGig, 10GBased-T Ethernet as a forward error correction code. However, LDPC code is required a large amount of computational complexity due to large iterations and block lengths for high performances. To solve this problem, various research has been continously performed for reducing computational complexity. In this paper, we propose AFC algorithm to deactive the variable and check node for reduce the computational complexity.

• New & Renewable Energy
• /
• v.9 no.2
• /
• pp.51-57
• /
• 2013

The Grid code is being strengthen as increase of renewable energy ratio. Especially, the grid connection regulations are continuously being updated for stable operation of power grids. Static grid support and Dynamic grid support must make an accurate measure at Grid connected point because they needs control algorithm individually. It has to exactly measure voltage including switching ripple at the output of the inverter generating system. In addition, it is necessary to have an accurate voltage measurement when the situation rapidly changing the grid impedance is caused by the input of serial impedance of transformer and line impedance as well as Grid Fault Device. In this paper, We propose a new detection method of grid voltage to calculate accurately the r.m.s voltage of the grid connection point along the standard required by the low voltage regulation. We verified performance through simulation grid fault device.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.432-438
• /
• 2011

This paper describes an analysis of optimal design conditions of multi-mode LDPC(low density parity check) decoder which supports three block lengths (648, 1296, 1944) and four code rates (1/2, 2/3, 3/4, 5/6) for IEEE 802.11n WLAN system. A fixed-point model of LDPC decoder, which adopts min-sum algorithm and layered decoding scheme, is implemented using Matlab. From fixed-point simulation results for various bit-width parameters such as internal bit-width, integer/fractional part bit-widths, optimal design conditions and decoding performance of LDPC decoder are analyzed.

• Nuclear Engineering and Technology
• /
• v.53 no.9
• /
• pp.2830-2838
• /
• 2021

This work deals with the assessment of the burnup capabilities of the Serpent Monte Carlo code to predict spent nuclear fuel (SNF) isotopic concentrations for low-enriched uranium (LEU) fuel at different burnup levels up to 47 MWd/kgU. The irradiation of six UO₂ experimental samples in three different VVER-1000 reactor units has been simulated and the predicted concentrations of actinides up to ²⁴⁴Cm have been compared with the corresponding measured values. The results show a global good agreement between calculated and experimental concentrations, in several cases within the margins of the nuclear data uncertainties and in a few cases even within the reported experimental uncertainties. The differences in the performances of the JEFF3.1.1, ENDF/B-VII.1 and ENDF/B-VIII.0 nuclear data libraries (NDLs) have also been assessed and the use of the newly released ENDF/B-VIII.0 library has shown an increased accuracy in the prediction of the C/E's for some of the actinides considered, particularly for the plutonium isotopes. This work represents a step forward towards the validation of advanced simulation tools against post irradiation experimental data and the obtained results provide an evidence of the capabilities of the Serpent Monte-Carlo code with the associated modern NDLs to accurately compute SNF nuclide inventory concentrations for VVER-1000 type reactors.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.2
• /
• pp.42.1-42.1
• /
• 2021

Galaxy/Halo finding based on the friends-of-friend (FoF) algorithm has been widely adopted for its simplicity and expandability to the phase-space. However, cosmological simulations have been progressively bigger in size and more accurate in resolutions, resulting in that galaxy/halo finding gets computationally expensive more and more. In fact, we confirm this issue through our exercise of applying the 6-dimensional (6D) FoF galaxy finder code, VELOCIraptor (Elahi et al.2019) on the NewHorizon simulation (Dubois et al. 2021), in which typical galaxies with about 1e11 M_sun (10⁷ particles) are identified with very low speed (longer than a day). We have applied several improvements to the original VELOCIraptor code that solve the low-performance problem of galaxy finding on a simulation with high resolutions. Our modifications find the exact same FoF group and can be readily applied to any tree-based FoF code, achieving a 2700 (12) times speedup in the 3D (6D) FoF search compared to the original execution. We applied the updated version of VELOCIraptor on the entire NewHorizon simulation (834 snapshots) and identified its galaxies and halos. We present several quick comparisons of galaxy properties with those with GALAXYMaker data.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.9
• /
• pp.85-95
• /
• 2004

As the design complexity increases, it is a major problem that the size of test pattern is large and power consumption is high in scan, especially system-on-a-chip(SoC), with the automatic test equipment(ATE). Because static compaction of test patterns heads to higher power for testing, it is very hard to reduce the test pattern volume for low power testing. This paper proposes an efficient compression/decompression algorithm based on run-length coding for reducing the amount of test data for low power testing that must be stored on a tester and be transferred to SoC. The experimental results show that the new algorithm is very efficient by reducing the memory space for test patterns and the hardware overhead for the decoder.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.1-7
• /
• 2006

This paper consider a code-division multiple-access(CDMA) wireless ad-hoc network in low-SINR regime. In previous research [6], there has been proposed a algorithm for achieving global optimum at high SINR regime, but has not been fully investigated at low-SINR regime. In this paper, we focus on a case where SINR is much smaller than 1, and propose a algorithm that is suitable for low-SINR regime.