# US 2020/0403664 A1 · Systems and Methods for Communicating by Modulating Data on Zeros in the Presence of Channel Impairments

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

- Number: US 2020/0403664 A1
- Document ID: US20200403664A1
- Status: Published application
- Kind: A1
- Application number: 17/013,525
- Filed: 2020-09-04
- Published: 2020-12-24
- Earliest claimed: 2019-02-07
- Assignees: California Institute of Technology; The Regents of the University of California; Technische UniversitäT Berlin
- Applicants: California Institute of Technology; The Regents of the University of California; Technische Universität Berlin
- Inventors: Philipp Walk; Babak Hassibi; Peter Jung; Hamid Jafarkhani
- Web page: https://patentgrep.com/patent/US20200403664A1

## CPC

- H04L 27/2602: {Signal structure}
- H04B 1/0475: {with means for limiting noise, interference or distortion (H04B1/0483 takes precedence)}
- H04B 7/0452: Multi-user MIMO systems
- H04L 7/042: {Detectors therefor, e.g. correlators, state machines (digital correlators in general G06F17/15)}
- H04L 7/048: {using the properties of error detecting or error correcting codes, e.g. parity as synchronisation signal}
- H04L 27/122: {using digital generation of carrier signals (digital function generators G06F1/02, H04L17/10; generating pulses having stepped portions using digital techniques H03K4/026)}
- H04L 27/2676: {Blind, i.e. without using known symbols}
- H04L 27/2657: {Carrier synchronisation}
- H04L 27/2662: {Symbol synchronisation}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04B: TRANSMISSION

## Abstract

Communication systems and methods in accordance with various embodiments of the invention utilize modulation on zeros. Carrier frequency offsets (CFO) can result in an unknown rotation of all zeros of a received signal's z-transform. Therefore, a binary MOCZ scheme (BMOCZ) can be utilized in which the modulated binary data is encoded using a cycling register code (e.g. CPC or ACPC), enabling receivers to determine cyclic shifts in the BMOCZ symbol resulting from a CFO. Receivers in accordance with several embodiments of the invention include decoders capable of decoding information bits from received discrete-time baseband signals by: estimating a timing offset for the received signal; determining a plurality of zeros of a z-transform of the received symbol; identifying zeros from the plurality of zeros that encode received bits by correcting fractional rotations resulting from the CFO; and decoding information bits based upon the received bits using a cycling register code.

## Claims

### Claim at position 1

-20. (canceled)

### Claim 21

A method of communication, comprising:
receiving a plurality of information bits;
outputting a plurality of encoded bits in accordance with a cycling register code (CRC);
modulating the plurality of encoded bits to obtain a discrete-time baseband signal, where the plurality of encoded bits are encoded in the zeros of the z-transform of the discrete-time baseband signal;
generating a continuous-time signal based upon the discrete-time baseband signal;
down converting and sampling a received continuous-time signal at a given sampling rate to obtain a received discrete-time baseband signal, where the received discrete-time baseband signal includes at least one of a timing offset (TO) and a carrier frequency offset (CFO);
decoding a plurality of decoded information bits from the received discrete-time baseband signal by:
estimating a TO for the received discrete-time baseband signal to identify a received symbol;
determining a plurality of zeros of a z-transform of the received symbol;
identifying zeros from the plurality of zeros that encode received bits; and
decoding the plurality of decoded information bits based upon the received bits using the CRC.

### Claim 22 (depends on 21)

The method of claim 21, wherein a receiving of a continuous-time transmitted signal is performed over a multipath channel.

### Claim 23 (depends on 21)

The method of claim 21, wherein the modulating the plurality of encoded bits is performed so that the z-transform of the discrete-time baseband signal comprises a zero for each of a plurality of encoded bits.

### Claim 24 (depends on 21)

The method of claim 21, wherein the modulating the plurality of encoded bits is performed so that each zero in the z-transform of the discrete-time baseband signal is limited to being one of a set of conjugate-reciprocal pairs of zeros.

### Claim 25 (depends on 24)

