• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.295-300
• /
• 2002

In this paper, we apply the 3-dimension algorithm to the random interleaver and s-random interleaver and analyze the performance of the turbo code system with random interleaver (or s-random interleaver). In general, the performance of interleaver is determined by minimum distance between neighbor data, thus we could improve the performance of interleaver by increasing the distance of the nearest data. The interleaver using 3-dimension algorithm has longer minimum distance and average distance compared to existing random-interleaver (s-random interleaver) because the output data is generated randomly from 3-dimension storage. To verify and compare the performance of our proposed system, the computer simulations have been performed in turbo code system under gaussian noise environment.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.536-541
• /
• 2000

Turbo code has excellent decoding performance but had limitations for real time communications because of the system complexity and time delay in decoding procedure. To overcome this problem, a new SRI(Semi-Random Interleaver) algorithm which realize the reduction of the interleaver size is proposed for reducing the time delay during the decoding prodedure. SRI compose the interleaver 0.5 size from the input data sequence. In writing the interleaver, data is recorded by row such as block interleaver. But, in reading, data is read by randomly and the text data is located by the just address simultaneously. Therefore, the processing time of with the preexisting method such as block, helical random interleaver.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.5
• /
• pp.1067-1075
• /
• 2000

In this paper, the performance of 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 the constraint length of turbo code using seim random interleaver and convolutional code is constant, and BER $10^{-4}$ each value of $E_b/N_o$ was 6.4(DB) and 1.7(dB). There(ore, when the constraint length was constant, we proved that the performance of turbo code using semi random interleaver is superior to convolutional code about 4.7(dB) in the case of BER=$10^{-4}$.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.788-791
• /
• 2005

In this paper, We propose performance of improvement method for eHDR-WPAN system using Interleaver. Burst error pattern caused by fading in indoor wireless channel. for the reason, using of Interleave method (make burst error to random error) can be enhance to error-rate in system. This paper is used Convolutional, Block, Random Interleaver. We make use of 9 and 27 for symbol spacing. Block-Interleaver is show that performance about 0.6dB of E$_b$/N$_o$ at $10^{-4}$. In result, the suitable Interleaver for eHDR-WPAN system is Block Interleaver of 9 symbol spacing.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2473-2483
• /
• 2000

In this paper, The turbo code is used to effectively remove noise which is generated on the image communication channel. Turbo code had excellent decoding performance. However, it had limitations for real time communication because of the system complexity and time delay in decoding procedure. To overcome this problem, this paper proposed a new SRI(Semi Random Interleaved algorithm, which decrease the time delay, when the image data, which reduced the interleaver size of turbo code encoder and decoder, transmitted. The SRI algorithm was composed of 0.5 interleaver size from input frame sequence. When the data inputs in interleaver, the data recorded by row such as block interleaver. But, When the data read in interleaver, the data was read by randomly and the next data located by the just address simultaneously. Therefore, the SRI reduced half-complexity when it was compared with pre-existing method such as block, helical, random interleaver. The image data could be the real time processing when the SRI applied to turbo code.

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

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1129-1134
• /
• 2006

In this paper, we analyze the cycle structure of punctured finite-length RA-type LDPC codes and design interleavers which have good memory efficiency and avoid short cycles. Furthermore, we introduce the check-node merging scheme for punctured finite-length RA-type LDPC codes and design simple interleavers. Simulation results show that punctured finite-length RA-type LDPC codes using the proposed simple interleavers have better performance than those with random and S-random interleavers.

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

In digital communications systems, an interleaver spreads burst errors occurred in channels and makes it random errors. As a result, the signals are rearranged and encrypted to the 3rd party. Deinterleaving this unknown interleaved signal is very important in electronic warfare and various researches on reconstruction of interleaved signal have been studied in the literature. Unlike previous researches which is mainly about helical scan interleaver or bit unit interleaver, in this paper, we estimate the symbol unit convolutional interleavr and shortened Reed-Solomon code parameters such as the number of stages of interleaver, a codeword length and a data symbol length and propose an specific algorithm to obtain the parameters from the unknown interleaved signal and simulate this algorithm as well.