|
|
 |
| |
|
|
|
Error Rate Analysis of Sliding Window Algorithm in Turbo Decoding |
|
|
|
PP: 191-203 |
|
|
|
doi:10.18576/amis/13S120
|
|
|
|
Author(s) |
|
|
|
V. Pushpa,
H. Ranganathan,
M. Palanivelan,
|
|
|
|
Abstract |
|
|
| The performance analysis of coding is the error rate analysis which finds the probability of bit being error in the data transmission. The errors should be minimized for the better reception in the wireless communication. This paper presents a different approach of turbo decoding by implementing and sliding window algorithm in iterative turbo decoding. Sliding window algorithm is combined with turbo codes to improve the latency problem and large memory requirement. In this method the entire trellis is divided into small length sequence of several windows and the turbo decoding algorithms are applied only on those windows instead of running over the entire trellis. The performance of the coding is measured particularly by Bit Error Rate. The performance degrade in the sliding window turbo decoding algorithm is measured and it is improved by introducing proposed method of overlap sliding window algorithm is implemented in iterative decoding. By using this method the BER performance of the turbo code is improved over sliding window turbo decoding method. The number of computations is computed and compared for both sliding window turbo decoding and overlap sliding window turbo decoding method. The experimental results showed that the proposed method of overlap sliding window algorithm has better error performance than the sliding window turbo decoding method.
|
|
|
|
|
|
|
|
