• Title/Summary/Keyword: 길쌈 디인터리버

Search Result 3, Processing Time 0.016 seconds

Low-Power DTMB Deinterleaver Structure Using Buffer Transformation and Single-Pointer Register Structure (버퍼 변환과 단일 위치 레지스터 구조를 이용한 저전력 DTMB 디인터리버 구조)

  • Kang, Hyeong-Ju
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.5
    • /
    • pp.1135-1140
    • /
    • 2011
  • This paper proposes a DTMB deinterleaver structure to reduce the SDRAM power consumption with buffer conversion and the single pointer-register structure. The DTMB deinterleaver with deep interleaving for higher performance consists of long delay buffers allocated on SDRAM. The conventional structure activates a new SDRAM row almost everytime when it reads and writes a datum. In the proposed structure, long buffers are transformed into several short buffers so that the number of row activations is reduced. The single pointer-register structure solves the problem of many pointer-registers. The experimental results show that the SDRAM power consumption can be reduced to around 37% with slight logic area reduction.

Blind Block Deinterleaving using Convolutional Code Reconstruction Method (길쌈 부호 복원 기법을 이용한 블라인드 블록 디인터리빙)

  • Jeong, Jin-Woo;Yoon, Dong-Weon;Park, Cheol-Sun;Yun, Sang-Bom;Lee, Sang-Hyeon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.9
    • /
    • pp.10-16
    • /
    • 2011
  • Interleaving is applied to prevent from exceeding the error-correction capability of channel code. At the receiver, burst errors are converted into random errors after deinterleaving, so the error-correction capability of channel code is not exceeded. However, when a receiver does not have any information on parameters used at an interleaver, interleaving can be seen as an encryption with some pattern. In this case, deinterleaving becomes complicated. In the field of blind deinterleaving, there have recently been a number of researches using linearity of linear block code. In spite of those researches, since the linearity is not applicable to a convolutional code, it is difficult to estimate parameters as in a linear block code. In this paper, we propose a method of blind block deinterleaving using convolutional code reconstruction method.

Estimation of Convolutional Interleaver Parameters using Linear Characteristics of Channel Codes (채널 부호의 선형성을 이용한 길쌈 인터리버의 파라미터 추정)

  • Lee, Ju-Byung;Jeong, Jeong-Hoon;Kim, Sang-Goo;Kim, Tak-Kyu;Yoon, Dong-Weon
    • 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.