• Title/Summary/Keyword: Block turbo code

Search Result 58, Processing Time 0.026 seconds

Improved Orthogonal Code Hopping Multiplexing Using Both Division and Hopping

  • Kwon, Jae-Kyun;Park, Su-Won;Sung, Dan-Keun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3A
    • /
    • pp.277-285
    • /
    • 2008
  • We previously proposed an Orthogonal Code Hopping Multiplexing (OCHM) scheme for statistical multiplexing on a synchronous downlink. OCHM enables a large number of users to share a limited number of code channels through statistical multiplexing. We here improve the performance of OCHM by prioritizing encoded symbols according to their importance using both the conventional code division and the previously proposed code hopping multiplexing schemes. Prioritization is useful for channel coding schemes with different levels of importance for encoded symbols such as turbo-codes. Scheme performance is evaluated by simulation in terms of the required Eb/N0 for a 1% block error rate.

Analysis of the performance of Turbo codes on 3GPP2 (3GPP2에 적용된 터보부호의 성능 분석)

  • Hyeon, Seong-Hwan;Lee, Gyeong-Su;Park, Sin-Cheong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.37 no.2
    • /
    • pp.1-6
    • /
    • 2000
  • In this paper, simulations are performed using standards proposed by 3GPP and 3GPP2. From the view point of performance analysis based on Turbo code specification, performance of Turbo code in AWGN, proposed by 3GPP, is compared. To make comparison, experimental result of Turbo code that is performed on one of the many block sizes proposed by 3GPP2 in Rayleigh fading channel, is provided. Performance of Turbo decoders using Max_Log MAP and Log MAP are compared.

  • PDF

FPGA Design of Turbo Code based on MAP (MAP 기반 터보코드의 FPGA 설계)

  • Seo, Young-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3C
    • /
    • pp.306-313
    • /
    • 2007
  • In this paper, we efficiently implemented turbo code algorithm in FPGA H/W(hardware) resource. The used turbo code algorithm has the characteristics; the size of constraint is 3, encoder type is 1/3, the size of random interleaver is 2048. The proposed H/W consists of MAP block for calculating alpha and delta using delta value, storing buffer for each value, multiplier for calculating lamda, and lamda buffer. The proposed algorithm and H/W architecture was verified by C++ language and was designed by VHDL. Finally the designed H/W was programmed into FPGA and tested in wireless communication environment for field availability. The target FPGA of the implemented H/W is VERTEX4 XC4VFX12-12-SF363 and it is stably operated in 131.533MHz clock frequency (7.603ns).

A New Semi-Random Imterleaver Algorithm for the Noise Removal in Image Communication (영상통신에서 잡음 제거를 위한 새로운 세미 랜덤 인터리버 알고리즘)

  • Hong, Sung-Won;Park, Jin-Soo
    • 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.

  • PDF

Augmented QSBC(Quantum Short-Block Code)-QURC(Quantum Unity-Rate Code)(II) with Pauli X,Y,Z error detection (파울리 X,Y,Z 오류검출 기능을 갖는 증강된 QSBC(Quantum Short-Block Code)-QURC(Quantum Unity-Rate Code)(II))

  • Dong-Young Park;Sang-Min Suh;Baek-Ki Kim
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.3
    • /
    • pp.495-508
    • /
    • 2023
  • This paper proposes a method to find out the type and location information of Pauli X, Y, Z errors generated in quantum channels using only the quantum information processing part of the multiple-rate quantum turbo short-block code without external help from the classical information processing part. In order to obtain the location information of the Pauli X,Y error, n-auxiliary qubits and n-CNOT gates were inserted into the C[n,k,2] QSBC-QURC encoder. As a result, the maximum coding rate is limited to about 1/2 as the trade-off characteristics. The location information of the Pauli Z error for C[n,k,2] QSBC-QURC was obtained through the Clifford-based stabilizer measurement. The proposed method inherits all other characteristics of C[n,k,2] QSBC-QURC except for the coding rate.

