• Journal of IKEEE
• /
• v.22 no.4
• /
• pp.896-900
• /
• 2018

Traditionally, Linear Shift Feedback Register (LFSR) has been widely employed to implement Cyclic Redundant Check (CRC) codes for a serial input. Since many applications including network and storage systems demand as high throughput as ever, various efforts have been made to implement CRC hardware to support parallel inputs. Among various parallel schemes, the look-ahead scheme is one of the most widely used schemes due to its short critical path. However, it is very cumbersome to design HDL codes for parallel CRC codes since the look-ahead scheme is inevitable to consider how register and input values move in the next cycles. Thus, this paper proposes a novel CRC hardware generator, which automatically produces HDL codes given a CRC polynomial and parallel factor. The experimental results verify the applicability to use the proposed generator by analyzing the synthesis results from the generated HDL code.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.68-73
• /
• 2007

Recently, WSN(wireless sensor networks) consists of several sensor nodes in sensor field. And each sensors have the enforced energy constraint. Therefore, it is important to manage energy efficiently. In WSN application system, FEC(Forward error correction) increases the energy efficiency and data reliability of the data transmission. LDPC(Low density parity check) code is one of the FEC code. It needs more encoding operation than other FEC code by growing codeword length. But this code can approach the Shannon capacity limit and it is also can be used to increase the data reliability and decrease the transmission energy. In this paper, the author adopt Linear-Congruence method at generating parity check matrix of LDPC(Low density parity check) codes to reduce the complexity of encoding process and to enhance the energy efficiency in the WSN. As a result, the proposed algorithm can increase the encoding energy efficiency and the data reliability.

• Computers and Concrete
• /
• v.12 no.4
• /
• pp.413-429
• /
• 2013

The primary aim of this study is to develop a three dimensional finite element (FE) model to predict the axial stress-strain relationship and ultimate strength of the FRP-wrapped UHPC columns by comparing experimental results. The reliability of four selected confinement models and three design codes such as ACI-440, CSA-S806-02, and ISIS CANADA is also evaluated in terms of agreement with the experimental results. Totally 6 unconfined and 36 different types of the FRP-wrapped UHPC columns are tested under monotonic axial compression. The values of ultimate strengths of FRP-wrapped UHPC columns obtained from the experimental results are compared and verified with finite element (FE) analysis results and the design codes mentioned above. The concrete damage plasticity model (CDPM) in Abaqus is utilized to represent the confined behavior of the UHPC. The results indicate that agreement between the test results and the non-linear FE analysis results is highly satisfactory. The CSA-S806-02 design code is considered more reliable than the ACI-440 and the ISIS CANADA design codes to calculate the ultimate strength of the FRP-wrapped UHPC columns. None of the selected confinement models that are developed for FRP-wrapped low and normal strength concrete columns can safely predict the ultimate strength of FRP-wrapped UHPC columns.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.258-268
• /
• 2004

We demonstrate rotationally invariant space-time (ST) trellis codes with a 4-D rectangular signal constellation for data transmission over fading channels using two transmit antennas. The rotational invariance is a good property to have that may alleviate the task of the carrier phase tracking circuit in the receiver. The transmitted data stream is segmented into eight bit blocks and quadrature amplitude modulated using a 256 point 4-D signal constellation whose 2-D constituent constellation is a 16 point square constellation doubly partitioned. The 4-D signal constellation is simply the Cartesian product of the 2-D signal constellation with it-self and has 32 subsets. The partition is performed on one side into four subsets A, B, C, and D with increased minimum-squared Euclidian distance, and on the other side into four rings, where each ring includes four points of equal energy. We propose both linear and nonlinear ST trellis codes and perform simulations using an appropriate multiple-input multiple-output (MIMO) channel model. The 4-D ST codes constructed here demonstrate about the same frame error rate (FER) performance as their 2-D counterparts, having however the added value of rotational invariance.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1991.06a
• /
• pp.151-156
• /
• 1991

