{'fraction_non_alphanumeric': 0.02040816326530612, 'fraction_numerical': 0.0, 'mean_word_length': 4.985915492957746, '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}}
An independent but not identically distributed bit error model for heavy-tailed wireless channels

The error patterns of a wireless channel can be represented by a binary sequence of ones (burst) and zeros (run), which is referred to as a trace. Recent surveys have shown that the run length distribution of a wireless channel is an intrinsically heavy-tailed distribution. Analytical models to characterize such features have to deal with the trade-off between complexity and accuracy. In this paper, we use an independent but not identically distributed (inid) stochastic process to characterize such channel behavior and show how to parameterize the inid bit error model on the basis of a trace. The proposed model has merely two parameters both having intuitive meanings and can be easily figured out from a trace. Compared with chaotic maps, the inid bit error model is simple for practical use but can still be deprived from heavy-tailed distribution in theory. Simulation results demonstrate that the inid model can match the trace, but with fewer parameters. We then propose an improvement on the inid model to capture the ‘bursty’ nature of channel errors, described by burst length distribution. Our theoretical analysis is supported by an experimental evaluation.