• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5A
• /
• pp.333-340
• /
• 2003

In this paper, we propose a new turbo-coded orthogonal frequency division multiplexing (OFDM) transmission scheme that can improve greatly the performance by making all the turbo-coded symbols have the same reliability for OFDM transmission over a frequency selective fading channel. The same reliability, that is, the same fading can be accomplished through multiplexing of turbo-coded symbols using distinct orthogonal codes and spreading over the whole effective subcarriers (hereafter, called as the orthogonal code multiplexing (OCM)). As for the orthogonal code selection, we choose the set of the discrete Fourier transform (DFT) basis sequences, since the code set holds the orthogonality irrespective of the length and also has the equal energy property. We perform computer simulations using the Log-maximum-a-posteriori (Log-MAP) algorithm for iterative decoding in order to assess the performance of the proposed transmission scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.588-592
• /
• 2009

In this paper, we propose a novel method to improve the performance of the global soft decision which is based on the second-order conditional maximum a posteriori (CMAP). Conventional global soft decision scheme has an disadvantage in that the speech absence probability adjusted by a fixed-parameter was sensitive to the various noise environments. In proposed approach using the second-order CMAP, speech absence probability value is more flexible which exploit not only the current observation but also the speech activity decisions in the previous two frames. Experimental results show that the proposed improved global soft decision method based on second-order conditional MAP yields better results compared to the conventional global soft decision technique with the performance criteria of the ITU-T P. 862 perceptual evaluation of speech quality (PESQ).

• Journal of IKEEE
• /
• v.4 no.2 s.7
• /
• pp.257-265
• /
• 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 in each decoding step, and uses the information to the next decoding step. Viterbi decoder, which is for a convolutional code, runs continuous mode, while Turbo Code decoder runs by block unit. There are algorithms used in a decoder : which are MAP(maximum a posteriori) algorithm requiring very complicated calculation and SOVA(soft output Viterbi algorithm) using Viterbi algorithm suggested by Hagenauer, and it is known that the decoding performance of MAP is better. The result of this make experimentation shows that the performance of SOVA, which has half complex algorithm compare to MAP, is almost same as the performance of MAP when the SOVA decoding performance is supplemented with Robust equalization techniques.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.8
• /
• pp.768-775
• /
• 2011

Since error compensation schemes guaranteeing high reliability are required in wireless communication systems for the transmission of the large amount of data, as an efficient error compensation scheme the turbo HARQ scheme combining automatic repeat request and turbo coding has been studied in many places in the literature. In the case of conventional turbo HARQ schemes, the transmitter recognizing NAK signals repetitively sends the whole unit packet to the receiver although the received packet can be partially correctable. Through two successive processes, selection of uncorrectable error data and retransmission of only the relevant parts of the information data, transmission efficiency can be improved. In this paper, we present an error data selection criterion for retransmission using the sign transitions of A Posteriori values and propose a tubo HARQ scheme based on the partial retransmission technique. Through a computer simulation, we show and analyze the performance of the proposed scheme with transmission efficiency.

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

• Information and Communications Magazine
• /
• v.24 no.12
• /
• pp.14-21
• /
• 2007

This paper aims to improve the design of iterative detection and decoding(IDD) based on the soft interference cancellation with minimum mean squared error(SC-MMSE) detector, which shows low performance compared to the maximum a posteriori(MAP) detector. By means of extrinsic information transfer(EXIT) chart analysis, such low performance may be attributed to that the "pure"(original) turbo principle is not always best for IDD. Thus, we propose a new IDD architecture based on the SC-MMSE detector which uses new a priori information. Simulation results show that the performance of the proposed IDD is very close to that of IDD based on the MAP detector.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2003.11a
• /
• pp.340-343
• /
• 2003

This study presents a practical procedure for the Bayesian inversion of geophysical data by Markov chain Monte Carlo (MCMC) sampling and geostatistics. We have applied geostatistical techniques for the acquisition of prior model information, and then the MCMC method was adopted to infer the characteristics of the marginal distributions of model parameters. For the Bayesian inversion of dipole-dipole array resistivity data, we have used the indicator kriging and simulation techniques to generate cumulative density functions from Schlumberger array resistivity data and well logging data, and obtained prior information by cokriging and simulations from covariogram models. The indicator approach makes it possible to incorporate non-parametric information into the probabilistic density function. We have also adopted the MCMC approach, based on Gibbs sampling, to examine the characteristics of a posteriori probability density function and the marginal distribution of each parameter. This approach provides an effective way to treat Bayesian inversion of geophysical data and reduce the non-uniqueness by incorporating various prior information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1131-1143
• /
• 2016

Differential detection schemes do not require any channel estimation, which can be employed under user mobility with low computational complexity. In this work, a soft-input soft-output (SISO) differential detection algorithm is proposed for amplify-and-forward (AF) over time-varying relaying channels based cooperative communications system. Furthermore, maximum-likelihood (ML) detector for M-ary differential Phase-shift keying (DPSK) is derived to calculate a posteriori probabilities (APP) of information bits. In addition, when the SISO is exploited in conjunction with channel decoding, iterative detection and decoding approach by exchanging extrinsic information with outer code is obtained. Finally, simulation results show that the proposed non-coherent approach improves detection performance significantly. In particular, the system can obtain greater performance gain under fast-fading channels.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.905-908
• /
• 2008

In this paper, an Adaptive Modulation (AM) system with an efficient turbo-coded Vertical-Bell-lab Layered Space-Time (V-BLAST) technique is proposed. The proposed decoding algorithm adopts iteratively the extrinsic information from a Maximum a Posteriori (MAP) decoder as a priori probability in the two decoding procedures of the V-BLAST scheme of ordering and slicing. In this analysis, each MIMO channel is assumed to be a part of the system of performance improvement.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.135-140
• /
• 2003

In this paper, we investigate the error performance of a serially concatenated system using a nonrecursive convolutional code as the outer code and a recursive QPSK space-time trellis code as the inner code on quasi-static and rapid Rayleigh fading channels. At the receiver, we consider iterative decoding based on the maximum a posteriori (MAP) algorithm. The performance is evaluated by means of computer simulations and it is shown that better error performance can be obtained by using low complexity outer and/or inner codes and the Euclidean distance criterion based recursive space-time inner codes. We also obtain new systems with large number of trasmit and/or receive antennas providing good error performance.