RACH performance improvement with randomized access preamble

Lei Zhou, Yu Dong Yao, Harry Heffes, Ruifeng Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

An improved random access channel (RACH) scheme is proposed. The scheme randomizes the access preamble sequences by modulating random numbers chosen by accessing users. The random number is sent back from a base station together with an acknowledgment sequence, again through modulation. Only the users whose access preamble is acknowledged and random number coincides the one sent back together with the acknowledgment get access to the message channel. This way, the probability of collisions is greatly reduced. Since the length of preamble and acknowledgment sequences allows modulations of quite large random numbers, the probability of two or more users happen to choose the same access preamble signature and the same modulated random number is practically negligible. It is shown in the simulation that the proposed scheme offers better performance than another improved packet access scheme common packet channel (CPCH).

Original languageEnglish
Title of host publicationProceedings of the International Conference on Telecommunications
EditorsL. Yuan'an, L. Yuan'an
Pages312-316
Number of pages5
StatePublished - 2002
EventProceedings of the International Conference on Telecommunications 2002 - Beijing, China
Duration: 23 Jun 200226 Jun 2002

Publication series

NameProceedings of the International Conference on Telecommunications
Volume2

Conference

ConferenceProceedings of the International Conference on Telecommunications 2002
Country/TerritoryChina
CityBeijing
Period23/06/0226/06/02

Fingerprint

Dive into the research topics of 'RACH performance improvement with randomized access preamble'. Together they form a unique fingerprint.

Cite this