Tighter performance upper bounds for terminated convolutional codes in Rayleigh fading channels

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

Abstract

In this paper, we present tighter performance upper bounds for terminated convolutional codes over Rayleigh fading channels with BPSK and QPSK modulation. The performance upper bounds for convolutional codes are generally obtained from the union bound derived from the transfer function. This bound is quite loose for a terminated trellis. In the literature, performance bounds for terminated convolutional codes with BPSK in AWGN environment have been derived using a new weight enumerator obtained from a modified trellis diagram. In this work, we use the modified trellis approach to derive the weight enumerators for rate 1/2 terminated convolutional codes with QPSK modulation and derive tighter upper bounds using that.
Original languageEnglish
Title of host publicationProceedings of the 2009 6th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON 2009): May 6th-9th, 2009, Pattaya, Chonburi, Thailand
PublisherIEEE
Pages800-803
Number of pages4
ISBN (Print)9781424433889
DOIs
Publication statusPublished - 2009
EventInternational Conference on Electrical Engineering/Electronics_Computer_Telecommunications and Information Technology -
Duration: 6 May 2009 → …

Conference

ConferenceInternational Conference on Electrical Engineering/Electronics_Computer_Telecommunications and Information Technology
Period6/05/09 → …

Fingerprint

Dive into the research topics of 'Tighter performance upper bounds for terminated convolutional codes in Rayleigh fading channels'. Together they form a unique fingerprint.

Cite this