Home > Research > Publications & Outputs > Comparison of convolutional and turbo coding sc...

Electronic data

  • TB07 Published Journal

    Final published version, 635 KB, PDF document

    Available under license: None


Text available via DOI:

View graph of relations

Comparison of convolutional and turbo coding schemes for broadband FWA systems

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>06/2007
<mark>Journal</mark>IEEE Transactions on Broadcasting
Issue number2
Number of pages10
Pages (from-to)494-503
Publication StatusPublished
<mark>Original language</mark>English


It has been demonstrated that turbo codes substantially outperform other codes, e.g., convolutional codes, both in the non-fading additive white Gaussian noise (AWGN) channel as well as multiple-transmit and multiple-receive antenna fading channels. Moreover, it has also been reported that turbo codes perform very well in fast fading channels, but perform somewhat poorly on slow and block fading channels of which the broadband fixed wireless access (FWA) channel is an example. In this paper, we thoroughly compare the performance of turbo-coded and convolutional-coded broadband FWA systems both with and without antenna diversity under the condition of identical complexity for a variety of decoding algorithms. In particular, we derive mathematical expressions to characterize the complexity of turbo decoding based on state-of-the-art Log-MAP and Max-Log-MAP algorithms as well as convolutional decoding based on the Viterbi algorithm in terms of the number of equivalent addition operations. Simulation results show that turbo codes do not offer any performance advantage over convolutional codes in FWA systems without antenna diversity or FWA systems with limited antenna diversity. Indeed, turbo codes only outperform convolutional codes in FWA systems having significant antenna diversity.