• Title/Summary/Keyword: Channel decoding

Search Result 408, Processing Time 0.021 seconds

The performance analysis and optimal conditions for Viterbi decoding over the Gaussian channel (가우스 채널 상에서의 비터비 디코딩에 대한 성능 분석 및 최적 조건 고찰)

  • Won, Dae-Ho;Jung, Hui-Sok;Yang, Yeon-Mo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.357-359
    • /
    • 2010
  • The Viterbi Decoding is one of the most researched areas of the convolutional decoding methods. In this paper, we use various parameters for the substantial Viterbi decoding and discuss some viterbi decoding methods. And, the viterbi algorithms of the methods, we discuss 'Hard Decision' and 'Soft Decision'. So, we compare differences of two methods about decoding methods, performance. Because of having various parameters and decision methods, we discuss the values of various parameter and decision methods in the Gaussian channel about the viterbi decoding methods.

  • PDF

An FPGA Implementation of High-Speed Adaptive Turbo Decoder

  • Kim, Min-Huyk;Jung, Ji-Won;Bae, Jong-Tae;Choi, Seok-Soon;Lee, In-Ki
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4C
    • /
    • pp.379-388
    • /
    • 2007
  • In this paper, we propose an adaptive turbo decoding algorithm for high order modulation scheme combined with originally design for a standard rate-1/2 turbo decoder for B/QPSK modulation. A transformation applied to the incoming I-channel and Q-channel symbols allows the use of an off-the-shelf B/QPSK turbo decoder without any modifications. Adaptive turbo decoder process the received symbols recursively to improve the performance. As the number of iterations increase, the execution time and power consumption also increase as well. The source of the latency and power consumption reduction is from the combination of the radix-4, dual-path processing, parallel decoding, and early-stop algorithms. We implemented the proposed scheme on a field-programmable gate array (FPGA) and compared its decoding speed with that of a conventional decoder. From the result of implementation, we confirm that the decoding speed of proposed adaptive decoding is faster than conventional scheme by 6.4 times.

Iterative Decoding for a Turbo-Coded OFDM/CDMA System

  • Kim, Jin-Young
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.213-216
    • /
    • 2001
  • In this paper, the performance of an OFDM/CDMA system with turbo coding is analyzed and simulated in a multipath fading channel. Bit error probability is derived fDr a Rayleigh fading channel. In an OFDM/CDMA system, an OFDM and a CDMA techniques are combined to exploit the advantages of both techniques. For decoding of turbo code, MAP decoding algorithm is employed. From the simulation results. it is demonstrated that turbo coding offers considerable coding gain with reasonable encoding/decoding complexity. Also, it is shown that the BER performance is substantially improved by increasing the interleaver length for a fixed code rate and the increasing number of iterations used in the decoding process. The results in the paper can be applied to the design of OFDM-based CDMA system.

  • PDF

Performance for a Space-time Coded DS-CDMA system with arrival time difference in a Rayleigh fading channel (도착시간차가 존재하는 레일레이 폐이딩 채널에서 시공간부호화된 DS-CDMA 시스템의 성능)

  • 이주현;이재홍
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.9-12
    • /
    • 2001
  • In this paper, the natural space-time coding is applied for a DS-CDMA system with multiple transmit/receive antennas in a Rayleigh fading channel. With difference of arrival times from transmit antennas a modified maximum likelihood (ML) decoding algorithm is proposed for the space-time coded DS-CDMA system. The proposed decoding algorithm performs ML decoding over the transition of two consecutive branches by using a modified branch metric with the partial autocorrelation. By simulation, it is shown that the proposed decoding algorithm achieves significant performance improvement over the ML decoding algorithm without the modified branch metric.

  • PDF

A turbo code with reduced decoding delay (감소된 복호지연을 갖는 Turbo Code)

  • 김준범;문태현;임승주;주판유;홍대식;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.7
    • /
    • pp.1427-1436
    • /
    • 1997
  • Turbo codes, decoded through an iterative decoding algorithm, habe recently been shown to yidel remarkable coding gains close to theoretical limits in the Gaussian channel environment. This thesis presents the performance of Turbo code through the computer simulation. The performance of modified Turbo code is compared to that of the conventional Turbo codes. The modified Turbo code reduces the time delay in decoding with minimal effect to the performance for voice transmission sytems. To achieve the same performance, random interleaver the size of which is no less than the square root of the original one should be used. Also, the modified Turbo code is applied to MC-CDMA system, and its performance is analyzed under the Rayleigh Fading channel environment. In Rayleigh fading channel environment, due to the amplitude distortion caused by fading, the interleaver of the size twice no less than that in the Gaussian channel enironment was required. In overall, the modified Turbo code maintained the performance of the conventional Turbo code while the time delay in transmission and decoding was reduced at the rate of multiples of two times the squared root of the interleaver size.

  • PDF

