• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.81-83
• /
• 2006

This Paper suggests efficient design method which is used by Bit_Inerleaver in the IEEE 802.15,3.a. Bit_Interleaver is consist of Symbol_Interleaver and Tone_Interleaver Each Interleaver is designed by using memory. In other to resolve burst error, Block Interleaver is using different leading and writing address for mixing the data. However This method has a different reading and writing memory address to realize Block Interleaver so this schematic is some complex. This Paper suggests efficient and simple Bit_Interleaver Method which classify the memory of Bit_Interleavr to reduce complexity of shcemeatic.

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

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.718-720
• /
• 2000

Turbo Code is one of the most useful and powerful channel coding technique. It is adopted in radio transmission of IMT-2000, both CDMA2000 and W-CDMA system. The performance of this code depends on many parameters such as encoder memory size, free distance of codewords, interleaver size, number of decoding iteration, and so on. This paper describes a Multi-Stage Interleaver which is used in Turbo Codes for W-CDMA channel coding. We compare the performance of a Multi-Stage Interleaver with that of Mother Interleaver. The simulation results show that Multi-Stage Interleaver performs better than Mother Interleaver in bit error rate from $10^{-3}$ to $10^{-6}$.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.15-23
• /
• 2011

An interleaver rearranges a channel-encoded data in the symbol unit to spread burst errors occurred in channels into random errors. Thus, the interleaving process makes it difficult for a receiver, who does not have information of the interleaver parameters used in the transmitter, to de-interleave an unknown interleaved signal. Recently, various researches on the reconstruction of an unknown interleaved signal have been studied in many places of literature by estimating the interleaver parameters. They, however, have been mainly focused on the estimation of the block interleaver parameters required to reconstruct the de-interleaver. In this paper, as an extension of the previous researches, we estimate the convolutional interleaver parameters, e.g., the number of shift registers, a shift register depth, and a codeword length, required to de-interleave the unknown data stream, and propose the de-interleaving procedure by reconstructing the de-interleaver.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5C
• /
• pp.384-392
• /
• 2012

Recently, much research on blind estimation of the interleaver parameters has been performed by using Gauss-Jordan elimination to find the linearity of the block channel code. When using Gauss-Jordan elimination, the input data to be calculated needs to run as long as the square multiple of the number of the interleaver period. Thus, it has a limit in estimating the interleaver parameters with insufficient input data. In this paper, we introduce and analyze an estimation algorithm which can estimate interleaver parameters by using only 15 percent of the input data length required in the above algorithm. The shorter length of input data to be calculated makes it possible to estimate the interleaver parameters even when limited data is received. In addition, a 80 percent reduction in the number of the interleaver period candidates increases the efficiency of analysis. It is also feasible to estimate both the type and size of the interleaver and the type of channel coding.

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

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

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.161-164
• /
• 2000

Given the frame size and constituent encoders, interleaver plays a central role in a turbo code performance. Interleaver should be designed to generate a heavy weight codeword in the second encoder if the first encoder generates a low weight codeword. In this paper we present a search procedure for high performace interleaver whose performance is measured by computing union bound using the weight spectrum of all the weight 2, 3

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