Limiting performance of frequency-hop random access

DOI10.1109/18.52479MaRDI QIDQ3484751zbMATH OpenOpenAlexFDO

Authors Upamanyu Madhow, Michael B. Pursley

Publication date 1990

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b6cb3144cb657423cec8578b7a34f30339027d20

zbMATH Keywords

asymptotic performancechannel capacitymultiple-access interferenceexponentially distributed packet lengthshigh traffic levelsmultiple-access capability of asynchronous frequency- hop packet ratio networksprobability of error for unslotted systemsReed-Solomon coding

Mathematics Subject Classification ID

Communication theory (94A05) Model systems in control theory (93C99)

Recommendations

• Frequency-hop transmission for satellite packet switching and terrestrial packet radio networks
• Random Time and Frequency Hopping for Infinite User Population
• The capacities of frequency-hopped code-division multiple-access channels
• Capacity of the wireless packet collision channel without feedback
• Throughput analysis of CDMA systems using multiuser receivers

Cited in

(4)

• Protograph LDPC code design for asynchronous random access
• Hit statistics in FH-CDMA unslotted packet networks
• Random Time and Frequency Hopping for Infinite User Population
• Enhancing the performance of random access networks with random packet CDMA and joint detection

This page was built for publication: Limiting performance of frequency-hop random access

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484751)