Lancaster EPrints

Performance-complexity tradeoff of convolutional codes for broadband fixed wireless access systems

Chatzigeorgiou, I. and Demosthenous, A. and Rodrigues, M. R. D. and Wassell, I. J. (2010) Performance-complexity tradeoff of convolutional codes for broadband fixed wireless access systems. Iet communications, 4 (4). pp. 419-427. ISSN 1751-8628

Full text not available from this repository.

Abstract

In this study, the authors investigate the performance-complexity tradeoff of convolutional codes for broadband fixed wireless access systems by considering the effects of quantisation and path metric memory in practical Viterbi decoding implementations. They show that in systems with limited antenna diversity, low-memory codes achieve a better error-rate performance compared to that of high-memory codes. Only in systems with considerable antenna diversity, can the performance of a convolutional code be improved by increasing its memory size. Nevertheless, the authors demonstrate that the coding advantage offered by the high-memory codes is not large enough to justify the significant increase in implementation complexity. In particular, memory-2 convolutional codes achieve a coding gain of up to 1.2 dB over their memory-8 counterparts in single-input single-output fixed wireless access systems. The situation is reversed when multiple antennas are used, but the decoder of memory-8 codes occupies at least 130 times more silicon area than that of memory-2 codes.

Item Type: Article
Journal or Publication Title: Iet communications
Uncontrolled Keywords: VITERBI DECODER ; ALGORITHM
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments: Faculty of Science and Technology > School of Computing & Communications
ID Code: 49521
Deposited By: ep_importer_pure
Deposited On: 23 Aug 2011 16:19
Refereed?: Yes
Published?: Published
Last Modified: 10 Oct 2012 09:00
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/49521

Actions (login required)

View Item