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

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

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

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.857-864
• /
• 2002

Channel coding is one of the most important things to improve digital communications. In this paper, we analyze the performance of turbo code with block interleaver using hopping algorithm (i. e., non-linear interleaver) for high speed multi-media service. The input and output of conventional block interleaver is achieved by the order of column and row, but hoping algorithm is achieved by hopping the column and row that increase the minimum distance and average distance between the nearest data dually. To verify and compare the performance of an proposed method the computer simulation have been performed using turbo code in gaussian channel environment.

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

• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.417-421
• /
• 2005

In the recent digital communication systems, the performance of Turbo Code using the error correction coding depends on the interleaver influencing the free distance determination and the recursive decoding algorithms that is executed in the turbo decoder. However, performance depends on the interleaver depth that needs many delays over the reception process. Moreover, turbo code has been known as the robust coding methods with the confidence over the fading channel. International Telecommunication Union(ITU) has recently adopted it as the standardization of the channel coding over the third generation mobile communications(IMT-2000). Therefore, in this paper, we proposed the interleaver that has the better performance than existing block interleaver, and modified turbo decoder that has the parallel concatenated structure using MAP algorithm. In the real-time voice and video service over third generation mobile communications, the performance of the proposed two methods was analyzed and compared with the existing methods by computer simulation in terms of reduced decoding delay using the variable decoding method over AWGN and fading channels for CDMA environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2C
• /
• pp.161-166
• /
• 2008

In the parallel-architecture turbo codes, the constituent interleaver must avoid memory collision. This paper proposes a collision-free interleaver structure composed of a Latin square matrix and pre-designed interleavers. Our proposed interleavers can be easily optimized for various information block sizes and for various degrees of parallelism. Their performances were evaluated by computer simulation.