Improved Physical Layer Implementation of VANETs

  • Khan, Latif Ullah;Khattak, M. Irfan;Khan, Naeem;Khan, Atif Sardar;Shafi, M.
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.3
    • /
    • pp.142-152
    • /
    • 2014
  • Vehicular Ad-hoc Networks (VANETs) are comprised of wireless mobile nodes characterized by a randomly changing topology, high mobility, availability of geographic position, and fewer power constraints. Orthogonal Frequency Division Multiplexing (OFDM) is a promising candidate for the physical layer of VANET because of the inherent characteristics of the spectral efficiency and robustness to channel impairments. The susceptibility of OFDM to Inter-Carrier Interference (ICI) is a challenging issue. The high mobility of nodes in VANET causes higher Doppler shifts, which results in ICI in the OFDM system. In this paper, a frequency domain com-btype channel estimation was used to cancel out ICI. The channel frequency response at the pilot tones was estimated using a Least Square (LS) estimator. An efficient interpolation technique is required to estimate the channel at the data tones with low interpolation error. This paper proposes a robust interpolation technique to estimate the channel frequency response at the data subcarriers. The channel induced noise tended to degrade the Bit Error Rate (BER) performance of the system. Parallel concatenated Convolutional codes were used for error correction. At the decoding end, different decoding algorithms were considered for the component decoders of the iterative Turbo decoder. A performance and complexity comparison among the various decoding algorithms was also carried out.

Jeju Jong-Nang Channel Code III (제주 정낭(錠木) 채널 Code III)

  • Park, Ju-Yong;Kim, Jeong-Su;Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.91-103
    • /
    • 2015
  • This paper presents "The 3-User NOR switching channel based on interference decoding with receiver cooperation" in succession to "Jeju Jong Nang channel code I, II". The Jeju Jong Nang code is considered as one of the earliest human binary coded communication (HBCC) in the world with a definite "1" or "0" binary symbolic analysis of switching circuits. In this paper, we introduce a practical example of interference decoding with receiver cooperation based on the three user Jong Nang NOR switching channel. The proposed system models are the three user Jong Nang (TUJN) NOR logic switching on-off, three-user injective deterministic NOR switching channel and Gaussian interference channel (GIC) with receiver cooperation. Therefore, this model is well matched to Shannon binary symmetric and erasure channel capacity. We show the applications of three-user Gaussian interference decoding to obtain deterministic channels which means each receiver cooperation helps to adjacent others in order to increase degree of freedom. Thus, the optimal sum rate of interference mitigation through adjacent receiver cooperation achieves 7 bits.

Generalized SCAN Bit-Flipping Decoding Algorithm for Polar Code

  • Lou Chen;Guo Rui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.4
    • /
    • pp.1296-1309
    • /
    • 2023
  • In this paper, based on the soft cancellation (SCAN) bit-flipping (SCAN-BF) algorithm, a generalized SCAN bit-flipping (GSCAN-BF-Ω) decoding algorithm is carried out, where Ω represents the number of bits flipped or corrected at the same time. GSCAN-BF-Ω algorithm corrects the prior information of the code bits and flips the prior information of the unreliable information bits simultaneously to improve the block error rate (BLER) performance. Then, a joint threshold scheme for the GSCAN-BF-2 decoding algorithm is proposed to reduce the average decoding complexity by considering both the bit channel quality and the reliability of the coded bits. Simulation results show that the GSCAN-BF-Ω decoding algorithm reduces the average decoding latency while getting performance gains compared to the common multiple SCAN bit-flipping decoding algorithm. And the GSCAN-BF-2 decoding algorithm with the joint threshold reduces the average decoding latency further by approximately 50% with only a slight performance loss compared to the GSCAN-BF-2 decoding algorithm.

Performance Of Iterative Decoding Schemes As Various Channel Bit-Densities On The Perpendicular Magnetic Recording Channel (수직자기기록 채널에서 기록 밀도에 따른 반복복호 기법의 성능)

  • Park, Dong-Hyuk;Lee, Jae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7C
    • /
    • pp.611-617
    • /
    • 2010
  • In this paper, we investigate the performances of the serial concatenated convolutional codes (SCCC) and low-density parity-check (LDPC) codes on perpendicular magnetic recording (PMR) channels. We discuss the performance of two systems when user bit-densities are 1.7, 2.0, 2.4 and 2.8, respectively. The SCCC system is less complex than LDPC system. The SCCC system consists of recursive systematic convolutional (RSC) codes encoder/decoder, precoder and random interleaver. The decoding algorithm of the SCCC system is the soft message-passing algorithm and the decoding algorithm of the LDPC system is the log domain sum-product algorithm (SPA). When we apply the iterative decoding between channel detector and the error control codes (ECC) decoder, the SCCC system is compatible with the LDPC system even at the high user bit density.

Joint Virtual User Identification and Channel Security En/Decoding Method for Ad hoc Network

  • Zhang, Kenan;Li, Xingqian;Ding, Kai;Li, Li
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.11
    • /
    • pp.241-247
    • /
    • 2022
  • Ad hoc network is self-organized network powered by battery. The reliability of virtual user identification and channel security are reduced when SNR is low due to limited user energy. In order to solve this problem, a joint virtual user identification and channel security en/decoding method is proposed in this paper. Transmitter-receiver-based virtual user identification code is generated by executing XOR operation between orthogonal address code of transmitter and pseudo random address code of receiver and encrypted by channel security code to acquire orthogonal random security sequence so as to improve channel security. In order to spread spectrum as well as improve transmission efficiency, data packet is divided into 6-bit symbols, each symbol is mapped with an orthogonal random security sequence. Subspace-based method is adopted by receiver to process received signal firstly, and then a judgment model is established to identify virtual users according to the previous processing results. Simulation results indicate that the proposed method obtains 1.6dB Eb/N0 gains compared with reference methods when miss alarm rate reaches 10-3.