A union bound on the error probability of binary codes over block-fading channels

Block-fading is a popular channel model that approximates the behavior of different wireless communication systems. In this paper, a union bound on the error probability of binary-coded systems over block-fading channels is proposed. The bound is based on uniform interleaving of the coded sequence p...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Zummo, S.A. (author)
مؤلفون آخرون: Ping-Cheng Yeh Stark, W.E. (author), unknown (author)
التنسيق: article
منشور في: 2005
الموضوعات:
الوصول للمادة أونلاين:https://eprints.kfupm.edu.sa/id/eprint/14121/1/14121_1.pdf
https://eprints.kfupm.edu.sa/id/eprint/14121/2/14121_2.doc
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
_version_ 1864513384036171776
author Zummo, S.A.
author2 Ping-Cheng Yeh Stark, W.E.
unknown
author2_role author
author
author_facet Zummo, S.A.
Ping-Cheng Yeh Stark, W.E.
unknown
author_role author
dc.creator.none.fl_str_mv Zummo, S.A.
Ping-Cheng Yeh Stark, W.E.
unknown
dc.date.none.fl_str_mv 2005-11
2020
dc.format.none.fl_str_mv application/pdf
application/msword
dc.identifier.none.fl_str_mv https://eprints.kfupm.edu.sa/id/eprint/14121/1/14121_1.pdf
https://eprints.kfupm.edu.sa/id/eprint/14121/2/14121_2.doc
(2005) A union bound on the error probability of binary codes over block-fading channels. Vehicular Technology, IEEE Transactions on, 54.
dc.language.none.fl_str_mv en
en
dc.publisher.none.fl_str_mv IEEE
dc.relation.none.fl_str_mv https://eprints.kfupm.edu.sa/id/eprint/14121/
dc.rights.*.fl_str_mv info:eu-repo/semantics/openAccess
dc.subject.none.fl_str_mv Computer
dc.title.none.fl_str_mv A union bound on the error probability of binary codes over block-fading channels
dc.type.none.fl_str_mv Article
PeerReviewed
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/article
description Block-fading is a popular channel model that approximates the behavior of different wireless communication systems. In this paper, a union bound on the error probability of binary-coded systems over block-fading channels is proposed. The bound is based on uniform interleaving of the coded sequence prior to transmission over the channel. The distribution of error bits over the fading blocks is computed. For a specific distribution pattern, the pairwise error probability is derived. Block-fading channels modeled as Rician and Nakagami distributions are studied. We consider coherent receivers with perfect and imperfect channel side information (SI) as well as noncoherent receivers employing square-law combining. Throughout the paper, imperfect SI is obtained using pilot-aided estimation. A lower bound on the performance of iterative receivers that perform joint decoding and channel estimation is obtained assuming the receiver knows the correct data and uses them as pilots. From this, the tradeoff between channel diversity and channel estimation is investigated and the optimal channel memory is approximated analytically. Furthermore, the optimal energy allocation for pilot signals is found for different channel memory lengths.
eu_rights_str_mv openAccess
format article
id KFUPM_c8f4a9c3ddfce861b8404baf418ebad8
identifier_str_mv (2005) A union bound on the error probability of binary codes over block-fading channels. Vehicular Technology, IEEE Transactions on, 54.
language_invalid_str_mv en
network_acronym_str KFUPM
network_name_str King Fahd University of Petroleum and Minerals
oai_identifier_str oai::14121
publishDate 2005
publisher.none.fl_str_mv IEEE
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling A union bound on the error probability of binary codes over block-fading channelsZummo, S.A.Ping-Cheng Yeh Stark, W.E.unknownComputerBlock-fading is a popular channel model that approximates the behavior of different wireless communication systems. In this paper, a union bound on the error probability of binary-coded systems over block-fading channels is proposed. The bound is based on uniform interleaving of the coded sequence prior to transmission over the channel. The distribution of error bits over the fading blocks is computed. For a specific distribution pattern, the pairwise error probability is derived. Block-fading channels modeled as Rician and Nakagami distributions are studied. We consider coherent receivers with perfect and imperfect channel side information (SI) as well as noncoherent receivers employing square-law combining. Throughout the paper, imperfect SI is obtained using pilot-aided estimation. A lower bound on the performance of iterative receivers that perform joint decoding and channel estimation is obtained assuming the receiver knows the correct data and uses them as pilots. From this, the tradeoff between channel diversity and channel estimation is investigated and the optimal channel memory is approximated analytically. Furthermore, the optimal energy allocation for pilot signals is found for different channel memory lengths.IEEE2005-112020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfapplication/mswordhttps://eprints.kfupm.edu.sa/id/eprint/14121/1/14121_1.pdfhttps://eprints.kfupm.edu.sa/id/eprint/14121/2/14121_2.doc (2005) A union bound on the error probability of binary codes over block-fading channels. Vehicular Technology, IEEE Transactions on, 54. enenhttps://eprints.kfupm.edu.sa/id/eprint/14121/info:eu-repo/semantics/openAccessoai::141212019-11-01T14:04:17Z
spellingShingle A union bound on the error probability of binary codes over block-fading channels
Zummo, S.A.
Computer
status_str publishedVersion
title A union bound on the error probability of binary codes over block-fading channels
title_full A union bound on the error probability of binary codes over block-fading channels
title_fullStr A union bound on the error probability of binary codes over block-fading channels
title_full_unstemmed A union bound on the error probability of binary codes over block-fading channels
title_short A union bound on the error probability of binary codes over block-fading channels
title_sort A union bound on the error probability of binary codes over block-fading channels
topic Computer
url https://eprints.kfupm.edu.sa/id/eprint/14121/1/14121_1.pdf
https://eprints.kfupm.edu.sa/id/eprint/14121/2/14121_2.doc