• Title/Summary/Keyword: block code

Search Result 766, Processing Time 0.026 seconds

The Effect of Block Interleaving in an LDPC-Turbo Concatenated Code

  • Lee, Sang-Hoon;Joo, Eon-Kyeong
    • 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.

  • PDF

Two-Dimensional Symmetric Balance Incomplete Block Design Codes for Small Input Power (작은 입력신호를 위한 Two-Dimensional Symmetric Balance Incomplete Block Design Code)

  • Jhee, Yoon Kyoo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.5
    • /
    • pp.121-127
    • /
    • 2013
  • When input power is small, nonideal symmetric balance incomplete block design(BIBD) code design is effective in the spectral-amplitude-code(SAC) optical code-division multiple-access (OCDMA) system. But the number of simultaneous users is not sufficient. To overcome this property, we propose 2-D BIBD codes, where nonideal BIBD codes are used as spectral code and ideal BIBD codes are used as spatial codes. Analytical results show that the number of simultaneous users increases significantly.

Spectral Efficiency 0f Symmetric Balance Incomplete Block Design Codes (Symmetric Balance Incomplete Block Design Code의 Spectral Efficiency)

  • Jhee, Yoon Kyoo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.1
    • /
    • pp.117-123
    • /
    • 2013
  • By calculating the spectral efficiency of symmetric balance incomplete block design(BIBD) codes satisfying BER=$10^{-9}$, it can be found that ideal BIBD code design with m=2 and various q's is effective when effective power is high($P_{sr}=-10$ dBm). But BIBD code design with q > 2 and various m's can be effective when effective power is low($P_{sr}=-25$ dBm).

Optical CDMA Network Codecs with Symmetric Balance Incomplete Block Design Code and Arrayed-Waveguide Grating (Symmetric Balance Incomplete Block Design Code와 Arrayed-Waveguide Grating을 이용한 Optical CDMA Network Codecs)

  • Jhee, Yoon-Kyoo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.49 no.5
    • /
    • pp.22-29
    • /
    • 2012
  • By using the cyclic properties of symmetric balance incomplete block design(BIBD) codes and arrayed-waveguide grating(AWG) routers, a compact optical CDMA network coder-decoder(codec) can be constructed. It can be observed that the various code families obtained by BIBD improve the BER performance compared to M-sequence code.

A Study on Performance in Space-Time Block Code (Space-Time Block Code에서의 성능에 관한 연구)

  • 이은희;김종성
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.64-66
    • /
    • 2002
  • 공간-시간 부호(Space-Time Code)는 다중 안테나 시스템에서 기존의 기술에 비해서 부가적인 대역폭이 필요 없이 부호화 이득을 얻을 수 있다. 지금까지 공간-시간 부호(Space-Time Code)는 다이버시티 이득의 관점에서는 신호행렬들의 차가 완전-계수(Full-Rank)를 가져야 하고, 코딩 이득의 관점에서는 신호행렬들의 차의 determinant 값이 최소값을 가져야 한다. 본 논문에서는 공간-시간 블록 부호 디자인(Space-Time Block Code) 관점에서 직교-디자인(Orthogonal-design) 즉, 최소거리가 5이면서 완전-계수(Full-Rank)인 디자인을 비교대상으로 완전-계수(Full-Rank)가 아니면서 최소거리가 5와7인두 부호에 관하여 연구되어졌다.

  • PDF

A Code Block Cipher Method to Protect Application Programs From Reverse Engineering (응용프로그램 역분석 방지를 위한 코드블록 암호화 방법)

  • Jung, Dong-Woo;Kim, Hyong-Shik;Park, Joong-Gil
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.2
    • /
    • pp.85-96
    • /
    • 2008
  • One of the typical methods to prevent tampering and reverse engineering on executable codes is to encrypt them. This paper proposes a code block cipher method based on key chaining to encrypt the code. The block cipher by key chaining has been known to be inadequate for encrypting the code with control transfer, even though the key chaining has advantage of hiding the keys in blocks and making the individual keys different from block to block. This paper proposes a block transformation and duplication method to apply the block cipher by key chaining to the executable codes with control transfer instructions, and shows the idea works with the MIPS instruction set.

Application of Block Turbo Code for Improving the Performance of 5 ㎓ IEEE 802,11a WLAN System (5 ㎓대 IEEE 802.11a WLAN 시스템의 성능향상을 위한 블록터보코드(Block Turbo Code)의 응용)

  • 김한종;이병남
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.15 no.1
    • /
    • pp.21-28
    • /
    • 2004
  • In this paper we apply block turbo coding at the transmitter and iterative decoding algorithm at the receiver for different operating modes, based on the 5 ㎓ IEEE 802.1 la WLAN system, instead of convolutional coding and soft decision viterbi algorithm to improve forward error correcting performance. Experimental results showed that each coding scheme outperforms coding gains of up to 3.5 ㏈ at the BER of 10$\^$-3/.

Transform Trellis Image Coding Using a Training Algorithm (훈련 알고리듬을 이용한 변환격자코드에 의한 영상신호 압축)

  • 김동윤
    • Journal of Biomedical Engineering Research
    • /
    • v.15 no.1
    • /
    • pp.83-88
    • /
    • 1994
  • The transform trellis code is an optimal source code as a block size and the constraint length of a shift register go to infinite for stationary Gaussian sources with the squared-error distortion measure. However to implement this code, we have to choose the finite block size and constraint length. Moreover real-world sources are inherently non stationary. To overcome these difficulties, we developed a training algorithm for the transform trellis code. The trained transform trellis code which uses the same rates to each block led to a variation in the resulting distortion from one block to another. To alleviate this non-uniformity in the encoded image, we constructed clusters from the variance of the training data and assigned different rates for each cluster.

  • PDF

Concrete Stress Block Parameters for High-Strength Concrete : Recent Developments and Their Impact

  • Bae, Sun-Gjin
    • International Journal of Concrete Structures and Materials
    • /
    • v.18 no.1E
    • /
    • pp.11-16
    • /
    • 2006
  • The use of the current ACI 318 stress block parameters has been reported to provide unconservative estimations of the moment capacities for high-strength concrete columns. Accordingly, several concrete stress block parameters have been recently proposed. This paper discusses various concrete stress block parameters for high-strength concrete and their influences on the code provisions. In order to adopt the proposed stress block parameters to the design code, it is necessary to understand the impact of the change of the stress block parameters on various aspects of the code provisions. For this purpose, the influence of using of different stress block parameters on the location of the neutral axis and the tensile strain in extreme tension steel as well as the axial and moment capacities are investigated. In addition, the influence on the prestressed concrete members is also elucididated.

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.