• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.7
• /
• pp.1792-1801
• /
• 2012

Symbol timing error amounts to a major degradation in the system performance. Conventionally, timing error is estimated by predefined preamble on both transmitter and receiver. The maximum of the correlation result is considered the start of the OFDM symbol. Problem arises when the prime path is not the strongest one. In this paper, we propose a new combined time and channel estimation method for multi-band OFDM ultra wide-band (MB-OFDM UWB) systems. It is assumed that a coarse timing has been obtained at a stage before the proposed scheme. Based on the coarse timing, search interval is set (or time candidates). Exploiting channel statistics that are assumed to be known by the receiver, we derive a maximum a posteriori estimate (MAP) of the channel impulse response. Based on this estimate, we discern for the timing error. Timing estimation performance is compared with the least squares (LS) channel estimate in terms of mean squared error (MSE). It is shown that the proposed timing scheme is lower in MSE than the LS method.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.281-282
• /
• 2008

Turbo equalizers which use MAP (maximum a posteriori probability) equalizer or MMSE (minimum mean square error) equalizer have shown high performance and adoptability [1], [2]. In this paper, we show that the BP (belief propagation) algorithm can also be applied in equalizer and when it is connected with channel code, it can replace the MAP equalizer with similar complexity and performance.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.14-15
• /
• 2008

In this paper, a new iterative decoding of LDPC codes is proposed. The decoding is based on the posteriori probability of each belief propagation (BP) decoding and an additional postprocessing, that is, erasure decoding of LDPC codes. It turned out that the new method consistently improves the decoding performance on various classes of LDPC codes. For example it removes the error floor of Margulis codes effectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.4 s.316
• /
• pp.117-122
• /
• 2007

For multiple antenna systems, we consider the hybrid iterative detection of the maximum a posteriori probability(MAP) detection and the linear detection such as the minimum-mean-square-error(MMSE) filtering with soft cancelation. We devise methods to obtain both the lower complexity of the linear detection and the superior performance of the MAP detection. Using the a prior probability of the coded bit which is extrinsic of the outer decoder, we compute the threshold of grouping and determine the detection scheme symbol by symbol. Through the simulation results, it is shown that the proposed receiver obtains the superior performance to the MMSE detector and the lower complexity than the MAP detector.

• The Journal of the Korea Contents Association
• /
• v.6 no.12
• /
• pp.105-112
• /
• 2006

In this study, we propose a simple preprocessing method for classification of basal cell carcinoma (BCC), which is one of the most common skin cancer. The preprocessing step consists of data clipping with a half Hanning window and dimension reduction with principal components analysis (PCA). The application of the half Hanning window deemphasizes the peak near $1650cm^{-1}$ and improves classification performance by lowering the false negative ratio. Classification results with various classifiers are presented to show the effectiveness of the proposed method. The classifiers include maximum a posteriori probability (MAP), k-nearest neighbor (KNN), probabilistic neural network (PNN), multilayer perceptron(MLP), support vector machine (SVM) and minimum squared error (MSE) classification. Classification results with KNN involving 216 spectra preprocessed with the proposed method gave 97.3% sensitivity, which is very promising results for automatic BCC detection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.725-732
• /
• 2002

Block-wise MAP (Maximum A posteriori) decoding algorithm for turbo-codes requires less memory than Log-MAP decoding algorithm. The ER (Bit Error Rate) performance of previous block-wise MAP decoding algorithm depend on the block length and training length. To maximize hardware utilization and perform successive decoding, the block length is set to be equal to the training length in previous MAP decoding algorithms. Simulation result on the BER performance shows that the EBR performance can be maintained with shorter blocks when training length is sufficient. This paper proposes an architecture for area efficient block-wise MAP decoder. The proposed architecture employs the decoding schema for reducing memory by using the training length, which in N times larger than block length. To efficiently handle the proposed schema, a pipelined architecture is proposed. Simulation results show that memory usage can be reduced by 30%~45% in the proposed architecture without degrading the BER performance.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.4A
• /
• pp.677-687
• /
• 2006

Kriging interpolation is one of the generally used interpolation techniques in Geostatistics field. This technique includes the experimental and theoretical variograms and the formulation of kriging interpolation. In contrast to the conventional least square method for stress recovery, kriging interpolation is based on the weighted least square method to obtain the estimated exact solution from the stress data at the Gauss points. The weight factor is determined by variogram modeling for interpolation of stress data apart from the conventional interpolation methods that use an equal weight factor. In addition to this, the p-level is increased non-uniformly or selectively through a posteriori error estimation based on SPR (superconvergent patch recovery) technique, proposed by Zienkiewicz and Zhu, by auto mesh p-refinement. The cut-out plate problem under tension has been tested to validate this approach. It also provides validity of kriging interpolation through comparing to existing least square method.

• ETRI Journal
• /
• v.26 no.6
• /
• pp.615-621
• /
• 2004

Next generation mobile communication system, such as IMT-2000, adopts Turbo codes due to their powerful error correction capability. This paper presents a block-wise maximum a posteriori (MAP) Turbo decoding structure with a low memory requirement. During this research, it has been observed that the training size and block size determine the amount of required memory and bit-error rate (BER) performance of the block-wise MAP decoder, and that comparable BER performance can be obtained with much shorter blocks when the training size is sufficient. Based on this observation, a new decoding structure is proposed and presented in this paper. The proposed block-wise decoder employs a decoding scheme for reducing the memory requirement by setting the training size to be N times the block size. The memory requirement for storing the branch and state metrics can be reduced 30% to 45%, and synthesis results show that the overall memory area can be reduced by 5.27% to 7.29%, when compared to previous MAP decoders. The decoder throughput can be maintained in the proposed scheme without degrading the BER performance.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2004.10a
• /
• pp.79-82
• /
• 2004

In this study, a new refinement technique for 3-dimensional hexahedral element mesh is proposed, which is aimed at the control of mesh density. With the proposed scheme the mesh is refined adaptively to the elemental error which is estimated by 'a posteriori' error estimator based on the energy norm. A desired accuracy of an analysis i.e. a limit of error defines the new desired mesh density map on the current mesh. To obtain the desired mesh density, the refinement procedure is repeated iteratively until no more elements to be refined exist. In the algorithm, at first the regions of mesh to be refined are defined and, then, the zero-thickness element layers are inserted into the interfaces between the regions. All the meshes in the regions, in which the zero-thickness layers are inserted, are to be regularized in order to improve the shape of the slender elements on the interfaces. This algorithm is tested on a simple shape of 2-d quadrilateral element mesh and 3-d hexahedral element mesh. A numerical example of elastic deformation of a plate with a hole shows the effectiveness of the proposed refinement scheme.

• Journal of the korean Society of Automotive Engineers
• /
• v.10 no.6
• /
• pp.54-60
• /
• 1988

During recent years, a great deal of interest has emerged on the use of adaptive approaches and a posteriori estimates in finite element method. The results are intended to be used to improve the quality of finite element solution by changing the location of the nodes within a fixed number of degrees of freedom-so called r method-, and by increasing the order of polynomial approximation with the new degrees of freedom-p method. This paper deals with error analysis that contains the basic theory and method of deriving error estimates and adaptive processes applied to finite element solutions underlying the rpm method that is the combination of r and p method of finite element. It is shown that we can obtain more accurate solution by applying the method to the 2-dimensional heat transfer problem.