• Phonetics and Speech Sciences
• /
• v.4 no.3
• /
• pp.111-117
• /
• 2012

In this paper, we compare the performance of several speaker adaptation methods for a HMM-based Korean speech synthesis system with small amounts of adaptation data. According to objective and subjective evaluations, a hybrid method of constrained structural maximum a posteriori linear regression (CSMAPLR) and maximum a posteriori (MAP) adaptation shows better performance than other methods, when only five minutes of adaptation data are available for the target speaker. During the objective evaluation, we find that the duration models are insufficiently adapted to the target speaker as the spectral envelope and pitch models. To alleviate the problem, we propose the duration rectification method and the duration interpolation method. Both the objective and subjective evaluations reveal that the incorporation of the proposed two methods into the conventional speaker adaptation method is effective in improving the performance of the duration model adaptation.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.48-54
• /
• 2021

In most existing researches on non-orthogonal multiple access (NOMA) with symmetric superposition coding (SSC), uniform sources have been usually considered. For the first part in this two-part paper, for the strongest channel gain user, we showed that the bit-error rate (BER) for the optimal maximum a-posteriori (MAP) receiver for the non-uniform source improves slightly, compared to that of the conventional receiver for the uniform sources. We demonstrate that in communication scenarios of the non-uniform source NOMA schemes, for the weakest channel gain user, the BER performance of the optimal MAP receiver for a non-uniform source improves greatly, compared to that of the conventional receiver for uniform sources. We first derive an analytical expression of the BER for non-uniform source NOMA with SSC. Then, simulations demonstrate that the BER of the optimal MAP receiver for the non-uniform source improves, compared with that of the conventional maximum likelihood (ML) receiver for the uniform sources. In result, the proposed optimal MAP receiver for the non-uniform source could be a promising scheme for SSC NOMA, with improved BER performances.

• Korean Journal of Remote Sensing
• /
• v.30 no.6
• /
• pp.817-827
• /
• 2014

In the satellite remote sensing, the operational environment of the satellite sensor causes image degradation during the image acquisition. The degradation results in noise and blurring which badly affect identification and extraction of useful information in image data. This study proposes a maximum a posteriori (MAP) estimation using Point-Jacobian iteration to restore a degraded image. The proposed method assumes a Gaussian additive noise and Markov random field of spatial continuity. The proposed method employs a neighbor window of spoke type which is composed of 8 line windows at the 8 directions, and a boundary adjacency measure of Mahalanobis square distance between center and neighbor pixels. For the evaluation of the proposed method, a pixel-wise classification was used for simulation data using various patterns similar to the structure exhibited in high resolution imagery and an unsupervised segmentation for the remotely-sensed image data of 1 mspatial resolution observed over the north area of Anyang in Korean peninsula. The experimental results imply that it can improve analytical accuracy in the application of remote sensing high resolution imagery.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.587-593
• /
• 2010

In this paper we design an irregular low-density parity-check (LDPC) code for multiple-input multiple-output (MIMO) system, using a simple extrinsic information transfer (EXIT) chart method. The MIMO systems considered are optimal maximum a posteriori probability (MAP) detector. The MIMO detector and the LDPC decoder exchange soft information and form a turbo iterative receiver. The EXIT charts are used to obtain the edge degree distribution of the irregular LDPC code which is optimized for the MIMO detector. It is shown that the performance of the designed LDPC code is better than that of conventional LDPC code which was optimized for either the Additive White Gaussian Noise (AWGN) channel or the MIMO channel.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.2
• /
• pp.84-89
• /
• 1998

본 논문에서는 임의의 단어를 인식하기 위하여 음성학적으로 최적화된 (phonetically-optimized word) 음성 데이터베이스를 사용하여 훈련된 가변어휘 고립단위 음 성인식기의 실제 인식기 사용 환경에서의 성능을 평가하였다. 이를 위하여, 훈련 데이터베이 스에서와 상이한 환경에서 수집된 음성학적으로 균형 잡힌(phonetically-balanced word) 고 립 단어 음성을 테스트 데이터로 사용하였다. 테스트 데이터는 일반적인 사무실에서 작동하 는 노트북 PC에서 내장 마이크를 사용하여 녹음되었다. 이렇게 녹음된 음성을 사용하여 고 립단어 인식기의 인식률을 측정하였다. 이 인식기는 최대 사후(maximum a posteriori) 추정 알고리듬을 사용하여 화자의 변화에 적응하였다. 컴퓨터 모의실험 결과에 의하면 화자 적응 을 하지 않은 기본 시스템은 깨끗한 음성에 대하여 81.3%에서 사무실 환경 음성에 대하여 69.8%로 인식률이 저하되었다. 사무실 환경 음성에 대하여, 비교사 점진(unsupervised incremental) 모드에서 최대 사후 추정 화자 적응 알고리듬을 적용하였을 경우에는 화자적 응을 하지 않은 경우에 비하여 9%의 에러를 감소시키며, 50단어의 적응 단어를 사용하여 교사 묶음(supervised batch) 모드에서 최대 사후 추정 화자 적응 알고리듬을 적용하였을 경우에는 16%의 에러를 감소시켰다.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.426-432
• /
• 2007

The MAP algorithm is designed and implemented through the sliding window method for turbo decoding. First, the implementation issues, which are the length of the sliding window and the normalization method of state metrics are reviewed, and their optimal values are obtained by the simulation. All component schemes of the decoder including the branch metric evaluator are also presented. The proposed MAP architecture can be easily redesigned according to the size of sliding window, that is, sub-frame length because of its simplicity on buffer control.

• Korean Journal of Remote Sensing
• /
• v.25 no.5
• /
• pp.455-464
• /
• 2009

Lee(2009) proposed the boundary-adaptive despeckling method using a Bayesian model which is based on the lognormal distribution for image intensity and a Markov random field(MRF) for image texture. This method employs the Point-Jacobian iteration to obtain a maximum a posteriori(MAP) estimate of despeckled imagery. The boundary-adaptive algorithm is designed to use less information from more distant neighbors as the pixel is closer to boundary. It can reduce the possibility to involve the pixel values of adjacent region with different characteristics. The boundary-adaptive scheme was comprehensively evaluated using simulation data and the effectiveness of boundary adaption was proved in Lee(2009). This study, as an extension of Lee(2009), has suggested a modified iteration algorithm of MAP estimation to enhance computational efficiency and to combine classification. The experiment of simulation data shows that the boundary-adaption results in yielding clear boundary as well as reducing error in classification. The boundary-adaptive scheme has also been applied to high resolution Terra-SAR data acquired from the west coast of Youngjong-do, and the results imply that it can improve analytical accuracy in SAR application.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.4 s.310
• /
• pp.73-79
• /
• 2006

Due to the powerful correcting performance, turbo codes have been adopted in many communication standards such as W-CDMA(Wideband Code Division Multiple Access), CDMA2000, etc., and implemented by hardware in many kind of fields. Although several hardware structures and improved algorithm have been proposed, these problems such as hardware area, operating speed and power consumption are still a major issue to be solved in practical implementations. In this paper, we designed the turbo-code decoder using MAX -SCALE operation derived from the posterior probability optimization. The proposed circuit has been measured their performance on Matlab and MaxPlusII and implemented on the FPGA As a result, when implementing the proposed algorithm on the FPGA, this circuit only occupies 616 logic elements. And comparing the performance with the MAP(Maxirnum a Posteriori) decoding algorithm, the operating speed was increased by about 40%(56.48MHz) and BER(Bit Error Rate) was increased by 6.12.

• 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.