• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.6 s.97
• /
• pp.556-562
• /
• 2005

In this paper, we propose interleaved super-orthogonal convolutional coded ultra wide-band impulse radio(ISOC-UWB-IR) system, and analyze its performance. The proposed system uses interleaver and deinterleaver to decorrelate the temporal correlation of the fading process and to obtain the diversity gain. We also suggest the three types of interleavers, which are pulse-wise interleaver(PI), pulse sub-group-wise interleaver(PSGI), and pulse group-wise interleaver(PGI). Performance analysis result shows that the interleaving scheme, rather than the code rate of super orthogonal convolutional code(SOC) encoder, affects the performance for the Rayleigh fading channel.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.861-868
• /
• 2001

In this paper, the performance of Reed Solomon(RS)/convolution리 concatenated codes and turbo code using semi random interleaver over the radio communication channel was analyzed. In the result, we proved that the performance of decoder was excellent as increase the interleaver size, constraint length, and iteration number. When turbo code using semi random interleaver and Hsiconvolutional concatenated codes was constant constraint length L=5, BER=10-4 , each value of $E_b/N_o$ was 4.5〔dB〕 and 2.95〔dB〕. Therefore, when the constraint length was constant, we proved that the performance of turbo code is superior to RS/Convolutional concatenated codes about 1.55〔dB〕 in the case of BER=10-4.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.41-48
• /
• 2013

An efficient encryption algorithm based on the Data Encryption Standard (DES) for personal cloud computing environments is presented. The proposed algorithm improves data privacy, security and also encryption speed, compared with the triple DES. The improvement of the proposed algorithm stems from enhanced privacy inherent from the use of spread random interleaver in the place of the known substitution table for initial and final permutations in the DES algorithm. The simulation results demonstrate that the interleaver based DES (I-DES) is found to run faster than the triple DES algorithm and also offer improved security. The proposed algorithm also offers encryption for variable-length data using the Cipher Block Chaining (CBC).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.999-1021
• /
• 2023

Differential spatial modulation uses the antenna index to transmit information, which improves the spectral efficiency, and completely bypasses any channel side information in the recommended setting. A generalized distributed multiple turbo coded-cooperative differential spatial modulation based on distributed multiple turbo code is put forward and its performances in Rayleigh fading channels is analyzed. The generalized distributed multiple turbo coded-cooperative differential spatial modulation scheme is a coded-cooperation communication scheme, in which we proposed a new joint parallel iterative decoding method. Moreover, the code matched interleaver is considered to be the best choice for the generalized multiple turbo coded-cooperative differential spatial modulation schemes, which is the key factor of turbo code. Monte Carlo simulated results show that the proposed cooperative differential spatial modulation scheme is better than the corresponding non-cooperative scheme over Rayleigh fading channels in multiple input and output communication system under the same conditions. In addition, the simulation results show that the code matched interleaver scheme gets a better diversity gain as compared to the random interleaver.

• ETRI Journal
• /
• v.28 no.5
• /
• pp.672-675
• /
• 2006

The effect of block interleaving in a low density parity check (LDPC)-turbo concatenated code is investigated in this letter. Soft decoding can be used in an LDPC code unlike the conventional Reed-Solomon (RS) code. Thus, an LDPC-turbo concatenated code can show better performance than the conventional RS-turbo concatenated code. Furthermore, the performance of an LDPC-turbo code can be improved by using a block interleaver between the LDPC and turbo code. The average number of iterations in LDPC decoding can also be reduced by a block interleaver.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.10
• /
• pp.2687-2702
• /
• 1996

It is desirable that the implementation of next generation information infrastructure is the Integrated Network combining the satellite and the terrestrial network. The application of the ATM network being the dominant infrastrure of terrestrial network to the satellite network is being studied variously. Considering these concepts, this paper analyzes due to ATM transport via satellite, evaluates the degradation of QoS and proposes reliable method of ATM cell transport via satellite. Because ATM is investigated with the optical fiber which is almost error free characteristics, the practical application of ATM transport via satellite essentially need the channel coding(FEC:Forward Error Correction) to enhance BER performance. But using the FEC coding, satellite link has burst error characteristics which evoke severe performance degradation fo ATM QoS. Therefore in satellite link, we analyze burst error characteristics using experimental results of computer simulation. Then to compensate these characteristics, based on this analysis and HEC dual mode algorithm we propose various interleaver structures(Block interleaver, Intra interlever, and Inter-Intra interleaver) to improve cell transmission QoS. We execute performance evaluations of iterleaver structures by computer simulation.

• Journal of Korea Multimedia Society
• /
• v.11 no.6
• /
• pp.828-834
• /
• 2008

This paper presents high-spread (HS) random interleavers based interleave-division multiple access (IDMA) scheme for the 4th generation mobile radio system. High-spread feature of a random interleaver offers high-spread characteristics to interleavers and thus produces extrinsic values with low correlation. As interleavers are key components for user separation in the IDMA, the HS interleavers with this feature are employed and analyzed in the IDMA for performance improvement. In addition, by replacing random interleavers with the HS interleavers in the IDMA, bandwidth efficiency is achieved by means of reducing the length of the repetition code. Performance evaluation shows that the proposed scheme of the IDMA with the HS interleavers provides superior BER performance and improved bandwidth efficiency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.550-552
• /
• 2014

In this paper, we propose an interleaver reconstruction method for punctured channel coded signals. We calculate the ratio of the number of '1' bits to the number of '0' bits in the matrix which is generated by a Gaussian elimination process. Then, we can reconstruct an interleaver by checking the minimum values of the ratio that have a smaller ratio than a certain threshold. We validate the proposed method through computer simulations.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.07a
• /
• pp.447-449
• /
• 2015

Advanced television systems commitee (ATSC) 3.0 은 효율적 주파수 사용을 위하여 여러 개의 방송 스트림을 계층 분할하여 전송하는 layered division multiplexing (LDM) 기술과 연집오류에 의한 성능저하를 방지하기 위하여 시간 인터리버 (time interleaver) 기술을 채택하였다. 본 논문에서는 LDM 기반 시간 인터리버 기술의 각 계층별 성능을 모의실험을 통하여 다양한 채널 환경에서 평가하고 효과를 분석하였다.