Random time and frequency hopping for unslotted asynchronous access

Sandor Csibi, L. Györfi

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

1 Citation (Scopus)

Abstract

Two kinds of interleaved codes are considered for unslotted asynchronous multiple access collision channel without feedback, for random time hopping, and also through L of such parallel channels for random frequency hopping. Exponential upper bounds are given on the decoding error probability. Each of these bounds consists of a first term due to overflow and a second term due to collision under no overflow. For both kinds of interleavings essentially the same throughput limiting role of the channel capacity is exhibited as known for slotted access with a single code. For one of the rules the same error probability limit is guaranteed at the same throughput both for the unslotted and for the slotted case.

Original languageEnglish
Title of host publicationIEEE International Symposium on Spread Spectrum Techniques & Applications
Pages1123-1127
Number of pages5
Volume3
Publication statusPublished - 1996
EventProceedings of the 1996 4th International Symposium on Spread Spectrum Techniques & Applications, ISSSTA'96 - Mainz, Ger
Duration: Sep 22 1996Sep 25 1996

Other

OtherProceedings of the 1996 4th International Symposium on Spread Spectrum Techniques & Applications, ISSSTA'96
CityMainz, Ger
Period9/22/969/25/96

Fingerprint

Frequency hopping
Throughput
Channel capacity
Decoding
Feedback
Error probability

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Csibi, S., & Györfi, L. (1996). Random time and frequency hopping for unslotted asynchronous access. In IEEE International Symposium on Spread Spectrum Techniques & Applications (Vol. 3, pp. 1123-1127)

Random time and frequency hopping for unslotted asynchronous access. / Csibi, Sandor; Györfi, L.

IEEE International Symposium on Spread Spectrum Techniques & Applications. Vol. 3 1996. p. 1123-1127.

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

Csibi, S & Györfi, L 1996, Random time and frequency hopping for unslotted asynchronous access. in IEEE International Symposium on Spread Spectrum Techniques & Applications. vol. 3, pp. 1123-1127, Proceedings of the 1996 4th International Symposium on Spread Spectrum Techniques & Applications, ISSSTA'96, Mainz, Ger, 9/22/96.
Csibi S, Györfi L. Random time and frequency hopping for unslotted asynchronous access. In IEEE International Symposium on Spread Spectrum Techniques & Applications. Vol. 3. 1996. p. 1123-1127
Csibi, Sandor ; Györfi, L. / Random time and frequency hopping for unslotted asynchronous access. IEEE International Symposium on Spread Spectrum Techniques & Applications. Vol. 3 1996. pp. 1123-1127
@inproceedings{999b16320c634903aeef24efc321628f,
title = "Random time and frequency hopping for unslotted asynchronous access",
abstract = "Two kinds of interleaved codes are considered for unslotted asynchronous multiple access collision channel without feedback, for random time hopping, and also through L of such parallel channels for random frequency hopping. Exponential upper bounds are given on the decoding error probability. Each of these bounds consists of a first term due to overflow and a second term due to collision under no overflow. For both kinds of interleavings essentially the same throughput limiting role of the channel capacity is exhibited as known for slotted access with a single code. For one of the rules the same error probability limit is guaranteed at the same throughput both for the unslotted and for the slotted case.",
author = "Sandor Csibi and L. Gy{\"o}rfi",
year = "1996",
language = "English",
volume = "3",
pages = "1123--1127",
booktitle = "IEEE International Symposium on Spread Spectrum Techniques & Applications",

}

TY - GEN

T1 - Random time and frequency hopping for unslotted asynchronous access

AU - Csibi, Sandor

AU - Györfi, L.

PY - 1996

Y1 - 1996

N2 - Two kinds of interleaved codes are considered for unslotted asynchronous multiple access collision channel without feedback, for random time hopping, and also through L of such parallel channels for random frequency hopping. Exponential upper bounds are given on the decoding error probability. Each of these bounds consists of a first term due to overflow and a second term due to collision under no overflow. For both kinds of interleavings essentially the same throughput limiting role of the channel capacity is exhibited as known for slotted access with a single code. For one of the rules the same error probability limit is guaranteed at the same throughput both for the unslotted and for the slotted case.

AB - Two kinds of interleaved codes are considered for unslotted asynchronous multiple access collision channel without feedback, for random time hopping, and also through L of such parallel channels for random frequency hopping. Exponential upper bounds are given on the decoding error probability. Each of these bounds consists of a first term due to overflow and a second term due to collision under no overflow. For both kinds of interleavings essentially the same throughput limiting role of the channel capacity is exhibited as known for slotted access with a single code. For one of the rules the same error probability limit is guaranteed at the same throughput both for the unslotted and for the slotted case.

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

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

M3 - Conference contribution

VL - 3

SP - 1123

EP - 1127

BT - IEEE International Symposium on Spread Spectrum Techniques & Applications

ER -