Low Complexity Turbo Decoding
Download:
by Peter Haase
http://www.phaase.net/itg2002_lowcomplexityturbodecoding.pdf
Add To MetaCart
Abstract:
Abstract — In this paper a truncated turbo decoding with reduced computational complexity is proposed. In the course of iterative decoding, bits are detected that will be changed very unlikely in the current iteration step. These bits are excluded from decoding (in the current iteration step) which yields a turbo decoding with much lower complexity while the loss of bit error rate (BER) is quiet small. I.
Citations
| 788 | Near Shannon limit error-correcting coding and decoding: turbo codes – Berrou, Glavieux, et al. - 1993 |
| 273 | Iterative decoding of binary block and convolutional codes – Hagenauer, Offer, et al. - 1996 |
| 21 | Two simple stopping criteria for turbo decoding – Shao, Lin, et al. - 1999 |
| 1 | Truncated turbo decoding with reduced computational complexity,” Accepted for publication in Kluwer Wireless Personal Communications – Haase, Rohling |
| 1 | et al., “Iterative (turbo) decoding of systematic convolutional codes with the – Hagenauer - 1994 |
