• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3944-3951
• /
• 2000

In this paper, we propose the new FEC(Forward Error Correction) code method, so called RCNC(Random Connection Node Convolutional) code with security property. Recently, many wireless communication systems, which can prouide integrated semices of various media types and hil rales, are required to haue the ability of secreting information and error correclion. This code system is a kind qf conuolulional code, but it Ius various code formats as each node is connected differently. And systems hy using RCNC codes haue all. ability of error correction as well as information protection. We describe the principle of operating RCNC codes, including operation examples. In this paper, we also show the peiformance of BER(Bit Error Rate) and verify authority of network system with computer simulation.

• ETRI Journal
• /
• v.25 no.2
• /
• pp.144-147
• /
• 2003

We propose a new serial concatenation scheme for space-time and recursive convolutional codes, in which a space-time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner code. Simulation results for a communication system with two transmit and one receive antennas in a quasi-static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.

• ETRI Journal
• /
• v.28 no.4
• /
• pp.453-460
• /
• 2006

In this article, we introduce a new class of product codes based on convolutional codes, called convolutional product codes. The structure of product codes enables parallel decoding, which can significantly increase decoder speed in practice. The use of convolutional codes in a product code setting makes it possible to use the vast knowledge base for convolutional codes as well as their flexibility in fast parallel decoders. Just as in turbo codes, interleaving turns out to be critical for the performance of convolutional product codes. The practical decoding advantages over serially-concatenated convolutional codes are emphasized.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.04a
• /
• pp.1-3
• /
• 1986

We are concerned with transmitting numerical source data of {0, 1, 2, ..., 2k-1} through a channel coding system. The rate 1/v dual-k convolutional code with the orthogonal MFSK modulation and the Viterbl decoding is employed for the implementation of the channel coding system. The mean square error of the dual-k convolutional code is evaluated for the numerical source transmitted over an additive white Gaussian noise channel with Rayleigh fading.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3B
• /
• pp.251-258
• /
• 2002

In this paper, an adaptive convolutional coding method in multicarrier direct sequence code division multiple access (DS/CDMA) systems is considered. In order to accommodate a number of coding rates easily and make the encoder and decoder structure simple, we use the rate compatible punctured convolutional (RCPC) code. To achieve maximum data throughput, an adaptive rate system based on the channel state information (the SINR estimate) is proposed. We show that the proposed adaptive rate convolution coded multicarrier DS/CDMA systems can enhance spectral efficiency and provide frequency diversity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4A
• /
• pp.260-268
• /
• 2012

The use of an error-correcting code is essential in communication systems where the channel is noisy. Unless a receiver has accurate channel coding parameters, it becomes difficult to decode the digitized encoding bits correctly. In this paper, we propose two algorithms for reconstructing convolutional codes: one for general convolutional codes and the other for punctured convolutional codes. And we also verify the algorithms by performing intensive computer simulation in additive white gaussian noise (AWGN) channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.611-617
• /
• 2004

The optimum convolutional error correction codes for recently standardized Feher-patented quadrature phase-shift keying (FQPSK-B) modulation are proposed. We utilize the continuous phase modulation characteristics of FQPSK-B signals for calculating the minimum Euclidean distance of convolutional coded FQPSK-B signal. It is shown that the Euclidean distance between two FQPSK-B signals is proportional to the Hamming distance between two binary data sequence. Utilizing this characteristic, we show that the convolutional codes with optimum free Hamming distance is the optimum convolutional codes for FQPSK-B signals.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.2
• /
• pp.207-213
• /
• 2019

In this paper, we evaluate the communication performance of convolutional code with block interleaving in a frequency-selective channel. Block interleaving is a technique for spreading and rearranging digital data streams. A block interleaving technique is applied to improve the performance by dispersing the concentration of burst errors in a frequency-selective channel. As a result of evaluating the performance of the convolutional code with block interleaving in the water tank experiment, There was no difference in the performance of convolutional codes using block interleaving in a frequency-selective channel. However, in the frequency-selective channel, the convolutional code with block interleaving has a gain of 2dB, and it is confirmed that the underwater acoustic communication performance is improved.

• Proceedings of the IEEK Conference
• /
• 2000.06b
• /
• pp.230-233
• /
• 2000

A parallel concatenated convolutional coding scheme consists of two constituent systematic convolutional encoders linked by an interleaver. The information bits at the input of the first encoder are scrambled by the interleaver before entering the second encoder.〔1〕-〔3〕Now many different interleavers are presented for Turbo code. The topic of this paper is to design of the interleaver which is for IS-2000 Turbo code.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1115-1125
• /
• 1994

In this paper, an efficient concatenated coding scheme under the satellite channel is presented. The performance of this scheme in terms of bit error rate versus energy per information bit over white gaussian noise power density E/N has been evaluated via computer simulation as a function of various system parameters. To achieve accuracy in simulation results, the distortions caused from the satellite channel, such as the nonlinearity of the TWTA(traveling wave tube amplifier), signal distortions of the input and output filters, has been considered. The simulation results show that, through using the 2/3 punctured convolutional code as the inner code of the concatenated code system, the coding rate can be improved more over 16%, while maintaining the same system complexity and bit error performance.