A New Algorithm without Exponential and Logarithmic Computations in Iterative Decoding for Double Binary Convolutional Turbo Code

Author

Zhan, Ming ; Zhou, Liang ; Wang, Chen

Author_Institution

Nat. Key Lab. of Sci. & Lechnology on Commun., Univ. of Electron. Sci. & Lechnology of China, Chengdu, China

fYear

2011

Firstpage

1

Lastpage

4

Abstract

This paper proposes a new and modified MAP algorithm for double binary convolutional turbo code (DB CTC) based on a new definition of branch metrics. The exponential and logarithmic operations in the convolutional algorithm are not needed in the iterative process after a date pre-processing of the received sequence. Furthermore, computational complexity analysis of branch metrics and performance simulation are also presented to demonstrate the effectiveness of our modified algorithm.

Keywords

binary codes; communication complexity; iterative decoding; turbo codes; MAP algorithm; branch metrics; computational complexity; date preprocessing; double binary convolutional turbo code; exponential computation; iterative decoding; iterative process; logarithmic computation; Algorithm design and analysis; Approximation algorithms; Convolutional codes; Decoding; Iterative decoding; Measurement; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on

Conference_Location

Wuhan

ISSN

2161-9646

Print_ISBN

978-1-4244-6250-6

Type

conf

DOI

10.1109/wicom.2011.6040175

Filename

6040175