A High Speed Block Turbo Code Decoding Algorithm and Hardware Architecture Design (고속 블록 터보 코드 복호 알고리즘 및 하드웨어 구조 설계)

  • 유경철;신형식;정윤호;김근회;김재석
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.7
    • /
    • pp.97-103
    • /
    • 2004
  • In this paper, we propose a high speed block turbo code decoding algorithm and an efficient hardware architecture. The multimedia wireless data communication systems need channel codes which have the high-performance error correcting capabilities. Block turbo codes support variable code rates and packet sizes, and show a high performance due to a soft decision iteration decoding of turbo codes. However, block turbo codes have a long decoding time because of the iteration decoding and a complicated extrinsic information operation. The proposed algorithm using the threshold that represents a channel information reduces the long decoding time. After the threshold is decided by a simulation result, the proposed algorithm eliminates the calculation for the bits which have a good channel information and assigns a high reliability value to the bits. The threshold is decided by the absolute mean and the standard deviation of a LLR(Log Likelihood Ratio) in consideration that the LLR distribution is a gaussian one. Also, the proposed algorithm assigns '1', the highest reliable value, to those bits. The hardware design result using verilog HDL reduces a decoding time about 30% in comparison with conventional algorithm, and includes about 20K logic gate and 32Kbit memory sizes.

Improvement of Normalized CMA Channel Equalization and Turbo Code for DS-CDMA System (DS-CDMA 시스템을 위한 터보 부호와 정규화 CMA 채널 등화 개선)

  • 박노진;강철호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.7A
    • /
    • pp.659-667
    • /
    • 2002
  • In this dissertation, in the Turbo Code used for error correction coding of the recent digital communication systems, we propose a new S-R interleaver that has the better performance than the existing block interleaver, and the Turbo Decoder that has the parallel concatenated New structure using the MAP algorithm. For real-time voice and video services over the third generation mobile communications, the performance of two proposed methods is analyzed by the reduced decoding delay using the variable decoding method by computer simulation over multipath channels of DS-CDMA system. Also, a Modified NCMA based on conventional NCMA is proposed to improve the channel efficiency in the mobile communication system, and is investigated over the multi-user environment of DS-CDMA system through computer simulation.

A Design of Turbo Decoder using MAP Algorithm (MAP 알고리즘을 이용한 터보 복호화기 설계)

  • 권순녀;이윤현
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.8
    • /
    • pp.1854-1863
    • /
    • 2003
  • In the recent digital communication systems, the performance of Turbo Code using the mr correction coding depends on the interleaver influencing the free distance determination and the recursive decoding algorithms that is executed in the huh decoder. However, performance depends on the interleaver depth that needs many delays over the reception process. Moreover, turbo code has been blown 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 preposed 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.

Double Binary Turbo Coded Data Transmission of STBC UWB Systems for U-Healthcare Applications

  • Kim, Yoon-Hyun;Kim, Eun-Cheol;Kim, Jin-Young
    • International journal of advanced smart convergence
    • /
    • v.1 no.1
    • /
    • pp.27-33
    • /
    • 2012
  • In this paper, we analyze and simulate performance of space time block coded (STBC) binary pulse amplitude modulation-direct sequence (BPAM-DS) ultra-wideband (UWB) systems with double binary turbo code in indoor environments for various ubiquitous healthcare (u-healthcare) applications. Indoor wireless channel is modeled as a modified Saleh and Valenzuela (SV) model proposed as a UWB indoor channel model by the IEEE 802.15.SG3a in July 2003. In the STBC encoding process, an Alamouti algorithm for real-valued signals is employed because UWB signals have the type of real signal constellation. It is assumed that the transmitter has knowledge about channel state information. From simulation results, it is shown that the STBC scheme does not have an influence on improving bit error probability performance of the BPAM-DS UWB systems. It is also confirmed that the results of this paper can be applicable for u-healthcare applications.

Phase offset estimation scheme of using STBC with Turbo-code in Fading channel (페이딩 채널에서 STBC와 터보부호 기반의 위상오프셋 추정 기법)

  • Lee, Cheon-Ho;Ryu, Jung-Gon;Heo, Jun
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.1047-1048
    • /
    • 2006
  • In this paper, we present an iterative phase offset estimation algorithm based on a space-time block code and turbo coded system. External single phase estimator receives soft information from the turbo decoder and estimates phase offset with LMS algorithm. The estimated phase offset value is used for space-time decoder. Simulation results show the phase estimation gain in a flat fading channel.

  • PDF