The method of claim 24, wherein:
each conjugate reciprocal pair of zeros in the set of conjugate-reciprocal pairs of zeros comprises:
an outer zero having a first radius that is greater than one; and
an inner zero having a radius that is the reciprocal of the first radius;
where the inner and outer zero have phases that are the same phase;
the radii of the outer zeros in each pair of zeros in the set of conjugate-reciprocal pairs of zeros are the same; and
the phases of the outer zeros in each pair of zeros in the set of conjugate-reciprocal pairs of zeros are evenly spaced over one complete revolution.

### Claim 26 (depends on 21)

The method of claim 21, wherein the CRC is a cyclically permutable code (CPC).

### Claim 27 (depends on 26)

The method of claim 26, wherein the CPC is extracted from a Bose Chaudhuri Hocquenghem (BCH) code.

### Claim 28 (depends on 26)

The method of claim 26, wherein the CPC is extracted from a primitive BCH code.

### Claim 29 (depends on 26)

The method of claim 26, wherein the CPC has a code length that is a Mersenne prime.

### Claim 30 (depends on 29)

The method of claim 29, wherein the CPC has a code length selected from the group consisting of 3, 7, 31, and 127.

### Claim 31 (depends on 21)

The method of claim 21, wherein the CRC is generated by an inner code and an outer code which are combined in a non-linear fashion.

### Claim 32 (depends on 31)

The method of claim 31, wherein the outer code is a cycling register code having a lower code rate than the inner code.

### Claim 33 (depends on 31)

The method of claim 31, wherein the outer code is a cyclically permutable code (CPC).

### Claim 34 (depends on 31)

The method of claim 31, wherein the CRC is an affine CPC (ACPC) code.

### Claim 35 (depends on 34)

The method of claim 34, wherein the ACPC is characterized by being attainable using a cyclic inner code having codewords of an inner codeword length, which is affine translated by a given binary word of the inner codeword length, and then further encoded by a cyclic outer code.

### Claim 36 (depends on 21)

The method of claim 21, wherein the estimating the TO is performed by measuring energy over an expected symbol length with a sliding window in the sampled signal.

### Claim 37 (depends on 36)

The method of claim 36, wherein the measuring energy over an expected symbol length is performed by convolving samples with a universal Huffman sequence of the expected symbol length comprising two impulses at the beginning and the end of the expected symbol length.

### Claim 38 (depends on 21)

The method of claim 21, wherein the estimate the TO is performed by identifying a set of three energy peaks that yield a maximum energy sum over an expected symbol length.

### Claim 39 (depends on 21)

The method of claim 21, further comprising:
oversampling the received discrete-time signal by zero-padding; and
identifying zeros from the plurality of zeros that encode a plurality of received bits by identifying a fractional rotation resulting from the CFO.

### Claim 40 (depends on 39)

The method of claim 39, further comprising determining a most likely set of zeros for the z-transform of the discrete-time baseband signal used to generate the transmitted signal based upon the received symbol.

### Claim 41 (depends on 39)

The method of claim 39, wherein the determining the plurality of received bits is achieved by performing a weighted comparison of samples of the z-transform of the received symbol with each zero in a set of zeros.

### Claim 42 (depends on 41)

The method of claim 41, wherein each zero in the z-transform of the discrete-time baseband signal used to generate the transmitted signal is limited to being one of a set of conjugate-reciprocal pairs of zeros.

### Claim 43 (depends on 21)

The method of claim 21, further comprising:
providing a plurality of receive antennas; and
determining the plurality of information bits by combining values derived from the samples of a plurality of continuous-time signals received by the plurality of receive antennas to perform decoding.

### Claim 44

A method of receiving, comprising:
down converting and sampling a received continuous-time signal to obtain a received discrete-time baseband signal, and over sampling the received discrete-time signal by zero padding, where the received discrete-time baseband signal includes at least one of a timing offset (TO) and a carrier frequency offset (CFO);
decoding a plurality of decoded information bits of information from the received discrete-time baseband signal by:
estimating a TO for the received discrete-time baseband signal to identify a received symbol;
determining a plurality of zeros of a z-transform of the received symbol;
identifying zeros from the plurality of zeros that encode received bits by identifying and correcting a fractional rotation in the plurality of zeros resulting from the CFO; and
decoding the plurality of decoded information bits based upon the received bits using a cycling register code (CRC).
