• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.17-25
• /
• 2013

In this paper, a coding algorithm is proposed for multi-user multi-input multi-output (MU-MIMO) systems to improve the reception performance in fading conditions without reducing the bandwidth efficiency. The space division multiple access (SDMA) scheme that is one of the commonly used for MU-MIMO systems is vulnerable to the fading. The space time block code (STBC) scheme that is used to overcome the fading has a disadvantage of reduced throughput. The proposed MU-MIMO system first encodes transmitted symbols by linear dispersion code (LDC) which is less vulnerable to the fading and increases the throughput in proportional to the number of transmit antennas. Then, the LDC coded symbols are pre-coded by the result of singular value decomposition (SVD) of the estimated channel gain. We evaluate the performance of the proposed scheme compared with the conventional algorithms by computer simulations.

• 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 the Korea Contents Association
• /
• v.5 no.1
• /
• pp.201-208
• /
• 2005

Tn this paper, we evaluate the peak-to-average power ratio (PAPR) performance in a space-time block code (STBC) multi-input multi-output orthogonal frequency division multiplexing (MIMO-OFDM) system using selected mapping (SLM) and partial transmit sequences (PTS) approaches. SLM and PTS methods are used to decrease the nonlinear distortion and to improve the power efficiency of the nonlinear high power amplifier(HPA) in the MIMO-OFDM system. In simulation result, when compared with the existing MIMO-OFDM system using QPSK, the PTS method reduces the PAPR about 5dB while the SLM method can reduce about 3.5 dB. Also, we find the BER performance of the MIMO-OFDM system with and without the predistorter in front of the HPA. When the predistorter is used, the input back-off (IBO) of 4 dB is required in the PTS method, and IBO of 6 dB in the SLM method to closely conform to the linear amplifier. If the method of improving the PAPR is not used, the value of IBO of 8 dB is required.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.641-650
• /
• 2002

Space-Time Block Code(STBC) provides full diversity gains with simple linear processing at the receiver. Interference Cancellation(IC) techniques in system using STBC improve the capacity and performance of wireless systems with co-channel users. Various IC techniques, Minimum Mean-Squared Error(MMSE) and Zero-Forcing(ZF) algorithms in system with STBC were proposed in the literatures in multiuser environment. The performance of these IC techniques were simulated by assuming perfect channel state information(CSI) of multiuser at the receiver. However, in practice it is difficult to know perfect CSI of multiuser at the receiver. Thus, channel estimation scheme is essential at the receiver. Also SNR estimation scheme is required to operate the MMSE IC algorithm. In this paper, we present estimation schemes of CSI and SNR using training sequences. Through extensive computer simulation, we compare and evaluate the performance of IC techniques using the proposed CSI and SNR estimation techniques.

• 한국전산유체공학회:학술대회논문집
• /
• 2004.03a
• /
• pp.42-48
• /
• 2004

Numerical simulation of viscous compressible flow in turbomachinery cascade involves many problems due to the complex geometry of blade but also flow phenomena. In the present study, numerical investigations have been performed to examine the three-dimensional flow characteristics inside the transonic linear turbine cascades using a commercial code, FLUENT. Multi-block H-type grids are applied to the high-turning turbine rotor blades and comparisons with the experimental data and the numerical results have been done. In addition, the effects of turbulence models on the prediction of the endwall flows are analyzed in the sense of the flow compressibility.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.216-219
• /
• 2002

정보통신의 발달과 인터넷의 확산으로 인해 정보보안의 필요성이 중요한 문제로 대두되면서 여러 종류의 암호 알고리즘이 개발되어 활용되고 있다. Substitution Permutation Networks(SPN)등의 블록 암호 알고리즘에서는 확산선형변환 행렬을 사용하여 안전성을 높이고 있다. 확산선형변환 행렬이 Maximum Distance Separable(MDS) 코드를 생성하면 선형 공격과 차분 공격에 강한 특성을 보인다. 본 논문에서는 선형변환 행렬이 MDS 코드를 생성하는 가를 판단하는 새로운 알고리즘을 제안한다. 입력 코드는 GF(2/sub□/)상의 원소들로 구성되며, 원소를 변수로 해석하여, 변수를 소거시키면서 선형변환행렬이 MDS 코드를 생성하는 가를 판단한다. 본 논문에서 제안한 알고리즘은 종래의 모든 정방 부분행렬이 정칙인가를 판단하는 알고리즘과 비교하여 연산 수행 시간을 크게 줄였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.365-374
• /
• 1996

