Union bounds on the bit error probability of coded MRC in Nakagami-m fading

Saiam A. Zummo

doi:10.1109/LCOMM.2006.060735

Union bounds on the bit error probability of coded MRC in Nakagami-m fading

Saiam A. Zummo

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

In this letter new union bounds are derived for coded maximal ratio combining (MRC) over Nakagami-m fading channels. The union bounds are expressed in the product form, which makes them easily evaluated using the transfer function of the code. The bounds are general to any diversity order and coding scheme with a known transfer function. Results show that the new bounds are tight to simulation results for wide ranges of diversity orders and Nakagami parameters.

Original language	English
Pages (from-to)	769-771
Number of pages	3
Journal	IEEE Communications Letters
Volume	10
Issue number	11
DOIs	https://doi.org/10.1109/LCOMM.2006.060735
State	Published - Nov 2006

Bibliographical note

Funding Information:
Manuscript received May 15, 2006. The associate editor coordinating the review of this letter and approving it for publication was Dr. Costas Georghiades. This work was supported by King Fahd University of Petroleum and Minerals (KFUPM), grant FT-2006-27. S. Zummo is with the Electrical Engineering Dept., KFUPM, Dhahran 31261, Saudi Arabia (email: [email protected]). Digital Object Identifier 10.1109/LCOMM.2006.060735.

Keywords

Convolutional codes
Diversity
Error probability
Fading
MRC
Nakagami-m
Rayleigh
TCM
Union bound

ASJC Scopus subject areas

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2006.060735

Cite this

@article{089b6b91f7234bd2829f8475abcd3248,

title = "Union bounds on the bit error probability of coded MRC in Nakagami-m fading",

abstract = "In this letter new union bounds are derived for coded maximal ratio combining (MRC) over Nakagami-m fading channels. The union bounds are expressed in the product form, which makes them easily evaluated using the transfer function of the code. The bounds are general to any diversity order and coding scheme with a known transfer function. Results show that the new bounds are tight to simulation results for wide ranges of diversity orders and Nakagami parameters.",

keywords = "Convolutional codes, Diversity, Error probability, Fading, MRC, Nakagami-m, Rayleigh, TCM, Union bound",

author = "Zummo, {Saiam A.}",

note = "Funding Information: Manuscript received May 15, 2006. The associate editor coordinating the review of this letter and approving it for publication was Dr. Costas Georghiades. This work was supported by King Fahd University of Petroleum and Minerals (KFUPM), grant FT-2006-27. S. Zummo is with the Electrical Engineering Dept., KFUPM, Dhahran 31261, Saudi Arabia (email: [email protected]). Digital Object Identifier 10.1109/LCOMM.2006.060735.",

year = "2006",

month = nov,

doi = "10.1109/LCOMM.2006.060735",

language = "English",

volume = "10",

pages = "769--771",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "11",

}

TY - JOUR

T1 - Union bounds on the bit error probability of coded MRC in Nakagami-m fading

AU - Zummo, Saiam A.

N1 - Funding Information: Manuscript received May 15, 2006. The associate editor coordinating the review of this letter and approving it for publication was Dr. Costas Georghiades. This work was supported by King Fahd University of Petroleum and Minerals (KFUPM), grant FT-2006-27. S. Zummo is with the Electrical Engineering Dept., KFUPM, Dhahran 31261, Saudi Arabia (email: [email protected]). Digital Object Identifier 10.1109/LCOMM.2006.060735.

PY - 2006/11

Y1 - 2006/11

N2 - In this letter new union bounds are derived for coded maximal ratio combining (MRC) over Nakagami-m fading channels. The union bounds are expressed in the product form, which makes them easily evaluated using the transfer function of the code. The bounds are general to any diversity order and coding scheme with a known transfer function. Results show that the new bounds are tight to simulation results for wide ranges of diversity orders and Nakagami parameters.

AB - In this letter new union bounds are derived for coded maximal ratio combining (MRC) over Nakagami-m fading channels. The union bounds are expressed in the product form, which makes them easily evaluated using the transfer function of the code. The bounds are general to any diversity order and coding scheme with a known transfer function. Results show that the new bounds are tight to simulation results for wide ranges of diversity orders and Nakagami parameters.

KW - Convolutional codes

KW - Diversity

KW - Error probability

KW - Fading

KW - MRC

KW - Nakagami-m

KW - Rayleigh

KW - TCM

KW - Union bound

UR - http://www.scopus.com/inward/record.url?scp=77955739773&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2006.060735

DO - 10.1109/LCOMM.2006.060735

M3 - Article

AN - SCOPUS:77955739773

SN - 1089-7798

VL - 10

SP - 769

EP - 771

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 11

ER -

Union bounds on the bit error probability of coded MRC in Nakagami-m fading

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this