Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anthony Perre 0001

dblp:148/5610-1 · also Anthony Joseph Perre 0001 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
5since 2021 · last 2026
0009-0008-7634-5431ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
modulation
1.012026
Smooshed Zero Constellation for Binary Modulation on Conjugate-Reciprocal Zeros · IEEE Trans. Commun. 2026
Physical-layer communications › modulation › multicarrier modulation
OFDM
1.012026
Smooshed Zero Constellation for Binary Modulation on Conjugate-Reciprocal Zeros · IEEE Trans. Commun. 2026
Physical-layer communications › synchronization › timing estimation
time offset estimation
1.012026
Smooshed Zero Constellation for Binary Modulation on Conjugate-Reciprocal Zeros · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes › error probability analysis
bit-error probability
0.312026
Smooshed Zero Constellation for Binary Modulation on Conjugate-Reciprocal Zeros · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes
error probability analysis
0.312026
Smooshed Zero Constellation for Binary Modulation on Conjugate-Reciprocal Zeros · IEEE Trans. Commun. 2026

Methods — techniques the papers use, named apart from their topics

neural network decoder · 2.0machine learning · 2.0DFT-based rotation estimation · 2.0
YearPublicationVenuePosition
2026 KAN-AE with Non-Linearity Score and Symbolic Regression for Energy-Efficient Channel Coding
abstract
In this paper, we investigate Kolmogorov-Arnold network-based autoencoders (KAN-AEs) with symbolic regression (SR) for energy-efficient channel coding. By using SR, we convert KAN-AEs into symbolic expressions, which enables low-complexity implementation and improved energy efficiency at the radios. To further enhance the efficiency, we introduce a new non-linearity score term in the SR process to help select lower-complexity equations when possible. Through numerical simulations, we demonstrate that KAN-AEs achieve competitive BLER performance while improving energy efficiency when paired with SR. We score the energy efficiency of a KAN-AE implementation using the proposed non-linearity metric and compare it to a multi-layer perceptron-based autoencoder (MLP-AE). Our experiment shows that the KAN-AE paired with SR uses 1.38 times less energy than the MLP-AE, supporting that KAN-AEs are a promising choice for energy-efficient deep learning-based channel coding.
Anthony Perre 0001, Parker Huggins, Alphan Sahin
CCNC1
2026 Smooshed Zero Constellation for Binary Modulation on Conjugate-Reciprocal Zeros
abstract
In this study, we introduce smooshed binary modulation on conjugate-reciprocal zeros (SBMOCZ) to mitigate timing offset (TO)-induced zero rotation in binary modulation on conjugate-reciprocal zeros (BMOCZ)-based orthogonal frequency division multiplexing (OFDM). In our approach, we modify Huffman BMOCZ with zero smooshing to create a structured gap in the zero constellation which rotates under a TO. By exploiting the auto-correlation properties of SBMOCZ, we develop a low-complexity rotation estimator at the receiver that can be implemented using a single discrete Fourier transform (DFT). We theoretically analyze the properties of SBMOCZ polynomials and derive closed-form expressions for the aperiodic auto-correlation function (AACF) and peak-to-average power ratio (PAPR). To learn the smooshed zero constellation parameters, we introduce two machine learning (ML)-based methods. The first uses a soft-output from the direct zero-testing (DiZeT) decoder with hinge loss, while the second jointly trains a neural network (NN)-based decoder robust to fading and the constellation parameters. Our numerical simulations demonstrate that SBMOCZ remains effective under TO impairments without relying on affine cyclically permutable codes (ACPCs) and improves bit error rate (BER) and block error rate (BLER) at no additional overhead.
Anthony Perre 0001, Parker Huggins, Alphan Sahin
IEEE Trans. Commun.1
2025 Fourier-Domain CFO Estimation Using Jutted Binary Modulation on Conjugate-Reciprocal Zeros
abstract
In this work, we propose jutted binary modulation on conjugate-reciprocal zeros (J-BMOCZ) for non-coherent communication under a carrier frequency offset (CFO). By introducing asymmetry to the Huffman BMOCZ zero constellation, we exploit the identical aperiodic auto-correlation function of BMOCZ sequences to derive a Fourier-domain metric for CFO estimation. Unlike the existing methods for Huffman BMOCZ, which require a cyclically permutable code (CPC) for pilot-free CFO correction, J-BMOCZ enables the estimation of a CFO without the use of pilots or channel coding. Through numerical simulations in additive white Gaussian noise and fading channels, we show that the bit error rate (BER) loss of J-BMOCZ under a CFO is just 1 dB over Huffman BMOCZ without a CFO. Furthermore, the results show that coded J-BMOCZ achieves better BER performance than Huffman BMOCZ with a CPC.
Parker Huggins, Anthony Perre 0001, Alphan Sahin
PIMRC2
2025 Learning Zero Constellations for Binary MOCZ in Fading Channels
abstract
In this work, we propose two methods to design zero constellations for binary modulation on conjugate-reciprocal zeros (BMOCZ). In the first approach, we treat constellation design as a multi-label binary classification problem and learn the zero locations for a direct zero-testing (DiZeT) decoder. In the second approach, we introduce a neural network (NN)-based decoder and jointly learn the decoder and zero constellation parameters. We show that the NN-based decoder can directly generalize to flat-fading channels, despite being trained under additive white Gaussian noise. Furthermore, the results of numerical simulations demonstrate that learned zero constellations outperform the canonical, Huffman BMOCZ constellation, with the proposed NN-based decoder achieving large performance gain at the expense of increased computational complexity.
Anthony Perre 0001, Parker Huggins, Alphan Sahin
PIMRC1
2025 A Smooshed BMOCZ Zero Constellation for CFO Estimation Without Channel Coding
abstract
In this study, we propose a new binary modulation on conjugate-reciprocal zeros (BMOCZ) zero constellation, which we call smooshed binary modulation on conjugate-reciprocal zeros (SBMOCZ), to address carrier frequency offset (CFO)induced zero rotation without depending on channel coding. In our approach, we modify the phase mapping of Huffman BMOCZ by shrinking the angle between adjacent zeros, except for the first and last, to introduce a gap in the zero constellation. By discerning the gap location in the received polynomial, the receiver can estimate and correct the phase rotation. We demonstrate the error rate performance of SBMOCZ relative to Huffman BMOCZ, showing that SBMOCZ addresses a CFO-induced rotation at the cost of a modest performance reduction compared to Huffman BMOCZ in the absence of a CFO. Finally, we compare SBMOCZ to Huffman BMOCZ using a cyclically permutable code (CPC), showing a 4 dB bit error rate (BER) improvement in a fading channel, while demonstrating comparable performance across other simulations.
Anthony Perre 0001, Parker Huggins, Alphan Sahin
PIMRC1