• Geomechanics and Engineering
• /
• v.12 no.4
• /
• pp.675-688
• /
• 2017

The anchor block is a specially designed concrete member intended to withstand pullout or thrust forces from backfill material of an internally stabilized anchored earth retaining wall by passive resistance of soil in front of the block. This study presents small-scale laboratory experimental works to investigate the pullout capacity of a concrete anchor block embedded in air dry sand and located at different distances from yielding boundary wall. The experimental setup consists of a large tank made of fiberglass sheets and steel framing system. A series of tests was carried out in the tank to investigate the load-displacement behavior of anchor block. Experimental results are then compared with the theoretical approaches suggested by different researchers and codes. The appropriate placement of an anchor block and the passive resistance coefficient, which is multiplied by the passive resistance in front of the anchor block to obtain the pullout capacity of the anchor, were also studied.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.7
• /
• pp.97-103
• /
• 2004

In this paper, we propose a high speed block turbo code decoding algorithm and an efficient hardware architecture. The multimedia wireless data communication systems need channel codes which have the high-performance error correcting capabilities. Block turbo codes support variable code rates and packet sizes, and show a high performance due to a soft decision iteration decoding of turbo codes. However, block turbo codes have a long decoding time because of the iteration decoding and a complicated extrinsic information operation. The proposed algorithm using the threshold that represents a channel information reduces the long decoding time. After the threshold is decided by a simulation result, the proposed algorithm eliminates the calculation for the bits which have a good channel information and assigns a high reliability value to the bits. The threshold is decided by the absolute mean and the standard deviation of a LLR(Log Likelihood Ratio) in consideration that the LLR distribution is a gaussian one. Also, the proposed algorithm assigns '1', the highest reliable value, to those bits. The hardware design result using verilog HDL reduces a decoding time about 30% in comparison with conventional algorithm, and includes about 20K logic gate and 32Kbit memory sizes.

• 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.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.307-312
• /
• 2005

In this work, we study the performance of a serial concatenated scheme comprising a convolutional code (CC) and an orthogonal space-time block code (STBC) separated by an inter-leaver. Specifically, we derive performance bounds for this concatenated scheme, clearly quantify the impact of using a CC in conjunction with a STBC, and compare that to using a STBC code only. Furthermore, we examine the impact of performing antenna selection at the receiver on the diversity order and coding gain of the system. In performing antenna selection, we adopt a selection criterion that is based on maximizing the instantaneous signal-to­noise ratio (SNR) at the receiver. That is, we select a subset of the available receive antennas that maximizes the received SNR. Two channel models are considered in this study: Fast fading and quasi-static fading. For both cases, our analyses show that substantial coding gains can be achieved, which is confirmed through Monte-Carlo simulations. We demonstrate that the spatial diversity is maintained for all cases, whereas the coding gain deteriorates by no more than $10\;log_{10}$ (M / L) dB, all relative to the full complexity multiple-input multiple-output (MIMO) system.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.73-79
• /
• 2004

In this paper, we propose an efficient soft decision decoding algorithm for linear block codes. A conventional soft decision decoder have to invoke a hard decision decoder several times to estimate its soft decision values. However, in this method, we may not have candidate codewords, thus it is very difficult to produce soft decision values. We solve this problem by introducing an efficient algorithm to search candidate codewords. By using this, we can highly reduce the cases we cannot find candidate codewords. We estimate the performance of the proposed algorithm by using the computer simulations. The simulation is performed for binary (63, 36) BCH code in fading channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.561-569
• /
• 2003

In this paper, for my linear orthogonal space-time block including the orthogonal space-time codes introduced by Alamouti［1］, Tarokh［14］, and Xia［11］, the exact expression for the pairwise error probability in the slow Rayleigh fading channel is derived in terms of the message symbol distance between two message vectors rather than the codeword symbol distance between two transmitted codeword matrices. Using the one-dimensional component symbol error probability, the exact closed form expressions for the symbol error probability of linear orthogonal space-time codes are derived for QPSK, 16-QAM, 64-QAM, and 256-QAM.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.959-962
• /
• 2001

Turbo codes of long block sizes have been known to show very good performance in an AWGN channel and the turbo code has been strongly recommended as error correction code for IMT-2000 in 3GPP(3rd Generation Partnership Project). Recently, turbo codes of short block sizes suitable for real time communication systems have attracted a lot of attention. Thus, in this paper we consider the turbo code of 1/3 code rate and short frame size of 192 bits in ITU-R channel model. We analyzed the performance of W-CDMA systems of 10MHz bandwidths employing RAKE receiver with not only MRC diversity but also turbo code.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.41-46
• /
• 2000

In this paper, we analyze the performance of W-CDMA systems using turbo code in the wideband multipath channel. The strength of each multipath component is assumed to be Rayleigh distributed. Turbo codes of long block sizes have been known to show very good performance in a AWGN channel. Recently, turbo codes of short block sizes suitable for real time communication systems have attracted a lot of attention. Thus, in this paper we consider the turbo code of 1/3 code rate and short frame size of 192 bits in wideband mobile multipath channel. We analyze the performance of W-CDMA systems with 10MHz bandwidths in the case of employing RAKE receiver with not only MRC diversity but also turbo code.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.16-17
• /
• 2008

본 논문은 다중 안테나 시스템에서 두 심볼을 묶어서 전송함으로써 최대 전송률을 유지하는 준직교 시공간 블록 부호(QOSTBC : quasi orthogonal space time block codes)의 성능을 평가하였다. 이제까지 제안된 여러 QOSTBC 부호는 다차원 신호 공간에서의 신호 설계 방식에 차이가 있고 결과적으로 diversity 차수는 동일하지만 부호 이득에 차이를 보인다. 채널 부호기를 결합한 경우와 그렇지 않은 경우에 여러 가지 방식의 QOSTBC의 성능을 모의실험으로 평가하였다.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.340-347
• /
• 2007

This paper proposes a new class of Space-Time Block Codes, which is manipulated from the existing transmit diversity schemes. We analyze the performance and the receiver complexity of the proposed scheme and confirm that the new diversity scheme can yield performance gain over other existing four-transmit antenna cases. By relaxing the diversity criterion on code designs, the proposed space-time code provides a full transmission rate for four-transmit antennas and makes it possible to approach the open-loop Shannon channel capacity. Outage capacity and simulation results are used to show that substantial improvements in performance while maintaining a simple linear processing receiver structure are obtained in frequency selective channels.