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

Lempel-Ziv coding is one of the most famous source coding schemes. The output of this source coding is usually a non-uniform code, which requires additional source coding, such as arithmetic coding, to reduce a redundancy. However, this additional source code increases complexity and decoding latency. Thus, this paper proposes the optimal maximum a-posteriori (MAP) receiver for non-uniform source non-orthogonal multiple access (NOMA) with symmetric superposition coding (SSC). First, we derive an analytical expression of the bit-error rate (BER) for non-uniform source NOMA with SSC. Then, Monte Carlo simulations demonstrate that the BER of the optimal MAP receiver for the non-uniform source improves slightly, compared to that of the conventional receiver for the uniform source. Moreover, we also show that the BER of an approximate analytical expression is in a good agreement with the BER of Monte Carlo simulation. As a result, the proposed optimal MAP receiver for non-uniform source could be a promising scheme for NOMA with SSC, to reduce complexity and decoding latency due to additional source coding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1290-1298
• /
• 2000

Turbo Code decoder is an iterate decoding technology, which extracts extrinsic information from the bit to be decoded by calculating both forward and backward metrics, and uses the information to the next decoding step Turbo Code shows excellent performance, approaching Shannon Limit at the view of BER, when the size of Interleaver is big and iterate decoding is run enough. But it has the problems which are increased complexity and delay and difficulty of real-time processing due to Interleaver and iterate decoding. In this paper, it is analyzed that MAP(maximum a posteriori) algorithm which is used as one of Turbo Code decoding, and the factor which determines its performance. MAP algorithm proceeds iterate decoding by determining soft decision value through the environment and transition probability between all adjacent bits and received symbols. Therefore, to improve the performance of MAP algorithm, the trust between adjacent received symbols must be ensured. However, MAP algorithm itself, can not do any action for ensuring so the conclusion is that it is needed more algorithm, so to decrease iterate decoding. Consequently, MAP algorithm and Turbo Code performance are analyzed in the nongaussian channel applying Robust equalization technique in order to input more trusted information into MAP algorithm for the received symbols.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.8
• /
• pp.1238-1246
• /
• 1989

In this paper, a texture synthesis technique based on the NCAR(non-causal auto-regressive) model and the pyramid structure is proposed. In order to estimate the NCAR model parameters accurately from a noisy texture, the MAP(maximum a posteriori) estimation technique is also employed. In our approach, since the input texture is decomposed into the Laplacian oyramid planes first and then the NCAR model is applied to each plane, we are able to obtain a good synthesized texture even if the texture exhibits some non-random local structure or non-homogenity. The usrfulness of the proposed method is demonstrated with seveal real textures in the Brodatz album. Finally, the 2-dimensional MAP estimation technique can be used to the image restoration for noisy images as well as a texture image synthesis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.385-391
• /
• 2007

In this paper, we propose and observe the Adaptive Modulation system with optimal Turbo Coded V-BLAST (Vertical-Bell-lab Layered Space-Time) technique that is applied the extrinsic information from MAP (Maximum A Posteriori) Decoder with Iterative Decoding to use as a priori probability in two decoding procedures of V-BLAST: ordering and slicing. Also, comparing with the Adaptive Modulation system using conventional Turbo Coded V-BLAST technique that is simply combined V-BLAST with Turbo Coding scheme, we observe how much throughput performance has been improved. As a result of simulation, in the Adaptive Modulation systems with several Turbo Coded V-BLAST techniques, the optimal Turbo Coded V-BLAST technique has higher throughput gain than the conventional Turbo Coded V-BLAST technique. Especially, the results show that the proposed scheme achieves the gain of 1.5 dB SNR compared to the conventional system at 2.5 Mbps throughput.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.594-597
• /
• 2002

In this paper we study the effects of transmission noise on fixed-length coded wavelet coefficients. We use a posteriori detectors which include inter-bitplane information and determine which transmitted codeword was most likely corrupted into a received erroneous codeword We present a simple method of recovering from these errors once detected and demonstrate our restoration methodology on scalar-quantized wavelet coefficients that have been transmitted across a binary symmetric channel.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.2
• /
• pp.107-113
• /
• 1997

