{'fraction_non_alphanumeric': 0.030818278427205102, 'fraction_numerical': 0.0, 'mean_word_length': 5.1568627450980395, '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}}
Multiuser signature quantization with tree-structured codebook in DS-CDMA

We consider a signature quantization scheme for a group of users in a reverse-link direct sequence (DS)-code division multiple access (CDMA). Assuming perfect channel knowledge, a receiver selects the set of signatures that maximizes an average signal-to-interference plus noise ratio (SINR) from a random vector quantization (RVQ) codebook, which consists of independent isotropically distributed unit-norm vectors. The quantized signatures are relayed from the receiver to users via noiseless rate-limited feedback channels. Previously, we have proposed to organize entries of RVQ codebook into a tree structure (TS) to speed up a search for the optimal entry. Here we extend the TS scheme for a multiuser signature quantization. Numerical results show that for a given performance, a TS-RVQ codebook can be an order of magnitude less complex than an RVQ codebook.