# US 2018/0019849 A1 · Optimizations for zero-forcing precoding

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

- Number: US 2018/0019849 A1
- Document ID: US20180019849A1
- Status: Published application
- Kind: A1
- Application number: 15/655,673
- Filed: 2017-07-20
- Published: 2018-01-18
- Earliest claimed: 2015-03-26
- Assignees: Facebook, Inc.
- Applicants: Facebook, Inc.
- Inventors: Karthik Yogeeswaran; Ali Yazdan Panah
- Web page: https://patentgrep.com/patent/US20180019849A1

## CPC

- H04L 5/0048: {Allocation of pilot signals, i.e. of signals known to the receiver (allocation of control signalling H04L5/0053; use of control signalling H04L5/0091)}
- H04B 7/0417: Feedback systems
- H04B 7/0452: Multi-user MIMO systems
- H04B 7/0626: {Channel coefficients, e.g. channel state information [CSI]}
- H04B 7/0628: {Diversity capabilities}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04B: TRANSMISSION

## Abstract

Massive MIMO systems provide impressive spectral efficiencies through beam forming techniques such as Zero-Forcing Precoding (ZFP). Unfortunately, ZFP imposes a considerable computational burden for each additional user. Relationships between the antennas, the users, and the environment must be rapidly, and accurately, reassessed during ZFP on an ongoing basis. Brute force approaches to these reassessments may be unfeasible for certain hardware and design conditions. Accordingly, various of the proposed embodiments implement representational optimizations which reduce the computational burden for each reassessment. Some embodiments employ “dynamic sectorization”, whereby the serviced environment is divided into regions and the corresponding representation is modified to reduce the computations of each reassessment. A backplane, antenna separation/directivity and thresholds for environment noise may each be adjusted to reduce the computational burden.

## Claims

### Claim 1

A communications system, comprising:
a plurality of antennas;
a backplane configured to physically separate a first group of the plurality of antennas and a second group of the plurality of antennas;
at least one processor;
at least one memory comprising instructions configured to cause the at least one processor to:
transmit a pilot signal from an antenna of the plurality of antennas;
receive feedback from a user device based upon the pilot signal;
generate a channel matrix based upon the feedback;
assign zero values to entries in the channel matrix below a threshold;
determine a precoder matrix based upon the channel matrix; and
adjust a directional pattern of a third group of the plurality of antennas based upon the precoder matrix.

### Claim 2 (depends on 1)

The communications system of claim 1, wherein the backplane is configured to be dynamically adjusted.

### Claim 3 (depends on 1)

The communications system of claim 1, wherein the antennas are directional.

### Claim 4 (depends on 1)

The communications system of claim 1, wherein determining a precoder matrix comprises using Cholesky Factorization and the Minimum Degree Algorithm after assigning the zero values.

### Claim 5 (depends on 1)

The communications system of claim 1, further comprising adjusting the backplane following determination of the precoder matrix.

### Claim 6 (depends on 1)

The communications system of claim 1, wherein the plurality of antennas comprise patch elements.

### Claim 7 (depends on 6)

The communications system of claim 6, wherein each of the patch elements have a length of approximately half the transmission wavelength.

### Claim 8 (depends on 1)

The communications system of claim 1, wherein the plurality of antennas comprises more than 90 antennas.

### Claim 9

A computer-implemented method, comprising:
transmitting a pilot signal from an antenna of a plurality of antennas, the first group of the plurality of antennas separated with a backplane from a second group of the plurality of antennas;
receiving feedback from a user device based upon the pilot signal;
generating a channel matrix based upon the feedback;
assigning zero values to entries in the channel matrix below a threshold;
computing a precoder matrix based upon the channel matrix; and
adjusting a directional pattern of a third group of the plurality of antennas based upon the computed precoder matrix.

### Claim 10 (depends on 9)

The computer-implemented method of claim 9, wherein determining a precoder matrix comprises using Cholesky Factorization and a Minimum Degree Algorithm after assigning the zero values.

### Claim 11 (depends on 9)

The computer-implemented method of claim 9, further comprising adjusting the backplane following determination of the precoder matrix.

### Claim 12 (depends on 11)

The computer-implemented method of claim 11, wherein each of the patch elements have a length of approximately have the transmission wavelength.

### Claim 13 (depends on 9)

The computer-implemented method of claim 9, wherein the plurality of antennas comprise patch elements.

### Claim 14 (depends on 9)

The computer-implemented method of claim 9, wherein the plurality of antennas comprises more than 90 antennas.

### Claim 15

A non-transitory computer-readable medium, comprising instructions configured to cause a communication system to:
transmit a pilot signal from an antenna of a plurality of antennas, the plurality of antennas comprising first group and a second group of antennas, the first group of the plurality of antennas separated with a backplane from the second group of the plurality of antennas;
receive feedback from a user device based on the pilot signal;
generate a channel matrix based upon the feedback;
assign zero values to entries in the channel matrix below a threshold;
determine a precoder matrix based upon the channel matrix; and
adjust a directional pattern of a third group of the plurality of antennas based upon the precoder matrix.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein determining a precoder matrix comprises using Cholesky Factorization and a Minimum Degree Algorithm after assigning the zero values.

### Claim 17 (depends on 15)

The non-transitory computer-readable medium of claim 15, further comprising adjusting the backplane following the threshold.

### Claim 18 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the plurality of antennas comprise patch elements.

### Claim 19 (depends on 18)

The non-transitory computer-readable medium of claim 18, wherein each of the patch elements have a length of approximately have the transmission wavelength.

### Claim 20 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the plurality of antennas comprises more than 90 antennas.
