# US 2026/0303412 A1 · Smooshed bmocz zero-constellation for cfo estimation without channel coding

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0303412 A1
- Document ID: US20260303412A1
- Status: Published application
- Kind: A1
- Application number: 19/566,088
- Filed: 2026-03-13
- Published: 2026-10-01
- Earliest claimed: 2025-03-27
- Assignees: University of South Carolina
- Applicants: University of South Carolina
- Inventors: ALPHAN SAHIN; ANTHONY PERRE; PARKER HUGGINS
- Web page: https://patentgrep.com/patent/US20260303412A1

## CPC

- H04L 25/0212: {of impulse response}
- H04L 25/022: {of frequency response}
- H04L 27/3483: {using a modulation of the constellation points}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The disclosure deals with system and methodology for smooshed BMOCZ zero-constellation for carrier frequency offset (CFO) estimation without channel coding. Particular presently disclosed subject matter for binary modulation on conjugate-reciprocal zeros (BMOCZ) zero-constellation (referenced as smooshed binary modulation on conjugate-reciprocal zeros (SBMOCZ)) is used to mitigate carrier frequency offset (CFO)-induced rotation without relying on channel coding. Per the disclosure, phase mapping of Huffman BMOCZ is modified by shrinking the phase between adjacent zeros, except for the first and last, to introduce a gap in the zero-constellation. By detecting the gap location from the received polynomial, the receiver can accurately estimate and correct the rotation.

## Claims

### Claim 1

A binary data transmission method, comprising:
obtaining a discrete-time baseband signal;
using a non-coherent communication scheme for transmitting the baseband signal, including using a smooshed binary modulation on conjugate-reciprocal zeros (SBMOCZ) that allows for non-coherent communication in the presence of a carrier frequency offset (CFO) and using a polynomial scheme for zero constellation formation in which the phase separation between consecutive zeros of an SBMOCZ zero constellation, excluding the first and last, is reduced, and generating and transmitting polynomial sequences based on the SBMOCZ zero constellation;
receiving the transmitted polynomial sequences; and
conducting analysis of at least one of the received polynomial sequences.

### Claim 2 (depends on 1)

The binary data transmission method according to claim 1, wherein the SBMOCZ zero constellation has a zero pattern of α=(α0, α1, . . . , αK−1)∈ for defining the Kth-degree polynomial, where K is a number of bits to be transmitted, where the phase difference between adjacent zeros, excluding the first and last, is given by Δφ=(2π−η)/K, and where the parameter η∈[0, 2π) defines a smooshing factor for compressing phase separation to controllably create a gap between α0 and αK−1.

### Claim 3 (depends on 2)

The binary data transmission method according to claim 2, wherein the smooshing factor parameter η>0.

### Claim 4 (depends on 3)

The binary data transmission method according to claim 3, further comprising:
detecting from the received polynomial sequence the location of the created gap between α0 and αK−1;
estimating a rotation of the received polynomial sequence due to the CFO of the received polynomial sequence based on the detected gap location; and
correcting the rotation without any channel coding.

### Claim 5 (depends on 4)

The binary data transmission method according to claim 4, wherein
detecting the location of the created gap includes identifying a peak location on a unit circle for a CFO-rotated polynomial; and
estimating the rotation due to the CFO includes using a single N-point discrete Fourier transform (DFT), where N defines a resolution of a search space.

### Claim 6 (depends on 5)

The binary data transmission method according to claim 5, wherein correcting includes compensating for the rotation by performing the correction Ŷ(z)={tilde over (Y)}(e−j{circumflex over (ψ)}z), where Ŷ(z) is an estimate of the received polynomial sequence without CFO impairment, Ŷ represents the received polynomial sequence with the CFO impairment, {circumflex over (ψ)} represents the estimated rotation, j is the imaginary unit, and z is a complex variable.

### Claim 7 (depends on 2)

The binary data transmission method according to claim 2, further comprising selecting the smooshing factor parameter η>0, and further tuned for a particular embodiment with a large enough value of η for a predetermined level of results in CFO correction capabilities while having a small enough value of η for a predetermined level of results in zero perturbation under additive white Gaussian noise (AWGN) noise.

### Claim 8 (depends on 1)

