# US 2021/0067211 A1 · Communication system and method for achieving high data rates using modified nearly-equiangular tight frame (netf) matrices

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

- Number: US 2021/0067211 A1
- Document ID: US20210067211A1
- Status: Published application
- Kind: A1
- Application number: 16/909,175
- Filed: 2020-06-23
- Published: 2021-03-04
- Earliest claimed: 2019-09-04
- Assignees: Rampart Communications, Inc.
- Applicants: Rampart Communications, Inc.
- Inventors: Matthew Brandon ROBINSON
- Web page: https://patentgrep.com/patent/US20210067211A1

## CPC

- H04B 7/0413: MIMO systems
- H04B 7/0456: Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
- G06F 7/556: Logarithmic or exponential functions
- H04B 1/707: using direct sequence modulation
- H04J 13/00: Code division multiplex systems (for frequency hopping H04B1/713)
- H04L 5/0007: {the frequencies being orthogonal, e.g. OFDM(A) or DMT}
- H04L 27/2639: {Modulators using other transforms, e.g. discrete cosine transforms, Orthogonal Time Frequency and Space [OTFS] or hermetic transforms}
- H04L 27/2601: {Multicarrier modulation systems}
- H04B: TRANSMISSION
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method includes generating a set of symbols based on an incoming data vector. The set of symbols includes K symbols, K being a positive integer. A first transformation matrix including an equiangular tight frame (ETF) transformation or a nearly equiangular tight frame (NETF) transformation is generated, having dimensions N×K, where N is a positive integer and has a value less than K. A second transformation matrix having dimensions K×K is generated based on the first transformation matrix. A third transformation matrix having dimensions K×K is generated by performing a series of unitary transformations on the second transformation matrix. A first data vector is transformed into a second data vector having a length N based on the third transformation matrix and the set of symbols. A signal representing the second data vector is sent to a transmitter for transmission of a signal representing the second data vector to a receiver.

## Claims

### Claim 1

A method, comprising:
generating, via a processor of a first compute device, a plurality of symbols;
generating a first transformation matrix, the first transformation matrix including one of an equiangular tight frame (ETF) transformation or a nearly equiangular tight frame (NETF) transformation;
generating a second transformation matrix based on the first transformation matrix, the second transformation matrix having dimensions different from dimensions of the first transformation matrix;
generating a third transformation matrix by performing a series of unitary transformations on the second transformation matrix;
producing a data vector based on the third transformation matrix and the plurality of symbols; and
sending a signal representing the data vector to a transmitter for transmission of a signal representing the data vector from the transmitter to a receiver.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
sending a signal representing the third transformation matrix to a second compute device prior to transmission of the signal representing the data vector from the transmitter to the receiver, for recovery of the plurality of symbols at the receiver.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
decomposing the third transformation matrix into a plurality of layers, each layer from the plurality of layers including a permutation and a primitive transformation matrix,
the data vector being based on at least one layer from the plurality of layers.

### Claim 4 (depends on 1)

The method of claim 1, wherein generating the second transformation matrix includes performing a unitary transformation.

### Claim 5 (depends on 1)

The method of claim 1, wherein the series of unitary transformations has an associated computational cost of O(N) arithmetic operations, where N is a positive integer.

### Claim 6 (depends on 1)

The method of claim 1, wherein the receiver includes a plurality of antenna arrays, the receiver and the transmitter configured to perform Multiple Input Multiple Output (MIMO) operations.

### Claim 7 (depends on 1)

The method of claim 1, wherein generating the second transformation matrix includes adding rows to the first transformation matrix.

### Claim 8

A system, comprising:
a transmitter; and
a processor operably coupled to the transmitter, the processor configured to:
generate a plurality of symbols;
generate a first transformation matrix, the first transformation matrix including one of an equiangular tight frame (ETF) transformation or a nearly equiangular tight frame (NETF) transformation;
generate a second transformation matrix based on the first transformation matrix, the second transformation matrix having dimensions different from dimensions of the first transformation matrix;
generate a third transformation matrix by performing a series of unitary transformations on the second transformation matrix; and
produce a plurality of transformed symbols based on the third transformation matrix and the plurality of symbols.

### Claim 9 (depends on 8)

The system of claim 8, wherein the at least one processor is further configured to:
decompose the third transformation matrix into a plurality of layers, each layer from the plurality of layers including a permutation and a primitive transformation matrix; and
produce the plurality of transformed symbols by encoding each symbol from the plurality of symbols based on at least one layer from the plurality of layers.

### Claim 10 (depends on 8)

The system of claim 8, wherein the transmitter includes a plurality of antenna arrays, the transmitter configured to perform Multiple Input Multiple Output (MIMO) operations.

### Claim 11 (depends on 8)

The system of claim 8, wherein the processor is configured to generate the second transformation matrix by performing a unitary transformation.

### Claim 12 (depends on 8)

The system of claim 8, wherein the series of unitary transformations on the second transformation matrix has an associated computational cost of O(N) arithmetic operations, where N is a positive integer.

### Claim 13 (depends on 8)

The system of claim 8, wherein producing the plurality of transformed symbols has a computational complexity of O(N log2 N) arithmetic operations, where N is a positive integer.

### Claim 14 (depends on 8)

The system of claim 8, wherein producing the second transformation matrix includes adding rows to the first transformation matrix.

### Claim 15

A method, comprising:
receiving, via a receiver, a plurality of symbols;
producing a first plurality of transformed symbols based on a sparse transformation matrix and the plurality of symbols; and
producing a second plurality of transformed symbols based on the first plurality of transformed symbols, the producing the second plurality of transformed symbols including an iterative process, each iteration of the iterative process including: (a) a permutation followed by (b) an application of at least one primitive transformation matrix; and
transmitting, from a transmitter, a signal representing the second plurality of transformed symbols.

### Claim 16 (depends on 15)

The method of claim 15, wherein the sparse transformation matrix is a third transformation matrix, the method further comprising:
generating a first transformation matrix, via a processor of a compute device operatively coupled to the transmitter, the first transformation matrix including one of an equiangular tight frame (ETF) transformation, or a nearly equiangular tight frame (NETF) transformation;
generating a second transformation matrix based on the first transformation matrix; and
generating the third transformation matrix by performing a series of unitary transformations on the second transformation matrix.

### Claim 17 (depends on 15)

The method of claim 15, wherein the transmitter includes a plurality of antenna arrays, the transmitter configured to perform Multiple Input Multiple Output (MIMO) operations.

### Claim 18 (depends on 15)

The method of claim 15, wherein at least one of producing the first plurality of transformed symbols or producing the second plurality of transformed symbols has an associated computational complexity of O(N log2 N) arithmetic operations, where N is a positive integer.
