Home > Research > Publications & Outputs > Performance-complexity tradeoff of convolutiona...

Electronic data

  • IET10 published

    Final published version, 617 KB, PDF document

    Available under license: None

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to journalJournal article

Published

Standard

Performance-complexity tradeoff of convolutional codes for broadband fixed wireless access systems. / Chatzigeorgiou, I.; Demosthenous, A.; Rodrigues, M. R. D.; Wassell, I. J.

In: IET Communications, Vol. 4, No. 4, 05.03.2010, p. 419-427.

Research output: Contribution to journalJournal article

Harvard

Chatzigeorgiou, I, Demosthenous, A, Rodrigues, MRD & Wassell, IJ 2010, 'Performance-complexity tradeoff of convolutional codes for broadband fixed wireless access systems', IET Communications, vol. 4, no. 4, pp. 419-427. https://doi.org/10.1049/iet-com.2008.0596

APA

Vancouver

Author

Chatzigeorgiou, I. ; Demosthenous, A. ; Rodrigues, M. R. D. ; Wassell, I. J. / Performance-complexity tradeoff of convolutional codes for broadband fixed wireless access systems. In: IET Communications. 2010 ; Vol. 4, No. 4. pp. 419-427.

Bibtex

@article{9449695d0926440f9656ed18d7b48985,
title = "Performance-complexity tradeoff of convolutional codes for broadband fixed wireless access systems",
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.",
keywords = "VITERBI DECODER, ALGORITHM",
author = "I. Chatzigeorgiou and A. Demosthenous and Rodrigues, {M. R. D.} and Wassell, {I. J.}",
year = "2010",
month = "3",
day = "5",
doi = "10.1049/iet-com.2008.0596",
language = "English",
volume = "4",
pages = "419--427",
journal = "IET Communications",
issn = "1751-8628",
publisher = "Institution of Engineering and Technology",
number = "4",

}

RIS

TY - JOUR

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

AU - Chatzigeorgiou, I.

AU - Demosthenous, A.

AU - Rodrigues, M. R. D.

AU - Wassell, I. J.

PY - 2010/3/5

Y1 - 2010/3/5

N2 - 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.

AB - 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.

KW - VITERBI DECODER

KW - ALGORITHM

U2 - 10.1049/iet-com.2008.0596

DO - 10.1049/iet-com.2008.0596

M3 - Journal article

VL - 4

SP - 419

EP - 427

JO - IET Communications

JF - IET Communications

SN - 1751-8628

IS - 4

ER -