Further analysis of pairing-based traitor tracing schemes for broadcast encryption
Security and Communication Networks
| Hi-index | 0.00 |
Turbo decoder estimates message values sent from transmitter by computing iteratively to get the maximum posteriori probability. It will be inefficient if the number of iteration is set irrationally. To reduce decoding process latency, lots of stopping criteria for Turbo decoding were proposed [1-8]. Those methods also increase computation complexity at each iteration. The computation complexity may become issue in the real implementation in terms of gate count, power consumption, and computing latency in the end. In this paper, we propose a novel stopping criterion called Convolution-Sum (CS) stopping criterion with lower computation complexity. Turbo decoding achieves more efficiency with CS stopping criterion. The result of simulation indicates that the number of iteration with CS stopping criterion will be reduced by 30% at most when the signal-to-noise ratio is between 0.5dB and 2dB while maintaining Turbo decoding performance.