• Title/Summary/Keyword: bit interleaving

Search Result 40, Processing Time 0.026 seconds

A Study on Turbo Equalization for MIMO Systems Based on LDPC Codes (MIMO 시스템에서 LDPC 부호 기반의 터보등화 방식 연구)

  • Baek, Chang-Uk;Jung, Ji-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.5
    • /
    • pp.504-511
    • /
    • 2016
  • In this paper, MIMO system based on turbo equalization techniques which LDPC codes were outer code and space time trellis codes (STTC) were employed as an inner code are studied. LDPC decoder and STTC decoder are connected through the interleaving and de-interleaving that updates each other's information repeatedly. In conventional turbo equalization of MIMO system, BCJR decoder which decodes STTC coded bits required two-bit wise decoding processing. Therefore duo-binary turbo codes are optimal for MIMO system combined with STTC codes. However a LDPC decoder requires bit unit processing, because LDPC codes can't be applied to these system. Therefore this paper proposed turbo equalization for MIMO system based on LDPC codes combined with STTC codes. By the simulation results, we confirmed performance of proposed turbo equalization model was improved about 0.6dB than that of conventional LDPC codes.

An Image Watermarking Method for Embedding Copyrighter's Audio Signal (저작권자의 음성 삽입을 위한 영상 워터마킹 방법)

  • Choi Jae-Seung;Kim Chung-Hwa;Koh Sung-Shik
    • The Journal of the Acoustical Society of Korea
    • /
    • v.24 no.4
    • /
    • pp.202-209
    • /
    • 2005
  • The rapid development of digital media and communication network urgently brings about the need of data certification technology to protect IPR (Intellectual property right). This paper proposed a new watermarking method for embedding owner's audio signal. Because this method uses an audio signal as a watermark to be embedded, it is very useful to claim the ownership aurally. And it has the advantage of restoring audio signal modified and especially removed by image removing attacks by applying our LBX(Linear Bit-expansion) interleaving. Three basic stages of our watermarking include: 1) Encode . analogue owner's audio signal by PCM and create new digital audio watermark, 2) Interleave an audio watermark by our LBX; and 3) Embed the interleaved audio watermark in the low frequency band on DTn (Discrete Haar Wavelet Transform) of image. The experimental results prove that this method is resistant to lossy JPEG compression as standard image compression and especially to cropping and rotation which remove a part of Image.

A Study on Video Data Protection Method based on MPEG using Dynamic Shuffling (동적 셔플링을 이용한 MPEG기반의 동영상 암호화 방법에 관한 연구)

  • Lee, Ji-Bum;Lee, Kyoung-Hak;Ko, Hyung-Hwa
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.1
    • /
    • pp.58-65
    • /
    • 2007
  • This dissertation proposes digital video protection algorithm lot moving image based on MPEG. Shuffling-based encryption algorithms using a fixed random shuffling table are quite simple and effective but vulnerable to the chosen plaintext attack. To overcome this problem, it is necessary to change the key used for generation of the shuffling table. However, this may pose a significant burden on the security key management system. A better approach is to generate the shuffling table based on the local feature of an image. In order to withstand the chosen plaintext attack, at first, we propose a interleaving algorithm that is adaptive to the local feature of an image. Secondly, using the multiple shuffling method which is combined interleaving with existing random shuffling method, we encrypted the DPCM processed 8*8 blocks. Experimental results showed that the proposed algorithm needs only 10% time of SEED encryption algorithm and moreover there is no overhead bit. In video sequence encryption, multiple random shuffling algorithms are used to encrypt the DC and AC coefficients of intra frame, and motion vector encryption and macroblock shuffling are used to encrypt the intra-coded macroblock in predicted frame.

  • PDF

An interleaver design of low latency for IEEE 802.11a Wireless LAN (IEEE 802.11a 무선 랜에 적용할 Low Latency 인터리버 설계)

  • Shin, Bo-Young;Lee, Jong-Hoon;Park, June;Won, Dong-Youn;Song, Sang-Seob
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.200-203
    • /
    • 2003
  • By minimizing the burst error of data and correcting the error, we can define the convolution coding and interleaving in IEEE 802.11a wireless tan system. Two step block interleaver was decided by coded bits per OFDM symbol and due to this it comes to the delay time in IEEE 802.11a. This is the point of the question which we must consider. We try to decrease the delay time by all 48-clock from interleavings, and we have proposed a way carried out the interleaving outputs per symbol. So in comparison with the existing interleaver, we can decrease the delay time in reading and writing data, as well as reduce the delay time of bit re-ordering per symbol. Also this scheme is apply in all x-QAM cases.

  • PDF

A Low-Complexity Turbo coded BICM-ID System (Turbo coded BICM-ID의 복잡도 개선 기법)

  • Kang, Donghoon;Lee, Yongwook;Oh, Wangrok
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.8
    • /
    • pp.21-27
    • /
    • 2013
  • In this paper, we propose a low-complexity Turbo coded BICM-ID (bit-interleaved coded modulation with iterative decoding) system. A Turbo code is a powerful error correcting code with a BER (bit error rate) performance very close to the Shannon limit. In order to increase spectral efficiency of the Turbo code, a coded modulation combining Turbo code with high order modulation is used. The BER performance of Turbo-BICM can be improved by Turbo-BICM-ID using iterative demodulation and decoding algorithm. However, compared with Turbo-BICM, the decoding complexity of Turbo-BICM-ID is increased by exchanging information between decoder and demodulator. To reduce the decoding complexity of Turbo-BICM-ID, we propose a low-complexity Turbo-BICM-ID system. When compared with conventional Turbo-BICM-ID, the proposed scheme not only show similar BER performance but also reduce the decoding complexity.