Finite wordlength effects of the FS-1016 CELP(Code Excite Linear Prediction) vocoder algorithm) is analyzed, and a block floating-Point implementation method is employed to improve the fixed-point performance. An efficient run-time integer wordlength estimation algorithm is developed, and the overall system performance. An efficient run-time integer wordlength estimation algorithm is developed, and the overall system performance is verified in real-time using a TMS320C50 emulation board. Autoscaler software that conducts simulation-based automatic scaling to provide a floating-point like programming environment is used for this application development.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4A
• /
• pp.291-300
• /
• 2002

In this paper, a way of constituting optimized S box and G function was suggested in the block cipher whose structure is similar to SEED, which is KOREA standard of 128-bit block cipher. S box can be formed with nonlinear function and an affine transform. Nonlinear function must be strong with differential attack and linear attack, and it consists of an inverse number over GF(2$\^$8/) which has neither a fixed point, whose input and output are the same except 0 and 1, nor an opposite flexed number, whose output is one's complement of the input. Affine transform can be constituted so that the input/output correlation can be the lowest and there can be no fixed point or opposite fixed point. G function undergoes diffusive linear transform with 4 S-box outputs using the matrix of 4$\times$4 over GF(2$\^$8/). G function can be constituted so that MDS(Maximum Distance Separable) code can be formed, SAC(Strict Avalanche Criterion) can be met, there can be no weak input, where a fried point, an opposite fried point, and output can be two's complement of input, and the construction of hardware can be made easy. The S box and G function suggested in this paper can be used as a constituent of the block cipher with high security, in that they are strong with differential attack and linear attack with no weak input and they are excellent at diffusion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11A
• /
• pp.1244-1252
• /
• 2004

In this paper, we derive some properties of linear detectors (zero forcing or minimum mean square error) at spatial multiplexing systems with alamouti's space-time block code. Based on the derived properies, this paper proposes low-complexity receivers. Implementing MMSE detector adaptively, the number of weight vectors to be calculated and updated is greatly reduced with the derived properties compared to the conventional methods. In the case of recursive least square algorithm, with the proposed approach computational complexity is reduced to less than the half. We also identify that sorted QR decomposition detector, which reduces the complexity of V-Blast detector, has the same properties for unitary matrix Q and upper triangular matrix R. A complexity reduction of about 50%, for sorted QR decomposition detector, can be achieved by using those properties without the loss of performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.1
• /
• pp.123-136
• /
• 2004

In this paper, complexity and regularity of polynomial multiplication over $GF({2^n})$ are defined by using Hamming weight of rows and columns of the matrix ever GF(2) which represents polynomial multiplication. It is shown experimentally that in order to construct the block cipher robust against differential cryptanalysis, polynomial multiplication of substitution layer and the permutation layer should have high complexity and high regularity. With result of the experiment, a way of constituting S box and G function is suggested in the block cipher whose structure is similar to SEED, which is KOREA standard of 128-bit block cipher. S box can be formed with a nonlinear function and an affine transform. Nonlinear function must be strong with differential attack and linear attack, and it consists of an inverse number over $GF({2^8})$ which has neither a fixed pout, whose input and output are the same except 0 and 1, nor an opposite fixed number, whose output is one`s complement of the input. Affine transform can be constituted so that the input/output correlation can be the lowest and there can be no fixed point or opposite fixed point. G function undergoes linear transform with 4 S-box outputs using the matrix of 4${\times}$4 over $GF({2^8})$. The components in the matrix of linear transformation have high complexity and high regularity. Furthermore, G function can be constituted so that MDS(Maximum Distance Separable) code can be formed, SAC(Strict Avalanche Criterion) can be met, and there can be no weak input where a fixed point an opposite fixed point, and output can be two`s complement of input. The primitive polynomials of nonlinear function affine transform and linear transformation are different each other. The S box and G function suggested in this paper can be used as a constituent of the block cipher with high security, in that they are strong with differential attack and linear attack with no weak input and they are excellent at diffusion.