• Title/Summary/Keyword: %EB%9E%A9%EB%B7%B0

Search Result 1, Processing Time 0.018 seconds

Performance analysis on the complexity of turbo code with short frame sizes (프레임 크기가 작은 터보 코드의 복잡도에 대한 성능 분석)

  • Kim, Yeun-Goo;Ko, Young-Hoon;Kim, Nam
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7A
    • /
    • pp.1046-1051
    • /
    • 1999
  • It is well known that Parallel Concatenated Convolutional Codes(turbo codes) has a good performance for long block sizes. This thesis has analyzed the performance of turbo code which is based on voice or control frames with short frame sizes in the future mobile communication system. Also, at the similar decoding complexity, the performance of turbo code and convolutional codes in the speech/control frames, and the applicability of this system are considered. As a result, turbo code in short frame sizes present the performance of a BER of $10^{-3}$ or more over 3 iterations in the future mobile communication system. However, at a BER of $10^{-3}$ , if the same complexity is considered, the performance of rate 1/2 turbo code with K = 5 is better than that of convolutional code with K = 9 at low $E_b/N_0$, and the performance of turbo code with K = 3 is superior to that of convolutional code with K = 7. Rate 1/3 turbo code with K = 3 and 5 have similar to performance of rate 1/2 turbo code.

  • PDF