• Title/Summary/Keyword: Spread random interleaver

Search Result 3, Processing Time 0.015 seconds

High-Spread Interleaver based Interleave-Division Multiple Access Scheme for the 4G System

  • Chung, Yeon-Ho
    • 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.

  • PDF

A Spread Random Interleaver based Efficient DES Algorithm for Personal Cloud Computing Environments (개인 클라우드 컴퓨팅 환경을 위한 스프레드 랜덤 인터리버 기반의 효율적인 DES 알고리즘)

  • Chung, Yeon Ho
    • 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).

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.