🤖 AI Summary
To address the low estimation accuracy and high decoding complexity in bit-error counting for wireless packet transmission, this paper proposes a novel Error Estimation Coding (EEC) scheme based on the Odd Sketch data sketching technique. By nontrivially adapting Odd Sketch to the error estimation context—integrating bit sampling with maximum-likelihood estimation—the method achieves efficient and lightweight bit-error count estimation. It attains estimation accuracy comparable to state-of-the-art schemes such as gEEC and mEEC, while drastically reducing decoding computational complexity. Experimental results demonstrate an average one-order-of-magnitude reduction in decoding overhead, making it suitable for resource-constrained, real-time wireless communication systems. The core contribution lies in the first integration of the Odd Sketch data summarization technique into the EEC framework, establishing a theoretically sound and practically efficient new paradigm for error estimation.
📝 Abstract
Error estimating coding (EEC) is a standard technique for estimating the number of bit errors during packet transmission over wireless networks. In this paper, we propose OddEEC, a novel EEC scheme. OddEEC is a nontrivial adaptation of a data sketching technique named Odd Sketch to EEC, addressing new challenges therein by its bit sampling technique and maximum likelihood estimator. Our experiments show that OddEEC overall achieves comparable estimation accuracy as competing schemes such as gEEC and mEEC, with much smaller decoding complexity.