Analysis of coding on non-ergodic block-fading channels

Joseph Boutros, Albert Guilléni Fàbregas, Emilio Calvanese Strinati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

26 Citations (Scopus)

Abstract

We study coding for the non-ergodic block-fading channel. In particular, we analyze the error probability of full-diversity binary codes, and we elaborate on how to approach the outage probability limit. In so doing, we introduce the concept outage boundary region, which is a graphical way to illustrate failures in the decoding process. We show that outage achieving codes have a frame error probability which is independent of the block length. Conversely, we show that codes that do not approach the outage probability have an error probability that grows logarithmically with the block length.

Original languageEnglish
Title of host publication43rd Annual Allerton Conference on Communication, Control and Computing 2005
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages1096-1105
Number of pages10
Volume2
ISBN (Electronic)9781604234916
Publication statusPublished - 1 Jan 2005
Externally publishedYes
Event43rd Annual Allerton Conference on Communication, Control and Computing 2005 - Monticello, United States
Duration: 28 Sep 200530 Sep 2005

Other

Other43rd Annual Allerton Conference on Communication, Control and Computing 2005
CountryUnited States
CityMonticello
Period28/9/0530/9/05

Fingerprint

Outages
Fading channels
Binary codes
Decoding
Error probability

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Boutros, J., Guilléni Fàbregas, A., & Strinati, E. C. (2005). Analysis of coding on non-ergodic block-fading channels. In 43rd Annual Allerton Conference on Communication, Control and Computing 2005 (Vol. 2, pp. 1096-1105). University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering.

Analysis of coding on non-ergodic block-fading channels. / Boutros, Joseph; Guilléni Fàbregas, Albert; Strinati, Emilio Calvanese.

43rd Annual Allerton Conference on Communication, Control and Computing 2005. Vol. 2 University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2005. p. 1096-1105.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Boutros, J, Guilléni Fàbregas, A & Strinati, EC 2005, Analysis of coding on non-ergodic block-fading channels. in 43rd Annual Allerton Conference on Communication, Control and Computing 2005. vol. 2, University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, pp. 1096-1105, 43rd Annual Allerton Conference on Communication, Control and Computing 2005, Monticello, United States, 28/9/05.
Boutros J, Guilléni Fàbregas A, Strinati EC. Analysis of coding on non-ergodic block-fading channels. In 43rd Annual Allerton Conference on Communication, Control and Computing 2005. Vol. 2. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering. 2005. p. 1096-1105
Boutros, Joseph ; Guilléni Fàbregas, Albert ; Strinati, Emilio Calvanese. / Analysis of coding on non-ergodic block-fading channels. 43rd Annual Allerton Conference on Communication, Control and Computing 2005. Vol. 2 University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2005. pp. 1096-1105
@inproceedings{bc1f29a0caa04dc693d870e4130518ae,
title = "Analysis of coding on non-ergodic block-fading channels",
abstract = "We study coding for the non-ergodic block-fading channel. In particular, we analyze the error probability of full-diversity binary codes, and we elaborate on how to approach the outage probability limit. In so doing, we introduce the concept outage boundary region, which is a graphical way to illustrate failures in the decoding process. We show that outage achieving codes have a frame error probability which is independent of the block length. Conversely, we show that codes that do not approach the outage probability have an error probability that grows logarithmically with the block length.",
author = "Joseph Boutros and {Guill{\'e}ni F{\`a}bregas}, Albert and Strinati, {Emilio Calvanese}",
year = "2005",
month = "1",
day = "1",
language = "English",
volume = "2",
pages = "1096--1105",
booktitle = "43rd Annual Allerton Conference on Communication, Control and Computing 2005",
publisher = "University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering",

}

TY - GEN

T1 - Analysis of coding on non-ergodic block-fading channels

AU - Boutros, Joseph

AU - Guilléni Fàbregas, Albert

AU - Strinati, Emilio Calvanese

PY - 2005/1/1

Y1 - 2005/1/1

N2 - We study coding for the non-ergodic block-fading channel. In particular, we analyze the error probability of full-diversity binary codes, and we elaborate on how to approach the outage probability limit. In so doing, we introduce the concept outage boundary region, which is a graphical way to illustrate failures in the decoding process. We show that outage achieving codes have a frame error probability which is independent of the block length. Conversely, we show that codes that do not approach the outage probability have an error probability that grows logarithmically with the block length.

AB - We study coding for the non-ergodic block-fading channel. In particular, we analyze the error probability of full-diversity binary codes, and we elaborate on how to approach the outage probability limit. In so doing, we introduce the concept outage boundary region, which is a graphical way to illustrate failures in the decoding process. We show that outage achieving codes have a frame error probability which is independent of the block length. Conversely, we show that codes that do not approach the outage probability have an error probability that grows logarithmically with the block length.

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

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

M3 - Conference contribution

VL - 2

SP - 1096

EP - 1105

BT - 43rd Annual Allerton Conference on Communication, Control and Computing 2005

PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering

ER -