{'fraction_non_alphanumeric': 0.022954091816367265, 'fraction_numerical': 0.0029940119760479044, 'mean_word_length': 4.698863636363637, '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 Comparison of Stepwise Serial and Parallel Cell Search in WCDMA

For three-step cell search in WCDMA, a stepwise serial scheme is conventionally employed, where each step of cell search operates in serial. In order to reduce the cell search time, a stepwise parallel scheme can be considered as a candidate for cell search, where each step operates in pipelined fashion. However, in the parallel scheme where the processing time in every step is equal, excessive accumulations are caused in step (1) and step (3) because the period of a code used for step (2) is much longer than that for the other steps. And it does not provide any gain because the effect becomes easily saturated with the number of accumulations. In this paper, the performance of parallel cell search is analyzed, and compared with that of serial cell search. Finally, it is shown that the performance of parallel cell search can be improved by adjusting the processing time in each step, based on the analytic results.