• Journal of information and communication convergence engineering
• /
• v.20 no.1
• /
• pp.1-7
• /
• 2022

Herein, a new space-time block coding technique is proposed for a MIMO 2 × 2 multiple-input multiple output (MIMO) system to minimize the bit error rate (BER) in Rayleigh fading channels with reduced decoding complexity using ZF and MMSE linear detection techniques. The main objective is to improve the service quality of wireless communication systems and optimize the number of antennas used in base stations and terminals. The idea is to exploit the correlation product technique between both information symbols to transmit per space-time block code and their own orthogonal Walsh-Hadamard sequences to ensure orthogonality between both symbol vectors and create a full-rate orthogonal STBC code. Using 16 quadrature amplitude modulation and the quasi-static Rayleigh channel model in the MATLAB environment, the simulation results show that the proposed space-time block code performs better than the Alamouti code in terms of BER performance in the 2 × 2 MIMO system for both cases of linear decoding ZF and MMSE.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.73-80
• /
• 2016

We had introduced the backgrounds, history and physical meanings of Jong Nang in "Jeju Jong Nang Channel Code I, II and III". In "Jeju Jong Nang Channel Code II" paper, we have introduced practical the root of digital human binary coded Jong Nang communications as the wooden gate in Korea Jeju Island custom and investigated Jong Nang gatemodels as an approximation of the AWGN model. The objective was to find a deterministic model, which was accessible to analysis the capacity. Jong Nang communications mean the normal 3 rafters placed on two vertical stones with three holes to convey the family's whereabouts that is deterministic signal. In this paper we find the capacity of deterministic signal processing about the linear deterministic signals approximately.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.2
• /
• pp.295-309
• /
• 2020

Loop transversal codes take an alternative approach to the theory of error-correcting codes, placing emphasis on the set of errors that are to be corrected. Hitherto, the loop transversal code method has been restricted to linear codes. The goal of the current paper is to extend the conceptual framework of loop transversal codes to admit nonlinear codes. We present a natural example of this nonlinearity among perfect single-error correcting codes that exhibit efficient domination in a circulant graph, and contrast it with linear codes in a similar context.

• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1135-1142
• /
• 2017

The applicability of the algebraic collapsing acceleration (ACA) technique to the method of characteristics (MOC) in cases with scattering anisotropy and/or linear sources was investigated. Previously, the ACA was proven successful in cases with isotropic scattering and uniform (step) sources. A presentation is first made of the MOC implementation, available in the DRAGON5 code. Two categories of schemes are available for integrating the propagation equations: (1) the first category is based on exact integration and leads to the classical step characteristics (SC) and linear discontinuous characteristics (LDC) schemes and (2) the second category leads to diamond differencing schemes of various orders in space. The acceleration of these MOC schemes using a combination of the generalized minimal residual [GMRES(m)] method preconditioned with the ACA technique was focused on. Numerical results are provided for a two-dimensional (2D) eight-symmetry pressurized water reactor (PWR) assembly mockup in the context of the DRAGON5 code.

• Korean Management Science Review
• /
• v.11 no.3
• /
• pp.35-46
• /
• 1994

The primal-dual log barrier code OB1(Optimization with Barriers 1) has been identified the most efficient one in reducing computer time and solving large linear programs. This is a brief survey of OB1's life-time and performance.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.3E
• /
• pp.77-86
• /
• 2005

This paper shows one and two dimensional active linear modeling of cochlear biomechanics using Hspice. The advantage of the Hspice modeling is that the cochlear biomechanics may be implemented into an analog Ie chip. This paper explains in detail how to transform the physical cochlear biomechanics to the electrical circuit model and how to represent the circuit in Hspice code. There are some circuit design rules to make the Hspice code to be executed properly.

• ETRI Journal
• /
• v.32 no.1
• /
• pp.93-101
• /
• 2010

A true random number generator (TRNG) is widely used to generate secure random numbers for encryption, digital signatures, authentication, and so on in crypto-systems. Since TRNG is vulnerable to environmental changes, a deterministic function is normally used to reduce bias and improve the statistical properties of the TRNG output. In this paper, we propose a linear corrector for secure TRNG. The performance of a linear corrector is bounded by the minimum distance of the corresponding linear error correcting code. However, we show that it is possible to construct a linear corrector overcoming the minimum distance limitation. The proposed linear corrector shows better performance in terms of removing bias in that it can enlarge the acceptable bias range of the raw TRNG output. Moreover, it is possible to efficiently implement this linear corrector using only XOR gates, which must have a suitable hardware size for embedded security systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1462-1470
• /
• 2003

According to the necessity about information security as well as the advance of IT system and the spread of the Internet, a variety of cryptography algorithms are being developed and put to practical use. In addition the technique about cryptography attack also is advanced, and the algorithms which are strong against its attack are being studied. If the linear transformation matrix in the block cipher algorithm such as Substitution Permutation Networks(SPN) produces the Maximum Distance Separable(MDS) code, it has strong characteristics against the differential attack and linear attack. In this paper, we propose a new algorithm which cm estimate that the linear transformation matrix produces the MDS code. The elements of input code of linear transformation matrix over GF$({2_n})$ can be interpreted as variables. One of variables is transformed as an algebraic formula with the other variables, with applying the formula to the matrix the variables are eliminated one by one. If the number of variables is 1 and the all of coefficient of variable is non zero, then the linear transformation matrix produces the MDS code. The proposed algorithm reduces the calculation time greatly by diminishing the number of multiply and reciprocal operation compared with the conventional algorithm which is designed to know whether the every square submatrix is nonsingular.

• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.3
• /
• pp.19-26
• /
• 2017

In this paper, a Linear Error Correction Code, Which is Applicable to Next Generation Wireless Communication System Technology, is Constructed Based on Performance Comparison and Transmission Based on the Premise of High Performance Mobile Rate Enhancement System. This is Because Data Rates are Becoming an Important Issue in Reed-Solomon Codes and Linear Error Code (LDPC) Used in the Physical Layer of Digital Communication and Broadcasting Technologies. Therefore, this paper Simulates the Performance of Reed - Solomon Code and LDPC Applied to Mobile Broadcasting DVB (Digital Video Broadcasting) System and Mobile Broadcasting in Digital Communication and Broadcasting, At this time, Technical Aspects of the Transmission Efficiency and Performance of the LDPC Replacing the Existing Reed-Solomon Code have been Verified from the Viewpoint of Efficiency.

• Journal of the Korean Mathematical Society
• /
• v.43 no.6
• /
• pp.1357-1369
• /
• 2006

It is known that if C is an [24m + 2l, 12m + l, d] selfdual binary linear code with $0{\leq}l<11,\;then\;d{\leq}4m+4$. We present a sufficient condition for the nonexistence of extremal selfdual binary linear codes with d=4m+4,l=1,2,3,5. From the sufficient condition, we calculate m's which correspond to the nonexistence of some extremal self-dual binary linear codes. In particular, we prove that there are infinitely many such m's. We also give similar results for additive self-dual codes over GF(4) of length n=6m+1.