By Topic

Performance limits of multiaccess tree protocols with shared multi-user coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Thomas, G. ; Dept. of Electr. and Comput. Eng., Univ. of Southwestern Louisiana, Lafayette, LA, USA

Group random access methods usually involve apportionment of channel resources either in the time or the frequency domain, among a number of groups in a total population of users. Each group collectively accesses its apportioned resource according to some random access protocol. In the paper the author poses and answers the question whether a similar group-sharing can be accomplished in the code domain. He shows, using results in the theory of multi-user codes, that an M-user code can be effectively shared among M classes of users, rather than among M individual users. He analyzes the performance gains in the specific cases of Aloha and tree protocols for random multiple access

Published in:

Global Telecommunications Conference, 1993, including a Communications Theory Mini-Conference. Technical Program Conference Record, IEEE in Houston. GLOBECOM '93., IEEE

Date of Conference:

29 Nov-2 Dec 1993