• Title/Summary/Keyword: Concatenated code

Search Result 112, Processing Time 0.03 seconds

The Concatenated Coding Scheme for OFDM system over burst noise channel

  • Byung-Hyun, Moon;Sang-Min, Choi
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.9 no.2
    • /
    • pp.17-22
    • /
    • 2004
  • In this paper, a concatenated RS and Turbo code is proposed for OFDM system over burst error channel. The concatenated code used in this study is a RS(255,202) code and a rate 1/2 turbo code. The turbo code uses 2 recursive systematic convolutional (RSC) code as the constituent codes and the parity bit are punctured to get the desired code rate. It is shown by simulation that the conventional OFDM system fails when there exists burst noise. The concatenated RS and turbo code obtains at least 5dB gain over the turbo code at the bit error probability of 10/sup -3/.

  • PDF

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

Concatenated Code System for Mobile Fading Channel (이동통신 페이딩 채널에서의 CONCATENATED 코드 시스템)

  • 박형진;정호영;홍대식;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.1
    • /
    • pp.1-9
    • /
    • 1993
  • In this paper, a new digital mobile channel has been modeled. And concatenated code systems have been proposed to transmit information reliably in the newly modeled mobile fading channels. The BCH code has been used as the outer code and the convolutional code as the inner code. We have modeled the channels which have multipath fading phenomena and additive white Gaussian noise. As a result, the characteristics of the channels are identical to that of the mobile fading channel. To find the best code system, we have tested (7, 4), (63, 45), (63, 57) and (31.26) BCH codes as an outer code. Results show that the concatenated code with (7, 4) outer code gives the best performance. And if we use the soft decision, we can improve about 2 -6 dB in the SNR

  • PDF

A Study on the Efficient Concatenated Code on the Diffusion-based Molecular Communication Channel (확산기반 분자통신 채널에 효율적인 직렬 연결 부호에 관한 연구)

  • Cheong, Ho-Young
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.15 no.4
    • /
    • pp.230-236
    • /
    • 2022
  • In this paper, we propose an efficient concatenated code for both random and ISI errors on diffusion-based molecular communication channels. The proposed concatenated code was constructed by combining the ISI-mitigating code designed for ISI mitigation and the ISI-Hamming code strong against random errors, and the BER(bit error rate) performance was analyzed through simulation. In the case of the above M=1,200 channel environment, it was found that the error rate performance of the concatenated code follows the error rate performance of the ISI-mitigating code, which is strong against ISI, and follows the error rate performance of the ISI-Hamming code, which is strong against random errors, in the channel environment below M=600. In M=600~1,200, the concatenated code shows the best error rate performance among those of three codes, which is analyzed because it can correct both random errors and errors caused by ISI. In the following cases of below M=800, it can be seen that the error rate of the concatenated code and the ISI-mitigating code shows an error rate difference of about 1.0×10-1 on average.

A Study on a concatenated RS code and Turbo code for OFDM system over burst noise channel

  • Choi Sang Min;Moon Byung Hyun;Park Jong Soo
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.649-652
    • /
    • 2004
  • In this paper, a concatenated RS and Turbo code is proposed for OFDM system over burst error channel. The concatenated code used in this study is a RS(255,2D2) code and a rate 1/2 turbo code. The turbo code uses 2 recursive systematic convolutional (RSC) code as the constituent codes and the parity bit are punctured to get the desired code rate. It is shown by simulation that the conventional OFDM system fails when there exists burst noise. The concatenated RS and turbo code obtains at least 5dB gain over the turbo code at the bit error probability of $10^{-3}$.

  • PDF

Concatenated Coding System for an Effective Error Correction (효율적인 에러 정정을 위한 콘케티네이티드 코팅 시스템)

  • Kang, Beob Joo;Kang, Chang Eon
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.23 no.3
    • /
    • pp.309-316
    • /
    • 1986
  • A concatenated coding system using a binary code as the inner code and a nonbinary code as the outer code has been constructed for the purpose of error correction. The complexity of a conventional coding system grows exponentially as the code length of a block code becomes longer. To reduce the complexity for ling code, an effective communication system has been proposed by cascading two codes-binary and norbinary codes. Using a parallel-to-serial circuit and a serial-to-parallel circuit, the concatenated coding system has been designed and constructed by empolying a (7,3) burst error correcting code as the inner code and a (7,3) Reed-Solomon code as the outer code. This system has been simulated and tested using a micro-computer. For the (49,9) concatenated coding system, the error probability of the channel has been evaluated and compared to different coding systems.

  • PDF

