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

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.13-23
• /
• 2009

In this paper, the network performance of a turbo coded optical code division multiple access (CDMA) system with cross-layer, which is between physical and network layers, concept is analyzed and simulated. We consider physical and MAC layers in a cross-layer concept. An intensity-modulated/direct-detection (IM/DD) optical system employing pulse position modulation (PPM) is considered. In order to increase the system performance, turbo codes composed of parallel concatenated convolutional codes (PCCCs) is utilized. The network performance is evaluated in terms of bit error probability (BEP). From the simulation results, it is demonstrated that turbo coding offers considerable coding gain with reasonable encoding and decoding complexity. Also, it is confirmed that the performance of such an optical CDMA network can be substantially improved by increasing e interleaver length and e number of iterations in e decoding process. The results of this paper can be applied to implement the indoor optical wireless LANs.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.585-592
• /
• 2009

This paper presents a method for decoding high minimal distance ($d_{min}$) short codes, termed Cortex codes. These codes are systematic block codes of rate 1/2 and can have higher$d_{min}$ than turbo codes. Despite this characteristic, these codes have been impossible to decode with good performance because, to reach high $d_{min}$, several encoding stages are connected through interleavers. This generates a large number of hidden variables and increases the complexity of the scheduling and initialization. However, the structure of the encoder is well suited for analog decoding. A proof-of-concept Cortex decoder for the (8, 4, 4) Hamming code is implemented in subthreshold 0.25-${\mu}m$ CMOS. It outperforms an equivalent LDPC-like decoder by 1 dB at BER=$10^{-5}$ and is 44 percent smaller and consumes 28 percent less energy per decoded bit.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.565-568
• /
• 2003

This paper presents a method that can be used to reduce the decoding computational complexity in turbo codes. To reduce the decoding complexity we proposed an adaptive sliding window method which control the learning period of Viterbi sliding window method depending on channel signal to interference ratio (SIR). When received signal to interference ratio (SIR) is relatively high, we can reduce the decoding complexity without a noticeable degradation of BER performance at CDMA cellular system with power control error.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.97-100
• /
• 2003

The quasi-complementary turbo codes (QCTC) proposed by Kim [1] is used for a fast hybrid ARQ scheme with incremental redundancy and adaptive modulation coding in the cdma2000 1xEV-DV [2]. The QCTC provides various code rates with good performance, a very simple encoder structure, and an inherent channel interleaving. It is shown that the QCTC is a unified scheme of channel coding and channel interleaving. In this paper, we introduce the properties of QCTC and various hybrid ARQ-QCTC schemes for the system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7A
• /
• pp.775-780
• /
• 2004

In this paper, we propose a simple protection scheme for error prone bit positions of turbo codes using the error detection capability of the CRC, which is almost always employed in practical systems. The proposed scheme based on bit flipping with CRC offers flexibility on selecting the level of protection. Also, not having send additional parity bits or discarding useful bit positions, it offers the best error performance for a given level of protection.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.2071-2074
• /
• 2002

This paper introduces an encoder design method of Turbo TCM (Trellis Coded Modulation) with symbol puncturing. TTCM consists of two simple trellis codes in parallel and modulator. To obtain an good encoder, we calculate the free distance by the assumption that the punctured symbol is transmitted from the subset that consist of signals with the same systematic bit at random. We develop a search program to find the component encoder which maximize the free distance. Especially, for 8-PSK with code rate 2/3, we search for the component codes. We find a new encoder which has better BER performance than that of Robertson′s encoder. We verify the results through the simulation."

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.277-285
• /
• 2008

We previously proposed an Orthogonal Code Hopping Multiplexing (OCHM) scheme for statistical multiplexing on a synchronous downlink. OCHM enables a large number of users to share a limited number of code channels through statistical multiplexing. We here improve the performance of OCHM by prioritizing encoded symbols according to their importance using both the conventional code division and the previously proposed code hopping multiplexing schemes. Prioritization is useful for channel coding schemes with different levels of importance for encoded symbols such as turbo-codes. Scheme performance is evaluated by simulation in terms of the required Eb/N0 for a 1% block error rate.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.5 no.3
• /
• pp.169-173
• /
• 2012

This paper investigates the performance of Turbo equalization in wireless multipath channels. Turbo equalization mainly consists of a SISO(soft-in soft-out) equalizer and a SISO decoder. Iterative channel estimators can improve the accuracy of channel estimates by soft information fed back from the SISO decoder. Comparing iterative channel estimators with LMS(least mean square) and RLS(recursive least squares) algorithms, which are the most common algorithms to estimate and track a time-varying channel impulse response, the iterative channel estimator with RLS converges more faster than the one with LMS. However, the difference of BER(bit error rate) performances gradually decreases as the number of iterations for Turbo equalization increases.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.235-238
• /
• 2000

In this paper the MUD(Multi-User Detection) schemes and turbo codes are utilized in DS-CDMA mobile communication systems. Theses schemes effectively mitigate the effects of MAI(Multiple Access Interference) and Rayleigh fading. Using Monte Carlo simulation, the performance of the proposed schemes is analyzed for various channel conditions.