• The Journal of the Acoustical Society of Korea
• /
• 제15권1E호
• /
• pp.89-94
• /
• 1996

This paper deals with the application of the LMS algorithm as a decision-directed adaptive equalizer in a communication receiver which also employs a sophisticated decoding scheme such as the Viterbi algorithm, in which the desired signal, hence the error, is not available until several symbol intervals later because of decoding delay. In such applications the implemented weight updating algorithm becomes DLMS and major penalty is reduced convergence speed. Therefore, every effort should by made to keep the delay as small as possible if it is not avoidable. In this paper we present a modified implementation in which the effects of the decoding delay can be avioded and perform some computer simulations to check the validity and the performance of the new implementation.

• 한국전자파학회논문지
• /
• 제14권8호
• /
• pp.816-822
• /
• 2003

본 논문에서는 전력이 제한된 환경에서 사용이 고려되고 있는 터보 TCM(Turbo Trellis Coded Modulation)에 대하여 낮은 복잡도를 갖는 효율적인 반복복호 제어기법을 제안한다. 터보 부호의 복호 과정에서 반복 복호수를 증가하면 성능이 향상되지만 어느 정도의 반복 복호수 이상에서는 성능 향상이 거의 나타나지 않는다. 따라서 복호 계산량과 복호지연을 감소시킬 수 있도록 반복 복호과정을 효율적으로 정지시킬 수 있는 반복복호 제어가 필요하다. 본 논문은 복호지연 및 반복복호 첫수를 줄일 수 있는 효율적인 알고리즘을 제시한다. 제안 기법은 터보 TCM 복호화 과정에서 궤환되는 외부부가정보의 특성에 따른 임계치를 이용하여 반복 복호수를 가변적으로 제어하는 기법이다. 성능 분석 결과 제안구조는 복호과정의 계산량과 지연을 성능 저하 없이 효율적으로 감소시킬 수 있음을 보여준다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 하계종합학술대회 논문집(1)
• /
• pp.39-42
• /
• 2004

Turbo codes, proposed by Berrou, that increase the interleaver size and the number of iteration have better than conventional convolutional codes, in case of BER performance. However, because turbo codes has been required much decoding delay to increase iteration number, it demands unnecessary iterative decoding. Therefore, in this paper, we propose iterative decoding stop criterion that uses the variance of absolute value of LLR. This algorithm can be reduced average iterative decoding number and had lossless performance of BER, because of decreasing unnecessary iterative decoding.

• 한국통신학회논문지
• /
• 제19권12호
• /
• pp.2376-2385
• /
• 1994

디지털 TV 신호를 수신함에 있어서 복호화 지연과 채널변경 지연은 응용측면에서 매우 중요한 요소들이다. B-화면이 없는 MPEG-2의 SIMPLE PROFILE에서 intra-slice 부호화방식은 영상 복호화과정에서 지연시간을 짧게 하는 근원적인 방식들 중의 하나이다. 그 방식에는 복호화 지연시간은 짧은 장점이 있으나 채널변경 지연시간은 길어지는 단점이 있다. 본 논문에서는, SNR 성능의 손실은 무시할 수 있을 만큼 적게 하며 채널변경 지연을 줄이는 방법을 제안한다. 이를 위해서 슬라이스들의 여러 영역으로 화면들을 구분하고 화면간 부호화를 위한 이동벡터 추정에서 약간의 제한을 부가하며, 이로 인해 임의접근 위치가 효과적으로 증가되고, 채널변경 지연시간이 줄어듬을 확인한다.

• 산업공학
• /
• 제4권1호
• /
• pp.63-69
• /
• 1991

In this paper, the Go-Back-N ARQ protocol with decoding in communication network is considered. The time delay and throughput are respectively analyzed as a function of window size and decoding time out. Packets arrive continuously at the decoder, and are stored in a buffer if the decoder is busy upon its arrival. The decoder devotes no more than a time-out period of predetermined length to the decoding of any single packet. If packet decoding is completed within that period, the packet leaves the system. Otherwise, it is retransimitted and its decoding starts anew. The time delay and throughput are obtained using recursive formula and difference equation. An appropriate time out and window size that satisfies the grade of service can be determined.

• 전자공학회논문지A
• /
• 제30A권3호
• /
• pp.16-33
• /
• 1993

