• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.3
• /
• pp.543-552
• /
• 1994

Dynamic Time Warp(DTW) needs for iterative calculations and the design of PE cell suitable for the operations is very important. Accordingly, this paper aims at real time recognition design enables large dictionary hardware realization using DTW algorithm. The DTW PE cell separated into three large blocks. "MIN" is the one block for counting accumulated minimum distance. "ADD" block calculates these minimum distances, and "ABS" seeks for the absolute values to the total sum of local distances. Circuit design and verification about the three block have been accomplished, and performed layout '||'&'||' DRC(design rule check) using 1.2 m CMOS N-Well rule base.CMOS N-Well rule base.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2369-2381
• /
• 1999

In this paper, we propose an iterative algorithm for reducing the blocking artifact in block transform-coded images by using a wavelet transform. In the proposed method, an image is considered as a set of one-dimensional horizontal and vertical signals and one-dimensional wavelet transform is utilized in which the mother wavelet is the first order derivative of a Gaussian like function. The blocking artifact is reduced by removing the blocking component, that causes the variance at the block boundary position in the first scale wavelet domain to be abnormally higher than those at the other positions, using a minimum mean square error (MMSE) filter in the wavelet domain. This filter minimizes the MSE between the ideal blocking component-free signal and the restored signal in the neighborhood of block boundaries in the wavelet domain. It also uses local variance in the wavelet domain for pixel adaptive processing. The filtering and the projection onto a convex set of quantization constraint are iteratively performed in alternating fashion. Experimental results show that the proposed method yields not only a PSNR improvement of about 0.56-1.07 dB, but also subjective quality nearly free of the blocking artifact and edge blur.

• Journal of Communications and Networks
• /
• v.9 no.1
• /
• pp.1-10
• /
• 2007

This paper proposes a multimodal generalized Gaussian distribution (MGGD) to effectively model the varying statistical properties of the extrinsic information. A subsidiary maximum likelihood decoding (MLD) algorithm is subsequently developed to dynamically select the most suitable MGGD parameters to be used in the component maximum a posteriori (MAP) decoders at each decoding iteration to derive the more reliable metrics performance enhancement. Simulation results show that, for a wide range of block lengths, the proposed approach can enhance the overall turbo decoding performance for both parallel and serially concatenated codes in additive white Gaussian noise (AWGN), Rician, and Rayleigh fading channels.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.2
• /
• pp.119-124
• /
• 1998

Block Matching Motion Estimation(BMME) Algorithm is demands a very large amount of computing power and have been proposed many fast algorithms. These algorithms are many problem that larger size of VLSI scale due to non-localized search block data and problem of non-reuse of input data for each processing step. In this paper, we designed systolic arry of high processing capacity, constraints input output pin size and reuse of input data for small VLSI size. The proposed systolic array is optimized memory access time because of iterative reuse of input data on search block and become independent of problem size due to increase of algorithm's parallelism and total processing elements connection is localized spatial and temporal. The designed systolic array is reduced O(N6) time complexity to O(N3) on moving vector and has O(N) input/output pin size.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.239-252
• /
• 2008

For orthogonal frequency division multiplexing (OFDM), cyclic prefix (CP) should be longer than the length of channel impulse response, resulting in a loss of bandwidth efficiency. In this paper, we describe a new technique to restore the cyclicity of the received signal when the CP is not sufficient for OFDM systems. The proposed technique efficiently restores the cyclicity of the current received symbol by adding the weighted next received symbol to the current received symbol. Iterative CP reconstruction (CPR) procedure, based on the residual intersymbol interference cancellation (RISIC) algorithm, is analyzed and compared to the RISIC. In addition, we apply the CPR method to Alamouti space-time block coded (STBC) OFDM system. It is shown that in the STBC OFDM, tail cancellation as well as cyclic reconstruction of the CPR procedure should be repeated. The computational complexities of the RISIC, the proposed CPR, the RISIC with STBC, and the proposed CPR with STBC are analyzed and their performances are evaluated in multipath fading environments. We also propose an iterative channel estimation (CE) method for OFDM with insufficient CP. Further, we discuss the CE method for the STBC OFDM system with the CPR. It is shown that the CPR technique with the proposed CE method minimizes the loss of bandwidth efficiency due to the use of CP, without sacrificing the diversity gain of the STBC OFDM system.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.11 s.114
• /
• pp.1065-1072
• /
• 2006