Reduced-state sequence estimation for TC 8PSK/OFDM with 2-stage IDFT/DFTs (두단계 IDFT/DFT를 갖는 TC 8PSK/OFDM를 위한 RSSE 방식)

  • Kang Hoon-Chul;Ko Sang-Bo;Jwa Jeong-Woo
    • Proceedings of the IEEK Conference
    • /
    • 2004.06a
    • /
    • pp.147-150
    • /
    • 2004
  • In this paper, we propose a reduced-state sequence estimation (RSSE) for trellis coded modulation (TCM) in OFDM with two-stage IDFT/ DFTs, MMSE-LE, and interleaving on frequency selective Rayleigh fading channels. The Viterbi algorithm (VA) is used to search for the best path through the reduced-state trellis combined with equalization and TCM decoding. Computer simulations confirm the bit error probability of the proposed scheme.

  • PDF

Design of a physical layer of IEEE 802.15.4q TASK for IoT (IoT를 위한 IEEE 802.15.4q 기반 TASK 물리 계층 설계)

  • Kim, Sunhee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.16 no.1
    • /
    • pp.11-19
    • /
    • 2020
  • IoT has been consistently used in various fields such as smart home, wearables, and healthcare. Since IoT devices are small terminals, relatively simple wireless communication protocols such as IEEE 802.15.4 and ISO 18000 series are used. In this paper, we designed the 802.15.4q 2.4 GHz TASK physical layer. Physical protocol data unit of TASK supports bit-level interleaving and shortened BCH encoding. It is spread by unique ternary sequences. There are four spreading factors to choose the data rate according to the communication channel environment. The TASK physical layer was designed using verilog-HDL and verified through the loop-back test of the transceiver. The designed TASK physical layer was implemented in a fpga and tested using MAXIM RFICs. The PER was about 0% at 10 dB SNR. It is expected to be used in small, low power IoT applications.

Transmission Performance Analysis on Digital Multimedia Broadcasting System (이동멀티미디어방송 시스템의 전송성능 분석)

  • Lee, Hyun;Park, So-Ra;Yang, Kyu-Tea;Hamn, Young-Kwon;Lee, Soo-In
    • Journal of Broadcast Engineering
    • /
    • v.8 no.3
    • /
    • pp.228-237
    • /
    • 2003
  • Eureka-147 DAB(Digital Audio Broadcasting) system on which DMB(Digital Multimedia Broadcasting) system is based, was designed for the requirements of CD qualify audio with ${10}^{-4}$ bit error rate. Audio program may be primary service in DAB system, but multimedia program can be primary service in DMB system. Therefore, the bit error rate required must be below ${10}^{-7}$${10}^{-8}$ to transmit multimedia data via DMB channel. In order to meet the requirements and keep backward compatibility of DAB system we propose an outer channel coding scheme using Reed-Solomon coding and convolutional interleaving. This paper shows the simulation results for DMB channel performance based on mobile channel model. Also, it describes the needs and the effects of the outer channel coding.

High-Performance Low-Complexity Iterative BCH Decoder Architecture for 100 Gb/s Optical Communications (100 Gb/s급 광통신시스템을 위한 고성능 저면적 반복 BCH 복호기 구조)

  • Yang, Seung-Jun;Yeon, Jaewoong;Lee, Hanho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.7
    • /
    • pp.140-148
    • /
    • 2013
  • This paper presents a iterative Bose-Chaudhuri-hocquenghem (i-BCH) code and its high-speed decoder architecture for 100 Gb/s optical communications. The proposed architecture features a very high data processing rate as well as excellent error correction capability. The proposed 6-iteration i-BCH code structure with interleaving method allows the decoder to achieve 9.34 dB net coding gain performance at $10^{-15}$ decoder output bit error rate to compensate for serious transmission quality degradation. The proposed high-speed i-BCH decoder architecture is synthesized using a 90-nm CMOS technology. It can operate at a clock frequency of 430 MHz and achieve a data processing rate of 100 Gb/s. Thus, it has potential applications in next generation forward error correction (FEC) schemes for 100 Gb/s optical communications.

Motion Vector Recovery Scheme for H.264/AVC (H.264/AVC을 위한 움직임 벡터 복원 방법)

  • Son, Nam-Rye
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.5
    • /
    • pp.29-37
    • /
    • 2008
  • To transmit video bit stream over low bandwidth such as wireless channel, high compression algorithm like H.264 codec is exploited. In transmitting high compressed video bit-stream over low bandwidth, packet loss causes severe degradation in image quality. In this paper, a new algorithm for recovery of missing or erroneous motion vector is proposed. Considering that the missing or erroneous motion vectors in blocks are closely correlated with those of neighboring blocks. Motion vector of neighboring blocks are clustered according to average linkage algorithm clustering and a representative value for each cluster is determined to obtain the candidate motion vector sets. As a result, simulation results show that the proposed method dramatically improves processing time compared to existing H.264/AVC. Also the proposed method is similar to existing H.264/AVC in terms of visual quality.