Performance of path-time codes for end-to-end transmission in ad hoc multihop networks

I. Wei Lai; Chia Han Lee; Kwang Cheng Chen; Ezio Biglieri

doi:10.1109/ISIT.2014.6874796

Performance of path-time codes for end-to-end transmission in ad hoc multihop networks

I. Wei Lai, Chia Han Lee, Kwang Cheng Chen, Ezio Biglieri

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Citations (Scopus)

Abstract

In this paper, we study the performance of the recently proposed class of path-time codes (PTCs), which exploit time and path diversity to increase the reliability of end-to-end transmission in ad hoc multihop networks. Using the central limit theorem, we prove that PTCs reshape the statistics of a relay path including multiple cascaded links. In particular, as the number K of relay paths becomes large, the cascaded channel statistic is transformed from K-product Rayleigh to Rayleigh. This is numerically demonstrated and analytically verified by using the concept of 'amount of fading' (AF). Our results show that, by using PTCs, the end-to-end error-rate performance can be boosted in addition to the diversity and coding gains.

Original language	English
Title of host publication	2014 IEEE International Symposium on Information Theory, ISIT 2014
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	66-70
Number of pages	5
ISBN (Print)	9781479951864
DOIs	https://doi.org/10.1109/ISIT.2014.6874796
Publication status	Published - 2014
Externally published	Yes
Event	2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States Duration: 2014 Jun 29 → 2014 Jul 4

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/Territory	United States
City	Honolulu, HI
Period	2014/06/29 → 2014/07/04

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2014.6874796

Cite this

Lai, I. W., Lee, C. H., Chen, K. C., & Biglieri, E. (2014). Performance of path-time codes for end-to-end transmission in ad hoc multihop networks. In 2014 IEEE International Symposium on Information Theory, ISIT 2014 (pp. 66-70). Article 6874796 (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2014.6874796

Performance of path-time codes for end-to-end transmission in ad hoc multihop networks. / Lai, I. Wei; Lee, Chia Han; Chen, Kwang Cheng et al.
2014 IEEE International Symposium on Information Theory, ISIT 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 66-70 6874796 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Lai, IW, Lee, CH, Chen, KC & Biglieri, E 2014, Performance of path-time codes for end-to-end transmission in ad hoc multihop networks. in 2014 IEEE International Symposium on Information Theory, ISIT 2014., 6874796, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 66-70, 2014 IEEE International Symposium on Information Theory, ISIT 2014, Honolulu, HI, United States, 2014/06/29. https://doi.org/10.1109/ISIT.2014.6874796

Lai IW, Lee CH, Chen KC, Biglieri E. Performance of path-time codes for end-to-end transmission in ad hoc multihop networks. In 2014 IEEE International Symposium on Information Theory, ISIT 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 66-70. 6874796. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2014.6874796

@inproceedings{97fc1b1f23d94954a61fcb1fcbbc8945,

title = "Performance of path-time codes for end-to-end transmission in ad hoc multihop networks",

abstract = "In this paper, we study the performance of the recently proposed class of path-time codes (PTCs), which exploit time and path diversity to increase the reliability of end-to-end transmission in ad hoc multihop networks. Using the central limit theorem, we prove that PTCs reshape the statistics of a relay path including multiple cascaded links. In particular, as the number K of relay paths becomes large, the cascaded channel statistic is transformed from K-product Rayleigh to Rayleigh. This is numerically demonstrated and analytically verified by using the concept of 'amount of fading' (AF). Our results show that, by using PTCs, the end-to-end error-rate performance can be boosted in addition to the diversity and coding gains.",

author = "Lai, {I. Wei} and Lee, {Chia Han} and Chen, {Kwang Cheng} and Ezio Biglieri",

year = "2014",

doi = "10.1109/ISIT.2014.6874796",

language = "English",

isbn = "9781479951864",

series = "IEEE International Symposium on Information Theory - Proceedings",

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

pages = "66--70",

booktitle = "2014 IEEE International Symposium on Information Theory, ISIT 2014",

note = "2014 IEEE International Symposium on Information Theory, ISIT 2014 ; Conference date: 29-06-2014 Through 04-07-2014",

}

TY - GEN

T1 - Performance of path-time codes for end-to-end transmission in ad hoc multihop networks

AU - Lai, I. Wei

AU - Lee, Chia Han

AU - Chen, Kwang Cheng

AU - Biglieri, Ezio

PY - 2014

Y1 - 2014

N2 - In this paper, we study the performance of the recently proposed class of path-time codes (PTCs), which exploit time and path diversity to increase the reliability of end-to-end transmission in ad hoc multihop networks. Using the central limit theorem, we prove that PTCs reshape the statistics of a relay path including multiple cascaded links. In particular, as the number K of relay paths becomes large, the cascaded channel statistic is transformed from K-product Rayleigh to Rayleigh. This is numerically demonstrated and analytically verified by using the concept of 'amount of fading' (AF). Our results show that, by using PTCs, the end-to-end error-rate performance can be boosted in addition to the diversity and coding gains.

AB - In this paper, we study the performance of the recently proposed class of path-time codes (PTCs), which exploit time and path diversity to increase the reliability of end-to-end transmission in ad hoc multihop networks. Using the central limit theorem, we prove that PTCs reshape the statistics of a relay path including multiple cascaded links. In particular, as the number K of relay paths becomes large, the cascaded channel statistic is transformed from K-product Rayleigh to Rayleigh. This is numerically demonstrated and analytically verified by using the concept of 'amount of fading' (AF). Our results show that, by using PTCs, the end-to-end error-rate performance can be boosted in addition to the diversity and coding gains.

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

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

U2 - 10.1109/ISIT.2014.6874796

DO - 10.1109/ISIT.2014.6874796

M3 - Conference contribution

AN - SCOPUS:84906539335

SN - 9781479951864

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 66

EP - 70

BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014

Y2 - 29 June 2014 through 4 July 2014

ER -

Performance of path-time codes for end-to-end transmission in ad hoc multihop networks

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this