{'fraction_non_alphanumeric': 0.015178571428571428, 'fraction_numerical': 0.0017857142857142857, 'mean_word_length': 4.962765957446808, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Performance analysis of the random access channel (RACH) in WCDMA

In addition to call origination and registration messages, the random access channel (RACH) in 3GPP will carry traffic including short messaging service (SMS) packets and possibly short data bursts in the absence of a dedicated traffic channel. Because of this increase in traffic volume it is important to accurately predict performance of this channel and size the resources appropriately. It has commonly been assumed that RACH throughput is comparable to that of slotted ALOHA. Using the infinite user assumption we show that the resource utilization at node B is significantly higher than e/sup -1/. This analysis provides a close estimate of the RACH capacity when the actual protocol is in place. We present physical layer results that provide preamble detection probability at the receiver and use these results in a detailed MAC layer simulation with finite number of mobiles. We analyze the capacity per resource in node B for two message sizes and we investigate performance impacts of power capture and the maximum number of preamble cycles.