Improved error bounds for rate-1/2, terminated convolutional codes with QPSK in Nakagami-m fading channels

P. Wijesinghe; U. Gunawardana; R. Liyanapathirana

doi:10.1109/SPCOM.2010.5560559

Improved error bounds for rate-1/2, terminated convolutional codes with QPSK in Nakagami-m fading channels

School of Engineering, Design & Built Environment

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

1 Citation (Scopus)

Abstract

This paper presents tighter performance upper bounds for the bit error probability of terminated convolutional codes combined with QPSK modulation operating over frequency non-selective Nakagami-m fading channels. In particular, a method to derive the weight enumerators for rate-1/2, terminated convolutional codes with QPSK modulation is shown and the tighter upper bounds are derived using new weight enumerators. Simulation results prove that the derived upper bounds are tighter than the conventional upper bounds.

Original language	English
Title of host publication	Proceedings of the 2010 International Conference on Signal Processing and Communications (SPCOM 2010): Bangalore, India, 18-21 July 2010
Publisher	IEEE
Number of pages	4
ISBN (Print)	9781424471362
DOIs	https://doi.org/10.1109/SPCOM.2010.5560559
Publication status	Published - 2010
Event	IEEE International Conference on Signal Processing and Communications - Duration: 18 Jul 2010 → …

Conference

Conference	IEEE International Conference on Signal Processing and Communications
Period	18/07/10 → …

Access to Document

10.1109/SPCOM.2010.5560559

Cite this

@inproceedings{c2c1dd1d19414339a8af7f1fbec30771,

title = "Improved error bounds for rate-1/2, terminated convolutional codes with QPSK in Nakagami-m fading channels",

abstract = "This paper presents tighter performance upper bounds for the bit error probability of terminated convolutional codes combined with QPSK modulation operating over frequency non-selective Nakagami-m fading channels. In particular, a method to derive the weight enumerators for rate-1/2, terminated convolutional codes with QPSK modulation is shown and the tighter upper bounds are derived using new weight enumerators. Simulation results prove that the derived upper bounds are tighter than the conventional upper bounds.",

author = "P. Wijesinghe and U. Gunawardana and R. Liyanapathirana",

year = "2010",

doi = "10.1109/SPCOM.2010.5560559",

language = "English",

isbn = "9781424471362",

booktitle = "Proceedings of the 2010 International Conference on Signal Processing and Communications (SPCOM 2010): Bangalore, India, 18-21 July 2010",

publisher = "IEEE",

note = "IEEE International Conference on Signal Processing and Communications ; Conference date: 18-07-2010",

}

Wijesinghe, P, Gunawardana, U & Liyanapathirana, R 2010, Improved error bounds for rate-1/2, terminated convolutional codes with QPSK in Nakagami-m fading channels. in Proceedings of the 2010 International Conference on Signal Processing and Communications (SPCOM 2010): Bangalore, India, 18-21 July 2010. IEEE, IEEE International Conference on Signal Processing and Communications, 18/07/10. https://doi.org/10.1109/SPCOM.2010.5560559

Improved error bounds for rate-1/2, terminated convolutional codes with QPSK in Nakagami-m fading channels. / Wijesinghe, P.; Gunawardana, U.; Liyanapathirana, R.
Proceedings of the 2010 International Conference on Signal Processing and Communications (SPCOM 2010): Bangalore, India, 18-21 July 2010. IEEE, 2010.

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

TY - GEN

T1 - Improved error bounds for rate-1/2, terminated convolutional codes with QPSK in Nakagami-m fading channels

AU - Wijesinghe, P.

AU - Gunawardana, U.

AU - Liyanapathirana, R.

PY - 2010

Y1 - 2010

N2 - This paper presents tighter performance upper bounds for the bit error probability of terminated convolutional codes combined with QPSK modulation operating over frequency non-selective Nakagami-m fading channels. In particular, a method to derive the weight enumerators for rate-1/2, terminated convolutional codes with QPSK modulation is shown and the tighter upper bounds are derived using new weight enumerators. Simulation results prove that the derived upper bounds are tighter than the conventional upper bounds.

AB - This paper presents tighter performance upper bounds for the bit error probability of terminated convolutional codes combined with QPSK modulation operating over frequency non-selective Nakagami-m fading channels. In particular, a method to derive the weight enumerators for rate-1/2, terminated convolutional codes with QPSK modulation is shown and the tighter upper bounds are derived using new weight enumerators. Simulation results prove that the derived upper bounds are tighter than the conventional upper bounds.

UR - http://handle.uws.edu.au:8081/1959.7/562636

UR - http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5552578

U2 - 10.1109/SPCOM.2010.5560559

DO - 10.1109/SPCOM.2010.5560559

M3 - Conference Paper

SN - 9781424471362

BT - Proceedings of the 2010 International Conference on Signal Processing and Communications (SPCOM 2010): Bangalore, India, 18-21 July 2010

PB - IEEE

T2 - IEEE International Conference on Signal Processing and Communications

Y2 - 18 July 2010

ER -

Improved error bounds for rate-1/2, terminated convolutional codes with QPSK in Nakagami-m fading channels

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this