• International Journal of High-Rise Buildings
• /
• v.1 no.3
• /
• pp.203-209
• /
• 2012

The purpose of this paper is to present the state of practice being used in the Philippines for the performance-based seismic design of reinforced concrete tall buildings. Initially, the overall methodology follows "An Alternative Procedure for Seismic Analysis and Design of Tall Buildings Located in the Los Angeles Region, 2008", which was developed by Los Angeles Tall Buildings Structural Design Council. After 2010, the design procedure follows "Tall Buildings Initiative, Guidelines for Performance-Based Seismic Design of Tall Buildings, 2010" developed by Pacific Earthquake Engineering Research Center (PEER). After the completion of preliminary design in accordance with code-based design procedures, the performance of the building is checked for serviceable behaviour for frequent earthquakes (50% probability of exceedance in 30 years, i.e,, with 43-year return period) and very low probability of collapse under extremely rare earthquakes (2% of probability of exceedance in 50 years, i.e., 2475-year return period). In the analysis, finite element models with various complexity and refinements are used in different types of analyses using, linear-static, multi-mode pushover, and nonlinear-dynamic analyses, as appropriate. Site-specific seismic input ground motions are used to check the level of performance under the potential hazard, which is likely to be experienced. Sample project conducted using performance-based seismic design procedures is also briefly presented.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.24-36
• /
• 2011

In this paper, we verify the channel synthesis and decomposition of polar codes using successive cancellation decoding algorithm over binary discrete memoryless symmetric channel by modifying Arikan's algebraic formular on encoding and decoding of polar codes. In addition, we found that information bits are sent by efficiently consisting of polar codes with their size $2^n$ through polarizing matrix ${G_2}^{{\otimes}n}$ over binary discrete memoryless symmetric channel W. Expecially, if $N{\geq}2$, the complexity of Arikan's encoding and decoding for polar codes is O($Nlog_2N$). Furthermore, we found that polar codes are one of the solution to the challenging problems for the multipoint communication.

• The Journal of the Korea Contents Association
• /
• v.10 no.3
• /
• pp.122-131
• /
• 2010

In this paper, we design and implement CTOC, a new bytecode analysis and translation tool. We also propose E-Tree, a new intermediate code, to efficiently deal with intermediate codes translated from bytecodes. E-Tree is expressed in a tree form by combining relevant bytecode instructions in basic blocks of eCFG to overcome the weaknesses of bytecodes such as complexity and analytical difficulty. To demonstrate the usefulness and possible extensibility of CTOC, we show the creation process of eCFG and E-Tree through practical bytecode analysis and translation and shows the optimization process of a bytecode program as an example of possible extensibility.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.423-428
• /
• 2004

In this paper, STBC (Space Time Block Code) is applied to the WB system and frequency repeated diversity is used to get the 4-th order space time diversity gain. The performance of が STDB-OFDM system is analyzed by computer simulation. As a result of simulation, proposed W system can reduce the complexity that is introduced by increasing number of transmit antenna and show the same performance of 4 antennas with only using 2. Proposed system shows the enhancement of 7.1 dB compared to the general UWB OFDM and 1.9 dB compared to UWB STBC-OFDM.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.10
• /
• pp.831-835
• /
• 2020

By automatically generating HDL codes from C/C++ source codes, HLS makes it possible to shorten FPGA system developing period through easy timing control and structure change. We designed LDPC encoder for telemetry standard 106-17 with Xilinx Vivado HLS and showed hardware structure can be easily adapted for different purposes through minor C code modification. Synthesis results targeting Spartan-7 xc7s100 device are presented for throughput and hardware complexity comparison.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1122-1127
• /
• 2010

In this paper, we propose a relay-based DF cooperative communication scheme using repetitive transmission algorithm for wireless LAN environments on D-STBC. Additional transmission diversity gain can be obtained by repetitive transmission algorithm. However, in comparison with conventional schemes, data rate is decreased in half. We consider data modulation constellation twice higher than conventional schemes. Further, system complexity is decreased and performance degradation is minimized because repetitive transmission algorithm is adapted between source and relay node. We show the uncoded BER performance of the proposed algorithm over HiperLAN/2 Rayleigh fading channel.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.639-644
• /
• 2014

In low-density parity-check (LDPC) coded multiple-input multiple-output (MIMO) communication systems, probabilistic information are exchanged between an LDPC decoder and a MIMO detector. TheMIMO detector has to calculate probabilistic values for each bit which can be very complex. In [1], the authors presented a class of linear block codes named low-density MIMO codes (LDMC) which can reduce the complexity of MIMO detector. However, this code only supports the outer-iterations between the MIMO detector and decoder, but does not support the inner-iterations inside the LDPC decoder. In this paper, a new approach to construct LDMC codes is introduced. The new LDMC codes can be encoded efficiently at the transmitter side and support both of the inner-iterations and outer-iterations at the receiver side. Furthermore they can achieve the design rates and perform very well over MIMO channels.

• 한국연소학회:학술대회논문집
• /
• 2002.11a
• /
• pp.209-214
• /
• 2002

Computations were performed to investigate the flow, temperature and pollutants in two stage heavy-oil combustion burner. The burner geometry and flow conditions were provided by a burner company. The goal of the study is to understand combustion phenomena according to each air inlet's velocity, excessive air ratio and air temperature through CFD. Air flow rates at two inlets are adjusted by a damper inside a burner. Here, injection conditions of liquid fuel are kept constant throughout all simulations. This assumption is made in order to limit the complexity of oil combustion though it may cause some disagreement. The final goal of this research is to design a Low-NOx heavy oil combustion burner through comparison between computational study and experimental ones. Besides experiments, simulation works can give us insights into heavy oil combustion and help us design a Low NOx burner while saving time and cost. The computational study is based on k-e model, P-1 radiation model(WSGGM) and PDF, and is implemented on a commercial code, FLUENT.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.111-119
• /
• 1994

In this paper we propose a reversible image coding methods with progressive build-up function by bit-plane of multi-lavel image. Firstly, the differencial conversion is applied to reduce the entropy of source images. Then the bit-plane sequences of converted images are coded by means of the newly designed VFRL(Variable to Fixed Run-Llength) code and the RDHC(Run-length Dynamic Huffman Coding). We aim to the simple construction to reduce the complexity. The computer simulated results show that the proposed methods are very effective to the multi-level digital images. For "GIRL" and "COUPLE" of 1EEE monochromatic standard images, the compressibility are superior to the results obtained by the well-known universal codes.own universal codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.2063-2076
• /
• 1996

In this thesis, in order to apply a punctured convolutional codes to the trellis coded modulation(TCM), an efficient punctured trellis coded modulation(PTCM) based on the decomposition of the metric into orthogonal components is presented. Also, a simulation is performed in an additive white Gaussian noise(AWGN) and a rician fading channel modeling the mobile satellite channel. The PTCM combines punctured convolutional coding with MPSK modulation to provide a large coding gain in a power-limited or bandwidth-limited channel. However, in general the use of the punctured convolutional code structure in the decoder results in a performance loss in comparison to trellis codes, due to difficulties in assigning metrics. But, the study shows no loss in performance for punctured trellis coded MPSK in comparison to TCM, and what is more, the punctured convolutional codes results in some savings in the complexity of Viterbi decoders, compared to TCM of the same rate. Also, the results shows that the punctured trellis coded .pi./8 shift 8PSK is an attractive scheme for power-limited and band-limited systems and especially, the Viterbi decoder with first and Lth phase difference metrics improves BER performance by the mobile satellite channel.