• Computers and Concrete
• /
• v.24 no.1
• /
• pp.85-94
• /
• 2019

The ACI building code is allowing for higher strength reinforcement and concrete compressive strengths. The nominal strength of high-strength concrete columns is over predicted by the current ACI 318 rectangular stress block and is increasingly unconservative as higher strength materials are used. Calibration of a rectangular stress block to address this condition leads to increased computational complexity. A triangular stress block, derived from the general shape of the stress-strain curve for high-strength concrete, provides a superior solution. The nominal flexural and axial strengths of 150 high-strength concrete columns tests are calculated using the proposed stress distribution and compared with the predicted strength using various design codes and proposals of other researchers. The proposed triangular stress model provides similar level of accuracy and conservativeness and is easily incorporated into current codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7C
• /
• pp.617-623
• /
• 2005

In this paper, new space-time block codes achieving full rate and full diversity for QAM and quasi-static Rayleigh fading channels when using 3 transmit antennas are proposed. These codes are constructed by serially concatenating the constellation rotating precoders with the Alamouti scheme like the conventional A-ST-CR code Computer simulations show that all of the proposed codes achieve the coding gains greater than the existing ST-CR code, in which the best has approximately 1.5dB and 3dB larger coding gains than the ST-CR code for QPSK and 16-QAM, respectively, at average SER= 10$^{-5}$.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.92-96
• /
• 2008

Practical communication systems need to operate at various different rates. This paper describes and analyzes low-density parity check codes for various different rates. From a specific mother code, it allows LDPC codes for different rate. The advantage of this technique is that each different rate LDPC codes have a same block length as mother code though the rate changes so it can make up for the weak points of puncturing and shortening which reduce their block length as the rate changes. Row-splitting method is to split the row, so that the rate changes from a higher rate to lower rate and cause of its own property, it can overcome the defect of row-combining method.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.27-32
• /
• 2003

An efficient soft-decision decoding algorithm for binary block codes it proposed. The proposed soft-decision decoding algorithm is implemented by a series of hard-decision decoding process. By the hard-decision decoding result, the candidate codewords are efficiently searched for A new decoding method, which prevents the missing of the candidate codeword, is proposed. Also, the method fir reducing complexity is developed. This method removes the practical complexity increase caused by the improved algorithm. There facts are confirmed by the simulation results for binary (63, 36) BCH code.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11C
• /
• pp.1025-1028
• /
• 2009

This paper presents upper bounds of Maximum Likelihood (ML) decoding performance of a few irregular LDPC codes using the simple bound and ML input output weight distributions and it is shown that contrary to general opinion that as block length becomes longer, BP decoding performance becomes simply closer to ML decoding performance, before peak degradation, as block length becomes longer, BP decoding performance falls behind ML decoding performance more and after peak degradation, general opinion holds.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.393-399
• /
• 2011

We evaluate the link-level performance of cooperative multi-hop relaying networks with an maximum distance separable (MDS) code. The effect of the code on the link-level performance at the destination is investigated in terms of the outage probability and the spectral efficiency. Assuming a simple topology, we construct an absorbing Markov chain. Numerical results indicate that significant improvement can be achieved by incorporating an MDS code. MDS codes successfully facilitate recovery of the message block at a relaying node due to powerful error-correcting capability, so that it can reduce the outage probability. Furthermore, we evaluate the average number of hops where the message block can be delivered.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.924-944
• /
• 2014

This paper investigates the power allocation and outage performance of MIMO full-duplex relaying (MFDR), based on orthogonal space-time block codes (OSTBC), in cognitive radio systems. OSTBC transmission is used as a simple means to achieve multi-antenna diversity gain. Cognitive MFDR systems not only have the advantage of increasing spectral efficiency through spectrum sharing, but they can also extend coverage through the use of relays. In cognitive MFDR systems, the primary user experiences interference from the secondary source and relay simultaneously, owing to full duplexing. It is therefore necessary to optimize the transmission powers at the secondary source and relay. In this paper, we propose an optimal power allocation (OPA) scheme based on minimizing the outage probability in cognitive MFDR systems. We also analyse the outage probability of the secondary user in noise-limited and interference-limited environments in Nakagami-m fading channels. Simulation results show that the proposed schemes achieve performance improvements in terms of reducing outage probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.637-642
• /
• 2014

In this paper, we propose a efficient shift index searching algorithm for design of the block LDPC codes. It is combined with the message-passing based cycle search algorithm and ACE algorithm. We can determine the shift indices by ordering of priority factors which are effect on the LDPC code performance. Using this algorithm, we can construct the LDPC codes with low complexity compare to trellis-based search algorithm and save the memory for storing the parity check matrix.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.83-86
• /
• 2007

In the blind Maximum-likelihood (ML) detection for Orthogonal Space-Time Block Codes (OSTBC), the problem of ambiguity in determining the symbols has been a great concern. A solution to this problem is to apply semi-blind ML detection, i.e., the blind ML decoding with pilot symbols or training sequence. In order to increase the performance, the number of pilot symbols or length of training sequence should be increased. Unfortunately, this leads to a significant decrease in system spectral efficiency. This work presents an approach to resolve the aforementioned issue by introducing a new method for constructing transmitted information symbol. Thus, by transmitting information symbols drawn from different modulation constellation, the ambiguity can be easily eliminated in blind detection. Also, computer simulations are implemented to verify the performance of the proposed approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.324-330
• /
• 2004

In this paper, we propose the TCM(Trellis coded modulation) decoding scheme that reduces the number of operations in branch metric with STBC(space time block codes) channel information and present the implementation results. The proposed TCM decoding scheme needs only 1 signal point in each TCM subset. Using bias point scheme, It detects the minimum distance symbol. The proposed TCM decoding scheme can reduce the branch metric calculations. In case of 16QAM 8 subset, the reduction ratio is about 50％ and for 64QAM 8 subset, about 80％ reduction can be obtained. The results of logic synthesis for the TCM and STBC decoder with the proposed scheme are 57.6K gate count.