To achive a robust Korean word recognition system for both channel distortion and additive noise, maximum a posteriori estimation(MAP) adaptation is proposed and the effectiveness of environmental adaptation for improving recognition performance is investigated in this paper. To do this, recognition experiments using MAP adaptation are carried out for the three different speech ; 1) channel distortion is introduced, 2) environmental noise is added, 3) both channel distortion and additive noise are presented. Theeffectiveness of additive feature parameters, such as regressive coefficients and durations, for environmental adaptation are also investigated. From the speaker independent 100 words recognition tests, we had 9.0% of recognition improvement for the case 1), more than 75% for the case 2), and 11%~61.4% for the case 3) respectively, resulting that a MAP environmental adaptation is effective for both channel distorted and noise added speech recognition. But it turned out that duration information used as additive feature parameter did not played an important role in the tests.

• Phonetics and Speech Sciences
• /
• v.6 no.1
• /
• pp.77-83
• /
• 2014

This paper proposes a speaker and environment clustering method in order to overcome the degradation of the speech recognition performance caused by various noise and speaker characteristics. In this paper, instead of using the distance between Gaussian mixture model (GMM) weight vectors as in the Google's approach, the distance between the adapted mean vectors based on the modified maximum a posteriori (MAP) adaptation is used as a distance measure for vector quantization (VQ) clustering. According to our experiments on the simulation data generated by adding noise to clean speech, the proposed clustering method yields error rate reduction of 10.6% compared with baseline speaker-independent (SI) model, which is slightly better performance than the Google's approach.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.8
• /
• pp.3748-3759
• /
• 2013

The purpose of this study was to examine the classification accuracies of ML, MAP, and EAP methods under DINA model. For this purpose, this study examined the classification accuracies of the classification methods under the various conditions: the number of attributes, the ability distribution of examinees, and test length. To accomplish this purpose, this study used a simulation method. For the simulation study, data was simulated under the various simulation conditions including the number of attributes (K= 5, 7), the ability distribution of examinees (high, middle, low), and test length (J= 15, 30, 45). Additionally, the percent of agreements between true skill patterns(true ${\alpha}$) and skill patterns estimated by the ML, MAP, and EAP methods were calculated. The summary of the main results of this study is as follows: First, When the number of attributes was 5 and 7, the EAP method showed relatively higher average in the percent of exact agreement than the ML and MAP methods. Second, under the same conditions, as the number of attributes increased, the average percent of exact agreement decreased in ML, MAP, and EAP methods. Third, when the prior distribution of examinees ability was different from low to high under the conditions of the same test length, the EAP method showed relatively higher average in the percent of exact agreement than those of the ML and MAP methods. Fourth, the average percent of exact agreement increased in all methods, ML, MAP, and EAP when the test length increased from 15 to 30 and 45 under the conditions of the same the ability distribution of examinees.

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.51-56
• /
• 2022

In space based constellation network, users are allowed to enter or leave the network arbitrarily. Hence, the number, identities and transmitted data of active users vary with time and have considerable impacts on the receiver's performance. The so-called problem of multiuser detection means identifying the identity of each active user and detecting the data transmitted by each active user. Traditional methods assume that the number of active users is equal to the maximum number of users that the network can hold. The model of traditional methods are simple and the performance are suboptimal. In this paper a Maximum A Posteriori Probability (MAP) based multiuser detection method is proposed. The proposed method models the activity state of users as Markov chain and transforms multiuser detection into searching optimal path in grid map with BCJR algorithm. Simulation results indicate that the proposed method obtains 2.6dB and 1dB E_b/N₀ gains respectively when activity detection error rate and symbol error rate reach 10^-3, comparing with reference methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.132-138
• /
• 2009

In this paper, we propose a novel approach to improve the performance of minima controlled recursive averaging (MCRA) which is based on the second-order conditional maximum a posteriori (CMAP). From an investigation of the MCRA scheme, it is discovered that the MCRA method cannot take full consideration of the inter-frame correlation of voice activity since the noise power estimate is adjusted by the speech presence probability depending on an observation of the current frame. To avoid this phenomenon, the proposed MCRA approach incorporates the second-order CMAP criterion in which the noise power estimate is obtained using the speech presence probability conditioned on both the current observation and the speech activity decisions in the previous two frames. Experimental results show that the proposed MCRA technique based on second-order conditional MAP yields better results compared to the conventional MCRA method.