{'fraction_non_alphanumeric': 0.017501988862370723, 'fraction_numerical': 0.0, 'mean_word_length': 5.4512820512820515, '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}}
Multi-antenna Cayley differential codes

Multiple antenna differential modulation using unitary matrices requires no channel knowledge at the receiver, and so is ideal for use on wireless links where channel tracking is undesirable or infeasible, either because of rapid changes in the channel characteristics or because of limited system resources. Although this basic principle is well understood, it is not known how to generate good-performing constellations of unitary matrices, for any number of transmit and receive antennas and especially at high rates. We propose a class of Cayley codes that works with any number of antennas, and allows for polynomial-time near-maximum-likelihood decoding based on either successive nulling/cancelling or sphere decoding. The codes use the Cayley transform, which maps the highly nonlinear Stiefel manifold of unitary matrices to the linear space of skew-Hermitian matrices. This leads to a simple linear constellation structure in the Cayley transform domain and to an information-theoretic design criterion based on emulating a Cauchy random matrix. Simulations show that Cayley codes allow efficient and effective high-rate data transmission in multi-antenna communication systems without knowing the channel.