On finite-precision implementation of a decoder for turbo codes
- 20 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 423-426
- https://doi.org/10.1109/iscas.1999.780032
Abstract
[[abstract]]© 1999 Institute of Electrical and Electronics Engineers - In this paper, we have investigated the finite-precision effects on a decoder for turbo codes based on the Log-BCJR algorithm. As for the numerical accuracy, we have empirically found that three bits are adequate for representing the decimal fractions of the variables in this algorithm. Furthermore, these variables have different numerical ranges for different signal-to-noise ratios, thus requiring different numbers of bits for representing them. By observing their minimum and maximum values through computer simulations, we have decided the proper number of bits for representing these variables. Simulation results have indicated that the scheme we have developed for determining the finite-precision parameter set of a turbo decoder based on the Log-BCJR algorithm is effective in approximating the performance of the same decoder with infinite-precision implementation[[department]]電機工程學Keywords
This publication has 5 references indexed in Scilit:
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domainPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Terminating the trellis of turbo-codes in the samestateElectronics Letters, 1995
- Reduced complexity symbol detectors with parallel structure for ISI channelsIEEE Transactions on Communications, 1994
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974