New decoding algorithm of double-error-correction Reed-Solmon codes over GF(2$^{8}$) for optical compact disks is proposed and decoding algorithm of RS codes with triple-error-correcting capability is presented in this paper. First of all. efficient algorithms for estimating the number of errors in the received code words are presented. The most complex circuits in the RS decoder are parts for soving the error-location numbers from error-location polynomial, so the complexity of those circuits has a great influence on overall decoder complexity. One of the most known algorithm for searching the error-location number is Chien's method, in which all the elements of GF(2$^{m}$) are substituted into the error-location polynomial and the error-location number can be found as the elements satisfying the error-location polynomial. But Chien's scheme needs another 1 frame delay in the decoder, which reduces decoding speed as well as require more stroage circuits for the received ocode symbols. The ther is Polkinghorn method, in which the roots can be resolved directly by solving the error-location polynomial. Bur this method needs additional ROM (readonly memory) for storing tthe roots of the all possible coefficients of error-location polynomial or much more complex cicuit. Simple, efficient, and high speed method for solving the error-location number and decoding algorithm of double-error correction RS codes which reudce considerably the complexity of decoder are proposed by using Hilbert theorems in this paper. And the performance of the proposed decoding algorithm is compared with that of conventional decoding algorithms. As a result of comparison, the proposed decoding algorithm is superior to the conventional decoding algorithm with respect to decoding delay and decoder complexity. And decoding algorithm of RS codes with triple-error-correcting capability is presented, which is suitable for error-correction in digital audio tape, also.

• 한국통신학회논문지
• /
• 제22권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1144-1158
• /
• 2016

In this paper, delay-constrained data transmission is considered over error-prone networks. Network coding is deployed for efficient information exchange, and an approximate decoding approach is deployed to overcome potential all-or-nothing problems. Our focus is on determining the cluster size and its impact on approximate decoding performance. Decoding performance is quantified, and we show that performance is determined only by the number of packets. Moreover, the fundamental tradeoff between approximate decoding performance and data transfer rate improvement is analyzed; as the cluster size increases, the data transfer rate improves and decoding performance is degraded. This tradeoff can lead to an optimal cluster size of network coding-based networks that achieves the target decoding performance of applications. A set of experiment results confirms the analysis.

• 융합신호처리학회논문지
• /
• 제2권2호
• /
• pp.62-67
• /
• 2001

최근의 이동통신 시스템에서 오류 정정 부호화 방식으로 사용되는 터보 코드의 성능은 부호기에 내재되어 부호의 자유 거리 결정에 큰 영향을 미치는 인터리버와 복호기에서 수행되는 반복 복호에 의한 것이다. 하지만 우수한 성능을 얻기 위해 수신과정에서 많은 지연시간이 요구되는데 이는 주로 인터리버의 크기에 의존하게 된다. 또한 터보 코드는 페이딩 채널 상에서도 신뢰성 있는 강력한 코딩 기법으로 알려져, 최근 ITU 등에서 IMT-2700과 같은 차세대 이동 통신에서 채널 코드의 표준으로 채택되었다. 따라서 본 논문에서는 복잡도는 2배로 증가하나 성능을 개선시킨 병렬 구조의 4-New 터보 복호기를 제안하고, 차세대 무선 멀티미디어 통신에서 실시간 음성 및 비디오 서비스를 제공 시 복호 지연시간을 단축시키기 위해 가변 복호 방법을 이용하여 AWGN과 페이딩 채널 환경에서의 컴퓨터 모의 실험을 통해 성능 분석을 하였다.

• 정보통신설비학회논문지
• /
• 제8권4호
• /
• pp.207-215
• /
• 2009

In recent digital communication systems, the performance of Turbo Code used as the error correction coding method depends on the interleaver size influencing the free distance determination and iterative decoding algorithms of the turbo decoder. However, some iterations are needed to get a better performance, but these processes require large time delay. Recently, methods of reducing the number of iteration have been studied without degrading original performance. In this paper, the new method combining ME (Mean Estimate) stopping criterion with SDR (sign difference ratio) stopping criterion of previous stopping criteria is proposed, and the fact of compensating each method's missed detection is verified Faster decoding realizes that reducing the number of iterative decoding about 1~2 times by adopting our proposed method into serially concatenation of both decoder. System Environments were assumed DS-CDMA forward link system with intense MAI (multiple access interference).