The binary data transmission method according to claim 1, wherein for the SBMOCZ zero constellation, the kth bit in a message m=(m0, m1, . . . , mK−1)∈{0, 1}K derived from the OFDM based baseband signal is mapped to the kth zero of a polynomial according to
α
k
=
{
R
k
⁢
e
ϕ
k
,
m
k
=
1
R
k
-
1
⁢
e
ϕ
k
,
m
k
=
0
,
for k∈[K] and Rk>1, with zero patterns of α=(α0, α1, . . . , αK−1)∈ for defining the Kth-degree polynomial, where the phase difference between adjacent zeros, excluding the first and last, is given by Δφ=(2π−η)/K, and where the parameter η∈[0, 2π) defines a smooshing factor for compressing phase separation to controllably create a gap between α0 and αK−1.

### Claim 9 (depends on 1)

The binary data transmission method according to claim 1, wherein:
the polynomial scheme includes encoding and decoding; and
conducting analysis includes conducting decoding of at least one of the received polynomial sequences.

### Claim 10 (depends on 9)

The binary data transmission method according to claim 9, wherein
conducting decoding of a received polynomial sequence includes using an inverse discrete Fourier transform (IDFT)-based direct zero-testing (DiZeT) decoder.

### Claim 11 (depends on 1)

The binary data transmission method according to claim 1, further including using the binary data transmission method for ultra-reliable, low-latency communications including at least one of intermittent short-packet transmissions in IoT networks, over-the-air computations, integrated sensing and communications, or short-packet communications.

### Claim 12

A binary data transmission system, comprising:
an input source for providing information bits;
one or more processors; and
one or more non-transitory computer-readable media that store instructions that, when executed by the one or more processors, cause the one or more processors to perform operations, the operations comprising:
obtaining a discrete-time baseband signal from the provided information bits;
using a non-coherent communication scheme for transmitting the baseband signal, including using a smooshed binary modulation on conjugate-reciprocal zeros (SBMOCZ) that allows for non-coherent communication in the presence of a carrier frequency offset (CFO) and using a polynomial scheme for zero constellation formation in which the phase separation between consecutive zeros of an SBMOCZ zero constellation, excluding the first and last, is reduced, and generating and transmitting polynomial sequences based on the SBMOCZ zero constellation;
receiving the transmitted polynomial sequences; and
conducting analysis of at least one of the received polynomial sequences.

### Claim 13 (depends on 12)

The binary data transmission system according to claim 12, wherein the SBMOCZ zero constellation has a zero pattern of a=(α0, α1, . . . , αK−1)∈ for defining the Kth-degree polynomial, where K is a number of bits to be transmitted, where the phase difference between adjacent zeros, excluding the first and last, is given by Δφ=(2π−η)/K, and where the parameter η∈[0, 2π) defines a smooshing factor for compressing phase separation to controllably create a gap between α0 and αK−1.

### Claim 14 (depends on 13)

The binary data transmission system according to claim 13, wherein the smooshing factor parameter η>0.

### Claim 15 (depends on 14)

The binary data transmission system according to claim 14, wherein the operations further comprise:
detecting from the received polynomial sequence the location of the created gap between α0 and αK−1;
estimating a rotation of the received polynomial sequence due to the CFO of the received polynomial sequence based on the detected gap location; and
correcting the rotation without any channel coding.

### Claim 16 (depends on 15)

The binary data transmission system according to claim 15, wherein:
detecting the location of the created gap includes identifying a peak location on a unit circle for a CFO-rotated polynomial; and
estimating the rotation due to the CFO includes using a single N-point discrete Fourier transform (DFT), where N defines a resolution of a search space.

### Claim 17 (depends on 16)

The binary data transmission system according to claim 16, wherein correcting includes compensating for the rotation by performing the correction Ŷ(z)={tilde over (Y)}(e−j{circumflex over (ψ)}z), where Ŷ(z) is an estimate of the received polynomial sequence without CFO impairment, Ŷ represents the received polynomial sequence with the CFO impairment, {circumflex over (ψ)} represents the estimated rotation, j is the imaginary unit, and z is a complex variable.

### Claim 18 (depends on 13)

The binary data transmission system according to claim 13, wherein the operations further comprise selecting the smooshing factor parameter η>0, and further tuned for a particular embodiment with a large enough value of η for a predetermined level of results in CFO correction capabilities while having a small enough value of η for a predetermined level of results in zero perturbation under additive white Gaussian noise (AWGN) noise.

### Claim 19 (depends on 12)

The binary data transmission system according to claim 12, wherein for the SBMOCZ zero constellation, the kth bit in a message m=(m0, m1, . . . , mK−1)∈{0, 1}K derived from the baseband signal is mapped to the kth zero of a polynomial according to
α
k
=
{
R
k
⁢
e
ϕ
k
,
m
k
=
1
R
k
-
1
⁢
e
ϕ
k
,
m
k
=
0
,
for k∈[K] and Rk>1, with zero patterns of a=(α0, α1, . . . , αK−1)∈CK for defining the Kth-degree polynomial, where the phase difference between adjacent zeros, excluding the first and last, is given by Δφ=(2π−η)/K, and where the parameter η∈[0, 2π) defines a smooshing factor for compressing phase separation to controllably create a gap between α0 and αK−1.

### Claim 20 (depends on 12)

The binary data transmission system according to claim 12, wherein:
the polynomial scheme includes encoding and decoding; and
conducting analysis includes conducting decoding of at least one of the received polynomial sequences.