Serially Concatenated Space-Time Code using Iterative Decoding of High Data Rate Wireless Communication (고속 무선 통신을 위한 반복 복호 직렬 연쇄 시.공간 부호)

  • 김웅곤;구본진;양하영;강창언;홍대식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4A
    • /
    • pp.519-527
    • /
    • 2000
  • This paper suggests and analyzes the Serially Concatenated Space-Time Code(SCSTC) with the possibility of a efficient high-speed transmission in a band limited channel. The suggested code has a structure that uses the interleaver to connect the space-time code as an inner code and the convolutional code as a outer code serially. This code keeps the advantage of high-speed transmission and also has the high BER performance. The performance of the suggested system is compared with the conventional bandwidth efficient trellis coded modulation, such as a Serially Concatenated Trellis Coded Modulation (SCTCM) and a Turbo-Trellis Coded Modulation(Turbo-TCM). The results show that the suggested system has a 2.8dB and 3dB better BER performance than SCTCM and Turbo-TCM respectively in case of the transmission rate 2b/s/Hz in fading channel.

  • PDF

Synchronous Optical Fiber Code-Division Multiple-Access Networks Using Concatenated Codes for Channel Interference Cancellation

  • Lam, Pham Manh;Sripimanwat, Keattisak
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.536-539
    • /
    • 2002
  • The use of concatenated codes in noncoherent synchronous optical fiber CDMA networks is proposed. The concatenated code sequences are generated using balanced Walsh code sequences and Walsh code sequences. The selection of balanced Walsh code sequences is presented and the design of fully programmable transmitter and receiver is reported. The analysis of the system BER performance shows that multiple-access interference is completely eliminated and the BER performance of the proposed system is better than that of the non-coherent synchronous optical fiber CDMA system using optical orthogonal codes with double hard-limiters.

  • PDF

LDPC Decoding by Failed Check Nodes for Serial Concatenated Code

  • Yu, Seog Kun;Joo, Eon Kyeong
    • ETRI Journal
    • /
    • v.37 no.1
    • /
    • pp.54-60
    • /
    • 2015
  • The use of serial concatenated codes is an effective technique for alleviating the error floor phenomenon of low-density parity-check (LDPC) codes. An enhanced sum-product algorithm (SPA) for LDPC codes, which is suitable for serial concatenated codes, is proposed in this paper. The proposed algorithm minimizes the number of errors by using the failed check nodes (FCNs) in LDPC decoding. Hence, the error-correcting capability of the serial concatenated code can be improved. The number of FCNs is simply obtained by the syndrome test, which is performed during the SPA. Hence, the decoding procedure of the proposed algorithm is similar to that of the conventional algorithm. The error performance of the proposed algorithm is analyzed and compared with that of the conventional algorithm. As a result, a gain of 1.4 dB can be obtained by the proposed algorithm at a bit error rate of $10^{-8}$. In addition, the error performance of the proposed algorithm with just 30 iterations is shown to be superior to that of the conventional algorithm with 100 iterations.

Optimum Inner and Outer Code Rates for Concatenated Codes in Gaussian Binary Symmetric Channels (가우시안 이진 대칭 채널에서 쇄상부호의 최적 내.외 부호율에 관한 연구)

  • Lee, Ye Hoon
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.2
    • /
    • pp.110-113
    • /
    • 2014
  • In this paper, we address a problem of finding the optimum inner and outer code rates for a concatenated code in Gaussian binary symmetric channels. Clearly, as the inner code rate decreases, the error detection capability of the inner code increases. However, decreasing the inner code rate implies a decrease in error-correction capability of the outer code when overall code rate is fixed. With this notion in mind, we examine the optimum distribution of redundancy on the outer and inner codes to achieve a maximum performance gain in the concatenated coding scheme. Our analysis shows that the maximum coding gain can be obtained when the inner code rate is maximized and the outer code rate is minimized under the constraint of total code rate is fixed.