In this study, we propose a new approach to compute the majority vote (MV) function based on modulation on conjugate-reciprocal zeros (MOCZ) and introduce three different methods. In these methods, each transmitter maps the votes to the zeros of a Huffman polynomial, and the corresponding polynomial coefficients are transmitted. The receiver evaluates the polynomial constructed by the elements of the superposed sequence at conjugate-reciprocal zero pairs and detects the MV with a direct zero-testing (DiZeT) decoder. With differential and index-based encoders, we eliminate the need for power-delay information at the receiver while improving the computation error rate (CER) performance. The proposed methods do not use instantaneous channel state information at the transmitters and receiver. Thus, they provide robustness against phase and time synchronization errors. We theoretically analyze the CERs of the proposed methods. Finally, we demonstrate their efficacy in a distributed median computation scenario.

翻译：本研究提出了一种基于共轭倒数零点调制（MOCZ）计算多数表决（MV）函数的新方法，并介绍了三种不同的实现方案。在这些方案中，每个发射机将表决值映射至霍夫曼多项式的零点，并传输对应的多项式系数。接收机通过直接零点检测（DiZeT）解码器，在共轭倒数零点对上评估由叠加序列元素构建的多项式，从而检测出多数表决结果。通过采用差分编码与基于索引的编码器，我们在提升计算错误率（CER）性能的同时，消除了接收端对功率延迟信息的需求。所提方法在发射机与接收机端均无需使用瞬时信道状态信息，因此对相位与时间同步误差具有鲁棒性。我们从理论上分析了所提方法的计算错误率，最后通过在分布式中值计算场景中的实验验证了其有效性。