Powiadomienia systemowe
- Sesja wygasła!
- Sesja wygasła!
Tytuł artykułu
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
A novel approach for approximating the max* operator, used in the Log-MAP decoding algorithm, is presented. In this approximation it is not necessary to use any additional correction term, as previous approximation methods require. Several decoding algorithms are obtained for both turbo and turbo trellis-coded modulation (TTCM) codes with optimal and near-optimal bit error rate (BER) performance depending on a single parameter, namely the number of piecewise-linear (PWL) approximation terms used. The decoding complexity is estimated, showing the practical implementation advantages of the proposed method against the Log-MAP algorithm.
Czasopismo
Rocznik
Tom
Strony
435--451
Opis fizyczny
Bibliogr. 16 poz., wykr.
Twórcy
autor
autor
autor
autor
autor
autor
- Chair of Wireless Communications, Poznań University of Technology, Poznań, Poland, {msybis ; tyczka}@et.put.poznan.pl ; {spapaha, mathio}@space.noa.gr
Bibliografia
- 1. C. Berrou, A. Glavieux and P. Thitimajshima: Near Shannon limit error correcting coding and decoding: Turbo codes. Proc. IEEE Int. Conf. Commun. (ICC), pp. 1064-1070, Geneva, Switzerland, 1993
- 2. P. Robertson and T. Worz: Bandwidth-efficient turbo trellis-coded modulation using punctured component codes, IEEE J. Sel. Areas Commun., vol. 16, pp. 206-218, Feb. 1998
- 3. G. Ungerboeck: Channel coding with multilevel/phase signals, IEEE Trans. Inform. Theory, vol. IT-28, pp. 55-67, Jan. 1982
- 4. L. R Bahl, J. Cocke, F. Jelinek and J. Raviv: Optimal decoding of linear codes for minimizing symbol error rate, IEEE Trans. Inf. Theory, IT-20, vol. 3, pp. 284-287, 1974
- 5. P. Robertson, E. Villebrun, and P. Hoeher: A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain, Proc. IEEE Int. Conf. Commun. (ICC), pp. 1009-1013, Seattle, USA, Jun. 1995
- 6. P. Robertson, P. Hoeher, and E. Villebrun: Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding, European. Trans. Telecomm., vol. 8, pp. 119-125, Mar.-Apr. 1997
- 7. A. J. Viterbi: An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes, IEEE J. Sel. Areas Commun., vol. 16, pp. 260-264, Feb. 1998
- 8. W. J. Gross and P. G. Gulak: Simplified MAP algorithm suitable for implementation of turbo decoders, Electron. Lett., vol. 34, no. 16, pp. 1577-1578, Aug. 1998
- 9. J. F. Cheng and T. Ottosson: Linearly approximated Log-MAP algorithms for turbo decoding, Proc. IEEE Vehic. Techn. Conf. (VTC), Spring, pp. 2252-2256, Tokyo, Japan, May 2000
- 10. B. Classon, K. Blankenship, and V. Desai: Channel coding for 4G systems with adaptive modulation and coding, IEEE Wireless Commun. Mag., vol. 9, no. 2, pp. 8-13, Apr. 2002
- 11. H. Wang, H. Yang, and D. Yang: Improved Log-MAP decoding algorithm for turbo-like codes, IEEE Commun. Letters, vol.10, no. 3, pp. 186-188, Mar. 2006
- 12. S. Talakoub, L. Sabeti, B. Shahrrava, M. Ahmadi: An improved Max-Log-MAP algorithm for turbo decoding and turbo equalization, IEEE Trans. Instrum. Meas., vol.56, no. 3, pp. 1058-1063, Jun. 2007
- 13. K. L. Hsiung, S. J. Kim, and S. Boyd: Tractable approximate robust geometric programming, Springer Optim. Eng. Journal, vol. 9, no. 2, pp. 95-118, Jun. 2008
- 14. M. Sybis, P. Tyczka, S. Papaharalabos, and P. T. Mathiopoulos: Reduced-complexity algorithms for near-optimal decoding of turbo TCM codes, Electron. Lett., vol. 45, no. 5, pp. 278-280, Feb. 2009
- 15. C. B. Schlegel and L. C. Perez: Trellis and Turbo Coding, Wiley and Sons, Inc., 2004
- 16. J. Vogt and A. Finger: Improving the Max-Log-MAP turbo decoder, IEE Electron. Lett., vol. 36, no. 23, pp. 1937-1939, Nov. 2000
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BWA0-0041-0016