Over-the-Air Majority Vote Computation With Modulation on Conjugate-Reciprocal Zeros

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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Wireless Communications
Published
2024-09-16
DOI
https://doi.org/10.1109/twc.2024.3456572
Citations
10
Primary Topic
Internet Traffic Analysis and Secure E-voting
Type
article
Field-Weighted Citation Impact
3.47
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Over-the-Air Majority Vote Computation With Modulation on Conjugate-Reciprocal Zeros

Alphan Şahin
10 citations
IEEE Transactions on Wireless Communications
Internet Traffic Analysis and Secure E-voting
3.47
article

Over-the-Air Majority Vote Computation With Modulation on Conjugate-Reciprocal Zeros

Alphan Şahin
article en
10 citations

Abstract

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.

IEEE Transactions on Wireless CommunicationsVol. 23(11)
University of South Carolina (US)
Openalex Percentile: Top 6%
Internet Traffic Analysis and Secure E-voting
3.47
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Over-the-Air Majority Vote Computation With Modulation on Conjugate-Reciprocal Zeros — Alphan Şahin · IEEE Transactions on Wireless Communications (2024) | TGRS Research Map | TGRS