In this paper, we propose a new algorithm for designing the R-G filter that has optimum performance in terms of mean square sidelobe level(MSSL) for the Barker code. The advantage of the conventional R-G filter lies in its simple structure so that it can be easily implemented. However, the conventional R-G filter dose not have optimum performances in terms of peak sidelobe level(PSL), mean sidelobe level(MSL), and MSSL. Recently, a(R-G)LP filter of which filter coefficients are obtained by the linear programming algorithm was proposed and known to have optimum performance in PSL. The proposed (R-G)LS filter keeps the simple structure of the conventional R-G filter and has the filter coefficients that minimizes the sidelobe in the least square sense. The analytic results show that the proposed (R-G)LS filter has better performances than the conventional R-G filter in terms of PSL, MSL, and MSSL. Compared with (R-G)LP filter, the proposed (R-G)LS filter has better performances in terms of MSL and MSSL. The proposed filter design algorithm can be applied to the other binary codes such as truncated pseudonoise(PN) codes and concatenated codes.

• Structural Engineering and Mechanics
• /
• v.44 no.2
• /
• pp.219-238
• /
• 2012

Objective of this paper is to compare linear buckling analysis formulations, available in commercial finite element programs. Modern steel design codes, including Eurocode 3, make abundant use of linear buckling loads for calculation of slenderness, and of linear buckling modes, used as shapes of imperfections for nonlinear analyses. Experience has shown that the buckling mode shapes and the magnitude of buckling loads may differ, sometimes significantly, from one algorithm to another. Thus, three characteristic examples have been used in order to assess the linear buckling formulations available in the finite element programs ADINA and ABAQUS. Useful conclusions are drawn for selecting the appropriate algorithm and the proper reference load in order to obtain either the classical linear buckling load or a good approximation of the actual geometrically nonlinear buckling load.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.20-26
• /
• 2011

In this paper, we propose an efficient algorithm for reducing the complexity of LDPC code decoding by using node monitoring (NM) and Piecewise Linear Function Approximation (NP). This NM algorithm is based on a new node-threshold method, and the message passing algorithm. Piecewise linear function approximation is used to reduce the complexity for more. This algorithm was simulated in order to verify its efficiency. Simulation results show that the complexity of our NM algorithm is reduced to about 20%, compared with thoes of well-known method.

• Nuclear Engineering and Technology
• /
• v.54 no.5
• /
• pp.1902-1908
• /
• 2022

In many of the complex systems modeled in the field of nuclear engineering, it is often useful to use linear regression-based analyses to analyze relationships between model parameters and responses of interests. In cases where the response of interest is calculated by a simulation which uses Monte Carlo methods, there will be some uncertainty in the responses. Further, the reduction of this uncertainty increases the time necessary to run each calculation. This paper presents some discussion on how the Monte Carlo error in the response of interest influences the error in computed linear regression coefficients. A mathematical justification is given that shows that when performing linear regression in these scenarios, the error in regression coefficients can be largely independent of the Monte Carlo error in each individual calculation. This condition is only true if the total number of calculations are scaled to have a constant total time, or amount of work, for all calculations. An application with a simple pin cell model is used to demonstrate these observations in a practical problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6A
• /
• pp.438-449
• /
• 2012

This paper presents new CRC-p codes for VHF band maritime wireless communication system based on performance analysis of various CRC codes. For this purpose, we firstly describe the method of determination of undetected error probability and minimum Hamming distance according to variation of CRC codeword length. By using the fact that the dual code of cyclic Hamming code and primitive BCH code become maximum length codes, we present an algorithm for computation of undetected error probability and minimum Hamming distance where the concept of simple hardware that is consisted of linear feedback shift register is utilized to compute the weight distribution of CRC codes. We also present construction of transmit data frame of VHF band maritime wireless communication system and specification of major communication parameters. Finally, new optimal CRC-p codes are presented based on the simulation results of undetected error probability and minimum Hamming distance using the various generator polynomials of CRC codes, and their performances are evaluated with simulation results of bit error rate based on the Rician maritime channel model and ${\pi}$/4-DQPSK modulator.

• Communications of the Korean Mathematical Society
• /
• v.20 no.2
• /
• pp.405-409
• /
• 2005

In [1], Sharma and Goel obtained a bound for random error correcting codes with Lee weight considerations. The purpose of this paper is to first point out a discrepancy in this result and then give a correct version of the same, improving upon the bound tremendously.