An OFDM(Orthogonal Frequency Division Multiplexing) system has the problem of the PAPR(Peak-to-Average Power Ratio) due to the overlapping phenomena of many sub-carriers. The previously proposed GA-SPW(Genetic Sub-block Phase Weighting) method not only improved the reduction of PAPR as the number of sub-blocks increases in an OFDM symbol but also decreased the number of calculations involved in the iterative phase searching yields to depend on the number of population and generation by using genetic algorithm not on the number of sub-blocks and phase elements. In this paper, we propose the modified GA-SPW method in order to improve the performance and to decrease the complexity. It is shown that the proposed modified GA-SPW method achieves the significant performance and the reduction of search complexity comparing to the ordinary technique, iterative flipping and previously proposed GA-SPW by the experimental results and analysis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.1
• /
• pp.36-41
• /
• 2006

In this paper, we present the performance of iterative decoding with a Turbo decoder and a M-ary QAM(Quadrature Amplitude Modulation) demapper. The demappers are designed with Max-Log-MAP algorithm and it's approximated one. In addition, we provide implementing block for the approximated algorithm. From the results of computer simulations, the approximated algorithm of the Max-Log-MAP has little bit worse than the Max-Log-MAP but suggests low complexity for practical implementation.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.19 no.5
• /
• pp.552-560
• /
• 2013

In this paper, an optimization algorithm for the block assembly accuracy control assessment is proposed with consideration for the current block assembly process and accuracy control procedure used in the shipbuilding site. The objective function of the proposed algorithm consists of root mean square error of the distances between design and measured data of the other control points with respect to a specific point of the whole control points. The control points are divided into two groups: points on the control line and the other points. The grouped data are used as criteria for determining the combination of 6 degrees of freedom in the registration process when constituting constraints and calculating objective function. The optimization algorithm is developed by using combination of the sampling method and the point to point relation based modified ICP algorithm which has an allowable error check procedure that makes sure that error between design and measured point is under allowable error. According to the results from the application of the proposed algorithm with the design and measured data of two blocks data which are verified and validated by an expert in the shipbuilding site, it implies that the choice of whole control points as target points for the accuracy calculation shows better results than that of the control points on the control line as target points for the accuracy of the calculation and the best optimized result can be acquired from the accuracy calculation with a fixed point on the control line as the reference point of the registration.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.29 no.2
• /
• pp.123-130
• /
• 2016

With the development of fast construction mode in shipbuilding market, the demand on accuracy management of hull is becoming higher and higher in shipbuilding industry. In order to enhance production efficiency and reduce manufacturing cycle time in shipbuilding industry, it is important for shipyards to have the accuracy of ship components evaluated efficiently during the whole manufacturing cycle time. In accurate shipbuilding process, block accuracy is the key part, which has significant meaning in shortening the period of shipbuilding process, decreasing cost and improving the quality of ship. The key of block accuracy control is to create a integrate block accuracy controlling system, which makes great sense in implementing comprehensive accuracy controlling, increasing block accuracy, standardization of proceeding of accuracy controlling, realizing "zero-defect transferring" and advancing non-allowance shipbuilding. Generally, managers of accuracy control measure the vital points at section surface of block by using the heavy total station, which is inconvenient and time-consuming for measurement of vital points. In this paper, a new measurement method based on point clouds technique has been proposed. This method is to measure the 3D coordinates values of vital points at section surface of block by using 3D scanner, and then compare the measured point with design point based on ICP algorithm which has an allowable error check process that makes sure that whether or not the error between design point and measured point is within the margin of error.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1154-1163
• /
• 2007

For orthogonal frequency division multiplexing (OFDM), cyclic prefix (CP) should be longer than the length of channel impulse response. In order to prevent a loss of bandwidth efficiency due to the use of a CP, residual intersymbol interference cancellation (RISIC) method has recently been developed. In this paper, we first apply the RISIC algorithm to the space-time block coded (STBC) OFDM and the space-frequency block coded (SFBC) OFDM with insufficient CP. It is shown that in the STBC OFDM, tail cancellation as well as cyclic restoration of the RISIC should be repeated. Second, we propose iterative channel estimation method for the RISIC in the STBC OFDM system with insufficient CP. Based on the expectation-maximization (EM) algorithm, the proposed estimation method exploits the extrinsic probabilities of the channel decoder iteratively. The performance of the proposed method is evaluated by computer simulation in a multipath fading environment.